java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:28:31,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:28:31,762 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:28:31,774 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:28:31,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:28:31,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:28:31,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:28:31,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:28:31,781 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:28:31,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:28:31,782 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:28:31,783 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:28:31,784 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:28:31,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:28:31,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:28:31,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:28:31,788 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:28:31,789 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:28:31,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:28:31,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:28:31,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:28:31,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:28:31,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:28:31,806 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:28:31,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:28:31,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:28:31,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:28:31,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:28:31,813 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:28:31,818 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:28:31,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:28:31,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:28:31,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:28:31,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:28:31,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:28:31,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:28:31,822 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:28:31,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:28:31,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:28:31,852 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:28:31,852 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:28:31,853 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:28:31,853 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:28:31,853 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:28:31,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:28:31,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:28:31,854 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:28:31,854 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:28:31,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:28:31,855 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:28:31,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:28:31,855 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:28:31,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:28:31,855 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:28:31,856 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:28:31,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:28:31,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:28:31,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:28:31,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:28:31,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:28:31,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:28:31,857 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:28:31,857 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:28:31,858 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:28:31,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:28:31,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:28:31,858 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:28:31,858 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:28:31,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:28:31,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:28:31,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:28:31,927 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:28:31,928 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:28:31,928 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl [2018-10-04 14:28:31,929 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl' [2018-10-04 14:28:31,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:28:31,993 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:28:31,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:28:31,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:28:31,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:28:32,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (1/1) ... [2018-10-04 14:28:32,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (1/1) ... [2018-10-04 14:28:32,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:28:32,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:28:32,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:28:32,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:28:32,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (1/1) ... [2018-10-04 14:28:32,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (1/1) ... [2018-10-04 14:28:32,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (1/1) ... [2018-10-04 14:28:32,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (1/1) ... [2018-10-04 14:28:32,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (1/1) ... [2018-10-04 14:28:32,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (1/1) ... [2018-10-04 14:28:32,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (1/1) ... [2018-10-04 14:28:32,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:28:32,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:28:32,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:28:32,056 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:28:32,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (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:28:32,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:28:32,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:28:32,357 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:28:32,358 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:28:32 BoogieIcfgContainer [2018-10-04 14:28:32,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:28:32,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:28:32,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:28:32,362 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:28:32,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:28:31" (1/2) ... [2018-10-04 14:28:32,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267529b4 and model type gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:28:32, skipping insertion in model container [2018-10-04 14:28:32,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:28:32" (2/2) ... [2018-10-04 14:28:32,366 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bpl [2018-10-04 14:28:32,375 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:28:32,383 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:28:32,431 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:28:32,431 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:28:32,432 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:28:32,432 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:28:32,432 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:28:32,432 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:28:32,432 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:28:32,433 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:28:32,433 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:28:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 14:28:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 14:28:32,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:32,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 14:28:32,456 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:32,463 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:32,463 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 14:28:32,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:32,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:32,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:32,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:32,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:32,618 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:28:32,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:28:32,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:28:32,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:28:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:28:32,640 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:32,642 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-04 14:28:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:32,705 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2018-10-04 14:28:32,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:28:32,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 14:28:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:32,718 INFO L225 Difference]: With dead ends: 14 [2018-10-04 14:28:32,718 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 14:28:32,721 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:28:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 14:28:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 14:28:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 14:28:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-10-04 14:28:32,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-10-04 14:28:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:32,755 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-10-04 14:28:32,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:28:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-04 14:28:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:28:32,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:32,756 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 14:28:32,757 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:32,757 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:32,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1807905788, now seen corresponding path program 1 times [2018-10-04 14:28:32,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:32,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:32,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:32,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:32,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:32,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:32,868 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:32,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:32,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:33,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:28:33,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-04 14:28:33,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:28:33,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:28:33,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:33,022 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-10-04 14:28:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:33,100 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-10-04 14:28:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:28:33,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 14:28:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:33,104 INFO L225 Difference]: With dead ends: 20 [2018-10-04 14:28:33,104 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:28:33,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:28:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:28:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-10-04 14:28:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:28:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-10-04 14:28:33,114 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 7 [2018-10-04 14:28:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:33,114 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-10-04 14:28:33,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:28:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-10-04 14:28:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:28:33,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:33,116 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1] [2018-10-04 14:28:33,117 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:33,117 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:33,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1839610074, now seen corresponding path program 1 times [2018-10-04 14:28:33,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:33,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:33,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:33,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:33,190 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:28:33,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:33,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:33,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:33,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:28:33,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:28:33,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:28:33,326 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:33,326 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-10-04 14:28:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:33,467 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-10-04 14:28:33,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:28:33,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 14:28:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:33,468 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:28:33,468 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 14:28:33,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:28:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 14:28:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 14:28:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 14:28:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-10-04 14:28:33,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-10-04 14:28:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:33,474 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-10-04 14:28:33,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:28:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-04 14:28:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:28:33,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:33,476 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1] [2018-10-04 14:28:33,476 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:33,476 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1731932091, now seen corresponding path program 2 times [2018-10-04 14:28:33,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:33,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:33,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:33,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:33,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:33,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:33,677 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:28:33,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:28:33,711 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:28:33,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:33,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:33,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:33,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:28:33,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:28:33,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:28:33,839 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:33,839 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-10-04 14:28:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:33,889 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-10-04 14:28:33,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:28:33,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-04 14:28:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:33,893 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:28:33,893 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 14:28:33,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 4 [2018-10-04 14:28:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 14:28:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 14:28:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:28:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-10-04 14:28:33,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-10-04 14:28:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:33,900 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-10-04 14:28:33,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:28:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-10-04 14:28:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:28:33,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:33,901 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1] [2018-10-04 14:28:33,902 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:33,902 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:33,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1975221498, now seen corresponding path program 3 times [2018-10-04 14:28:33,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:33,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:33,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:33,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:33,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:34,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:34,115 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:28:34,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:28:34,139 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 14:28:34,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:34,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-04 14:28:34,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:34,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-10-04 14:28:34,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:28:34,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:28:34,198 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:34,199 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2018-10-04 14:28:34,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:34,268 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-10-04 14:28:34,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:28:34,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-10-04 14:28:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:34,273 INFO L225 Difference]: With dead ends: 34 [2018-10-04 14:28:34,273 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:28:34,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 14:28:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:28:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-10-04 14:28:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:28:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-10-04 14:28:34,280 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-10-04 14:28:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:34,280 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-10-04 14:28:34,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:28:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-10-04 14:28:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 14:28:34,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:34,282 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1] [2018-10-04 14:28:34,282 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:34,282 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:34,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2006868068, now seen corresponding path program 4 times [2018-10-04 14:28:34,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:34,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:34,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:34,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:34,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:28:34,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:34,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 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:28:34,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:28:34,449 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:28:34,450 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:34,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:28:34,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:34,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:28:34,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:28:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:28:34,592 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:34,592 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2018-10-04 14:28:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:34,957 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-10-04 14:28:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:28:34,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-10-04 14:28:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:34,958 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:28:34,958 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:28:34,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 6 [2018-10-04 14:28:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:28:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 14:28:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 14:28:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-04 14:28:34,972 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2018-10-04 14:28:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:34,972 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-04 14:28:34,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:28:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-04 14:28:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 14:28:34,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:34,976 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1] [2018-10-04 14:28:34,976 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:34,977 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:34,977 INFO L82 PathProgramCache]: Analyzing trace with hash -266768761, now seen corresponding path program 5 times [2018-10-04 14:28:34,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:34,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:34,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:34,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 35 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:28:35,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:35,131 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:28:35,157 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:28:35,172 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:28:35,173 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:35,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 35 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:28:35,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:35,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:28:35,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:28:35,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:28:35,369 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:35,369 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2018-10-04 14:28:35,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:35,499 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-10-04 14:28:35,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:28:35,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-04 14:28:35,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:35,501 INFO L225 Difference]: With dead ends: 42 [2018-10-04 14:28:35,501 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 14:28:35,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 7 [2018-10-04 14:28:35,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 14:28:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 14:28:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:28:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-04 14:28:35,507 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2018-10-04 14:28:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:35,508 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-04 14:28:35,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:28:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-10-04 14:28:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 14:28:35,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:35,509 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 7, 2, 1, 1, 1] [2018-10-04 14:28:35,509 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:35,510 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1223576644, now seen corresponding path program 6 times [2018-10-04 14:28:35,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:35,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:35,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:35,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:35,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 84 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:28:35,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:35,704 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:28:35,714 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:28:35,738 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:28:35,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:35,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 56 proven. 7 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-04 14:28:35,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:35,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2018-10-04 14:28:35,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:28:35,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:28:35,890 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:35,891 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 13 states. [2018-10-04 14:28:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:36,030 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-10-04 14:28:36,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:28:36,031 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-10-04 14:28:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:36,032 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:28:36,032 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:28:36,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-04 14:28:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:28:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-04 14:28:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 14:28:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-10-04 14:28:36,040 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 31 [2018-10-04 14:28:36,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:36,041 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-10-04 14:28:36,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:28:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-10-04 14:28:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 14:28:36,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:36,042 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1] [2018-10-04 14:28:36,043 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:36,043 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1547890150, now seen corresponding path program 7 times [2018-10-04 14:28:36,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:36,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:36,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:36,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 14:28:36,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:36,193 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:28:36,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:36,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 14:28:36,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:36,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:28:36,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:28:36,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:28:36,334 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:36,335 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2018-10-04 14:28:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:36,513 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-10-04 14:28:36,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:28:36,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-04 14:28:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:36,514 INFO L225 Difference]: With dead ends: 54 [2018-10-04 14:28:36,514 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:28:36,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:28:36,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:28:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 14:28:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 14:28:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-04 14:28:36,521 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2018-10-04 14:28:36,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:36,522 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-04 14:28:36,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:28:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-04 14:28:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 14:28:36,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:36,524 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1] [2018-10-04 14:28:36,524 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:36,524 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1837705083, now seen corresponding path program 8 times [2018-10-04 14:28:36,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:36,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:36,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:36,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 80 proven. 135 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 14:28:36,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:36,713 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:28:36,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:28:36,744 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:28:36,745 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:36,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 80 proven. 135 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 14:28:36,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:36,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:28:36,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:28:36,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:28:36,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:36,873 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-10-04 14:28:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:36,941 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-10-04 14:28:36,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:28:36,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-10-04 14:28:36,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:36,942 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:28:36,942 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 14:28:36,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 10 [2018-10-04 14:28:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 14:28:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 14:28:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 14:28:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-10-04 14:28:36,950 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 40 [2018-10-04 14:28:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:36,950 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-10-04 14:28:36,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:28:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-10-04 14:28:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 14:28:36,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:36,952 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 10, 3, 1, 1, 1] [2018-10-04 14:28:36,952 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:36,952 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:36,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1464858170, now seen corresponding path program 9 times [2018-10-04 14:28:36,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:36,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:36,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:36,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:36,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 88 proven. 165 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 14:28:37,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:37,135 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:28:37,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:28:37,167 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:28:37,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:37,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 110 proven. 15 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-10-04 14:28:37,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:37,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2018-10-04 14:28:37,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:28:37,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:28:37,272 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:37,272 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 17 states. [2018-10-04 14:28:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:37,413 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-10-04 14:28:37,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:28:37,413 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-10-04 14:28:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:37,415 INFO L225 Difference]: With dead ends: 64 [2018-10-04 14:28:37,415 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:28:37,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 14:28:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:28:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-04 14:28:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 14:28:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-10-04 14:28:37,424 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 43 [2018-10-04 14:28:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:37,425 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-10-04 14:28:37,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:28:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-10-04 14:28:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 14:28:37,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:37,426 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 11, 4, 1, 1, 1] [2018-10-04 14:28:37,426 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:37,426 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash 469061468, now seen corresponding path program 10 times [2018-10-04 14:28:37,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:37,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:37,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 132 proven. 198 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 14:28:37,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:37,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:37,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:28:37,629 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:28:37,630 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:37,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 132 proven. 198 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 14:28:37,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:37,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:28:37,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:28:37,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:28:37,883 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:37,883 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 14 states. [2018-10-04 14:28:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:37,956 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-10-04 14:28:37,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:28:37,958 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-10-04 14:28:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:37,959 INFO L225 Difference]: With dead ends: 69 [2018-10-04 14:28:37,959 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:28:37,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 12 [2018-10-04 14:28:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:28:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 14:28:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 14:28:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-10-04 14:28:37,967 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 49 [2018-10-04 14:28:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:37,967 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-10-04 14:28:37,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:28:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-10-04 14:28:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 14:28:37,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:37,969 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1] [2018-10-04 14:28:37,969 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:37,969 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash -990261945, now seen corresponding path program 11 times [2018-10-04 14:28:37,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:37,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:37,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 14:28:38,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:38,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 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:28:38,149 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:28:38,173 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-10-04 14:28:38,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:38,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 14:28:38,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:38,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:28:38,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:28:38,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:28:38,348 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:38,348 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 15 states. [2018-10-04 14:28:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:38,416 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-10-04 14:28:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:28:38,416 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-10-04 14:28:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:38,417 INFO L225 Difference]: With dead ends: 72 [2018-10-04 14:28:38,418 INFO L226 Difference]: Without dead ends: 56 [2018-10-04 14:28:38,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 13 [2018-10-04 14:28:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-04 14:28:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-04 14:28:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 14:28:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-10-04 14:28:38,426 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 52 [2018-10-04 14:28:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:38,426 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-04 14:28:38,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:28:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-10-04 14:28:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-04 14:28:38,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:38,428 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 13, 4, 1, 1, 1] [2018-10-04 14:28:38,428 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:38,428 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:38,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2035088516, now seen corresponding path program 12 times [2018-10-04 14:28:38,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:38,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:38,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:38,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:38,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 154 proven. 273 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 14:28:38,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:38,670 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:38,680 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:28:38,848 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-10-04 14:28:38,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:38,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 182 proven. 26 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-10-04 14:28:39,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:39,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 21 [2018-10-04 14:28:39,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:28:39,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:28:39,255 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:39,255 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 21 states. [2018-10-04 14:28:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:39,378 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-10-04 14:28:39,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:28:39,379 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-10-04 14:28:39,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:39,380 INFO L225 Difference]: With dead ends: 79 [2018-10-04 14:28:39,380 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:28:39,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 19 [2018-10-04 14:28:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:28:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-04 14:28:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 14:28:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-10-04 14:28:39,389 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 55 [2018-10-04 14:28:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:39,390 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-10-04 14:28:39,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:28:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-10-04 14:28:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 14:28:39,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:39,391 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 14, 5, 1, 1, 1] [2018-10-04 14:28:39,391 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:39,391 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1900338010, now seen corresponding path program 13 times [2018-10-04 14:28:39,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:39,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:39,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:39,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:39,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 210 proven. 315 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 14:28:39,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:39,820 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:28:39,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:39,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 210 proven. 315 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 14:28:40,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:40,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:28:40,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:28:40,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:28:40,405 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:40,405 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 17 states. [2018-10-04 14:28:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:40,661 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-10-04 14:28:40,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:28:40,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-10-04 14:28:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:40,662 INFO L225 Difference]: With dead ends: 84 [2018-10-04 14:28:40,662 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 14:28:40,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.2s impTime 15 [2018-10-04 14:28:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 14:28:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-04 14:28:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 14:28:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-10-04 14:28:40,680 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 61 [2018-10-04 14:28:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:40,680 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-10-04 14:28:40,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:28:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-10-04 14:28:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 14:28:40,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:40,685 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 15, 5, 1, 1, 1] [2018-10-04 14:28:40,685 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:40,686 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:40,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1598238523, now seen corresponding path program 14 times [2018-10-04 14:28:40,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:40,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:40,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:40,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:40,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 224 proven. 360 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 14:28:41,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:41,015 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:28:41,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:28:41,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:28:41,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:41,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 224 proven. 360 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 14:28:41,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:41,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:28:41,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:28:41,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:28:41,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:41,195 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 18 states. [2018-10-04 14:28:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:41,415 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-10-04 14:28:41,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:28:41,415 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-10-04 14:28:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:41,416 INFO L225 Difference]: With dead ends: 87 [2018-10-04 14:28:41,416 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 14:28:41,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-04 14:28:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 14:28:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 14:28:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 14:28:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-10-04 14:28:41,425 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 64 [2018-10-04 14:28:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:41,425 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-10-04 14:28:41,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:28:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-10-04 14:28:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 14:28:41,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:41,426 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 16, 5, 1, 1, 1] [2018-10-04 14:28:41,427 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:41,427 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1720361094, now seen corresponding path program 15 times [2018-10-04 14:28:41,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:41,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:41,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 238 proven. 408 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 14:28:41,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:41,801 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:41,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:28:41,822 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:28:41,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:41,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 272 proven. 40 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-10-04 14:28:42,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:42,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 25 [2018-10-04 14:28:42,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 14:28:42,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 14:28:42,017 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:42,017 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 25 states. [2018-10-04 14:28:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:42,364 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2018-10-04 14:28:42,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:28:42,365 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-10-04 14:28:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:42,366 INFO L225 Difference]: With dead ends: 94 [2018-10-04 14:28:42,366 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 14:28:42,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 23 [2018-10-04 14:28:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 14:28:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-04 14:28:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 14:28:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-10-04 14:28:42,373 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 67 [2018-10-04 14:28:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:42,373 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-10-04 14:28:42,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 14:28:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-10-04 14:28:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 14:28:42,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:42,375 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 17, 6, 1, 1, 1] [2018-10-04 14:28:42,375 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:42,375 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:42,376 INFO L82 PathProgramCache]: Analyzing trace with hash -867234020, now seen corresponding path program 16 times [2018-10-04 14:28:42,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:42,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:42,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:42,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 459 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 14:28:42,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:42,612 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:28:42,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:28:42,645 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:28:42,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:42,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 459 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 14:28:42,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:42,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:28:42,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:28:42,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:28:42,826 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:42,826 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 20 states. [2018-10-04 14:28:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:42,902 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-10-04 14:28:42,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:28:42,903 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2018-10-04 14:28:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:42,904 INFO L225 Difference]: With dead ends: 99 [2018-10-04 14:28:42,904 INFO L226 Difference]: Without dead ends: 77 [2018-10-04 14:28:42,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 18 [2018-10-04 14:28:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-04 14:28:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-04 14:28:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 14:28:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-10-04 14:28:42,910 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 73 [2018-10-04 14:28:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:42,911 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-10-04 14:28:42,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:28:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-10-04 14:28:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 14:28:42,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:42,912 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 18, 6, 1, 1, 1] [2018-10-04 14:28:42,912 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:42,913 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:42,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1757201401, now seen corresponding path program 17 times [2018-10-04 14:28:42,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:42,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:42,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:42,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:42,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 323 proven. 513 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 14:28:43,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:43,207 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:28:43,214 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:28:43,277 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 14:28:43,277 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:43,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 323 proven. 513 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 14:28:43,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:43,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 14:28:43,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:28:43,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:28:43,551 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:43,551 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 21 states. [2018-10-04 14:28:43,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:43,638 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-10-04 14:28:43,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:28:43,639 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-10-04 14:28:43,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:43,640 INFO L225 Difference]: With dead ends: 102 [2018-10-04 14:28:43,640 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 14:28:43,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 19 [2018-10-04 14:28:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 14:28:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 14:28:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 14:28:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-10-04 14:28:43,644 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 76 [2018-10-04 14:28:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:43,644 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-10-04 14:28:43,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:28:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-10-04 14:28:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 14:28:43,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:43,646 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 19, 6, 1, 1, 1] [2018-10-04 14:28:43,646 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:43,646 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:43,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1942330564, now seen corresponding path program 18 times [2018-10-04 14:28:43,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:43,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:43,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:43,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:43,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 14:28:43,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:43,903 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:28:43,911 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:28:43,941 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-10-04 14:28:43,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:43,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 380 proven. 57 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-10-04 14:28:44,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:44,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 29 [2018-10-04 14:28:44,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:28:44,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:28:44,090 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:44,090 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 29 states. [2018-10-04 14:28:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:44,246 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2018-10-04 14:28:44,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:28:44,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-10-04 14:28:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:44,248 INFO L225 Difference]: With dead ends: 109 [2018-10-04 14:28:44,248 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 14:28:44,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 27 [2018-10-04 14:28:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 14:28:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-10-04 14:28:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-04 14:28:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-10-04 14:28:44,256 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 79 [2018-10-04 14:28:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:44,256 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-10-04 14:28:44,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:28:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-10-04 14:28:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 14:28:44,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:44,257 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 20, 7, 1, 1, 1] [2018-10-04 14:28:44,258 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:44,258 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:44,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1524001638, now seen corresponding path program 19 times [2018-10-04 14:28:44,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:44,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:44,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:44,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:44,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 420 proven. 630 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-04 14:28:44,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:44,646 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:28:44,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:44,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 420 proven. 630 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-04 14:28:44,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:44,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:28:44,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:28:44,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:28:44,826 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:44,826 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 23 states. [2018-10-04 14:28:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:44,948 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-10-04 14:28:44,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:28:44,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-10-04 14:28:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:44,950 INFO L225 Difference]: With dead ends: 114 [2018-10-04 14:28:44,950 INFO L226 Difference]: Without dead ends: 89 [2018-10-04 14:28:44,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 21 [2018-10-04 14:28:44,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-04 14:28:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-04 14:28:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 14:28:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-10-04 14:28:44,957 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 85 [2018-10-04 14:28:44,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:44,957 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-10-04 14:28:44,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:28:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-10-04 14:28:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-04 14:28:44,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:44,958 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 21, 7, 1, 1, 1] [2018-10-04 14:28:44,959 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:44,959 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:44,959 INFO L82 PathProgramCache]: Analyzing trace with hash 427997445, now seen corresponding path program 20 times [2018-10-04 14:28:44,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:44,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:44,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:44,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:44,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 440 proven. 693 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-04 14:28:45,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:45,244 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:45,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:28:45,273 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:28:45,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:45,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 440 proven. 693 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-04 14:28:45,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:45,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:28:45,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:28:45,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:28:45,609 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:45,609 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 24 states. [2018-10-04 14:28:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:45,743 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2018-10-04 14:28:45,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:28:45,745 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2018-10-04 14:28:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:45,746 INFO L225 Difference]: With dead ends: 117 [2018-10-04 14:28:45,746 INFO L226 Difference]: Without dead ends: 92 [2018-10-04 14:28:45,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 22 [2018-10-04 14:28:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-04 14:28:45,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-10-04 14:28:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-04 14:28:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-10-04 14:28:45,752 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 88 [2018-10-04 14:28:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:45,752 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-10-04 14:28:45,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:28:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-10-04 14:28:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-04 14:28:45,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:45,753 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 22, 7, 1, 1, 1] [2018-10-04 14:28:45,753 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:45,753 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1424508742, now seen corresponding path program 21 times [2018-10-04 14:28:45,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:45,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:45,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:45,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:45,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 759 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-04 14:28:46,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:46,161 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:46,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:28:46,186 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 14:28:46,186 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:46,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 506 proven. 77 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-10-04 14:28:46,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:46,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 33 [2018-10-04 14:28:46,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:28:46,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:28:46,375 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:46,375 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 33 states. [2018-10-04 14:28:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:46,573 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2018-10-04 14:28:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:28:46,574 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 91 [2018-10-04 14:28:46,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:46,575 INFO L225 Difference]: With dead ends: 124 [2018-10-04 14:28:46,575 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 14:28:46,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 31 [2018-10-04 14:28:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 14:28:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-10-04 14:28:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 14:28:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-10-04 14:28:46,581 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 91 [2018-10-04 14:28:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:46,581 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-10-04 14:28:46,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:28:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-10-04 14:28:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 14:28:46,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:46,582 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 23, 8, 1, 1, 1] [2018-10-04 14:28:46,582 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:46,582 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:46,582 INFO L82 PathProgramCache]: Analyzing trace with hash 201514716, now seen corresponding path program 22 times [2018-10-04 14:28:46,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:46,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:46,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:46,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:46,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 552 proven. 828 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-04 14:28:46,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:46,967 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:28:46,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:28:47,002 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:28:47,003 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:47,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 552 proven. 828 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-04 14:28:47,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:47,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:28:47,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:28:47,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:28:47,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:47,179 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 26 states. [2018-10-04 14:28:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:47,279 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2018-10-04 14:28:47,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:28:47,279 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2018-10-04 14:28:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:47,281 INFO L225 Difference]: With dead ends: 129 [2018-10-04 14:28:47,281 INFO L226 Difference]: Without dead ends: 101 [2018-10-04 14:28:47,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 24 [2018-10-04 14:28:47,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-04 14:28:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-04 14:28:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-04 14:28:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-10-04 14:28:47,288 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 97 [2018-10-04 14:28:47,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:47,288 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-10-04 14:28:47,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:28:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-10-04 14:28:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 14:28:47,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:47,289 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 24, 8, 1, 1, 1] [2018-10-04 14:28:47,289 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:47,289 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash -527844665, now seen corresponding path program 23 times [2018-10-04 14:28:47,290 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:47,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:47,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:47,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 575 proven. 900 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-04 14:28:48,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:48,283 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:28:48,291 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:28:48,338 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-10-04 14:28:48,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:48,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 575 proven. 900 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-04 14:28:48,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:48,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 14:28:48,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:28:48,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:28:48,518 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:48,518 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 27 states. [2018-10-04 14:28:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:48,647 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-10-04 14:28:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:28:48,647 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2018-10-04 14:28:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:48,648 INFO L225 Difference]: With dead ends: 132 [2018-10-04 14:28:48,648 INFO L226 Difference]: Without dead ends: 104 [2018-10-04 14:28:48,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 25 [2018-10-04 14:28:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-04 14:28:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-04 14:28:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-04 14:28:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-10-04 14:28:48,656 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 100 [2018-10-04 14:28:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:48,656 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-10-04 14:28:48,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:28:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-10-04 14:28:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-04 14:28:48,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:48,657 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 25, 8, 1, 1, 1] [2018-10-04 14:28:48,657 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:48,657 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash -633613572, now seen corresponding path program 24 times [2018-10-04 14:28:48,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:48,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:48,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:48,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:48,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 598 proven. 975 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-04 14:28:49,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:49,127 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:28:49,135 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:28:49,184 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-10-04 14:28:49,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:49,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 650 proven. 100 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-10-04 14:28:49,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:49,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11] total 37 [2018-10-04 14:28:49,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 14:28:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 14:28:49,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:49,371 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 37 states. [2018-10-04 14:28:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:49,550 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-10-04 14:28:49,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:28:49,550 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 103 [2018-10-04 14:28:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:49,552 INFO L225 Difference]: With dead ends: 139 [2018-10-04 14:28:49,552 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 14:28:49,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 35 [2018-10-04 14:28:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 14:28:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-10-04 14:28:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-04 14:28:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2018-10-04 14:28:49,559 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 103 [2018-10-04 14:28:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:49,559 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2018-10-04 14:28:49,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 14:28:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2018-10-04 14:28:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-04 14:28:49,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:49,560 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 26, 9, 1, 1, 1] [2018-10-04 14:28:49,560 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:49,560 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash 223821274, now seen corresponding path program 25 times [2018-10-04 14:28:49,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:49,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:49,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 702 proven. 1053 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-04 14:28:50,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:50,873 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:28:50,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:50,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 702 proven. 1053 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-04 14:28:51,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:51,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 14:28:51,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:28:51,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:28:51,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:51,241 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 29 states. [2018-10-04 14:28:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:51,374 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2018-10-04 14:28:51,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:28:51,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-10-04 14:28:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:51,376 INFO L225 Difference]: With dead ends: 144 [2018-10-04 14:28:51,376 INFO L226 Difference]: Without dead ends: 113 [2018-10-04 14:28:51,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.9s impTime 27 [2018-10-04 14:28:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-04 14:28:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-10-04 14:28:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-04 14:28:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-10-04 14:28:51,383 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 109 [2018-10-04 14:28:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:51,384 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-10-04 14:28:51,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:28:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-10-04 14:28:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-04 14:28:51,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:51,385 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 27, 9, 1, 1, 1] [2018-10-04 14:28:51,385 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:51,385 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:51,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1370788165, now seen corresponding path program 26 times [2018-10-04 14:28:51,385 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:51,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:51,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:51,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:51,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 728 proven. 1134 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-04 14:28:52,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:52,598 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:52,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:28:52,631 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:28:52,632 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:52,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 728 proven. 1134 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-04 14:28:52,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:52,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:28:52,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:28:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:28:52,828 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:52,828 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 30 states. [2018-10-04 14:28:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:53,037 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2018-10-04 14:28:53,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:28:53,037 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2018-10-04 14:28:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:53,038 INFO L225 Difference]: With dead ends: 147 [2018-10-04 14:28:53,038 INFO L226 Difference]: Without dead ends: 116 [2018-10-04 14:28:53,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 28 [2018-10-04 14:28:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-04 14:28:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-10-04 14:28:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-04 14:28:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-10-04 14:28:53,043 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 112 [2018-10-04 14:28:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:53,044 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-10-04 14:28:53,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:28:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-10-04 14:28:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-04 14:28:53,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:53,044 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 28, 9, 1, 1, 1] [2018-10-04 14:28:53,045 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:53,045 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash -98369030, now seen corresponding path program 27 times [2018-10-04 14:28:53,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:53,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:53,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:53,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:53,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 754 proven. 1218 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-04 14:28:53,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:53,637 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:28:53,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:28:53,666 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 14:28:53,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:53,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 812 proven. 126 refuted. 0 times theorem prover too weak. 1134 trivial. 0 not checked. [2018-10-04 14:28:53,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:53,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12] total 41 [2018-10-04 14:28:53,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:28:53,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:28:53,806 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:53,806 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 41 states. [2018-10-04 14:28:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:54,015 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-10-04 14:28:54,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:28:54,015 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 115 [2018-10-04 14:28:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:54,016 INFO L225 Difference]: With dead ends: 154 [2018-10-04 14:28:54,016 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 14:28:54,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 39 [2018-10-04 14:28:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 14:28:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-10-04 14:28:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-04 14:28:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-10-04 14:28:54,024 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 115 [2018-10-04 14:28:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:54,025 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-10-04 14:28:54,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:28:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-10-04 14:28:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-04 14:28:54,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:54,026 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 29, 10, 1, 1, 1] [2018-10-04 14:28:54,026 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:54,026 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:54,026 INFO L82 PathProgramCache]: Analyzing trace with hash -291193188, now seen corresponding path program 28 times [2018-10-04 14:28:54,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:54,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:54,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:54,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:54,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 870 proven. 1305 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 14:28:54,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:54,452 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:28:54,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:28:54,487 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:28:54,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:54,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 870 proven. 1305 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 14:28:54,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:54,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 14:28:54,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:28:54,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:28:54,814 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:54,814 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 32 states. [2018-10-04 14:28:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:54,942 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2018-10-04 14:28:54,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:28:54,943 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 121 [2018-10-04 14:28:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:54,944 INFO L225 Difference]: With dead ends: 159 [2018-10-04 14:28:54,944 INFO L226 Difference]: Without dead ends: 125 [2018-10-04 14:28:54,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 30 [2018-10-04 14:28:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-04 14:28:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-10-04 14:28:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-04 14:28:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-10-04 14:28:54,952 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 121 [2018-10-04 14:28:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:54,952 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-10-04 14:28:54,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:28:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-10-04 14:28:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-04 14:28:54,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:54,953 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 30, 10, 1, 1, 1] [2018-10-04 14:28:54,954 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:54,954 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:54,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1151252089, now seen corresponding path program 29 times [2018-10-04 14:28:54,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:54,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:54,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:54,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:54,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 899 proven. 1395 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 14:28:55,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:55,538 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:55,548 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:28:55,616 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2018-10-04 14:28:55,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:55,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 899 proven. 1395 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 14:28:55,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:55,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 14:28:55,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:28:55,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:28:55,859 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:55,860 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 33 states. [2018-10-04 14:28:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:56,093 INFO L93 Difference]: Finished difference Result 162 states and 183 transitions. [2018-10-04 14:28:56,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:28:56,093 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-10-04 14:28:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:56,094 INFO L225 Difference]: With dead ends: 162 [2018-10-04 14:28:56,094 INFO L226 Difference]: Without dead ends: 128 [2018-10-04 14:28:56,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 31 [2018-10-04 14:28:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-04 14:28:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-10-04 14:28:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-04 14:28:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-10-04 14:28:56,100 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 124 [2018-10-04 14:28:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:56,100 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-10-04 14:28:56,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:28:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-10-04 14:28:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-04 14:28:56,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:56,101 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 31, 10, 1, 1, 1] [2018-10-04 14:28:56,101 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:56,101 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash 608916156, now seen corresponding path program 30 times [2018-10-04 14:28:56,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:56,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:56,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:56,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 928 proven. 1488 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 14:28:56,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:56,778 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:28:56,785 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:28:56,835 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2018-10-04 14:28:56,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:56,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 992 proven. 155 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-10-04 14:28:57,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:57,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13] total 45 [2018-10-04 14:28:57,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:28:57,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:28:57,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:57,057 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 45 states. [2018-10-04 14:28:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:57,344 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2018-10-04 14:28:57,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:28:57,345 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 127 [2018-10-04 14:28:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:57,346 INFO L225 Difference]: With dead ends: 169 [2018-10-04 14:28:57,346 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 14:28:57,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 43 [2018-10-04 14:28:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 14:28:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-10-04 14:28:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-04 14:28:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-10-04 14:28:57,353 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 127 [2018-10-04 14:28:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:57,354 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-10-04 14:28:57,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:28:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-10-04 14:28:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-04 14:28:57,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:57,355 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 32, 11, 1, 1, 1] [2018-10-04 14:28:57,355 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:57,355 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash 918148890, now seen corresponding path program 31 times [2018-10-04 14:28:57,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:57,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:57,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:57,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:57,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1056 proven. 1584 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-04 14:28:57,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:57,749 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:28:57,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:57,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1056 proven. 1584 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-04 14:28:57,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:57,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 14:28:57,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 14:28:57,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 14:28:57,993 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:57,993 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 35 states. [2018-10-04 14:28:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:58,154 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2018-10-04 14:28:58,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:28:58,155 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-10-04 14:28:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:58,156 INFO L225 Difference]: With dead ends: 174 [2018-10-04 14:28:58,156 INFO L226 Difference]: Without dead ends: 137 [2018-10-04 14:28:58,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 33 [2018-10-04 14:28:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-04 14:28:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-10-04 14:28:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-04 14:28:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-10-04 14:28:58,163 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 133 [2018-10-04 14:28:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:58,164 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-10-04 14:28:58,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 14:28:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-10-04 14:28:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-04 14:28:58,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:58,165 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 33, 11, 1, 1, 1] [2018-10-04 14:28:58,165 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:58,165 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:58,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1564367237, now seen corresponding path program 32 times [2018-10-04 14:28:58,165 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:58,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:58,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:58,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:58,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 1088 proven. 1683 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-04 14:28:58,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:58,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 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:28:58,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:28:58,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:28:58,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:58,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 1088 proven. 1683 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-04 14:28:59,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:59,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 14:28:59,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:28:59,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:28:59,063 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:59,063 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 36 states. [2018-10-04 14:28:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:59,441 INFO L93 Difference]: Finished difference Result 177 states and 200 transitions. [2018-10-04 14:28:59,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:28:59,441 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 136 [2018-10-04 14:28:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:59,442 INFO L225 Difference]: With dead ends: 177 [2018-10-04 14:28:59,443 INFO L226 Difference]: Without dead ends: 140 [2018-10-04 14:28:59,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 34 [2018-10-04 14:28:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-04 14:28:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-10-04 14:28:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-04 14:28:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-10-04 14:28:59,450 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 136 [2018-10-04 14:28:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:59,450 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-10-04 14:28:59,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:28:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-10-04 14:28:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-04 14:28:59,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:59,452 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 34, 11, 1, 1, 1] [2018-10-04 14:28:59,452 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:59,452 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:59,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1283245254, now seen corresponding path program 33 times [2018-10-04 14:28:59,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:59,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:59,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1120 proven. 1785 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-04 14:29:01,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:01,824 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:29:01,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:29:01,863 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 14:29:01,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:01,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1190 proven. 187 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-04 14:29:02,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:02,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14] total 49 [2018-10-04 14:29:02,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 14:29:02,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 14:29:02,102 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:02,102 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 49 states. [2018-10-04 14:29:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:02,368 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2018-10-04 14:29:02,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 14:29:02,368 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 139 [2018-10-04 14:29:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:02,370 INFO L225 Difference]: With dead ends: 184 [2018-10-04 14:29:02,370 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 14:29:02,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 2.0s impTime 47 [2018-10-04 14:29:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 14:29:02,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-10-04 14:29:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-04 14:29:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-10-04 14:29:02,378 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 139 [2018-10-04 14:29:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:02,378 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-10-04 14:29:02,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 14:29:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-10-04 14:29:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-04 14:29:02,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:02,379 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 35, 12, 1, 1, 1] [2018-10-04 14:29:02,379 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:02,379 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:02,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1757982300, now seen corresponding path program 34 times [2018-10-04 14:29:02,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:02,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:02,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:02,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:02,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 1260 proven. 1890 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-10-04 14:29:03,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:03,123 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:03,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:29:03,165 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:29:03,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:03,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 1260 proven. 1890 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-10-04 14:29:03,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:03,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 14:29:03,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 14:29:03,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 14:29:03,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:03,373 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 38 states. [2018-10-04 14:29:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:03,682 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2018-10-04 14:29:03,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:29:03,682 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 145 [2018-10-04 14:29:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:03,683 INFO L225 Difference]: With dead ends: 189 [2018-10-04 14:29:03,683 INFO L226 Difference]: Without dead ends: 149 [2018-10-04 14:29:03,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 36 [2018-10-04 14:29:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-04 14:29:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-10-04 14:29:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-04 14:29:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2018-10-04 14:29:03,692 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 145 [2018-10-04 14:29:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:03,692 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2018-10-04 14:29:03,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 14:29:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2018-10-04 14:29:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-04 14:29:03,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:03,693 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 36, 12, 1, 1, 1] [2018-10-04 14:29:03,693 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:03,694 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash 593356871, now seen corresponding path program 35 times [2018-10-04 14:29:03,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:03,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:03,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:03,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:03,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 1295 proven. 1998 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-10-04 14:29:04,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:04,607 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:29:04,615 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:29:04,682 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-04 14:29:04,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:04,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 1295 proven. 1998 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-10-04 14:29:04,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:04,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 14:29:04,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 14:29:04,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 14:29:04,914 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:04,914 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand 39 states. [2018-10-04 14:29:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:05,180 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-10-04 14:29:05,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:29:05,181 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2018-10-04 14:29:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:05,182 INFO L225 Difference]: With dead ends: 192 [2018-10-04 14:29:05,182 INFO L226 Difference]: Without dead ends: 152 [2018-10-04 14:29:05,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 37 [2018-10-04 14:29:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-04 14:29:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-10-04 14:29:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-04 14:29:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-10-04 14:29:05,189 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 148 [2018-10-04 14:29:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:05,189 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-10-04 14:29:05,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 14:29:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2018-10-04 14:29:05,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-04 14:29:05,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:05,190 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 37, 12, 1, 1, 1] [2018-10-04 14:29:05,191 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:05,191 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:05,191 INFO L82 PathProgramCache]: Analyzing trace with hash -16981380, now seen corresponding path program 36 times [2018-10-04 14:29:05,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:05,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:05,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1330 proven. 2109 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-10-04 14:29:06,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:06,020 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:29:06,028 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:29:06,087 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-10-04 14:29:06,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:06,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1406 proven. 222 refuted. 0 times theorem prover too weak. 1998 trivial. 0 not checked. [2018-10-04 14:29:06,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:06,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 53 [2018-10-04 14:29:06,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:29:06,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:29:06,591 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:06,591 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 53 states. [2018-10-04 14:29:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:06,897 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2018-10-04 14:29:06,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 14:29:06,898 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 151 [2018-10-04 14:29:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:06,900 INFO L225 Difference]: With dead ends: 199 [2018-10-04 14:29:06,900 INFO L226 Difference]: Without dead ends: 159 [2018-10-04 14:29:06,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 51 [2018-10-04 14:29:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-04 14:29:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-10-04 14:29:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-04 14:29:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-10-04 14:29:06,908 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 151 [2018-10-04 14:29:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:06,909 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-10-04 14:29:06,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:29:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-10-04 14:29:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-04 14:29:06,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:06,910 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 38, 13, 1, 1, 1] [2018-10-04 14:29:06,910 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:06,911 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash 758997082, now seen corresponding path program 37 times [2018-10-04 14:29:06,911 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:06,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:06,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:06,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:06,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 1482 proven. 2223 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-04 14:29:08,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:08,048 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:29:08,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:29:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:08,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 1482 proven. 2223 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-04 14:29:08,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:08,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 14:29:08,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:29:08,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:29:08,343 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:08,343 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 41 states. [2018-10-04 14:29:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:08,610 INFO L93 Difference]: Finished difference Result 204 states and 231 transitions. [2018-10-04 14:29:08,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:29:08,611 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 157 [2018-10-04 14:29:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:08,612 INFO L225 Difference]: With dead ends: 204 [2018-10-04 14:29:08,612 INFO L226 Difference]: Without dead ends: 161 [2018-10-04 14:29:08,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 39 [2018-10-04 14:29:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-04 14:29:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-10-04 14:29:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 14:29:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2018-10-04 14:29:08,620 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 157 [2018-10-04 14:29:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:08,620 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2018-10-04 14:29:08,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:29:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2018-10-04 14:29:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-04 14:29:08,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:08,621 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 39, 13, 1, 1, 1] [2018-10-04 14:29:08,622 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:08,622 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:08,622 INFO L82 PathProgramCache]: Analyzing trace with hash -821292603, now seen corresponding path program 38 times [2018-10-04 14:29:08,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:08,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:08,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:29:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 1520 proven. 2340 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-04 14:29:10,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:10,525 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:29:10,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:29:10,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:29:10,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:10,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 1520 proven. 2340 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-04 14:29:10,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:10,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 14:29:10,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 14:29:10,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 14:29:10,898 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:10,899 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand 42 states. [2018-10-04 14:29:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:11,038 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2018-10-04 14:29:11,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:29:11,038 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-10-04 14:29:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:11,040 INFO L225 Difference]: With dead ends: 207 [2018-10-04 14:29:11,040 INFO L226 Difference]: Without dead ends: 164 [2018-10-04 14:29:11,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.4s impTime 40 [2018-10-04 14:29:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-04 14:29:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-10-04 14:29:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-04 14:29:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2018-10-04 14:29:11,048 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 160 [2018-10-04 14:29:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:11,049 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2018-10-04 14:29:11,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 14:29:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2018-10-04 14:29:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-04 14:29:11,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:11,050 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 40, 13, 1, 1, 1] [2018-10-04 14:29:11,050 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:11,051 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:11,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2094766982, now seen corresponding path program 39 times [2018-10-04 14:29:11,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:11,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:11,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:11,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:11,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1558 proven. 2460 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-04 14:29:12,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:12,215 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:29:12,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:29:12,258 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 14:29:12,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:12,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1640 proven. 260 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2018-10-04 14:29:12,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:12,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 16] total 57 [2018-10-04 14:29:12,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 14:29:12,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 14:29:12,890 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:12,890 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand 57 states. [2018-10-04 14:29:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:13,341 INFO L93 Difference]: Finished difference Result 214 states and 244 transitions. [2018-10-04 14:29:13,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 14:29:13,341 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 163 [2018-10-04 14:29:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:13,343 INFO L225 Difference]: With dead ends: 214 [2018-10-04 14:29:13,343 INFO L226 Difference]: Without dead ends: 171 [2018-10-04 14:29:13,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.3s impTime 55 [2018-10-04 14:29:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-04 14:29:13,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-10-04 14:29:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-04 14:29:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2018-10-04 14:29:13,350 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 163 [2018-10-04 14:29:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:13,350 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2018-10-04 14:29:13,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 14:29:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2018-10-04 14:29:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-04 14:29:13,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:13,351 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 41, 14, 1, 1, 1] [2018-10-04 14:29:13,351 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:13,351 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:13,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1878872548, now seen corresponding path program 40 times [2018-10-04 14:29:13,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:13,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:13,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:13,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 1722 proven. 2583 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-04 14:29:14,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:14,393 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:14,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:29:14,440 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:29:14,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:14,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 1722 proven. 2583 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-04 14:29:15,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:15,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 14:29:15,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:29:15,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:29:15,847 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:15,847 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand 44 states. [2018-10-04 14:29:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:16,032 INFO L93 Difference]: Finished difference Result 219 states and 248 transitions. [2018-10-04 14:29:16,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:29:16,032 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 169 [2018-10-04 14:29:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:16,034 INFO L225 Difference]: With dead ends: 219 [2018-10-04 14:29:16,034 INFO L226 Difference]: Without dead ends: 173 [2018-10-04 14:29:16,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 0.8s impTime 42 [2018-10-04 14:29:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-04 14:29:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-10-04 14:29:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-04 14:29:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2018-10-04 14:29:16,041 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 169 [2018-10-04 14:29:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:16,041 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2018-10-04 14:29:16,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:29:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2018-10-04 14:29:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-04 14:29:16,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:16,042 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 42, 14, 1, 1, 1] [2018-10-04 14:29:16,042 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:16,043 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash 890476295, now seen corresponding path program 41 times [2018-10-04 14:29:16,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:16,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:16,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:16,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:16,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 1763 proven. 2709 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-04 14:29:17,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:17,362 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:29:17,370 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:29:17,955 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2018-10-04 14:29:17,956 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:17,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 1763 proven. 2709 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-04 14:29:18,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:18,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 14:29:18,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:29:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:29:18,221 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:18,222 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand 45 states. [2018-10-04 14:29:18,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:18,413 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2018-10-04 14:29:18,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:29:18,413 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2018-10-04 14:29:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:18,415 INFO L225 Difference]: With dead ends: 222 [2018-10-04 14:29:18,415 INFO L226 Difference]: Without dead ends: 176 [2018-10-04 14:29:18,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime 43 [2018-10-04 14:29:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-04 14:29:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-10-04 14:29:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-04 14:29:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2018-10-04 14:29:18,421 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 172 [2018-10-04 14:29:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:18,422 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2018-10-04 14:29:18,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:29:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2018-10-04 14:29:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-04 14:29:18,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:18,423 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 43, 14, 1, 1, 1] [2018-10-04 14:29:18,423 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:18,423 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:18,423 INFO L82 PathProgramCache]: Analyzing trace with hash 535069244, now seen corresponding path program 42 times [2018-10-04 14:29:18,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:18,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:18,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:18,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:18,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 1804 proven. 2838 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-04 14:29:19,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:19,294 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:29:19,301 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:29:19,373 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2018-10-04 14:29:19,373 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:19,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 1892 proven. 301 refuted. 0 times theorem prover too weak. 2709 trivial. 0 not checked. [2018-10-04 14:29:19,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:19,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 17] total 61 [2018-10-04 14:29:19,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 14:29:19,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 14:29:19,662 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:19,662 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand 61 states. [2018-10-04 14:29:20,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:20,000 INFO L93 Difference]: Finished difference Result 229 states and 261 transitions. [2018-10-04 14:29:20,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 14:29:20,001 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 175 [2018-10-04 14:29:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:20,002 INFO L225 Difference]: With dead ends: 229 [2018-10-04 14:29:20,002 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 14:29:20,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.8s impTime 59 [2018-10-04 14:29:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 14:29:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-10-04 14:29:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-04 14:29:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2018-10-04 14:29:20,009 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 175 [2018-10-04 14:29:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:20,010 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2018-10-04 14:29:20,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 14:29:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2018-10-04 14:29:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-04 14:29:20,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:20,011 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 44, 15, 1, 1, 1] [2018-10-04 14:29:20,011 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:20,011 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1003346330, now seen corresponding path program 43 times [2018-10-04 14:29:20,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:20,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:20,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:20,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:20,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 1980 proven. 2970 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-10-04 14:29:21,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:21,366 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:29:21,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:29:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:21,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 1980 proven. 2970 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-10-04 14:29:21,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:21,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 14:29:21,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 14:29:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 14:29:21,754 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:21,754 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand 47 states. [2018-10-04 14:29:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:22,025 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2018-10-04 14:29:22,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:29:22,026 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 181 [2018-10-04 14:29:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:22,027 INFO L225 Difference]: With dead ends: 234 [2018-10-04 14:29:22,027 INFO L226 Difference]: Without dead ends: 185 [2018-10-04 14:29:22,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime 45 [2018-10-04 14:29:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-04 14:29:22,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-10-04 14:29:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-04 14:29:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2018-10-04 14:29:22,035 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 181 [2018-10-04 14:29:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:22,035 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2018-10-04 14:29:22,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 14:29:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2018-10-04 14:29:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-04 14:29:22,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:22,036 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 45, 15, 1, 1, 1] [2018-10-04 14:29:22,036 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:22,036 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2030680581, now seen corresponding path program 44 times [2018-10-04 14:29:22,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:22,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:22,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:22,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:29:22,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 2024 proven. 3105 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-10-04 14:29:22,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:22,759 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:29:22,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:29:22,810 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:29:22,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:22,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 2024 proven. 3105 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-10-04 14:29:23,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:23,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 14:29:23,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 14:29:23,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 14:29:23,111 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:23,111 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand 48 states. [2018-10-04 14:29:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:23,326 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2018-10-04 14:29:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:29:23,326 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 184 [2018-10-04 14:29:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:23,328 INFO L225 Difference]: With dead ends: 237 [2018-10-04 14:29:23,328 INFO L226 Difference]: Without dead ends: 188 [2018-10-04 14:29:23,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 46 [2018-10-04 14:29:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-04 14:29:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-04 14:29:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-04 14:29:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2018-10-04 14:29:23,336 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 184 [2018-10-04 14:29:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:23,337 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2018-10-04 14:29:23,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 14:29:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2018-10-04 14:29:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-04 14:29:23,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:23,338 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 46, 15, 1, 1, 1] [2018-10-04 14:29:23,338 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:23,338 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1408400826, now seen corresponding path program 45 times [2018-10-04 14:29:23,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:23,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:23,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2068 proven. 3243 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-10-04 14:29:24,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:24,119 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:24,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:29:24,165 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-04 14:29:24,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:24,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2162 proven. 345 refuted. 0 times theorem prover too weak. 3105 trivial. 0 not checked. [2018-10-04 14:29:24,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:24,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 18] total 65 [2018-10-04 14:29:24,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 14:29:24,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 14:29:24,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:24,639 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand 65 states. [2018-10-04 14:29:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:25,049 INFO L93 Difference]: Finished difference Result 244 states and 278 transitions. [2018-10-04 14:29:25,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 14:29:25,050 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 187 [2018-10-04 14:29:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:25,051 INFO L225 Difference]: With dead ends: 244 [2018-10-04 14:29:25,052 INFO L226 Difference]: Without dead ends: 195 [2018-10-04 14:29:25,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 63 [2018-10-04 14:29:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-04 14:29:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-10-04 14:29:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-04 14:29:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 210 transitions. [2018-10-04 14:29:25,058 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 210 transitions. Word has length 187 [2018-10-04 14:29:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:25,058 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 210 transitions. [2018-10-04 14:29:25,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 14:29:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 210 transitions. [2018-10-04 14:29:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-04 14:29:25,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:25,059 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 47, 16, 1, 1, 1] [2018-10-04 14:29:25,059 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:25,059 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash -622412324, now seen corresponding path program 46 times [2018-10-04 14:29:25,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:25,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:25,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:25,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:25,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2256 proven. 3384 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-04 14:29:27,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:27,332 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:27,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:29:27,384 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:29:27,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:27,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2256 proven. 3384 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-04 14:29:27,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:27,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 14:29:27,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 14:29:27,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 14:29:27,889 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:27,889 INFO L87 Difference]: Start difference. First operand 194 states and 210 transitions. Second operand 50 states. [2018-10-04 14:29:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:29,245 INFO L93 Difference]: Finished difference Result 249 states and 282 transitions. [2018-10-04 14:29:29,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 14:29:29,246 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-10-04 14:29:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:29,247 INFO L225 Difference]: With dead ends: 249 [2018-10-04 14:29:29,247 INFO L226 Difference]: Without dead ends: 197 [2018-10-04 14:29:29,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 1.8s impTime 48 [2018-10-04 14:29:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-04 14:29:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-10-04 14:29:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-04 14:29:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2018-10-04 14:29:29,254 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 193 [2018-10-04 14:29:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:29,254 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2018-10-04 14:29:29,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 14:29:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2018-10-04 14:29:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-04 14:29:29,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:29,255 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 48, 16, 1, 1, 1] [2018-10-04 14:29:29,255 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:29,255 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:29,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1846957511, now seen corresponding path program 47 times [2018-10-04 14:29:29,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:29,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:29,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:29,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:29,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2303 proven. 3528 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-04 14:29:30,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:30,299 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:29:30,307 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:29:30,412 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2018-10-04 14:29:30,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:30,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2303 proven. 3528 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-04 14:29:30,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:30,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 14:29:30,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 14:29:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 14:29:30,715 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:30,716 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand 51 states. [2018-10-04 14:29:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:30,929 INFO L93 Difference]: Finished difference Result 252 states and 285 transitions. [2018-10-04 14:29:30,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 14:29:30,929 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2018-10-04 14:29:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:30,931 INFO L225 Difference]: With dead ends: 252 [2018-10-04 14:29:30,931 INFO L226 Difference]: Without dead ends: 200 [2018-10-04 14:29:30,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 49 [2018-10-04 14:29:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-04 14:29:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-10-04 14:29:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-04 14:29:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 216 transitions. [2018-10-04 14:29:30,938 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 216 transitions. Word has length 196 [2018-10-04 14:29:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:30,939 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 216 transitions. [2018-10-04 14:29:30,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 14:29:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 216 transitions. [2018-10-04 14:29:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-04 14:29:30,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:30,940 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 49, 16, 1, 1, 1] [2018-10-04 14:29:30,940 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:30,941 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:30,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1651101188, now seen corresponding path program 48 times [2018-10-04 14:29:30,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:30,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:30,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:30,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:30,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2350 proven. 3675 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-04 14:29:32,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:32,521 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:29:32,529 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:29:32,613 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-10-04 14:29:32,614 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:32,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2450 proven. 392 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-10-04 14:29:32,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:32,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 19] total 69 [2018-10-04 14:29:32,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 14:29:32,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 14:29:32,938 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:32,938 INFO L87 Difference]: Start difference. First operand 200 states and 216 transitions. Second operand 69 states. [2018-10-04 14:29:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:33,352 INFO L93 Difference]: Finished difference Result 259 states and 295 transitions. [2018-10-04 14:29:33,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 14:29:33,352 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 199 [2018-10-04 14:29:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:33,354 INFO L225 Difference]: With dead ends: 259 [2018-10-04 14:29:33,354 INFO L226 Difference]: Without dead ends: 207 [2018-10-04 14:29:33,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.5s impTime 67 [2018-10-04 14:29:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-04 14:29:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-10-04 14:29:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-04 14:29:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-10-04 14:29:33,361 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 199 [2018-10-04 14:29:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:33,361 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-10-04 14:29:33,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 14:29:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-10-04 14:29:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-04 14:29:33,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:33,362 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 50, 17, 1, 1, 1] [2018-10-04 14:29:33,362 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:33,363 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:33,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1403567398, now seen corresponding path program 49 times [2018-10-04 14:29:33,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:33,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:33,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:33,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:33,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 2832 proven. 551 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-10-04 14:29:33,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:33,775 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:33,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:29:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:33,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:29:34,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:34,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 69] total 72 [2018-10-04 14:29:34,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 14:29:34,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 14:29:34,464 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:34,464 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 72 states. [2018-10-04 14:29:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:34,838 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2018-10-04 14:29:34,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 14:29:34,838 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 205 [2018-10-04 14:29:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:34,840 INFO L225 Difference]: With dead ends: 218 [2018-10-04 14:29:34,840 INFO L226 Difference]: Without dead ends: 216 [2018-10-04 14:29:34,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.4s impTime 52 [2018-10-04 14:29:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-04 14:29:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-10-04 14:29:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-04 14:29:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 235 transitions. [2018-10-04 14:29:34,848 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 235 transitions. Word has length 205 [2018-10-04 14:29:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:34,849 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 235 transitions. [2018-10-04 14:29:34,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 14:29:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 235 transitions. [2018-10-04 14:29:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-04 14:29:34,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:34,850 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 50, 20, 1, 1, 1] [2018-10-04 14:29:34,851 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:34,851 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:34,851 INFO L82 PathProgramCache]: Analyzing trace with hash 29832167, now seen corresponding path program 50 times [2018-10-04 14:29:34,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:34,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:34,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:34,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:29:34,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 3264 proven. 737 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-10-04 14:29:35,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:35,279 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:29:35,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:29:35,333 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:29:35,334 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:35,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:29:38,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:38,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 72] total 75 [2018-10-04 14:29:38,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 14:29:38,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 14:29:38,200 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:38,201 INFO L87 Difference]: Start difference. First operand 215 states and 235 transitions. Second operand 75 states. [2018-10-04 14:29:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:38,704 INFO L93 Difference]: Finished difference Result 227 states and 253 transitions. [2018-10-04 14:29:38,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 14:29:38,705 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 214 [2018-10-04 14:29:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:38,706 INFO L225 Difference]: With dead ends: 227 [2018-10-04 14:29:38,706 INFO L226 Difference]: Without dead ends: 225 [2018-10-04 14:29:38,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 1.9s impTime 52 [2018-10-04 14:29:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-04 14:29:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2018-10-04 14:29:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-04 14:29:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 247 transitions. [2018-10-04 14:29:38,714 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 247 transitions. Word has length 214 [2018-10-04 14:29:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:38,715 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 247 transitions. [2018-10-04 14:29:38,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 14:29:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 247 transitions. [2018-10-04 14:29:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-04 14:29:38,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:38,716 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 50, 23, 1, 1, 1] [2018-10-04 14:29:38,717 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:38,717 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:38,717 INFO L82 PathProgramCache]: Analyzing trace with hash -462347910, now seen corresponding path program 51 times [2018-10-04 14:29:38,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:38,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:38,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:38,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:38,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 3696 proven. 950 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-10-04 14:29:39,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:39,217 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:39,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:29:39,282 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-04 14:29:39,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:39,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 3550 proven. 805 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-10-04 14:29:39,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:39,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 28 [2018-10-04 14:29:39,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:29:39,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:29:39,657 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:39,657 INFO L87 Difference]: Start difference. First operand 224 states and 247 transitions. Second operand 28 states. [2018-10-04 14:29:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:39,777 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-10-04 14:29:39,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:29:39,778 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 223 [2018-10-04 14:29:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:39,780 INFO L225 Difference]: With dead ends: 236 [2018-10-04 14:29:39,780 INFO L226 Difference]: Without dead ends: 234 [2018-10-04 14:29:39,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.3s impTime 26 [2018-10-04 14:29:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-04 14:29:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-10-04 14:29:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-04 14:29:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2018-10-04 14:29:39,789 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 223 [2018-10-04 14:29:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:39,790 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2018-10-04 14:29:39,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:29:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2018-10-04 14:29:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-04 14:29:39,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:39,791 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 50, 26, 1, 1, 1] [2018-10-04 14:29:39,792 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:39,792 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:39,792 INFO L82 PathProgramCache]: Analyzing trace with hash 869124423, now seen corresponding path program 52 times [2018-10-04 14:29:39,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:39,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:39,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:39,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:39,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 4128 proven. 1190 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-10-04 14:29:40,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:40,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 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:29:40,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:29:40,361 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:29:40,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:40,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:29:41,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:41,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 78] total 81 [2018-10-04 14:29:41,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 14:29:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 14:29:41,151 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:41,151 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand 81 states. [2018-10-04 14:29:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:41,673 INFO L93 Difference]: Finished difference Result 245 states and 277 transitions. [2018-10-04 14:29:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-04 14:29:41,674 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 232 [2018-10-04 14:29:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:41,675 INFO L225 Difference]: With dead ends: 245 [2018-10-04 14:29:41,675 INFO L226 Difference]: Without dead ends: 243 [2018-10-04 14:29:41,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 52 [2018-10-04 14:29:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-04 14:29:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2018-10-04 14:29:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-04 14:29:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2018-10-04 14:29:41,681 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 232 [2018-10-04 14:29:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:41,682 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2018-10-04 14:29:41,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 14:29:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2018-10-04 14:29:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-04 14:29:41,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:41,683 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 50, 29, 1, 1, 1] [2018-10-04 14:29:41,683 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:41,683 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash -208889830, now seen corresponding path program 53 times [2018-10-04 14:29:41,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:41,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:41,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 4560 proven. 1457 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-10-04 14:29:42,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:42,343 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:29:42,350 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:29:42,783 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) [2018-10-04 14:29:42,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:42,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 4470 proven. 3626 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-10-04 14:29:43,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:43,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 52] total 52 [2018-10-04 14:29:43,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:29:43,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:29:43,324 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:43,324 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand 52 states. [2018-10-04 14:29:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:43,731 INFO L93 Difference]: Finished difference Result 307 states and 377 transitions. [2018-10-04 14:29:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:29:43,731 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 241 [2018-10-04 14:29:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:43,733 INFO L225 Difference]: With dead ends: 307 [2018-10-04 14:29:43,733 INFO L226 Difference]: Without dead ends: 305 [2018-10-04 14:29:43,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.5s impTime 50 [2018-10-04 14:29:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-04 14:29:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-10-04 14:29:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-04 14:29:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 355 transitions. [2018-10-04 14:29:43,743 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 355 transitions. Word has length 241 [2018-10-04 14:29:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:43,744 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 355 transitions. [2018-10-04 14:29:43,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:29:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 355 transitions. [2018-10-04 14:29:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-04 14:29:43,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:43,746 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 50, 50, 1, 1, 1] [2018-10-04 14:29:43,746 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:43,746 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:43,746 INFO L82 PathProgramCache]: Analyzing trace with hash 602025671, now seen corresponding path program 54 times [2018-10-04 14:29:43,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:43,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:43,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:43,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:43,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 11225 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-10-04 14:29:46,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:29:46,451 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:46,459 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:29:46,701 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2018-10-04 14:29:46,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:29:46,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:29:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 11225 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-10-04 14:29:48,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:29:48,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 14:29:48,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:29:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:29:48,024 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:48,024 INFO L87 Difference]: Start difference. First operand 305 states and 355 transitions. Second operand 53 states. [2018-10-04 14:29:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:50,164 INFO L93 Difference]: Finished difference Result 4284 states and 5659 transitions. [2018-10-04 14:29:50,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 14:29:50,165 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 304 [2018-10-04 14:29:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:50,183 INFO L225 Difference]: With dead ends: 4284 [2018-10-04 14:29:50,183 INFO L226 Difference]: Without dead ends: 4282 [2018-10-04 14:29:50,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 2.0s impTime 51 [2018-10-04 14:29:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2018-10-04 14:29:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 308. [2018-10-04 14:29:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-04 14:29:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 359 transitions. [2018-10-04 14:29:50,379 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 359 transitions. Word has length 304 [2018-10-04 14:29:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:50,380 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 359 transitions. [2018-10-04 14:29:50,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:29:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2018-10-04 14:29:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-04 14:29:50,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:29:50,382 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 51, 50, 1, 1, 1] [2018-10-04 14:29:50,382 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:29:50,382 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:29:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash -834605638, now seen corresponding path program 55 times [2018-10-04 14:29:50,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:29:50,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:29:50,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:50,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:29:50,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:29:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:29:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15352 backedges. 11527 proven. 0 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-10-04 14:29:51,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:29:51,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-10-04 14:29:51,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:29:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:29:51,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:29:51,325 INFO L87 Difference]: Start difference. First operand 308 states and 359 transitions. Second operand 52 states. [2018-10-04 14:29:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:29:51,683 INFO L93 Difference]: Finished difference Result 457 states and 557 transitions. [2018-10-04 14:29:51,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:29:51,684 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 307 [2018-10-04 14:29:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:29:51,685 INFO L225 Difference]: With dead ends: 457 [2018-10-04 14:29:51,685 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:29:51,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 50 [2018-10-04 14:29:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:29:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:29:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:29:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:29:51,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-10-04 14:29:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:29:51,687 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:29:51,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:29:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:29:51,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:29:51,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:29:52,636 WARN L178 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 1835 DAG size of output: 410 [2018-10-04 14:29:53,377 WARN L178 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 1830 DAG size of output: 400 [2018-10-04 14:29:54,028 WARN L178 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 1835 DAG size of output: 410 [2018-10-04 14:29:56,620 WARN L178 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 410 DAG size of output: 357 [2018-10-04 14:29:59,023 WARN L178 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 400 DAG size of output: 351 [2018-10-04 14:30:00,753 WARN L178 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 410 DAG size of output: 357 [2018-10-04 14:30:00,757 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-10-04 14:30:00,758 INFO L421 ceAbstractionStarter]: At program point L32(lines 29 38) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 61 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61))) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (<= 58 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-10-04 14:30:00,758 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2018-10-04 14:30:00,758 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-10-04 14:30:00,758 INFO L421 ceAbstractionStarter]: At program point L26(lines 26 30) the Hoare annotation is: false [2018-10-04 14:30:00,759 INFO L421 ceAbstractionStarter]: At program point L16(lines 16 27) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 61 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61))) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (<= 58 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-10-04 14:30:00,759 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2018-10-04 14:30:00,760 INFO L421 ceAbstractionStarter]: At program point L42(lines 13 42) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 61 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61))) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (<= 58 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-10-04 14:30:00,797 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:30:00 BoogieIcfgContainer [2018-10-04 14:30:00,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:30:00,799 INFO L168 Benchmark]: Toolchain (without parser) took 88806.90 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 607.1 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 122.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-04 14:30:00,800 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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:30:00,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.38 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:30:00,801 INFO L168 Benchmark]: Boogie Preprocessor took 19.91 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:30:00,805 INFO L168 Benchmark]: RCFGBuilder took 302.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:30:00,805 INFO L168 Benchmark]: TraceAbstraction took 88437.90 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 607.1 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 101.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-04 14:30:00,809 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.18 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 41.38 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 19.91 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 302.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88437.90 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 607.1 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 101.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (61 <= main_~x~4 && (main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (58 <= main_~x~4 && (main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (61 <= main_~x~4 && (main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (58 <= main_~x~4 && (main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (61 <= main_~x~4 && (main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (58 <= main_~x~4 && (main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 88.3s OverallTime, 57 OverallIterations, 102 TraceHistogramMax, 15.6s AutomataDifference, 0.0s DeadEndRemovalTime, 9.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 945 SDslu, 10370 SDs, 0 SdLazy, 8263 SolverSat, 1805 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8028 GetRequests, 6199 SyntacticMatches, 2 SemanticMatches, 1827 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=56, 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.5s AutomataMinimizationTime, 57 MinimizatonAttempts, 3995 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 306 NumberOfFragments, 2114 HoareAnnotationTreeSize, 4 FomulaSimplifications, 41233 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 610 FormulaSimplificationTreeSizeReductionInter, 6.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 55.9s InterpolantComputationTime, 13339 NumberOfCodeBlocks, 12541 NumberOfCodeBlocksAsserted, 964 NumberOfCheckSat, 13227 ConstructedInterpolants, 0 QuantifiedInterpolants, 5682843 SizeOfPredicates, 25 NumberOfNonLiveVariables, 11131 ConjunctsInSsa, 1456 ConjunctsInUnsatCore, 112 InterpolantComputations, 3 PerfectInterpolantSequences, 183380/343178 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-30-00-836.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-30-00-836.csv Received shutdown request...