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/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:20:25,239 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:20:25,241 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:20:25,257 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:20:25,257 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:20:25,258 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:20:25,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:20:25,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:20:25,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:20:25,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:20:25,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:20:25,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:20:25,266 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:20:25,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:20:25,270 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:20:25,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:20:25,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:20:25,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:20:25,275 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:20:25,277 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:20:25,278 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:20:25,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:20:25,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:20:25,282 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:20:25,282 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:20:25,283 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:20:25,284 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:20:25,285 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:20:25,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:20:25,287 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:20:25,287 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:20:25,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:20:25,288 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:20:25,288 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:20:25,289 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:20:25,290 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:20:25,290 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:20:25,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:20:25,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:20:25,319 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:20:25,319 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:20:25,323 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:20:25,323 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:20:25,323 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:20:25,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:20:25,324 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:20:25,324 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:20:25,324 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:20:25,324 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:20:25,324 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:20:25,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:20:25,326 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:20:25,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:20:25,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:20:25,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:20:25,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:20:25,328 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:20:25,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:20:25,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:20:25,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:20:25,329 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:20:25,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:20:25,329 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:20:25,329 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:20:25,329 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:20:25,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:20:25,330 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:20:25,330 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:20:25,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:20:25,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:20:25,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:20:25,416 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:20:25,416 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:20:25,417 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-10-04 14:20:25,417 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl' [2018-10-04 14:20:25,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:20:25,476 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:20:25,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:20:25,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:20:25,477 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:20:25,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (1/1) ... [2018-10-04 14:20:25,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (1/1) ... [2018-10-04 14:20:25,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:20:25,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:20:25,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:20:25,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:20:25,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (1/1) ... [2018-10-04 14:20:25,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (1/1) ... [2018-10-04 14:20:25,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (1/1) ... [2018-10-04 14:20:25,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (1/1) ... [2018-10-04 14:20:25,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (1/1) ... [2018-10-04 14:20:25,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (1/1) ... [2018-10-04 14:20:25,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (1/1) ... [2018-10-04 14:20:25,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:20:25,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:20:25,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:20:25,544 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:20:25,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (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:20:25,615 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 14:20:25,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:20:25,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:20:25,769 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:20:25,770 INFO L202 PluginConnector]: Adding new model count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:20:25 BoogieIcfgContainer [2018-10-04 14:20:25,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:20:25,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:20:25,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:20:25,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:20:25,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:25" (1/2) ... [2018-10-04 14:20:25,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395ba4f6 and model type count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:20:25, skipping insertion in model container [2018-10-04 14:20:25,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:20:25" (2/2) ... [2018-10-04 14:20:25,778 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-10-04 14:20:25,787 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:20:25,795 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:20:25,845 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:20:25,845 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:20:25,846 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:20:25,846 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:20:25,846 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:20:25,846 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:20:25,846 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:20:25,846 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:20:25,847 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:20:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 14:20:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 14:20:25,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:25,866 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 14:20:25,867 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:25,874 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-10-04 14:20:25,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:25,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:25,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:25,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:26,020 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:20:26,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:26,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:20:26,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:20:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:20:26,044 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:26,047 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-04 14:20:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:26,081 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-10-04 14:20:26,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:20:26,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 14:20:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:26,096 INFO L225 Difference]: With dead ends: 9 [2018-10-04 14:20:26,096 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 14:20:26,099 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:20:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 14:20:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 14:20:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 14:20:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 14:20:26,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 14:20:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:26,134 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 14:20:26,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:20:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 14:20:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 14:20:26,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:26,135 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 14:20:26,135 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:26,135 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-10-04 14:20:26,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:26,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:26,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:26,302 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:20:26,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:26,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:26,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:26,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 14:20:26,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:20:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:20:26,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:26,451 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-04 14:20:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:26,535 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 14:20:26,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:20:26,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-04 14:20:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:26,536 INFO L225 Difference]: With dead ends: 8 [2018-10-04 14:20:26,536 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 14:20:26,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 2 [2018-10-04 14:20:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 14:20:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 14:20:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 14:20:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 14:20:26,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 14:20:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:26,540 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 14:20:26,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:20:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 14:20:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:20:26,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:26,541 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-04 14:20:26,542 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:26,542 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:26,542 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-10-04 14:20:26,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:26,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:26,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:26,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:26,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:26,758 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:20:26,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:26,797 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:26,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:26,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:26,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:26,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:20:26,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:20:26,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:20:26,854 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:26,854 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-04 14:20:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:26,880 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 14:20:26,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:20:26,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 14:20:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:26,881 INFO L225 Difference]: With dead ends: 9 [2018-10-04 14:20:26,882 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:20:26,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 3 [2018-10-04 14:20:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:20:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 14:20:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 14:20:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 14:20:26,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 14:20:26,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:26,885 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 14:20:26,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:20:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 14:20:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:20:26,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:26,886 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-04 14:20:26,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:26,887 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:26,887 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-10-04 14:20:26,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:26,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:27,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:27,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:27,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:20:27,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 14:20:27,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:27,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:27,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:27,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:20:27,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:20:27,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:20:27,106 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:27,106 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-04 14:20:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:27,196 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 14:20:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:20:27,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-04 14:20:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:27,201 INFO L225 Difference]: With dead ends: 10 [2018-10-04 14:20:27,201 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 14:20:27,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 14:20:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 14:20:27,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 14:20:27,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 14:20:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 14:20:27,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 14:20:27,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:27,205 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 14:20:27,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:20:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 14:20:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:20:27,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:27,206 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-04 14:20:27,206 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:27,206 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:27,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-10-04 14:20:27,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:27,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:27,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:27,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:27,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:27,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:27,467 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:20:27,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:20:27,491 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:20:27,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:27,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:27,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:27,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:20:27,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:27,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:27,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:27,550 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-04 14:20:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:27,578 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 14:20:27,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:20:27,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 14:20:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:27,580 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:20:27,581 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 14:20:27,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 5 [2018-10-04 14:20:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 14:20:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 14:20:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 14:20:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 14:20:27,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 14:20:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:27,585 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 14:20:27,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 14:20:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:27,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:27,586 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-04 14:20:27,586 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:27,586 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-10-04 14:20:27,587 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:27,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:27,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:27,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:27,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:27,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:27,754 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:20:27,769 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:20:27,781 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 14:20:27,781 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:27,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:27,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:27,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:20:27,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:27,835 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:27,835 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-04 14:20:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:27,953 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 14:20:27,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:20:27,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:27,954 INFO L225 Difference]: With dead ends: 12 [2018-10-04 14:20:27,954 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 14:20:27,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:20:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 14:20:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 14:20:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 14:20:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 14:20:27,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 14:20:27,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:27,958 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 14:20:27,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 14:20:27,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:20:27,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:27,959 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-04 14:20:27,959 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:27,959 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:27,960 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-10-04 14:20:27,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:27,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:27,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:27,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:27,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:28,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:28,062 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:20:28,071 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:20:28,082 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 14:20:28,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:28,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:28,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:28,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:20:28,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:28,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:28,201 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:28,201 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-04 14:20:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:28,233 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 14:20:28,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:20:28,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 14:20:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:28,235 INFO L225 Difference]: With dead ends: 13 [2018-10-04 14:20:28,235 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 14:20:28,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:20:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 14:20:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 14:20:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 14:20:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 14:20:28,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 14:20:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:28,239 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 14:20:28,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 14:20:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:28,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:28,240 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-04 14:20:28,240 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:28,241 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:28,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-10-04 14:20:28,241 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:28,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:28,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:28,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:28,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:28,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:28,423 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:20:28,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:28,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:28,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:28,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:20:28,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:20:28,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:20:28,518 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:28,518 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-04 14:20:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:28,606 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 14:20:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:20:28,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-04 14:20:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:28,607 INFO L225 Difference]: With dead ends: 14 [2018-10-04 14:20:28,607 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 14:20:28,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:20:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 14:20:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 14:20:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 14:20:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 14:20:28,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 14:20:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:28,611 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 14:20:28,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:20:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 14:20:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:28,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:28,612 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-04 14:20:28,612 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:28,612 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:28,612 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-10-04 14:20:28,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:28,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:28,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:28,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:28,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:29,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:29,151 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:20:29,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:29,170 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:29,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:29,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:29,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:29,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:20:29,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:29,236 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:29,236 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-10-04 14:20:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:29,287 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 14:20:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:20:29,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-10-04 14:20:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:29,291 INFO L225 Difference]: With dead ends: 15 [2018-10-04 14:20:29,291 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 14:20:29,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 9 [2018-10-04 14:20:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 14:20:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 14:20:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 14:20:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 14:20:29,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 14:20:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:29,294 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 14:20:29,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 14:20:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:29,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:29,295 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-10-04 14:20:29,295 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:29,296 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-10-04 14:20:29,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:29,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:29,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:29,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:29,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:29,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:20:29,539 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:20:29,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:29,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:29,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:29,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:20:29,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:20:29,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:20:29,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:29,648 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-10-04 14:20:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:29,690 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 14:20:29,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:29,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-10-04 14:20:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:29,691 INFO L225 Difference]: With dead ends: 16 [2018-10-04 14:20:29,691 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 14:20:29,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 10 [2018-10-04 14:20:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 14:20:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 14:20:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:20:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 14:20:29,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 14:20:29,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:29,695 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 14:20:29,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:20:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 14:20:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:29,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:29,695 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-10-04 14:20:29,696 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:29,696 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:29,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-10-04 14:20:29,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:29,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:29,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:29,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:29,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:29,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:29,843 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:20:29,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:20:29,860 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:20:29,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:29,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:30,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:30,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 14:20:30,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:30,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:30,033 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:30,033 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-10-04 14:20:30,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:30,123 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 14:20:30,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:20:30,126 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-04 14:20:30,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:30,127 INFO L225 Difference]: With dead ends: 17 [2018-10-04 14:20:30,127 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:20:30,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 11 [2018-10-04 14:20:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:20:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 14:20:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 14:20:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 14:20:30,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 14:20:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:30,133 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 14:20:30,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 14:20:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:30,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:30,134 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-10-04 14:20:30,135 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:30,135 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:30,135 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-10-04 14:20:30,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:30,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:30,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:30,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:30,421 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:20:30,428 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:20:30,438 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:20:30,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:30,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:30,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:30,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:20:30,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:30,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:30,504 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:30,504 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-10-04 14:20:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:30,549 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 14:20:30,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:20:30,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 14:20:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:30,550 INFO L225 Difference]: With dead ends: 18 [2018-10-04 14:20:30,550 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 14:20:30,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 12 [2018-10-04 14:20:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 14:20:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 14:20:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:20:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 14:20:30,554 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 14:20:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:30,554 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 14:20:30,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 14:20:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:20:30,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:30,555 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-10-04 14:20:30,556 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:30,556 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-10-04 14:20:30,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:30,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:30,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:30,710 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:20:30,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:20:30,742 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:20:30,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:30,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:30,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:30,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:20:30,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:20:30,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:20:30,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:30,813 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-10-04 14:20:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:30,842 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 14:20:30,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:20:30,842 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 14:20:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:30,843 INFO L225 Difference]: With dead ends: 19 [2018-10-04 14:20:30,843 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 14:20:30,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 13 [2018-10-04 14:20:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 14:20:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 14:20:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 14:20:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 14:20:30,847 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 14:20:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:30,848 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 14:20:30,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:20:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 14:20:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:20:30,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:30,849 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-10-04 14:20:30,849 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:30,849 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-10-04 14:20:30,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:30,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:30,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:30,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:31,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:31,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 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:20:31,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:31,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:31,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:31,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:20:31,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:20:31,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:20:31,160 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:31,160 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-10-04 14:20:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:31,334 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 14:20:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:20:31,335 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-10-04 14:20:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:31,335 INFO L225 Difference]: With dead ends: 20 [2018-10-04 14:20:31,335 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 14:20:31,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 14:20:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 14:20:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 14:20:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:20:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 14:20:31,339 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 14:20:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:31,339 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 14:20:31,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:20:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 14:20:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:20:31,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:31,340 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-10-04 14:20:31,340 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:31,340 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-10-04 14:20:31,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:31,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:31,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:31,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:31,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:31,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:31,667 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:31,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:31,684 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:31,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:31,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:31,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:31,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:20:31,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:20:31,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:20:31,800 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:31,800 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-10-04 14:20:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:31,841 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 14:20:31,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:20:31,841 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-10-04 14:20:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:31,842 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:20:31,843 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:20:31,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 15 [2018-10-04 14:20:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:20:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 14:20:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 14:20:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 14:20:31,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 14:20:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:31,847 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 14:20:31,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:20:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 14:20:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:31,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:31,848 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-10-04 14:20:31,849 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:31,849 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:31,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-10-04 14:20:31,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:31,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:31,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:31,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:31,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:32,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:32,121 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:20:32,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:20:32,147 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:20:32,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:32,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:32,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:32,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:20:32,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:20:32,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:20:32,290 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:32,291 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-10-04 14:20:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:32,323 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 14:20:32,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:20:32,323 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 14:20:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:32,324 INFO L225 Difference]: With dead ends: 22 [2018-10-04 14:20:32,324 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 14:20:32,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-04 14:20:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 14:20:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 14:20:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:20:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 14:20:32,328 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 14:20:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:32,329 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 14:20:32,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:20:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 14:20:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:20:32,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:32,329 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-10-04 14:20:32,330 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:32,330 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-10-04 14:20:32,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:32,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:32,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:32,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:32,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:32,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:32,742 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:20:32,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:20:32,763 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:20:32,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:32,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:32,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:32,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 14:20:32,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:20:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:20:32,906 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:32,907 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-10-04 14:20:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:33,026 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 14:20:33,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:20:33,028 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-10-04 14:20:33,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:33,029 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:20:33,029 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:20:33,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 17 [2018-10-04 14:20:33,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:20:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 14:20:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 14:20:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 14:20:33,033 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 14:20:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:33,033 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 14:20:33,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:20:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 14:20:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:20:33,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:33,034 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-10-04 14:20:33,034 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:33,034 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:33,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-10-04 14:20:33,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:33,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:33,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:33,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:33,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:33,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:33,323 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:20:33,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:20:33,406 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 14:20:33,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:33,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:33,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:33,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:20:33,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:20:33,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:20:33,499 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:33,499 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-10-04 14:20:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:33,539 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 14:20:33,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:20:33,540 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-10-04 14:20:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:33,541 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:20:33,541 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 14:20:33,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 18 [2018-10-04 14:20:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 14:20:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 14:20:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:20:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 14:20:33,546 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 14:20:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:33,547 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 14:20:33,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:20:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 14:20:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:20:33,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:33,548 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-10-04 14:20:33,548 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:33,548 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-10-04 14:20:33,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:33,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:33,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:33,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:33,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:33,941 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:33,951 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:20:33,986 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 14:20:33,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:33,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:34,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:34,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 14:20:34,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:20:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:20:34,081 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:34,081 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-10-04 14:20:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:34,132 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 14:20:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:20:34,133 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-10-04 14:20:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:34,134 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:20:34,134 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:20:34,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 19 [2018-10-04 14:20:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:20:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 14:20:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 14:20:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 14:20:34,138 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 14:20:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:34,139 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 14:20:34,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:20:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 14:20:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:20:34,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:34,140 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-10-04 14:20:34,140 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:34,140 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-10-04 14:20:34,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:34,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:34,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:34,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:34,752 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:20:34,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:34,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:34,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:34,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 14:20:34,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:20:34,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:20:34,941 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:34,941 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-10-04 14:20:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:34,982 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 14:20:34,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:20:34,983 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-10-04 14:20:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:34,983 INFO L225 Difference]: With dead ends: 26 [2018-10-04 14:20:34,983 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 14:20:34,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 20 [2018-10-04 14:20:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 14:20:34,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 14:20:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:20:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 14:20:34,987 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 14:20:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:34,987 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 14:20:34,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:20:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 14:20:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 14:20:34,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:34,989 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-10-04 14:20:34,990 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:34,990 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-10-04 14:20:34,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:34,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:34,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:34,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:35,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:35,428 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:35,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:35,448 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:35,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:35,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:35,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:35,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:20:35,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:20:35,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:20:35,515 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:35,515 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-10-04 14:20:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:35,581 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 14:20:35,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:20:35,581 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-10-04 14:20:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:35,582 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:20:35,582 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 14:20:35,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 21 [2018-10-04 14:20:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 14:20:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 14:20:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 14:20:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 14:20:35,586 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 14:20:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:35,587 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 14:20:35,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:20:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 14:20:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 14:20:35,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:35,588 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-10-04 14:20:35,588 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:35,588 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-10-04 14:20:35,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:35,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:35,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:35,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:36,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:36,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 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:20:36,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:20:36,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 14:20:36,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:36,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:36,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:36,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:20:36,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:20:36,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:20:36,303 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:36,303 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-10-04 14:20:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:36,528 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 14:20:36,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:36,531 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-10-04 14:20:36,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:36,531 INFO L225 Difference]: With dead ends: 28 [2018-10-04 14:20:36,531 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 14:20:36,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 22 [2018-10-04 14:20:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 14:20:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 14:20:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:20:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 14:20:36,534 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 14:20:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:36,534 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 14:20:36,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:20:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 14:20:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 14:20:36,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:36,535 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-10-04 14:20:36,536 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:36,536 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:36,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-10-04 14:20:36,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:36,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:36,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:36,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:36,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:36,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:36,785 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:36,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:20:36,805 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:20:36,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:36,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:36,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:36,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 14:20:36,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 14:20:36,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 14:20:36,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:36,980 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-10-04 14:20:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:37,068 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 14:20:37,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:20:37,068 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-10-04 14:20:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:37,069 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:20:37,069 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:20:37,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 23 [2018-10-04 14:20:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:20:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 14:20:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 14:20:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 14:20:37,072 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 14:20:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:37,073 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 14:20:37,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 14:20:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 14:20:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 14:20:37,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:37,074 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-10-04 14:20:37,074 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:37,074 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:37,075 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-10-04 14:20:37,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:37,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:37,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:37,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:37,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:37,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:37,969 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:20:37,978 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:20:37,994 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 14:20:37,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:37,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:38,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:38,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:20:38,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:20:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:20:38,108 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:38,108 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-10-04 14:20:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:38,143 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 14:20:38,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:20:38,144 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-10-04 14:20:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:38,145 INFO L225 Difference]: With dead ends: 30 [2018-10-04 14:20:38,145 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 14:20:38,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 24 [2018-10-04 14:20:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 14:20:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 14:20:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:20:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 14:20:38,151 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 14:20:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:38,151 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 14:20:38,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:20:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 14:20:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 14:20:38,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:38,152 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-10-04 14:20:38,152 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:38,153 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-10-04 14:20:38,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:38,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:38,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:38,437 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:20:38,448 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:20:38,471 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 14:20:38,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:38,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:38,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:38,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 14:20:38,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:20:38,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:20:38,707 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:38,707 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-10-04 14:20:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:38,838 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 14:20:38,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:38,838 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-10-04 14:20:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:38,839 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:20:38,839 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:20:38,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 25 [2018-10-04 14:20:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:20:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 14:20:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 14:20:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 14:20:38,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 14:20:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:38,843 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 14:20:38,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:20:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 14:20:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 14:20:38,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:38,844 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-10-04 14:20:38,844 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:38,845 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:38,845 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-10-04 14:20:38,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:38,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:38,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:38,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:38,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:39,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:39,685 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:20:39,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:39,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:39,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:39,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 14:20:39,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:20:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:20:39,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:39,783 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-10-04 14:20:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:39,839 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 14:20:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:20:39,839 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-10-04 14:20:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:39,840 INFO L225 Difference]: With dead ends: 32 [2018-10-04 14:20:39,840 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 14:20:39,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 26 [2018-10-04 14:20:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 14:20:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 14:20:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:20:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 14:20:39,844 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 14:20:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:39,844 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 14:20:39,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:20:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 14:20:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 14:20:39,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:39,845 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-10-04 14:20:39,845 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:39,845 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-10-04 14:20:39,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:39,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:39,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:40,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:40,412 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:20:40,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:40,433 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:40,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:40,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:40,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:40,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 14:20:40,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:20:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:20:40,505 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:40,506 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-10-04 14:20:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:40,586 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 14:20:40,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:20:40,587 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-10-04 14:20:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:40,588 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:20:40,588 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:20:40,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 27 [2018-10-04 14:20:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:20:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 14:20:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:20:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 14:20:40,591 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 14:20:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:40,592 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 14:20:40,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:20:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 14:20:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:20:40,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:40,592 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-10-04 14:20:40,593 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:40,593 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:40,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-10-04 14:20:40,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:40,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:40,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:40,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:40,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:41,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:41,076 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:20:41,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:20:41,125 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 14:20:41,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:41,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:41,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:41,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:20:41,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:20:41,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:20:41,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:41,220 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-10-04 14:20:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:41,265 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 14:20:41,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:20:41,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-10-04 14:20:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:41,266 INFO L225 Difference]: With dead ends: 34 [2018-10-04 14:20:41,266 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 14:20:41,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 28 [2018-10-04 14:20:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 14:20:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 14:20:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:20:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 14:20:41,270 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 14:20:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:41,271 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 14:20:41,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:20:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 14:20:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 14:20:41,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:41,272 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-10-04 14:20:41,272 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:41,272 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:41,272 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-10-04 14:20:41,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:41,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:41,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:41,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:41,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:41,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:41,767 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:20:41,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:20:41,794 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:20:41,794 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:41,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:41,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:41,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 14:20:41,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 14:20:41,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 14:20:41,938 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:41,939 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-10-04 14:20:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:41,986 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 14:20:41,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:20:41,986 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-10-04 14:20:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:41,987 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:20:41,987 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:20:41,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 29 [2018-10-04 14:20:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:20:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 14:20:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 14:20:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 14:20:41,991 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 14:20:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:41,992 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 14:20:41,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 14:20:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 14:20:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 14:20:41,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:41,993 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-10-04 14:20:41,993 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:41,993 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:41,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-10-04 14:20:41,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:41,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:41,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:42,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:42,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 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:20:42,447 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:20:42,466 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 14:20:42,466 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:42,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:42,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:42,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 14:20:42,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:20:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:20:42,558 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:42,558 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-10-04 14:20:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:42,596 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 14:20:42,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:20:42,597 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-10-04 14:20:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:42,597 INFO L225 Difference]: With dead ends: 36 [2018-10-04 14:20:42,597 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 14:20:42,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 30 [2018-10-04 14:20:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 14:20:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 14:20:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:20:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 14:20:42,600 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 14:20:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:42,601 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 14:20:42,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:20:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 14:20:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:20:42,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:42,601 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-10-04 14:20:42,601 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:42,602 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:42,602 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-10-04 14:20:42,602 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:42,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:42,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:42,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:42,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:43,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:43,113 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:20:43,122 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:20:43,143 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 14:20:43,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:43,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:43,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:43,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 14:20:43,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:20:43,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:20:43,273 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:43,273 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-10-04 14:20:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:43,391 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 14:20:43,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:20:43,392 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-10-04 14:20:43,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:43,392 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:20:43,393 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:20:43,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 31 [2018-10-04 14:20:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:20:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 14:20:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:20:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 14:20:43,396 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 14:20:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:43,396 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 14:20:43,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:20:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 14:20:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:20:43,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:43,397 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-10-04 14:20:43,397 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:43,397 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-10-04 14:20:43,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:43,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:43,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:43,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:43,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:43,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:43,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:43,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:43,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 14:20:43,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 14:20:43,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 14:20:43,919 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:43,919 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-10-04 14:20:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:43,978 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 14:20:43,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:20:43,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-10-04 14:20:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:43,979 INFO L225 Difference]: With dead ends: 38 [2018-10-04 14:20:43,979 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 14:20:43,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 32 [2018-10-04 14:20:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 14:20:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 14:20:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 14:20:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 14:20:43,984 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 14:20:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:43,984 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 14:20:43,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 14:20:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 14:20:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 14:20:43,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:43,985 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-10-04 14:20:43,985 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:43,985 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:43,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-10-04 14:20:43,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:43,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:43,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:44,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:44,909 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:20:44,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:44,936 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:44,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:44,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:45,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:45,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 14:20:45,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 14:20:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 14:20:45,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:45,069 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-10-04 14:20:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:45,122 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 14:20:45,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:20:45,122 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-10-04 14:20:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:45,123 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:20:45,123 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:20:45,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 33 [2018-10-04 14:20:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:20:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 14:20:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 14:20:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 14:20:45,129 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 14:20:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:45,129 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 14:20:45,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 14:20:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 14:20:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 14:20:45,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:45,130 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-10-04 14:20:45,130 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:45,130 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-10-04 14:20:45,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:45,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:45,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:45,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:45,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:45,781 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:20:45,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:20:45,814 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 14:20:45,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:45,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:45,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:45,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 14:20:45,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:20:45,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:20:45,961 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:45,961 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-10-04 14:20:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:46,029 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 14:20:46,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:20:46,030 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-10-04 14:20:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:46,031 INFO L225 Difference]: With dead ends: 40 [2018-10-04 14:20:46,031 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 14:20:46,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 34 [2018-10-04 14:20:46,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 14:20:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 14:20:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 14:20:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 14:20:46,035 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 14:20:46,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:46,035 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 14:20:46,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:20:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 14:20:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 14:20:46,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:46,036 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-10-04 14:20:46,036 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:46,036 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:46,036 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-10-04 14:20:46,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:46,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:46,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:47,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:47,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 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:20:47,357 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:20:47,380 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:20:47,380 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:47,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:47,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:47,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 14:20:47,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 14:20:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 14:20:47,617 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:47,618 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-10-04 14:20:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:47,677 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 14:20:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:20:47,678 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-10-04 14:20:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:47,679 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:20:47,679 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:20:47,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.9s impTime 35 [2018-10-04 14:20:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:20:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 14:20:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 14:20:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 14:20:47,685 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 14:20:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:47,685 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 14:20:47,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 14:20:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 14:20:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 14:20:47,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:47,686 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-10-04 14:20:47,686 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:47,686 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-10-04 14:20:47,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:47,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:47,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:47,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:47,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:48,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:48,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:48,388 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:20:48,409 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 14:20:48,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:48,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:48,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:48,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 14:20:48,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 14:20:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 14:20:48,490 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:48,490 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-10-04 14:20:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:48,575 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 14:20:48,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:20:48,575 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-10-04 14:20:48,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:48,576 INFO L225 Difference]: With dead ends: 42 [2018-10-04 14:20:48,576 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 14:20:48,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 36 [2018-10-04 14:20:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 14:20:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 14:20:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 14:20:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 14:20:48,578 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 14:20:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:48,578 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 14:20:48,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 14:20:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 14:20:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 14:20:48,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:48,579 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-10-04 14:20:48,579 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:48,579 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:48,579 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-10-04 14:20:48,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:48,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:48,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:48,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:48,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:49,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:49,261 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:20:49,268 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:20:49,292 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 14:20:49,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:49,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:49,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:49,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 14:20:49,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 14:20:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 14:20:49,901 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:49,901 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-10-04 14:20:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:50,017 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 14:20:50,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:20:50,019 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-10-04 14:20:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:50,019 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:20:50,019 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:20:50,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.5s impTime 37 [2018-10-04 14:20:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:20:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 14:20:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 14:20:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 14:20:50,022 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 14:20:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:50,022 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 14:20:50,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 14:20:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 14:20:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 14:20:50,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:50,023 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-10-04 14:20:50,023 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:50,023 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:50,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-10-04 14:20:50,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:50,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:50,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:50,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:50,797 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:20:50,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:50,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:50,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:50,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 14:20:50,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 14:20:50,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 14:20:50,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:50,943 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-10-04 14:20:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:51,063 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 14:20:51,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:20:51,064 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-10-04 14:20:51,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:51,064 INFO L225 Difference]: With dead ends: 44 [2018-10-04 14:20:51,065 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 14:20:51,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 38 [2018-10-04 14:20:51,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 14:20:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 14:20:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 14:20:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 14:20:51,068 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 14:20:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:51,068 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 14:20:51,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 14:20:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 14:20:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 14:20:51,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:51,069 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-10-04 14:20:51,069 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:51,069 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-10-04 14:20:51,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:51,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:51,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:51,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:51,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:51,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:51,712 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:51,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:51,736 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:51,737 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:51,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:51,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:51,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 14:20:51,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:20:51,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:20:51,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:51,843 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-10-04 14:20:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:51,907 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 14:20:51,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:20:51,907 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-10-04 14:20:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:51,908 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:20:51,908 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:20:51,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.5s impTime 39 [2018-10-04 14:20:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:20:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 14:20:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 14:20:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 14:20:51,911 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 14:20:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:51,911 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 14:20:51,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:20:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 14:20:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 14:20:51,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:51,912 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-10-04 14:20:51,912 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:51,913 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:51,913 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-10-04 14:20:51,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:51,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:51,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:51,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:51,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:52,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:52,389 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:52,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:20:52,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 14:20:52,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:52,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:52,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:52,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 14:20:52,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 14:20:52,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 14:20:52,525 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:52,526 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-10-04 14:20:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:52,642 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 14:20:52,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:20:52,643 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-10-04 14:20:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:52,644 INFO L225 Difference]: With dead ends: 46 [2018-10-04 14:20:52,644 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 14:20:52,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 40 [2018-10-04 14:20:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 14:20:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 14:20:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 14:20:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 14:20:52,645 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 14:20:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:52,646 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 14:20:52,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 14:20:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 14:20:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 14:20:52,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:52,646 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-10-04 14:20:52,646 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:52,647 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:52,647 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-10-04 14:20:52,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:52,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:52,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:52,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:52,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:54,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:54,047 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:20:54,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:20:54,074 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:20:54,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:54,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:54,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:54,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 14:20:54,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 14:20:54,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 14:20:54,249 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:54,249 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-10-04 14:20:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:54,344 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 14:20:54,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:20:54,344 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-10-04 14:20:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:54,345 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:20:54,345 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:20:54,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime 41 [2018-10-04 14:20:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:20:54,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 14:20:54,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 14:20:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 14:20:54,348 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 14:20:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:54,348 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 14:20:54,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 14:20:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 14:20:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 14:20:54,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:54,349 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-10-04 14:20:54,349 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:54,349 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:54,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-10-04 14:20:54,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:54,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:54,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:54,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:54,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:55,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:55,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 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:20:55,569 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:20:55,596 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 14:20:55,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:55,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:55,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 14:20:55,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:20:55,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:20:55,703 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:55,704 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-10-04 14:20:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:56,007 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-04 14:20:56,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:20:56,007 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-10-04 14:20:56,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:56,008 INFO L225 Difference]: With dead ends: 48 [2018-10-04 14:20:56,008 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 14:20:56,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 1.0s impTime 42 [2018-10-04 14:20:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 14:20:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 14:20:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 14:20:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 14:20:56,010 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 14:20:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:56,011 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 14:20:56,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:20:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 14:20:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 14:20:56,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:56,011 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-10-04 14:20:56,012 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:56,012 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:56,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-10-04 14:20:56,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:56,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:56,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:56,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:56,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:56,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:56,846 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:56,854 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:20:56,894 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 14:20:56,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:56,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:57,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:57,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 14:20:57,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:20:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:20:57,094 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:57,094 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-10-04 14:20:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:57,166 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-04 14:20:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:20:57,167 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-10-04 14:20:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:57,168 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:20:57,168 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:20:57,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 43 [2018-10-04 14:20:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:20:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 14:20:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 14:20:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 14:20:57,171 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-04 14:20:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:57,171 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 14:20:57,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:20:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 14:20:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 14:20:57,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:57,172 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-10-04 14:20:57,172 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:57,173 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-10-04 14:20:57,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:57,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:57,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:58,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:58,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 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:20:58,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:58,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:58,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:58,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 14:20:58,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 14:20:58,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 14:20:58,271 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:58,271 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-10-04 14:20:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:58,348 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-04 14:20:58,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 14:20:58,349 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-10-04 14:20:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:58,350 INFO L225 Difference]: With dead ends: 50 [2018-10-04 14:20:58,350 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 14:20:58,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.8s impTime 44 [2018-10-04 14:20:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 14:20:58,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-04 14:20:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 14:20:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-04 14:20:58,353 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-10-04 14:20:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:58,353 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-04 14:20:58,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 14:20:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-04 14:20:58,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 14:20:58,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:58,354 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-10-04 14:20:58,354 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:58,354 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-10-04 14:20:58,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:58,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:58,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:58,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:59,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:59,301 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:20:59,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:59,334 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:59,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:59,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:59,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:59,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 14:20:59,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 14:20:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 14:20:59,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:59,453 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-10-04 14:20:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:59,604 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 14:20:59,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:20:59,604 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-10-04 14:20:59,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:59,605 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:20:59,605 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:20:59,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.8s impTime 45 [2018-10-04 14:20:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:20:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-04 14:20:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 14:20:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 14:20:59,609 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-10-04 14:20:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:59,609 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 14:20:59,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 14:20:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 14:20:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 14:20:59,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:59,610 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-10-04 14:20:59,610 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:59,610 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-10-04 14:20:59,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:59,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:59,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:59,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:59,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:00,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:00,474 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:21:00,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:21:00,508 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-04 14:21:00,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:00,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:00,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:00,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 14:21:00,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 14:21:00,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 14:21:00,678 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:00,678 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-10-04 14:21:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:01,070 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-04 14:21:01,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:21:01,071 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-10-04 14:21:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:01,072 INFO L225 Difference]: With dead ends: 52 [2018-10-04 14:21:01,072 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 14:21:01,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 46 [2018-10-04 14:21:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 14:21:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 14:21:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 14:21:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-04 14:21:01,073 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-10-04 14:21:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:01,074 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-04 14:21:01,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 14:21:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-04 14:21:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 14:21:01,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:01,074 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-10-04 14:21:01,074 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:01,074 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:01,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-10-04 14:21:01,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:01,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:01,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:02,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:02,271 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:21:02,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:21:02,300 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:21:02,300 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:02,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:02,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:02,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 14:21:02,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 14:21:02,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 14:21:02,424 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:02,424 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-10-04 14:21:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:02,528 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-04 14:21:02,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 14:21:02,528 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-10-04 14:21:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:02,529 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:21:02,529 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:21:02,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 1.0s impTime 47 [2018-10-04 14:21:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:21:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 14:21:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 14:21:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 14:21:02,533 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-10-04 14:21:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:02,533 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 14:21:02,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 14:21:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 14:21:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 14:21:02,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:02,534 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-10-04 14:21:02,534 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:02,535 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:02,535 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-10-04 14:21:02,535 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:02,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:02,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:03,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:03,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21:03,569 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:21:03,598 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 14:21:03,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:03,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:03,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:03,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 14:21:03,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 14:21:03,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 14:21:03,713 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:03,714 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-10-04 14:21:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:03,782 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-04 14:21:03,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 14:21:03,783 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-10-04 14:21:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:03,784 INFO L225 Difference]: With dead ends: 54 [2018-10-04 14:21:03,784 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 14:21:03,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 48 [2018-10-04 14:21:03,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 14:21:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-04 14:21:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 14:21:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-04 14:21:03,787 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-10-04 14:21:03,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:03,787 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-04 14:21:03,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 14:21:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-04 14:21:03,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 14:21:03,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:03,788 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-10-04 14:21:03,788 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:03,788 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:03,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-10-04 14:21:03,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:03,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:03,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:03,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:03,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:04,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:04,455 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:21:04,463 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:21:04,496 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 14:21:04,497 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:04,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:04,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:04,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 14:21:04,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 14:21:04,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 14:21:04,601 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:04,601 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-10-04 14:21:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:04,667 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 14:21:04,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 14:21:04,668 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-10-04 14:21:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:04,669 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:21:04,669 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:21:04,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 49 [2018-10-04 14:21:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:21:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 14:21:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 14:21:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 14:21:04,672 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-10-04 14:21:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:04,673 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 14:21:04,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 14:21:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 14:21:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 14:21:04,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:04,673 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-10-04 14:21:04,674 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:04,674 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-10-04 14:21:04,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:04,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:04,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:05,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:05,837 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:21:05,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:05,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:05,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:05,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 14:21:05,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:21:05,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:21:05,973 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:05,973 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-10-04 14:21:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:06,059 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-04 14:21:06,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:21:06,059 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-10-04 14:21:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:06,060 INFO L225 Difference]: With dead ends: 56 [2018-10-04 14:21:06,060 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 14:21:06,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 50 [2018-10-04 14:21:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 14:21:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-04 14:21:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 14:21:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-04 14:21:06,062 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-10-04 14:21:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:06,062 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-04 14:21:06,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:21:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-04 14:21:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 14:21:06,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:06,063 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-10-04 14:21:06,063 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:06,063 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-10-04 14:21:06,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:06,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:06,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:06,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:06,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:06,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:06,948 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:21:06,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:06,978 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:06,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:06,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:07,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:07,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 14:21:07,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:21:07,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:21:07,101 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:07,101 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-10-04 14:21:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:07,178 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-04 14:21:07,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 14:21:07,179 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-10-04 14:21:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:07,180 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:21:07,180 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:21:07,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 51 [2018-10-04 14:21:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:21:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 14:21:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 14:21:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-04 14:21:07,182 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-10-04 14:21:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:07,182 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-04 14:21:07,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:21:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-04 14:21:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 14:21:07,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:07,183 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-10-04 14:21:07,183 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:07,184 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-10-04 14:21:07,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:07,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:07,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:07,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:07,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:08,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:08,528 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:21:08,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:21:08,564 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-04 14:21:08,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:08,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:08,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:08,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 14:21:08,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 14:21:08,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 14:21:08,776 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:08,776 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-10-04 14:21:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:08,949 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-04 14:21:08,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 14:21:08,950 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-10-04 14:21:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:08,950 INFO L225 Difference]: With dead ends: 58 [2018-10-04 14:21:08,951 INFO L226 Difference]: Without dead ends: 56 [2018-10-04 14:21:08,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime 52 [2018-10-04 14:21:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-04 14:21:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-04 14:21:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 14:21:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-04 14:21:08,954 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-10-04 14:21:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:08,954 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-04 14:21:08,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 14:21:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-04 14:21:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-04 14:21:08,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:08,955 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-10-04 14:21:08,955 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:08,955 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-10-04 14:21:08,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:08,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:08,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:08,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:08,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:10,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:10,622 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:21:10,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:21:10,653 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:21:10,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:10,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:10,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:10,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 14:21:10,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 14:21:10,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 14:21:10,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:10,799 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-10-04 14:21:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:10,894 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 14:21:10,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:21:10,895 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-10-04 14:21:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:10,896 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:21:10,896 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:21:10,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 53 [2018-10-04 14:21:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:21:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 14:21:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 14:21:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 14:21:10,898 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-10-04 14:21:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:10,898 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 14:21:10,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 14:21:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 14:21:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 14:21:10,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:10,899 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-10-04 14:21:10,899 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:10,899 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-10-04 14:21:10,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:10,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:10,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:12,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:12,396 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:21:12,404 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:21:12,434 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-10-04 14:21:12,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:12,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:12,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:12,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 14:21:12,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 14:21:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 14:21:12,584 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:12,584 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-10-04 14:21:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:12,677 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-04 14:21:12,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:21:12,677 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-10-04 14:21:12,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:12,678 INFO L225 Difference]: With dead ends: 60 [2018-10-04 14:21:12,678 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 14:21:12,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.3s impTime 54 [2018-10-04 14:21:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 14:21:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-04 14:21:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-04 14:21:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-04 14:21:12,681 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-10-04 14:21:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:12,681 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-04 14:21:12,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 14:21:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-04 14:21:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 14:21:12,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:12,682 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-10-04 14:21:12,682 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:12,682 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-10-04 14:21:12,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:12,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:12,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:13,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:13,732 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:21:13,739 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:21:13,773 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-04 14:21:13,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:13,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:13,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:13,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 14:21:13,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 14:21:13,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 14:21:13,982 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:13,982 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-10-04 14:21:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:14,072 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 14:21:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 14:21:14,077 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-10-04 14:21:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:14,077 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:21:14,078 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:21:14,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 55 [2018-10-04 14:21:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:21:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 14:21:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 14:21:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-04 14:21:14,079 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-10-04 14:21:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:14,080 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-04 14:21:14,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 14:21:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-04 14:21:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:21:14,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:14,080 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-10-04 14:21:14,080 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:14,081 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:14,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-10-04 14:21:14,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:14,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:14,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:14,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:14,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:15,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:15,160 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:21:15,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:15,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:15,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:15,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 14:21:15,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 14:21:15,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 14:21:15,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:15,411 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-10-04 14:21:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:15,595 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-04 14:21:15,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 14:21:15,596 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-10-04 14:21:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:15,597 INFO L225 Difference]: With dead ends: 62 [2018-10-04 14:21:15,597 INFO L226 Difference]: Without dead ends: 60 [2018-10-04 14:21:15,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 56 [2018-10-04 14:21:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-04 14:21:15,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-10-04 14:21:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-04 14:21:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-04 14:21:15,600 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-10-04 14:21:15,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:15,601 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-04 14:21:15,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 14:21:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-04 14:21:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-04 14:21:15,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:15,602 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-10-04 14:21:15,602 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:15,602 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:15,602 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-10-04 14:21:15,602 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:15,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:15,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:15,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:15,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:16,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:16,993 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:21:17,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:17,033 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:17,033 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:17,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:17,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:17,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 14:21:17,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 14:21:17,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 14:21:17,167 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:17,167 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-10-04 14:21:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:17,260 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 14:21:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 14:21:17,260 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-10-04 14:21:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:17,261 INFO L225 Difference]: With dead ends: 63 [2018-10-04 14:21:17,261 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 14:21:17,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime 57 [2018-10-04 14:21:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 14:21:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 14:21:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 14:21:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 14:21:17,263 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-10-04 14:21:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:17,263 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 14:21:17,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 14:21:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 14:21:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 14:21:17,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:17,264 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-10-04 14:21:17,264 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:17,265 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:17,265 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-10-04 14:21:17,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:17,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:17,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:17,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:17,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:19,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:19,509 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:21:19,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:21:19,549 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-10-04 14:21:19,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:19,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:20,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:20,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 14:21:20,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 14:21:20,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 14:21:20,122 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:20,122 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-10-04 14:21:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:20,222 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-04 14:21:20,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 14:21:20,223 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-10-04 14:21:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:20,224 INFO L225 Difference]: With dead ends: 64 [2018-10-04 14:21:20,224 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 14:21:20,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 1.9s impTime 58 [2018-10-04 14:21:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 14:21:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-10-04 14:21:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 14:21:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-04 14:21:20,226 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-10-04 14:21:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:20,226 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-04 14:21:20,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 14:21:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-04 14:21:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 14:21:20,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:20,227 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-10-04 14:21:20,227 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:20,227 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:20,227 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-10-04 14:21:20,227 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:20,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:20,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:20,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:20,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:21,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:21,813 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:21:21,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:21:21,847 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:21:21,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:21,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:21,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:21,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-04 14:21:21,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 14:21:21,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 14:21:21,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:21,980 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-10-04 14:21:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:22,082 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 14:21:22,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 14:21:22,083 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-10-04 14:21:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:22,084 INFO L225 Difference]: With dead ends: 65 [2018-10-04 14:21:22,084 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:21:22,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.3s impTime 59 [2018-10-04 14:21:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:21:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 14:21:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 14:21:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-04 14:21:22,087 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-10-04 14:21:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:22,087 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-04 14:21:22,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 14:21:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-04 14:21:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 14:21:22,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:22,088 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-10-04 14:21:22,088 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:22,088 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:22,088 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-10-04 14:21:22,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:22,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:22,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:22,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:22,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:23,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:23,725 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:21:23,732 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:21:23,770 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-04 14:21:23,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:23,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:23,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:23,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 14:21:23,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 14:21:23,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 14:21:23,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:23,959 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-10-04 14:21:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:24,093 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-04 14:21:24,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 14:21:24,094 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-10-04 14:21:24,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:24,094 INFO L225 Difference]: With dead ends: 66 [2018-10-04 14:21:24,095 INFO L226 Difference]: Without dead ends: 64 [2018-10-04 14:21:24,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime 60 [2018-10-04 14:21:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-04 14:21:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-10-04 14:21:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 14:21:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-04 14:21:24,097 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-10-04 14:21:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:24,097 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-04 14:21:24,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 14:21:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-04 14:21:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 14:21:24,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:24,098 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-10-04 14:21:24,098 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:24,098 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-10-04 14:21:24,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:24,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:25,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:25,344 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21:25,352 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:21:25,390 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 14:21:25,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:25,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:25,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:25,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-04 14:21:25,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 14:21:25,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 14:21:25,633 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:25,633 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-10-04 14:21:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:25,797 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-04 14:21:25,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 14:21:25,797 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-10-04 14:21:25,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:25,798 INFO L225 Difference]: With dead ends: 67 [2018-10-04 14:21:25,798 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 14:21:25,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 61 [2018-10-04 14:21:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 14:21:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-04 14:21:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 14:21:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-04 14:21:25,800 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-10-04 14:21:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:25,800 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-04 14:21:25,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 14:21:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-04 14:21:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 14:21:25,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:25,800 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-10-04 14:21:25,801 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:25,801 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:25,801 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-10-04 14:21:25,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:25,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:25,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:25,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:25,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:26,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:26,928 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:21:26,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:26,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:27,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:27,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 14:21:27,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 14:21:27,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 14:21:27,087 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:27,087 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-10-04 14:21:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:27,180 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-04 14:21:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 14:21:27,181 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-10-04 14:21:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:27,181 INFO L225 Difference]: With dead ends: 68 [2018-10-04 14:21:27,182 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 14:21:27,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 62 [2018-10-04 14:21:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 14:21:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-04 14:21:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 14:21:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-04 14:21:27,184 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-10-04 14:21:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:27,185 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-04 14:21:27,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 14:21:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-04 14:21:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 14:21:27,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:27,185 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-10-04 14:21:27,185 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:27,185 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-10-04 14:21:27,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:27,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:27,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:27,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:27,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:28,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:28,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:28,224 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:28,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:28,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:28,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:28,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-04 14:21:28,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 14:21:28,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 14:21:28,369 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:28,369 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-10-04 14:21:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:28,562 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-04 14:21:28,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 14:21:28,562 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-10-04 14:21:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:28,563 INFO L225 Difference]: With dead ends: 69 [2018-10-04 14:21:28,563 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 14:21:28,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.8s impTime 63 [2018-10-04 14:21:28,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 14:21:28,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-04 14:21:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 14:21:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-04 14:21:28,566 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-10-04 14:21:28,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:28,566 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-04 14:21:28,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 14:21:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-04 14:21:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 14:21:28,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:28,567 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-10-04 14:21:28,568 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:28,568 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:28,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-10-04 14:21:28,568 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:28,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:28,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:28,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:28,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:29,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:29,794 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21:29,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:21:29,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-10-04 14:21:29,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:29,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:30,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:30,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 14:21:30,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 14:21:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 14:21:30,002 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:30,002 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-10-04 14:21:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:30,243 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-04 14:21:30,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 14:21:30,244 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-10-04 14:21:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:30,245 INFO L225 Difference]: With dead ends: 70 [2018-10-04 14:21:30,245 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 14:21:30,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 1.0s impTime 64 [2018-10-04 14:21:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 14:21:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 14:21:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 14:21:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-04 14:21:30,247 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-10-04 14:21:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:30,247 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-04 14:21:30,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 14:21:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-04 14:21:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 14:21:30,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:30,248 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-10-04 14:21:30,248 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:30,249 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:30,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-10-04 14:21:30,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:30,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:30,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:30,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:30,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:32,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:32,486 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:21:32,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:21:32,547 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:21:32,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:32,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:32,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:32,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-04 14:21:32,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 14:21:32,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 14:21:32,725 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:32,725 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-10-04 14:21:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:32,848 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-04 14:21:32,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 14:21:32,848 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-10-04 14:21:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:32,849 INFO L225 Difference]: With dead ends: 71 [2018-10-04 14:21:32,849 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 14:21:32,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 2.0s impTime 65 [2018-10-04 14:21:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 14:21:32,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-04 14:21:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 14:21:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-04 14:21:32,851 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-10-04 14:21:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:32,851 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-04 14:21:32,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 14:21:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-04 14:21:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 14:21:32,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:32,852 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-10-04 14:21:32,852 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:32,852 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:32,852 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-10-04 14:21:32,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:32,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:32,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:34,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:34,412 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:21:34,422 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:21:34,462 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-10-04 14:21:34,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:34,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:34,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:34,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 14:21:34,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 14:21:34,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 14:21:34,668 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:34,668 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-10-04 14:21:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:34,808 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-04 14:21:34,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 14:21:34,809 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-10-04 14:21:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:34,809 INFO L225 Difference]: With dead ends: 72 [2018-10-04 14:21:34,810 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 14:21:34,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.4s impTime 66 [2018-10-04 14:21:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 14:21:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-04 14:21:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-04 14:21:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-04 14:21:34,813 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-10-04 14:21:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:34,813 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-04 14:21:34,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 14:21:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-04 14:21:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-04 14:21:34,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:34,813 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-10-04 14:21:34,814 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:34,814 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-10-04 14:21:34,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:34,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:34,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:34,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:36,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:36,418 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:21:36,425 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:21:36,462 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-10-04 14:21:36,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:36,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:36,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:36,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-04 14:21:36,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 14:21:36,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 14:21:36,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:36,611 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-10-04 14:21:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:36,704 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-04 14:21:36,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 14:21:36,704 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-10-04 14:21:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:36,705 INFO L225 Difference]: With dead ends: 73 [2018-10-04 14:21:36,705 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 14:21:36,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.4s impTime 67 [2018-10-04 14:21:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 14:21:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 14:21:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 14:21:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-04 14:21:36,708 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-10-04 14:21:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:36,709 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-04 14:21:36,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 14:21:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-04 14:21:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 14:21:36,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:36,710 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-10-04 14:21:36,710 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:36,710 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:36,710 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-10-04 14:21:36,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:36,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:36,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:36,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:36,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:38,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:38,816 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:21:38,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:38,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:38,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:38,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 14:21:38,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 14:21:38,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 14:21:38,993 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:38,993 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-10-04 14:21:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:39,133 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-04 14:21:39,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 14:21:39,133 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-10-04 14:21:39,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:39,134 INFO L225 Difference]: With dead ends: 74 [2018-10-04 14:21:39,134 INFO L226 Difference]: Without dead ends: 72 [2018-10-04 14:21:39,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.9s impTime 68 [2018-10-04 14:21:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-04 14:21:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-10-04 14:21:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-04 14:21:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-04 14:21:39,136 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-10-04 14:21:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:39,137 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-04 14:21:39,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 14:21:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-04 14:21:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 14:21:39,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:39,137 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-10-04 14:21:39,137 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:39,137 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:39,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-10-04 14:21:39,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:39,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:39,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:39,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:39,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:41,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:41,507 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21:41,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:41,541 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:41,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:41,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:41,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:41,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-04 14:21:41,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 14:21:41,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 14:21:41,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:41,674 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-10-04 14:21:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:41,832 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-04 14:21:41,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 14:21:41,832 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-10-04 14:21:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:41,833 INFO L225 Difference]: With dead ends: 75 [2018-10-04 14:21:41,833 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 14:21:41,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 2.1s impTime 69 [2018-10-04 14:21:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 14:21:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-04 14:21:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 14:21:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-04 14:21:41,835 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-10-04 14:21:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:41,835 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-04 14:21:41,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 14:21:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-04 14:21:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 14:21:41,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:41,836 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-10-04 14:21:41,836 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:41,836 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:41,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-10-04 14:21:41,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:41,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:41,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:41,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:41,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:44,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:44,033 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:21:44,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:21:44,124 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-04 14:21:44,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:44,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:44,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:44,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 14:21:44,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 14:21:44,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 14:21:44,520 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:44,520 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-10-04 14:21:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:44,706 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-04 14:21:44,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 14:21:44,706 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-10-04 14:21:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:44,707 INFO L225 Difference]: With dead ends: 76 [2018-10-04 14:21:44,707 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 14:21:44,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 2.0s impTime 70 [2018-10-04 14:21:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 14:21:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 14:21:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 14:21:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-04 14:21:44,710 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-10-04 14:21:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:44,711 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-04 14:21:44,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 14:21:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-04 14:21:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 14:21:44,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:44,712 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-10-04 14:21:44,712 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:44,712 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-10-04 14:21:44,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:44,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:44,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:44,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:44,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:46,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:46,216 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:21:46,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:21:46,280 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:21:46,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:46,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:46,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:46,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-04 14:21:46,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 14:21:46,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 14:21:46,595 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:46,595 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-10-04 14:21:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:46,784 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-04 14:21:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 14:21:46,784 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-10-04 14:21:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:46,785 INFO L225 Difference]: With dead ends: 77 [2018-10-04 14:21:46,785 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 14:21:46,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.2s impTime 71 [2018-10-04 14:21:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 14:21:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-04 14:21:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 14:21:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-04 14:21:46,788 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-10-04 14:21:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:46,788 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-04 14:21:46,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 14:21:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-04 14:21:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 14:21:46,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:46,789 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-10-04 14:21:46,789 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:46,790 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:46,790 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-10-04 14:21:46,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:46,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:46,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:46,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:49,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:49,090 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21:49,096 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:21:49,141 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-04 14:21:49,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:49,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:49,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:49,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 14:21:49,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 14:21:49,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 14:21:49,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:49,550 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-10-04 14:21:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:49,684 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-04 14:21:49,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 14:21:49,685 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-10-04 14:21:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:49,686 INFO L225 Difference]: With dead ends: 78 [2018-10-04 14:21:49,686 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 14:21:49,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.0s impTime 72 [2018-10-04 14:21:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 14:21:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 14:21:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 14:21:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-04 14:21:49,689 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-10-04 14:21:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:49,690 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-04 14:21:49,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 14:21:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-04 14:21:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 14:21:49,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:49,691 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-10-04 14:21:49,691 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:49,691 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-10-04 14:21:49,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:49,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:49,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:49,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:49,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:52,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:52,137 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:21:52,143 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:21:52,186 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 14:21:52,186 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:52,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:52,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:52,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-04 14:21:52,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 14:21:52,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 14:21:52,400 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:52,400 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-10-04 14:21:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:52,575 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-04 14:21:52,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 14:21:52,576 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-10-04 14:21:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:52,577 INFO L225 Difference]: With dead ends: 79 [2018-10-04 14:21:52,577 INFO L226 Difference]: Without dead ends: 77 [2018-10-04 14:21:52,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 2.2s impTime 73 [2018-10-04 14:21:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-04 14:21:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-04 14:21:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 14:21:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-04 14:21:52,580 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-10-04 14:21:52,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:52,581 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-04 14:21:52,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 14:21:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-04 14:21:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 14:21:52,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:52,582 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-10-04 14:21:52,582 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:52,582 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:52,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-10-04 14:21:52,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:52,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:52,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:52,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:52,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:56,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:56,037 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:21:56,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:56,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:56,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:56,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-04 14:21:56,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 14:21:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 14:21:56,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:56,362 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-10-04 14:21:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:56,571 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-04 14:21:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 14:21:56,571 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-10-04 14:21:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:56,572 INFO L225 Difference]: With dead ends: 80 [2018-10-04 14:21:56,572 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 14:21:56,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time 3.0s impTime 74 [2018-10-04 14:21:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 14:21:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-04 14:21:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 14:21:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-04 14:21:56,574 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-10-04 14:21:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:56,574 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-04 14:21:56,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 14:21:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-04 14:21:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 14:21:56,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:56,575 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-10-04 14:21:56,575 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:56,575 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:56,575 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-10-04 14:21:56,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:56,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:56,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:56,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:56,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:58,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:58,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21:58,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:58,920 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:58,921 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:58,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:59,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:59,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-04 14:21:59,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 14:21:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 14:21:59,084 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:59,084 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-10-04 14:21:59,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:59,254 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-04 14:21:59,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 14:21:59,255 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-10-04 14:21:59,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:59,256 INFO L225 Difference]: With dead ends: 81 [2018-10-04 14:21:59,256 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 14:21:59,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 2.1s impTime 75 [2018-10-04 14:21:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 14:21:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-04 14:21:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 14:21:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-04 14:21:59,259 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-10-04 14:21:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:59,259 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-04 14:21:59,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 14:21:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-04 14:21:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 14:21:59,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:59,260 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-10-04 14:21:59,260 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:59,260 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-10-04 14:21:59,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:59,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:59,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:59,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:03,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:03,098 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:22:03,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:22:03,149 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-10-04 14:22:03,149 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:03,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:03,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:03,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-04 14:22:03,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 14:22:03,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 14:22:03,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:03,323 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-10-04 14:22:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:04,338 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-04 14:22:04,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 14:22:04,338 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-10-04 14:22:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:04,339 INFO L225 Difference]: With dead ends: 82 [2018-10-04 14:22:04,339 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 14:22:04,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.4s impTime 76 [2018-10-04 14:22:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 14:22:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 14:22:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 14:22:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-04 14:22:04,342 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-10-04 14:22:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:04,342 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-04 14:22:04,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 14:22:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-04 14:22:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 14:22:04,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:04,343 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-10-04 14:22:04,343 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:04,343 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:04,344 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-10-04 14:22:04,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:04,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:04,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:04,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:04,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:07,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:07,848 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:22:07,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:22:07,909 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:22:07,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:07,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:08,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:08,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-04 14:22:08,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 14:22:08,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 14:22:08,162 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:08,162 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-10-04 14:22:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:08,620 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-04 14:22:08,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 14:22:08,620 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-10-04 14:22:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:08,621 INFO L225 Difference]: With dead ends: 83 [2018-10-04 14:22:08,621 INFO L226 Difference]: Without dead ends: 81 [2018-10-04 14:22:08,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time 3.0s impTime 77 [2018-10-04 14:22:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-04 14:22:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-04 14:22:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-04 14:22:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-04 14:22:08,623 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-10-04 14:22:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:08,623 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-04 14:22:08,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 14:22:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-04 14:22:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 14:22:08,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:08,625 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-10-04 14:22:08,625 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:08,625 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:08,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-10-04 14:22:08,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:08,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:08,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:08,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:08,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:10,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:10,970 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:22:10,978 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:22:11,050 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-10-04 14:22:11,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:11,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:11,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:11,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-04 14:22:11,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 14:22:11,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 14:22:11,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:11,221 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-10-04 14:22:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:11,401 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-04 14:22:11,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-04 14:22:11,401 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-10-04 14:22:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:11,402 INFO L225 Difference]: With dead ends: 84 [2018-10-04 14:22:11,402 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 14:22:11,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 2.1s impTime 78 [2018-10-04 14:22:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 14:22:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-04 14:22:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 14:22:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-04 14:22:11,405 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-10-04 14:22:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:11,406 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-04 14:22:11,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 14:22:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-04 14:22:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 14:22:11,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:11,406 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-10-04 14:22:11,407 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:11,407 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:11,407 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-10-04 14:22:11,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:11,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:11,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:11,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:11,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:14,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:14,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 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:22:14,058 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:22:14,105 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2018-10-04 14:22:14,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:14,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:14,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:14,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-04 14:22:14,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 14:22:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 14:22:14,279 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:14,279 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-10-04 14:22:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:14,406 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-04 14:22:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-04 14:22:14,407 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-10-04 14:22:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:14,407 INFO L225 Difference]: With dead ends: 85 [2018-10-04 14:22:14,407 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 14:22:14,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 2.2s impTime 79 [2018-10-04 14:22:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 14:22:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 14:22:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 14:22:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-04 14:22:14,410 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-10-04 14:22:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:14,410 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-04 14:22:14,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 14:22:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-04 14:22:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-04 14:22:14,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:14,411 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-10-04 14:22:14,411 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:14,412 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:14,412 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-10-04 14:22:14,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:14,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:14,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:14,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:14,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:16,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:16,429 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:22:16,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:16,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:16,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:16,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-04 14:22:16,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 14:22:16,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 14:22:16,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:16,629 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-10-04 14:22:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:16,845 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-04 14:22:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 14:22:16,845 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-10-04 14:22:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:16,846 INFO L225 Difference]: With dead ends: 86 [2018-10-04 14:22:16,846 INFO L226 Difference]: Without dead ends: 84 [2018-10-04 14:22:16,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.8s impTime 80 [2018-10-04 14:22:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-04 14:22:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-10-04 14:22:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-04 14:22:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-04 14:22:16,849 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-10-04 14:22:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:16,850 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-04 14:22:16,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 14:22:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-04 14:22:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-04 14:22:16,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:16,850 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-10-04 14:22:16,851 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:16,851 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-10-04 14:22:16,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:16,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:16,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:16,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:19,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:19,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 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:22:19,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:19,773 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:19,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:19,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:20,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:20,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-04 14:22:20,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 14:22:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 14:22:20,752 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:20,753 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-10-04 14:22:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:20,969 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-04 14:22:20,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-04 14:22:20,969 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-10-04 14:22:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:20,970 INFO L225 Difference]: With dead ends: 87 [2018-10-04 14:22:20,970 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 14:22:20,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time 2.5s impTime 81 [2018-10-04 14:22:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 14:22:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 14:22:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 14:22:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-04 14:22:20,972 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-10-04 14:22:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:20,972 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-04 14:22:20,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 14:22:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-04 14:22:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 14:22:20,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:20,973 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-10-04 14:22:20,974 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:20,974 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-10-04 14:22:20,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:20,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:20,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:20,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:20,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:22,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:22,989 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:22:22,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:22:23,050 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-10-04 14:22:23,051 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:23,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:23,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:23,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-04 14:22:23,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 14:22:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 14:22:23,329 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:23,329 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-10-04 14:22:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:23,473 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-04 14:22:23,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 14:22:23,473 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-10-04 14:22:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:23,474 INFO L225 Difference]: With dead ends: 88 [2018-10-04 14:22:23,474 INFO L226 Difference]: Without dead ends: 86 [2018-10-04 14:22:23,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.8s impTime 82 [2018-10-04 14:22:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-04 14:22:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-10-04 14:22:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-04 14:22:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-04 14:22:23,476 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-10-04 14:22:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:23,476 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-04 14:22:23,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 14:22:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-04 14:22:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 14:22:23,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:23,477 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-10-04 14:22:23,477 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:23,478 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:23,478 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-10-04 14:22:23,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:23,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:23,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:26,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:26,256 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:22:26,263 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:22:26,299 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:22:26,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:26,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:27,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:27,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-04 14:22:27,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 14:22:27,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 14:22:27,820 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:27,820 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-10-04 14:22:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:28,308 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-04 14:22:28,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 14:22:28,308 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-10-04 14:22:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:28,309 INFO L225 Difference]: With dead ends: 89 [2018-10-04 14:22:28,309 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 14:22:28,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s Time 2.5s impTime 83 [2018-10-04 14:22:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 14:22:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 14:22:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 14:22:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-04 14:22:28,312 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-10-04 14:22:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:28,312 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-04 14:22:28,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 14:22:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-04 14:22:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 14:22:28,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:28,313 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-10-04 14:22:28,313 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:28,313 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-10-04 14:22:28,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:28,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:28,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:28,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:28,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:31,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:31,385 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:22:31,392 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:22:31,492 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-10-04 14:22:31,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:31,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:31,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:31,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-04 14:22:31,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 14:22:31,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 14:22:31,677 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:31,677 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-10-04 14:22:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:31,898 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-04 14:22:31,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-04 14:22:31,899 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-10-04 14:22:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:31,899 INFO L225 Difference]: With dead ends: 90 [2018-10-04 14:22:31,900 INFO L226 Difference]: Without dead ends: 88 [2018-10-04 14:22:31,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.8s impTime 84 [2018-10-04 14:22:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-04 14:22:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-10-04 14:22:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 14:22:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-04 14:22:31,902 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-10-04 14:22:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:31,903 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-04 14:22:31,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 14:22:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-04 14:22:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 14:22:31,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:31,904 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-10-04 14:22:31,904 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:31,904 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:31,904 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-10-04 14:22:31,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:31,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:31,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:31,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:31,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:33,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:33,863 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:22:33,874 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:22:33,931 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 14:22:33,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:33,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:34,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:34,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-04 14:22:34,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 14:22:34,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 14:22:34,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:34,114 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-10-04 14:22:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:34,256 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-04 14:22:34,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-04 14:22:34,256 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-10-04 14:22:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:34,257 INFO L225 Difference]: With dead ends: 91 [2018-10-04 14:22:34,257 INFO L226 Difference]: Without dead ends: 89 [2018-10-04 14:22:34,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.7s impTime 85 [2018-10-04 14:22:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-04 14:22:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-04 14:22:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 14:22:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-04 14:22:34,260 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-10-04 14:22:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:34,260 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-04 14:22:34,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 14:22:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-04 14:22:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-04 14:22:34,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:34,261 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-10-04 14:22:34,261 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:34,262 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-10-04 14:22:34,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:34,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:34,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:36,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:36,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 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:22:36,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:36,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:36,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:36,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-04 14:22:36,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 14:22:36,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 14:22:36,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:36,502 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-10-04 14:22:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:36,648 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-04 14:22:36,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-04 14:22:36,648 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-10-04 14:22:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:36,649 INFO L225 Difference]: With dead ends: 92 [2018-10-04 14:22:36,649 INFO L226 Difference]: Without dead ends: 90 [2018-10-04 14:22:36,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.8s impTime 86 [2018-10-04 14:22:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-04 14:22:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-10-04 14:22:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-04 14:22:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-04 14:22:36,651 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-10-04 14:22:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:36,652 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-04 14:22:36,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 14:22:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-04 14:22:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-04 14:22:36,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:36,653 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-10-04 14:22:36,653 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:36,654 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-10-04 14:22:36,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:36,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:36,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:36,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:39,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:39,265 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:22:39,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:39,305 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:39,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:39,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:39,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:39,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-10-04 14:22:39,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 14:22:39,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 14:22:39,490 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:39,490 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-10-04 14:22:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:39,651 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-04 14:22:39,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-04 14:22:39,651 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-10-04 14:22:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:39,652 INFO L225 Difference]: With dead ends: 93 [2018-10-04 14:22:39,652 INFO L226 Difference]: Without dead ends: 91 [2018-10-04 14:22:39,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.4s impTime 87 [2018-10-04 14:22:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-04 14:22:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-04 14:22:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 14:22:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-04 14:22:39,655 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-10-04 14:22:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:39,655 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-04 14:22:39,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-04 14:22:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-04 14:22:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 14:22:39,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:39,656 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-10-04 14:22:39,656 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:39,656 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-10-04 14:22:39,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:39,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:39,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:39,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:39,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:42,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:42,523 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:22:42,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:22:42,607 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-10-04 14:22:42,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:42,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:42,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:42,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-04 14:22:42,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 14:22:42,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 14:22:42,821 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:42,821 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-10-04 14:22:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:42,992 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-04 14:22:42,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-04 14:22:42,993 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-10-04 14:22:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:42,994 INFO L225 Difference]: With dead ends: 94 [2018-10-04 14:22:42,994 INFO L226 Difference]: Without dead ends: 92 [2018-10-04 14:22:42,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.5s impTime 88 [2018-10-04 14:22:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-04 14:22:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-10-04 14:22:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-04 14:22:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-04 14:22:42,997 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-10-04 14:22:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:42,997 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-04 14:22:42,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 14:22:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-04 14:22:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-04 14:22:42,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:42,998 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-10-04 14:22:42,998 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:42,999 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:42,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-10-04 14:22:42,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:42,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:42,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:43,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:45,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:45,428 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:22:45,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:22:45,474 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:22:45,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:45,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:45,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:45,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-10-04 14:22:45,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-04 14:22:45,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-04 14:22:45,653 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:45,654 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-10-04 14:22:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:45,822 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-04 14:22:45,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-04 14:22:45,822 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-10-04 14:22:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:45,823 INFO L225 Difference]: With dead ends: 95 [2018-10-04 14:22:45,823 INFO L226 Difference]: Without dead ends: 93 [2018-10-04 14:22:45,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 2.2s impTime 89 [2018-10-04 14:22:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-04 14:22:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-10-04 14:22:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 14:22:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-04 14:22:45,825 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-10-04 14:22:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:45,825 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-04 14:22:45,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-04 14:22:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-04 14:22:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-04 14:22:45,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:45,826 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-10-04 14:22:45,826 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:45,826 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:45,826 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-10-04 14:22:45,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:45,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:45,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:45,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:45,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:48,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:48,296 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:22:48,302 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:22:48,443 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2018-10-04 14:22:48,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:48,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:48,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:48,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-10-04 14:22:48,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 14:22:48,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 14:22:48,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:48,942 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-10-04 14:22:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:49,107 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-04 14:22:49,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-04 14:22:49,108 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-10-04 14:22:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:49,109 INFO L225 Difference]: With dead ends: 96 [2018-10-04 14:22:49,109 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 14:22:49,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.2s impTime 90 [2018-10-04 14:22:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 14:22:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-10-04 14:22:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-04 14:22:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-04 14:22:49,112 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-10-04 14:22:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:49,112 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-04 14:22:49,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 14:22:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-04 14:22:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-04 14:22:49,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:49,113 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-10-04 14:22:49,113 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:49,113 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:49,113 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-10-04 14:22:49,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:49,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:49,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:49,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:49,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:51,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:51,132 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:22:51,139 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:22:51,197 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2018-10-04 14:22:51,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:51,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:51,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:51,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2018-10-04 14:22:51,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-04 14:22:51,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-04 14:22:51,393 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:51,393 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-10-04 14:22:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:51,567 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-04 14:22:51,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-04 14:22:51,567 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-10-04 14:22:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:51,568 INFO L225 Difference]: With dead ends: 97 [2018-10-04 14:22:51,568 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 14:22:51,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.8s impTime 91 [2018-10-04 14:22:51,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 14:22:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-04 14:22:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-04 14:22:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-04 14:22:51,571 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-10-04 14:22:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:51,571 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-04 14:22:51,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-04 14:22:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-04 14:22:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-04 14:22:51,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:51,572 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-10-04 14:22:51,573 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:51,573 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-10-04 14:22:51,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:51,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:51,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:51,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:51,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:55,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:55,640 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:22:55,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:55,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:55,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:55,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2018-10-04 14:22:55,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-04 14:22:55,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-04 14:22:55,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:55,873 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-10-04 14:22:56,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:56,131 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-04 14:22:56,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-04 14:22:56,132 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-10-04 14:22:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:56,132 INFO L225 Difference]: With dead ends: 98 [2018-10-04 14:22:56,132 INFO L226 Difference]: Without dead ends: 96 [2018-10-04 14:22:56,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s Time 3.8s impTime 92 [2018-10-04 14:22:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-04 14:22:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-10-04 14:22:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 14:22:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-04 14:22:56,135 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-10-04 14:22:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:56,135 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-04 14:22:56,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-04 14:22:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-04 14:22:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-04 14:22:56,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:56,136 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-10-04 14:22:56,136 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:56,136 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:56,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-10-04 14:22:56,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:56,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:56,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:56,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:56,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:59,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:59,328 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:22:59,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:59,379 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:59,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:59,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:59,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:59,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2018-10-04 14:22:59,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-04 14:22:59,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-04 14:22:59,575 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:59,575 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-10-04 14:22:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:59,771 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-04 14:22:59,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-04 14:22:59,772 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-10-04 14:22:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:59,773 INFO L225 Difference]: With dead ends: 99 [2018-10-04 14:22:59,773 INFO L226 Difference]: Without dead ends: 97 [2018-10-04 14:22:59,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 2.8s impTime 93 [2018-10-04 14:22:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-04 14:22:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-10-04 14:22:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-04 14:22:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-04 14:22:59,775 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-10-04 14:22:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:59,775 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-04 14:22:59,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-04 14:22:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-04 14:22:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 14:22:59,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:59,776 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-10-04 14:22:59,776 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:59,776 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:59,776 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-10-04 14:22:59,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:59,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:59,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:59,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:59,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:02,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:02,139 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:23:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:23:02,216 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-10-04 14:23:02,216 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:02,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:02,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:02,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-10-04 14:23:02,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-04 14:23:02,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-04 14:23:02,623 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:02,623 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-10-04 14:23:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:02,847 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-04 14:23:02,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-04 14:23:02,847 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-10-04 14:23:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:02,847 INFO L225 Difference]: With dead ends: 100 [2018-10-04 14:23:02,847 INFO L226 Difference]: Without dead ends: 98 [2018-10-04 14:23:02,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.1s impTime 94 [2018-10-04 14:23:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-04 14:23:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-10-04 14:23:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 14:23:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-04 14:23:02,850 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-10-04 14:23:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:02,850 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-04 14:23:02,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-04 14:23:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-04 14:23:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 14:23:02,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:02,851 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-10-04 14:23:02,851 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:02,851 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2018-10-04 14:23:02,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:02,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:02,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:02,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:02,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:06,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:06,298 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:23:06,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:23:06,345 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:23:06,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:06,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:06,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:06,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-10-04 14:23:06,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-04 14:23:06,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-04 14:23:06,654 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:06,655 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-10-04 14:23:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:06,852 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-04 14:23:06,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-04 14:23:06,852 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-10-04 14:23:06,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:06,853 INFO L225 Difference]: With dead ends: 101 [2018-10-04 14:23:06,853 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 14:23:06,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time 3.2s impTime 95 [2018-10-04 14:23:06,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 14:23:06,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-04 14:23:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-04 14:23:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-04 14:23:06,857 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-10-04 14:23:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:06,857 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-04 14:23:06,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-04 14:23:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-04 14:23:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 14:23:06,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:06,858 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-10-04 14:23:06,858 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:06,858 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2018-10-04 14:23:06,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:06,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:06,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:10,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:10,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:23:10,152 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:23:10,214 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-04 14:23:10,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:10,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:10,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:10,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-10-04 14:23:10,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-04 14:23:10,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-04 14:23:10,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:10,415 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-10-04 14:23:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:10,664 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-04 14:23:10,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-04 14:23:10,665 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-10-04 14:23:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:10,665 INFO L225 Difference]: With dead ends: 102 [2018-10-04 14:23:10,665 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 14:23:10,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 3.0s impTime 96 [2018-10-04 14:23:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 14:23:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-04 14:23:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 14:23:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-04 14:23:10,667 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-10-04 14:23:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:10,668 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-04 14:23:10,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-04 14:23:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-04 14:23:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 14:23:10,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:10,668 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-10-04 14:23:10,668 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:10,669 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:10,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2018-10-04 14:23:10,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:10,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:10,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:10,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:13,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:13,352 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:23:13,359 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:23:13,423 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 14:23:13,423 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:13,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:13,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:13,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-10-04 14:23:13,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-04 14:23:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-04 14:23:13,628 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:13,628 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-10-04 14:23:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:13,782 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-04 14:23:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-04 14:23:13,783 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-10-04 14:23:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:13,784 INFO L225 Difference]: With dead ends: 103 [2018-10-04 14:23:13,784 INFO L226 Difference]: Without dead ends: 101 [2018-10-04 14:23:13,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 2.4s impTime 97 [2018-10-04 14:23:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-04 14:23:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-04 14:23:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-04 14:23:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-04 14:23:13,787 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-10-04 14:23:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:13,788 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-04 14:23:13,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-04 14:23:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-04 14:23:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 14:23:13,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:13,788 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-10-04 14:23:13,788 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:13,789 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2018-10-04 14:23:13,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:13,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:13,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:13,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:17,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:17,357 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:23:17,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:17,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:17,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:17,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-10-04 14:23:17,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-04 14:23:17,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-04 14:23:17,604 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:17,604 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-10-04 14:23:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:17,818 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-04 14:23:17,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-04 14:23:17,818 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-10-04 14:23:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:17,819 INFO L225 Difference]: With dead ends: 104 [2018-10-04 14:23:17,819 INFO L226 Difference]: Without dead ends: 102 [2018-10-04 14:23:17,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time 3.2s impTime 98 [2018-10-04 14:23:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-04 14:23:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-10-04 14:23:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-04 14:23:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-04 14:23:17,822 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-10-04 14:23:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:17,822 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-04 14:23:17,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-04 14:23:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-04 14:23:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-04 14:23:17,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:17,823 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-10-04 14:23:17,823 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:17,823 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:17,823 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2018-10-04 14:23:17,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:17,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:22,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:22,430 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:23:22,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:23:22,476 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:23:22,476 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:22,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:22,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:22,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-10-04 14:23:22,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-04 14:23:22,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-04 14:23:22,682 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:22,682 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-10-04 14:23:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:22,981 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-04 14:23:22,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-04 14:23:22,981 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-10-04 14:23:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:22,982 INFO L225 Difference]: With dead ends: 105 [2018-10-04 14:23:22,982 INFO L226 Difference]: Without dead ends: 103 [2018-10-04 14:23:22,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s Time 4.3s impTime 99 [2018-10-04 14:23:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-04 14:23:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-04 14:23:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-04 14:23:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-04 14:23:22,985 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-10-04 14:23:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:22,986 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-04 14:23:22,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-04 14:23:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-04 14:23:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-04 14:23:22,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:22,986 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-10-04 14:23:22,987 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:22,987 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:22,987 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2018-10-04 14:23:22,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:22,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:22,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:22,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:22,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:27,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:27,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 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:23:27,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:23:27,686 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-10-04 14:23:27,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:27,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:27,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:27,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-10-04 14:23:27,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-04 14:23:27,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-04 14:23:27,901 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:27,901 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-10-04 14:23:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:28,225 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-04 14:23:28,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-04 14:23:28,226 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-10-04 14:23:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:28,227 INFO L225 Difference]: With dead ends: 106 [2018-10-04 14:23:28,227 INFO L226 Difference]: Without dead ends: 104 [2018-10-04 14:23:28,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s Time 4.3s impTime 100 [2018-10-04 14:23:28,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-04 14:23:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-04 14:23:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-04 14:23:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-04 14:23:28,230 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-10-04 14:23:28,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:28,231 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-04 14:23:28,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-04 14:23:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-04 14:23:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-04 14:23:28,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:28,231 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-10-04 14:23:28,232 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:28,232 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:28,232 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2018-10-04 14:23:28,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:28,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:28,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:32,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:32,753 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:23:32,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:23:32,801 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:23:32,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:32,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:33,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:33,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2018-10-04 14:23:33,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-04 14:23:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-04 14:23:33,003 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:33,003 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-10-04 14:23:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:33,306 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-04 14:23:33,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-04 14:23:33,307 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-10-04 14:23:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:33,308 INFO L225 Difference]: With dead ends: 107 [2018-10-04 14:23:33,308 INFO L226 Difference]: Without dead ends: 105 [2018-10-04 14:23:33,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s Time 4.2s impTime 101 [2018-10-04 14:23:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-04 14:23:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-10-04 14:23:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-04 14:23:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-04 14:23:33,311 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-10-04 14:23:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:33,311 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-04 14:23:33,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-04 14:23:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-04 14:23:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-04 14:23:33,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:33,312 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-10-04 14:23:33,312 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:33,313 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2018-10-04 14:23:33,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:33,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:33,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:38,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:38,298 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:23:38,306 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:23:38,384 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2018-10-04 14:23:38,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:38,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:38,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:38,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2018-10-04 14:23:38,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-04 14:23:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-04 14:23:38,622 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:38,622 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-10-04 14:23:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:39,007 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-04 14:23:39,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-04 14:23:39,007 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-10-04 14:23:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:39,009 INFO L225 Difference]: With dead ends: 108 [2018-10-04 14:23:39,009 INFO L226 Difference]: Without dead ends: 106 [2018-10-04 14:23:39,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s Time 4.6s impTime 102 [2018-10-04 14:23:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-04 14:23:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-10-04 14:23:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-04 14:23:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-04 14:23:39,012 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-10-04 14:23:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:39,012 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-04 14:23:39,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-04 14:23:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-04 14:23:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-04 14:23:39,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:39,013 INFO L375 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-10-04 14:23:39,014 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:39,014 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2018-10-04 14:23:39,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:39,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:39,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:39,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:39,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:43,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:43,666 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:23:43,673 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:23:43,770 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2018-10-04 14:23:43,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:43,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:44,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:44,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2018-10-04 14:23:44,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-04 14:23:44,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-04 14:23:44,115 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:44,115 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-10-04 14:23:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:44,456 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-04 14:23:44,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-04 14:23:44,457 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-10-04 14:23:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:44,458 INFO L225 Difference]: With dead ends: 109 [2018-10-04 14:23:44,458 INFO L226 Difference]: Without dead ends: 107 [2018-10-04 14:23:44,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s Time 4.3s impTime 103 [2018-10-04 14:23:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-04 14:23:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-04 14:23:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 14:23:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-04 14:23:44,460 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-10-04 14:23:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:44,461 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-04 14:23:44,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-04 14:23:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-04 14:23:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-04 14:23:44,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:44,462 INFO L375 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-10-04 14:23:44,462 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:44,462 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:44,462 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2018-10-04 14:23:44,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:44,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:44,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:44,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:44,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:47,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:47,357 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:23:47,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:47,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:47,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:47,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2018-10-04 14:23:47,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-04 14:23:47,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-04 14:23:47,751 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:47,752 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-10-04 14:23:47,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:47,963 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-04 14:23:47,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-04 14:23:47,963 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-10-04 14:23:47,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:47,964 INFO L225 Difference]: With dead ends: 110 [2018-10-04 14:23:47,964 INFO L226 Difference]: Without dead ends: 108 [2018-10-04 14:23:47,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.5s impTime 104 [2018-10-04 14:23:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-04 14:23:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-10-04 14:23:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-04 14:23:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-04 14:23:47,966 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-10-04 14:23:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:47,966 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-04 14:23:47,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-04 14:23:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-04 14:23:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 14:23:47,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:47,967 INFO L375 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-10-04 14:23:47,967 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:47,967 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:47,968 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2018-10-04 14:23:47,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:47,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:47,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:47,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:47,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:50,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:50,950 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:23:50,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:23:50,999 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:23:51,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:51,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:51,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:51,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2018-10-04 14:23:51,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-04 14:23:51,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-04 14:23:51,272 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:51,272 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-10-04 14:23:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:51,491 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-04 14:23:51,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-04 14:23:51,491 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-10-04 14:23:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:51,491 INFO L225 Difference]: With dead ends: 111 [2018-10-04 14:23:51,492 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 14:23:51,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.6s impTime 105 [2018-10-04 14:23:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 14:23:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-04 14:23:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 14:23:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-04 14:23:51,494 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-10-04 14:23:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:51,494 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-04 14:23:51,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-04 14:23:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-04 14:23:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-04 14:23:51,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:51,495 INFO L375 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-10-04 14:23:51,496 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:51,496 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:51,496 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2018-10-04 14:23:51,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:51,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:51,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:51,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:51,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:56,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:56,761 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:23:56,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:23:56,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-10-04 14:23:56,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:56,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:57,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:57,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2018-10-04 14:23:57,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-04 14:23:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-04 14:23:57,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:57,069 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-10-04 14:23:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:57,405 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-04 14:23:57,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-04 14:23:57,405 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-10-04 14:23:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:57,406 INFO L225 Difference]: With dead ends: 112 [2018-10-04 14:23:57,406 INFO L226 Difference]: Without dead ends: 110 [2018-10-04 14:23:57,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s Time 5.0s impTime 106 [2018-10-04 14:23:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-04 14:23:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-10-04 14:23:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-04 14:23:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-04 14:23:57,408 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-10-04 14:23:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:57,409 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-04 14:23:57,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-04 14:23:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-04 14:23:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-04 14:23:57,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:57,410 INFO L375 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-10-04 14:23:57,410 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:57,410 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:57,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2018-10-04 14:23:57,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:57,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:57,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:57,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:57,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:01,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:01,209 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:24:01,216 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:01,260 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:01,260 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:01,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2018-10-04 14:24:01,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-04 14:24:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-04 14:24:01,481 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:01,481 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-10-04 14:24:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:01,775 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-04 14:24:01,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-04 14:24:01,775 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-10-04 14:24:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:01,775 INFO L225 Difference]: With dead ends: 113 [2018-10-04 14:24:01,775 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 14:24:01,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s Time 3.4s impTime 107 [2018-10-04 14:24:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 14:24:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-10-04 14:24:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-04 14:24:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-04 14:24:01,779 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-10-04 14:24:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:01,779 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-04 14:24:01,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-04 14:24:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-04 14:24:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-04 14:24:01,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:01,780 INFO L375 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-10-04 14:24:01,780 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:01,780 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:01,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2018-10-04 14:24:01,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:01,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:01,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:07,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:07,183 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:07,191 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:07,267 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2018-10-04 14:24:07,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:07,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:07,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:07,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2018-10-04 14:24:07,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-04 14:24:07,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-04 14:24:07,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:07,498 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-10-04 14:24:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:07,872 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-04 14:24:07,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-04 14:24:07,873 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-10-04 14:24:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:07,873 INFO L225 Difference]: With dead ends: 114 [2018-10-04 14:24:07,873 INFO L226 Difference]: Without dead ends: 112 [2018-10-04 14:24:07,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s Time 5.1s impTime 108 [2018-10-04 14:24:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-04 14:24:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-10-04 14:24:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-04 14:24:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-04 14:24:07,875 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-10-04 14:24:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:07,875 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-04 14:24:07,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-04 14:24:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-04 14:24:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-04 14:24:07,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:07,876 INFO L375 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-10-04 14:24:07,876 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:07,876 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2018-10-04 14:24:07,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:07,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:07,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:07,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:11,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:11,002 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:24:11,009 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:11,087 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-04 14:24:11,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:11,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:11,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:11,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2018-10-04 14:24:11,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-04 14:24:11,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-04 14:24:11,330 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:11,330 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-10-04 14:24:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:11,571 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-04 14:24:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-04 14:24:11,571 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-10-04 14:24:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:11,572 INFO L225 Difference]: With dead ends: 115 [2018-10-04 14:24:11,572 INFO L226 Difference]: Without dead ends: 113 [2018-10-04 14:24:11,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.8s impTime 109 [2018-10-04 14:24:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-04 14:24:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-10-04 14:24:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-04 14:24:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-04 14:24:11,574 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-10-04 14:24:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:11,574 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-04 14:24:11,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-04 14:24:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-04 14:24:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-04 14:24:11,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:11,575 INFO L375 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-10-04 14:24:11,575 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:11,575 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:11,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2018-10-04 14:24:11,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:11,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:11,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:17,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:17,025 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:24:17,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:17,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:17,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:17,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2018-10-04 14:24:17,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-04 14:24:17,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-04 14:24:17,315 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:17,316 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-10-04 14:24:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:17,669 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-04 14:24:17,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-04 14:24:17,670 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-10-04 14:24:17,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:17,670 INFO L225 Difference]: With dead ends: 116 [2018-10-04 14:24:17,670 INFO L226 Difference]: Without dead ends: 114 [2018-10-04 14:24:17,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s Time 5.0s impTime 110 [2018-10-04 14:24:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-04 14:24:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-10-04 14:24:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-04 14:24:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-04 14:24:17,673 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-10-04 14:24:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:17,674 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-04 14:24:17,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-04 14:24:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-04 14:24:17,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-04 14:24:17,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:17,675 INFO L375 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-10-04 14:24:17,675 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:17,675 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:17,675 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2018-10-04 14:24:17,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:17,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:17,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:17,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:17,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-04 14:24:20,513 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:24:20,518 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:24:20,518 INFO L202 PluginConnector]: Adding new model count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:24:20 BoogieIcfgContainer [2018-10-04 14:24:20,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:24:20,519 INFO L168 Benchmark]: Toolchain (without parser) took 235044.76 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -114.3 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 247.4 MB). Peak memory consumption was 133.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:24:20,521 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:20,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:20,522 INFO L168 Benchmark]: Boogie Preprocessor took 22.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:20,523 INFO L168 Benchmark]: RCFGBuilder took 226.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 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:24:20,523 INFO L168 Benchmark]: TraceAbstraction took 234747.60 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -114.3 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 226.2 MB). Peak memory consumption was 111.9 MB. Max. memory is 7.1 GB. [2018-10-04 14:24:20,526 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 226.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 234747.60 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -114.3 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 226.2 MB). Peak memory consumption was 111.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 114 with TraceHistMax 110, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 112 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 234.6s OverallTime, 111 OverallIterations, 110 TraceHistogramMax, 17.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 330 SDtfs, 0 SDslu, 4458 SDs, 0 SdLazy, 10673 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12428 GetRequests, 6323 SyntacticMatches, 0 SemanticMatches, 6105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 199.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 110 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 204.1s InterpolantComputationTime, 12647 NumberOfCodeBlocks, 12647 NumberOfCodeBlocksAsserted, 1776 NumberOfCheckSat, 12428 ConstructedInterpolants, 0 QuantifiedInterpolants, 2747462 SizeOfPredicates, 109 NumberOfNonLiveVariables, 19402 ConjunctsInSsa, 6231 ConjunctsInUnsatCore, 219 InterpolantComputations, 1 PerfectInterpolantSequences, 0/443630 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/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-24-20-536.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-24-20-536.csv Completed graceful shutdown