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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 08:43:47,934 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:43:47,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:43:47,948 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:43:47,948 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:43:47,950 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:43:47,951 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:43:47,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:43:47,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:43:47,958 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:43:47,959 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:43:47,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:43:47,962 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:43:47,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:43:47,964 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:43:47,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:43:47,974 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:43:47,976 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:43:47,978 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:43:47,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:43:47,983 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:43:47,984 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:43:47,987 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:43:47,987 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:43:47,987 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:43:47,991 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:43:47,992 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:43:47,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:43:47,994 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:43:47,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:43:47,996 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:43:47,996 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:43:47,997 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:43:47,997 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:43:47,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:43:48,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:43:48,000 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-03 08:43:48,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:43:48,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:43:48,026 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:43:48,026 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:43:48,027 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:43:48,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:43:48,028 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:43:48,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:43:48,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:43:48,028 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:43:48,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:43:48,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:43:48,029 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:43:48,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:43:48,029 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:43:48,030 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:43:48,030 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:43:48,030 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:43:48,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:43:48,030 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:43:48,033 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:43:48,033 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:43:48,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:43:48,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:43:48,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:43:48,034 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:43:48,034 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:43:48,034 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:43:48,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:43:48,035 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:43:48,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:43:48,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:43:48,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:43:48,113 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:43:48,113 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:43:48,114 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-03 08:43:48,114 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl' [2018-10-03 08:43:48,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:43:48,170 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:43:48,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:43:48,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:43:48,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:43:48,192 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 03.10 08:43:48" (1/1) ... [2018-10-03 08:43:48,205 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 03.10 08:43:48" (1/1) ... [2018-10-03 08:43:48,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:43:48,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:43:48,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:43:48,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:43:48,227 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 03.10 08:43:48" (1/1) ... [2018-10-03 08:43:48,227 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 03.10 08:43:48" (1/1) ... [2018-10-03 08:43:48,228 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 03.10 08:43:48" (1/1) ... [2018-10-03 08:43:48,228 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 03.10 08:43:48" (1/1) ... [2018-10-03 08:43:48,232 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 03.10 08:43:48" (1/1) ... [2018-10-03 08:43:48,234 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 03.10 08:43:48" (1/1) ... [2018-10-03 08:43:48,235 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 03.10 08:43:48" (1/1) ... [2018-10-03 08:43:48,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:43:48,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:43:48,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:43:48,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:43:48,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:43:48" (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-03 08:43:48,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 08:43:48,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 08:43:48,517 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 08:43:48,517 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:43:48 BoogieIcfgContainer [2018-10-03 08:43:48,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:43:48,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:43:48,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:43:48,522 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:43:48,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:43:48" (1/2) ... [2018-10-03 08:43:48,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9754a6 and model type gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 08:43:48, skipping insertion in model container [2018-10-03 08:43:48,524 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 03.10 08:43:48" (2/2) ... [2018-10-03 08:43:48,527 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bpl [2018-10-03 08:43:48,538 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:43:48,546 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 08:43:48,594 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:43:48,594 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:43:48,595 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:43:48,595 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:43:48,595 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:43:48,595 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:43:48,595 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:43:48,596 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:43:48,596 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:43:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-03 08:43:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-03 08:43:48,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:48,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-03 08:43:48,619 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:48,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-03 08:43:48,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:48,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:48,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:48,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:43:48,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:48,782 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-03 08:43:48,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:43:48,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:43:48,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:43:48,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:43:48,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:43:48,813 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-03 08:43:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:48,873 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2018-10-03 08:43:48,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:43:48,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-03 08:43:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:48,887 INFO L225 Difference]: With dead ends: 14 [2018-10-03 08:43:48,887 INFO L226 Difference]: Without dead ends: 9 [2018-10-03 08:43:48,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:43:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-03 08:43:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-03 08:43:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-03 08:43:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-10-03 08:43:48,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-10-03 08:43:48,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:48,928 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-10-03 08:43:48,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:43:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-03 08:43:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-03 08:43:48,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:48,929 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-03 08:43:48,929 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:48,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1807905788, now seen corresponding path program 1 times [2018-10-03 08:43:48,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:48,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:48,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:48,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:43:48,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:48,976 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-03 08:43:48,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:48,977 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-03 08:43:48,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:43:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:49,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:49,149 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-03 08:43:49,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 08:43:49,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-03 08:43:49,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 08:43:49,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 08:43:49,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:43:49,187 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-10-03 08:43:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:49,285 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-10-03 08:43:49,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:43:49,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-03 08:43:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:49,287 INFO L225 Difference]: With dead ends: 20 [2018-10-03 08:43:49,287 INFO L226 Difference]: Without dead ends: 15 [2018-10-03 08:43:49,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:43:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-03 08:43:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-10-03 08:43:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-03 08:43:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-10-03 08:43:49,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 7 [2018-10-03 08:43:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:49,294 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-10-03 08:43:49,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 08:43:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-10-03 08:43:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 08:43:49,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:49,295 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1] [2018-10-03 08:43:49,295 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:49,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1839610074, now seen corresponding path program 1 times [2018-10-03 08:43:49,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:49,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:49,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:49,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:43:49,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:49,367 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-03 08:43:49,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:49,368 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-03 08:43:49,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:43:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:49,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:49,420 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-03 08:43:49,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:49,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-03 08:43:49,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 08:43:49,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 08:43:49,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:43:49,443 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-10-03 08:43:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:49,520 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-10-03 08:43:49,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:43:49,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-03 08:43:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:49,521 INFO L225 Difference]: With dead ends: 24 [2018-10-03 08:43:49,522 INFO L226 Difference]: Without dead ends: 17 [2018-10-03 08:43:49,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:43:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-03 08:43:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-03 08:43:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-03 08:43:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-10-03 08:43:49,527 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-10-03 08:43:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:49,528 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-10-03 08:43:49,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 08:43:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-03 08:43:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:43:49,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:49,529 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1] [2018-10-03 08:43:49,529 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:49,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:49,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1731932091, now seen corresponding path program 2 times [2018-10-03 08:43:49,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:49,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:49,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:49,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:43:49,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:49,776 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-03 08:43:49,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:49,777 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-03 08:43:49,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:43:49,839 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:43:49,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:49,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:49,854 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-03 08:43:49,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:49,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-03 08:43:49,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 08:43:49,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 08:43:49,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-03 08:43:49,882 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-10-03 08:43:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:50,005 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-10-03 08:43:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 08:43:50,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-03 08:43:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:50,007 INFO L225 Difference]: With dead ends: 27 [2018-10-03 08:43:50,007 INFO L226 Difference]: Without dead ends: 20 [2018-10-03 08:43:50,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-03 08:43:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-03 08:43:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-03 08:43:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-03 08:43:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-10-03 08:43:50,015 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-10-03 08:43:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:50,016 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-10-03 08:43:50,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 08:43:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-10-03 08:43:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-03 08:43:50,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:50,017 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1] [2018-10-03 08:43:50,018 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:50,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:50,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1975221498, now seen corresponding path program 3 times [2018-10-03 08:43:50,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:50,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:50,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:50,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:50,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:50,144 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-03 08:43:50,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:50,145 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:43:50,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:43:50,163 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-03 08:43:50,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:50,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:50,269 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-03 08:43:50,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:50,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-10-03 08:43:50,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:43:50,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:43:50,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:43:50,304 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2018-10-03 08:43:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:50,423 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-10-03 08:43:50,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 08:43:50,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-10-03 08:43:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:50,428 INFO L225 Difference]: With dead ends: 34 [2018-10-03 08:43:50,428 INFO L226 Difference]: Without dead ends: 27 [2018-10-03 08:43:50,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:43:50,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-03 08:43:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-10-03 08:43:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-03 08:43:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-10-03 08:43:50,436 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-10-03 08:43:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:50,436 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-10-03 08:43:50,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:43:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-10-03 08:43:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-03 08:43:50,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:50,437 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1] [2018-10-03 08:43:50,438 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:50,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:50,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2006868068, now seen corresponding path program 4 times [2018-10-03 08:43:50,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:50,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:50,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:50,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:50,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:50,558 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-03 08:43:50,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:50,558 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-03 08:43:50,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:43:50,580 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:43:50,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:50,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:50,591 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-03 08:43:50,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:50,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 08:43:50,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:43:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:43:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:43:50,621 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2018-10-03 08:43:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:50,696 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-10-03 08:43:50,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-03 08:43:50,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-10-03 08:43:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:50,698 INFO L225 Difference]: With dead ends: 39 [2018-10-03 08:43:50,698 INFO L226 Difference]: Without dead ends: 29 [2018-10-03 08:43:50,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:43:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-03 08:43:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-03 08:43:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-03 08:43:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-03 08:43:50,704 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2018-10-03 08:43:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:50,705 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-03 08:43:50,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:43:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-03 08:43:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-03 08:43:50,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:50,706 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1] [2018-10-03 08:43:50,706 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:50,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:50,707 INFO L82 PathProgramCache]: Analyzing trace with hash -266768761, now seen corresponding path program 5 times [2018-10-03 08:43:50,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:50,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:50,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:50,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:50,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:50,940 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-03 08:43:50,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:50,941 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:43:50,964 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:43:51,094 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-03 08:43:51,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:51,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:51,116 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-03 08:43:51,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:51,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-03 08:43:51,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:43:51,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:43:51,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:43:51,150 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2018-10-03 08:43:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:51,281 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-10-03 08:43:51,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 08:43:51,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-03 08:43:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:51,283 INFO L225 Difference]: With dead ends: 42 [2018-10-03 08:43:51,283 INFO L226 Difference]: Without dead ends: 32 [2018-10-03 08:43:51,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:43:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-03 08:43:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-03 08:43:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-03 08:43:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-03 08:43:51,290 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2018-10-03 08:43:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:51,291 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-03 08:43:51,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:43:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-10-03 08:43:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-03 08:43:51,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:51,292 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 7, 2, 1, 1, 1] [2018-10-03 08:43:51,292 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:51,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:51,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1223576644, now seen corresponding path program 6 times [2018-10-03 08:43:51,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:51,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:51,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:51,446 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-03 08:43:51,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:51,446 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:43:51,454 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:43:51,467 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-03 08:43:51,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:51,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:51,531 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-03 08:43:51,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:51,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2018-10-03 08:43:51,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 08:43:51,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 08:43:51,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:43:51,562 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 13 states. [2018-10-03 08:43:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:51,662 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-10-03 08:43:51,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 08:43:51,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-10-03 08:43:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:51,664 INFO L225 Difference]: With dead ends: 49 [2018-10-03 08:43:51,664 INFO L226 Difference]: Without dead ends: 39 [2018-10-03 08:43:51,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:43:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-03 08:43:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-03 08:43:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-03 08:43:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-10-03 08:43:51,672 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 31 [2018-10-03 08:43:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:51,673 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-10-03 08:43:51,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 08:43:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-10-03 08:43:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-03 08:43:51,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:51,674 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1] [2018-10-03 08:43:51,675 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:51,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1547890150, now seen corresponding path program 7 times [2018-10-03 08:43:51,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:51,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:51,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:51,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:51,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:51,937 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-03 08:43:51,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:51,938 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-03 08:43:51,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:43:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:51,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:51,980 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-03 08:43:52,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:52,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-03 08:43:52,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 08:43:52,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 08:43:52,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-03 08:43:52,016 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2018-10-03 08:43:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:52,227 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-10-03 08:43:52,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-03 08:43:52,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-03 08:43:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:52,228 INFO L225 Difference]: With dead ends: 54 [2018-10-03 08:43:52,229 INFO L226 Difference]: Without dead ends: 41 [2018-10-03 08:43:52,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-03 08:43:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-03 08:43:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-03 08:43:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-03 08:43:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-03 08:43:52,245 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2018-10-03 08:43:52,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:52,247 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-03 08:43:52,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 08:43:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-03 08:43:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-03 08:43:52,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:52,249 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1] [2018-10-03 08:43:52,249 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:52,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1837705083, now seen corresponding path program 8 times [2018-10-03 08:43:52,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:52,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:52,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:43:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:52,549 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-03 08:43:52,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:52,550 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-03 08:43:52,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:43:52,580 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:43:52,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:52,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:52,602 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-03 08:43:52,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:52,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-03 08:43:52,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-03 08:43:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-03 08:43:52,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-03 08:43:52,624 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-10-03 08:43:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:52,726 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-10-03 08:43:52,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-03 08:43:52,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-10-03 08:43:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:52,727 INFO L225 Difference]: With dead ends: 57 [2018-10-03 08:43:52,727 INFO L226 Difference]: Without dead ends: 44 [2018-10-03 08:43:52,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-03 08:43:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-03 08:43:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-03 08:43:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-03 08:43:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-10-03 08:43:52,735 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 40 [2018-10-03 08:43:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:52,736 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-10-03 08:43:52,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-03 08:43:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-10-03 08:43:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-03 08:43:52,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:52,737 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 10, 3, 1, 1, 1] [2018-10-03 08:43:52,737 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:52,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1464858170, now seen corresponding path program 9 times [2018-10-03 08:43:52,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:52,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:52,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:52,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:52,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:52,941 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-03 08:43:52,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:52,942 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:43:52,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:43:52,961 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-03 08:43:52,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:52,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:53,061 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-03 08:43:53,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:53,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2018-10-03 08:43:53,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:43:53,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:43:53,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:43:53,084 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 17 states. [2018-10-03 08:43:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:53,227 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-10-03 08:43:53,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:43:53,227 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-10-03 08:43:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:53,229 INFO L225 Difference]: With dead ends: 64 [2018-10-03 08:43:53,229 INFO L226 Difference]: Without dead ends: 51 [2018-10-03 08:43:53,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:43:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-03 08:43:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-03 08:43:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-03 08:43:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-10-03 08:43:53,237 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 43 [2018-10-03 08:43:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:53,238 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-10-03 08:43:53,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:43:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-10-03 08:43:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-03 08:43:53,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:53,239 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 11, 4, 1, 1, 1] [2018-10-03 08:43:53,239 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:53,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:53,239 INFO L82 PathProgramCache]: Analyzing trace with hash 469061468, now seen corresponding path program 10 times [2018-10-03 08:43:53,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:53,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:53,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:53,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:53,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:53,443 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-03 08:43:53,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:53,443 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:43:53,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:43:53,472 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:43:53,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:53,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:53,489 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-03 08:43:53,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:53,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-03 08:43:53,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 08:43:53,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 08:43:53,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:43:53,512 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 14 states. [2018-10-03 08:43:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:53,610 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-10-03 08:43:53,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-03 08:43:53,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-10-03 08:43:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:53,612 INFO L225 Difference]: With dead ends: 69 [2018-10-03 08:43:53,612 INFO L226 Difference]: Without dead ends: 53 [2018-10-03 08:43:53,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:43:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-03 08:43:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-03 08:43:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-03 08:43:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-10-03 08:43:53,621 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 49 [2018-10-03 08:43:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:53,622 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-10-03 08:43:53,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 08:43:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-10-03 08:43:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-03 08:43:53,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:53,623 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1] [2018-10-03 08:43:53,623 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:53,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash -990261945, now seen corresponding path program 11 times [2018-10-03 08:43:53,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:53,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:53,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:53,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:53,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:53,839 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-03 08:43:53,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:53,839 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-03 08:43:53,849 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:43:53,876 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-10-03 08:43:53,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:53,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:53,895 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-03 08:43:53,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:53,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-03 08:43:53,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 08:43:53,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 08:43:53,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-03 08:43:53,921 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 15 states. [2018-10-03 08:43:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:54,050 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-10-03 08:43:54,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-03 08:43:54,051 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-10-03 08:43:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:54,052 INFO L225 Difference]: With dead ends: 72 [2018-10-03 08:43:54,052 INFO L226 Difference]: Without dead ends: 56 [2018-10-03 08:43:54,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-03 08:43:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-03 08:43:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-03 08:43:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-03 08:43:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-10-03 08:43:54,060 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 52 [2018-10-03 08:43:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:54,060 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-03 08:43:54,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 08:43:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-10-03 08:43:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-03 08:43:54,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:54,062 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 13, 4, 1, 1, 1] [2018-10-03 08:43:54,062 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:54,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:54,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2035088516, now seen corresponding path program 12 times [2018-10-03 08:43:54,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:54,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:54,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:54,490 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-03 08:43:54,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:54,490 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-03 08:43:54,498 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:43:54,582 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-10-03 08:43:54,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:54,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:54,986 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-03 08:43:55,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:55,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 21 [2018-10-03 08:43:55,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-03 08:43:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-03 08:43:55,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-03 08:43:55,008 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 21 states. [2018-10-03 08:43:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:55,124 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-10-03 08:43:55,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:43:55,124 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-10-03 08:43:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:55,125 INFO L225 Difference]: With dead ends: 79 [2018-10-03 08:43:55,125 INFO L226 Difference]: Without dead ends: 63 [2018-10-03 08:43:55,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-03 08:43:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-03 08:43:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-03 08:43:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-03 08:43:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-10-03 08:43:55,134 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 55 [2018-10-03 08:43:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:55,134 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-10-03 08:43:55,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-03 08:43:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-10-03 08:43:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-03 08:43:55,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:55,136 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 14, 5, 1, 1, 1] [2018-10-03 08:43:55,136 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:55,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:55,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1900338010, now seen corresponding path program 13 times [2018-10-03 08:43:55,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:55,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:55,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:55,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:55,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:55,670 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-03 08:43:55,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:55,671 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-03 08:43:55,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:43:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:55,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:55,722 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-03 08:43:55,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:55,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-03 08:43:55,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:43:55,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:43:55,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:43:55,744 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 17 states. [2018-10-03 08:43:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:55,893 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-10-03 08:43:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:43:55,893 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-10-03 08:43:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:55,894 INFO L225 Difference]: With dead ends: 84 [2018-10-03 08:43:55,894 INFO L226 Difference]: Without dead ends: 65 [2018-10-03 08:43:55,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:43:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-03 08:43:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-03 08:43:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-03 08:43:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-10-03 08:43:55,906 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 61 [2018-10-03 08:43:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:55,906 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-10-03 08:43:55,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:43:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-10-03 08:43:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-03 08:43:55,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:55,908 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 15, 5, 1, 1, 1] [2018-10-03 08:43:55,908 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:55,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1598238523, now seen corresponding path program 14 times [2018-10-03 08:43:55,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:55,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:55,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:55,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:43:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:56,177 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-03 08:43:56,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:56,178 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-03 08:43:56,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:43:56,232 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:43:56,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:56,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:56,256 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-03 08:43:56,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:56,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-03 08:43:56,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 08:43:56,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 08:43:56,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:43:56,285 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 18 states. [2018-10-03 08:43:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:56,414 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-10-03 08:43:56,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-03 08:43:56,414 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-10-03 08:43:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:56,415 INFO L225 Difference]: With dead ends: 87 [2018-10-03 08:43:56,416 INFO L226 Difference]: Without dead ends: 68 [2018-10-03 08:43:56,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:43:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-03 08:43:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-03 08:43:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-03 08:43:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-10-03 08:43:56,424 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 64 [2018-10-03 08:43:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:56,424 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-10-03 08:43:56,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 08:43:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-10-03 08:43:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-03 08:43:56,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:56,425 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 16, 5, 1, 1, 1] [2018-10-03 08:43:56,426 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:56,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:56,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1720361094, now seen corresponding path program 15 times [2018-10-03 08:43:56,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:56,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:56,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:56,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:56,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:56,695 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-03 08:43:56,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:56,695 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-03 08:43:56,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:43:56,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-03 08:43:56,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:56,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:56,909 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-03 08:43:56,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:56,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 25 [2018-10-03 08:43:56,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-03 08:43:56,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-03 08:43:56,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-03 08:43:56,930 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 25 states. [2018-10-03 08:43:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:57,378 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2018-10-03 08:43:57,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-03 08:43:57,379 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-10-03 08:43:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:57,380 INFO L225 Difference]: With dead ends: 94 [2018-10-03 08:43:57,380 INFO L226 Difference]: Without dead ends: 75 [2018-10-03 08:43:57,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-03 08:43:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-03 08:43:57,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-03 08:43:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-03 08:43:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-10-03 08:43:57,387 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 67 [2018-10-03 08:43:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:57,387 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-10-03 08:43:57,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-03 08:43:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-10-03 08:43:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-03 08:43:57,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:57,389 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 17, 6, 1, 1, 1] [2018-10-03 08:43:57,389 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:57,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:57,389 INFO L82 PathProgramCache]: Analyzing trace with hash -867234020, now seen corresponding path program 16 times [2018-10-03 08:43:57,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:57,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:57,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:57,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:57,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:57,702 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-03 08:43:57,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:57,702 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-03 08:43:57,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:43:57,734 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:43:57,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:57,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:57,751 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-03 08:43:57,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:57,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-03 08:43:57,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-03 08:43:57,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-03 08:43:57,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-03 08:43:57,776 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 20 states. [2018-10-03 08:43:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:57,873 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-10-03 08:43:57,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-03 08:43:57,874 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2018-10-03 08:43:57,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:57,875 INFO L225 Difference]: With dead ends: 99 [2018-10-03 08:43:57,875 INFO L226 Difference]: Without dead ends: 77 [2018-10-03 08:43:57,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-03 08:43:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-03 08:43:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-03 08:43:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-03 08:43:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-10-03 08:43:57,881 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 73 [2018-10-03 08:43:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:57,882 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-10-03 08:43:57,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-03 08:43:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-10-03 08:43:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-03 08:43:57,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:57,883 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 18, 6, 1, 1, 1] [2018-10-03 08:43:57,883 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:57,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1757201401, now seen corresponding path program 17 times [2018-10-03 08:43:57,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:57,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:57,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:58,833 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-03 08:43:58,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:58,834 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-03 08:43:58,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:43:58,874 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-03 08:43:58,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:58,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:58,894 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-03 08:43:58,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:58,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-03 08:43:58,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-03 08:43:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-03 08:43:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-03 08:43:58,916 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 21 states. [2018-10-03 08:43:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:59,044 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-10-03 08:43:59,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:43:59,048 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-10-03 08:43:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:59,049 INFO L225 Difference]: With dead ends: 102 [2018-10-03 08:43:59,049 INFO L226 Difference]: Without dead ends: 80 [2018-10-03 08:43:59,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-03 08:43:59,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-03 08:43:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-03 08:43:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-03 08:43:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-10-03 08:43:59,054 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 76 [2018-10-03 08:43:59,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:59,055 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-10-03 08:43:59,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-03 08:43:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-10-03 08:43:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-03 08:43:59,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:59,056 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 19, 6, 1, 1, 1] [2018-10-03 08:43:59,056 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:59,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:59,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1942330564, now seen corresponding path program 18 times [2018-10-03 08:43:59,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:59,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:59,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:59,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:59,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:43:59,382 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-03 08:43:59,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:43:59,383 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-03 08:43:59,390 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:43:59,427 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-10-03 08:43:59,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:43:59,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:43:59,652 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-03 08:43:59,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:43:59,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 29 [2018-10-03 08:43:59,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-03 08:43:59,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-03 08:43:59,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-03 08:43:59,675 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 29 states. [2018-10-03 08:43:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:43:59,828 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2018-10-03 08:43:59,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-03 08:43:59,828 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-10-03 08:43:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:43:59,829 INFO L225 Difference]: With dead ends: 109 [2018-10-03 08:43:59,829 INFO L226 Difference]: Without dead ends: 87 [2018-10-03 08:43:59,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-03 08:43:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-03 08:43:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-10-03 08:43:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-03 08:43:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-10-03 08:43:59,836 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 79 [2018-10-03 08:43:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:43:59,836 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-10-03 08:43:59,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-03 08:43:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-10-03 08:43:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-03 08:43:59,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:43:59,837 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 20, 7, 1, 1, 1] [2018-10-03 08:43:59,838 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:43:59,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:43:59,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1524001638, now seen corresponding path program 19 times [2018-10-03 08:43:59,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:43:59,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:43:59,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:59,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:43:59,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:43:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:00,129 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-03 08:44:00,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:00,130 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:44:00,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:00,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:00,177 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-03 08:44:00,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:00,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-03 08:44:00,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-03 08:44:00,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-03 08:44:00,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-03 08:44:00,198 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 23 states. [2018-10-03 08:44:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:00,276 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-10-03 08:44:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:44:00,277 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-10-03 08:44:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:00,278 INFO L225 Difference]: With dead ends: 114 [2018-10-03 08:44:00,278 INFO L226 Difference]: Without dead ends: 89 [2018-10-03 08:44:00,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-03 08:44:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-03 08:44:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-03 08:44:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-03 08:44:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-10-03 08:44:00,283 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 85 [2018-10-03 08:44:00,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:00,283 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-10-03 08:44:00,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-03 08:44:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-10-03 08:44:00,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-03 08:44:00,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:00,284 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 21, 7, 1, 1, 1] [2018-10-03 08:44:00,285 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:00,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:00,285 INFO L82 PathProgramCache]: Analyzing trace with hash 427997445, now seen corresponding path program 20 times [2018-10-03 08:44:00,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:00,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:00,744 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-03 08:44:00,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:00,745 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-03 08:44:00,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:44:00,776 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:44:00,777 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:00,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:00,801 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-03 08:44:00,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:00,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-03 08:44:00,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-03 08:44:00,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-03 08:44:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-03 08:44:00,827 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 24 states. [2018-10-03 08:44:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:01,097 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2018-10-03 08:44:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:44:01,099 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2018-10-03 08:44:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:01,100 INFO L225 Difference]: With dead ends: 117 [2018-10-03 08:44:01,100 INFO L226 Difference]: Without dead ends: 92 [2018-10-03 08:44:01,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-03 08:44:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-03 08:44:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-10-03 08:44:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-03 08:44:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-10-03 08:44:01,104 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 88 [2018-10-03 08:44:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:01,104 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-10-03 08:44:01,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-03 08:44:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-10-03 08:44:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-03 08:44:01,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:01,105 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 22, 7, 1, 1, 1] [2018-10-03 08:44:01,105 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:01,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:01,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1424508742, now seen corresponding path program 21 times [2018-10-03 08:44:01,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:01,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:01,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:01,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:01,447 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-03 08:44:01,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:01,447 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-03 08:44:01,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:44:01,479 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-03 08:44:01,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:01,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:02,001 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-03 08:44:02,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:02,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 33 [2018-10-03 08:44:02,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-03 08:44:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-03 08:44:02,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-03 08:44:02,023 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 33 states. [2018-10-03 08:44:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:02,321 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2018-10-03 08:44:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-03 08:44:02,322 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 91 [2018-10-03 08:44:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:02,323 INFO L225 Difference]: With dead ends: 124 [2018-10-03 08:44:02,323 INFO L226 Difference]: Without dead ends: 99 [2018-10-03 08:44:02,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-03 08:44:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-03 08:44:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-10-03 08:44:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-03 08:44:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-10-03 08:44:02,330 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 91 [2018-10-03 08:44:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:02,330 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-10-03 08:44:02,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-03 08:44:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-10-03 08:44:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-03 08:44:02,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:02,331 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 23, 8, 1, 1, 1] [2018-10-03 08:44:02,332 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:02,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:02,332 INFO L82 PathProgramCache]: Analyzing trace with hash 201514716, now seen corresponding path program 22 times [2018-10-03 08:44:02,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:02,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:02,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:02,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:02,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:03,492 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-03 08:44:03,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:03,492 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-03 08:44:03,500 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:44:03,525 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:44:03,525 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:03,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:03,542 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-03 08:44:03,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:03,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-03 08:44:03,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-03 08:44:03,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-03 08:44:03,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:44:03,565 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 26 states. [2018-10-03 08:44:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:03,653 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2018-10-03 08:44:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-03 08:44:03,653 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2018-10-03 08:44:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:03,655 INFO L225 Difference]: With dead ends: 129 [2018-10-03 08:44:03,655 INFO L226 Difference]: Without dead ends: 101 [2018-10-03 08:44:03,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:44:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-03 08:44:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-03 08:44:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-03 08:44:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-10-03 08:44:03,661 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 97 [2018-10-03 08:44:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:03,662 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-10-03 08:44:03,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-03 08:44:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-10-03 08:44:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-03 08:44:03,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:03,662 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 24, 8, 1, 1, 1] [2018-10-03 08:44:03,662 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:03,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:03,663 INFO L82 PathProgramCache]: Analyzing trace with hash -527844665, now seen corresponding path program 23 times [2018-10-03 08:44:03,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:03,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:03,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:03,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:03,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:04,094 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-03 08:44:04,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:04,094 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-03 08:44:04,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:44:04,154 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-10-03 08:44:04,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:04,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:04,176 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-03 08:44:04,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:04,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-03 08:44:04,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-03 08:44:04,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-03 08:44:04,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-03 08:44:04,201 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 27 states. [2018-10-03 08:44:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:04,474 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-10-03 08:44:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 08:44:04,475 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2018-10-03 08:44:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:04,476 INFO L225 Difference]: With dead ends: 132 [2018-10-03 08:44:04,476 INFO L226 Difference]: Without dead ends: 104 [2018-10-03 08:44:04,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-03 08:44:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-03 08:44:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-03 08:44:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-03 08:44:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-10-03 08:44:04,485 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 100 [2018-10-03 08:44:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:04,485 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-10-03 08:44:04,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-03 08:44:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-10-03 08:44:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-03 08:44:04,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:04,486 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 25, 8, 1, 1, 1] [2018-10-03 08:44:04,487 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:04,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:04,487 INFO L82 PathProgramCache]: Analyzing trace with hash -633613572, now seen corresponding path program 24 times [2018-10-03 08:44:04,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:04,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:04,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:04,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:04,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:05,097 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-03 08:44:05,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:05,098 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:44:05,105 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:44:05,147 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-10-03 08:44:05,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:05,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:05,389 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-03 08:44:05,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:05,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11] total 37 [2018-10-03 08:44:05,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-03 08:44:05,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-03 08:44:05,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-03 08:44:05,410 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 37 states. [2018-10-03 08:44:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:05,568 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-10-03 08:44:05,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-03 08:44:05,568 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 103 [2018-10-03 08:44:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:05,570 INFO L225 Difference]: With dead ends: 139 [2018-10-03 08:44:05,570 INFO L226 Difference]: Without dead ends: 111 [2018-10-03 08:44:05,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-03 08:44:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-03 08:44:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-10-03 08:44:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-03 08:44:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2018-10-03 08:44:05,577 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 103 [2018-10-03 08:44:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:05,577 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2018-10-03 08:44:05,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-03 08:44:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2018-10-03 08:44:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-03 08:44:05,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:05,578 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 26, 9, 1, 1, 1] [2018-10-03 08:44:05,578 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:05,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash 223821274, now seen corresponding path program 25 times [2018-10-03 08:44:05,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:05,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:05,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:06,396 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-03 08:44:06,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:06,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:44:06,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:06,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:06,457 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-03 08:44:06,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:06,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-03 08:44:06,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-03 08:44:06,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-03 08:44:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-03 08:44:06,483 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 29 states. [2018-10-03 08:44:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:06,636 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2018-10-03 08:44:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-03 08:44:06,637 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-10-03 08:44:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:06,638 INFO L225 Difference]: With dead ends: 144 [2018-10-03 08:44:06,638 INFO L226 Difference]: Without dead ends: 113 [2018-10-03 08:44:06,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-03 08:44:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-03 08:44:06,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-10-03 08:44:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-03 08:44:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-10-03 08:44:06,645 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 109 [2018-10-03 08:44:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:06,646 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-10-03 08:44:06,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-03 08:44:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-10-03 08:44:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-03 08:44:06,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:06,647 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 27, 9, 1, 1, 1] [2018-10-03 08:44:06,647 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:06,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1370788165, now seen corresponding path program 26 times [2018-10-03 08:44:06,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:06,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:06,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:06,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:06,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:07,249 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-03 08:44:07,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:07,249 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-03 08:44:07,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:44:07,281 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:44:07,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:07,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:07,303 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-03 08:44:07,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:07,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-03 08:44:07,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-03 08:44:07,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-03 08:44:07,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-03 08:44:07,326 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 30 states. [2018-10-03 08:44:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:07,509 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2018-10-03 08:44:07,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-03 08:44:07,509 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2018-10-03 08:44:07,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:07,510 INFO L225 Difference]: With dead ends: 147 [2018-10-03 08:44:07,510 INFO L226 Difference]: Without dead ends: 116 [2018-10-03 08:44:07,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-03 08:44:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-03 08:44:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-10-03 08:44:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-03 08:44:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-10-03 08:44:07,517 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 112 [2018-10-03 08:44:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:07,518 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-10-03 08:44:07,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-03 08:44:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-10-03 08:44:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-03 08:44:07,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:07,519 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 28, 9, 1, 1, 1] [2018-10-03 08:44:07,519 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:07,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:07,519 INFO L82 PathProgramCache]: Analyzing trace with hash -98369030, now seen corresponding path program 27 times [2018-10-03 08:44:07,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:07,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:07,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:07,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:07,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:08,326 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-03 08:44:08,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:08,326 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-03 08:44:08,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:44:08,355 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-03 08:44:08,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:08,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:08,639 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-03 08:44:08,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:08,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12] total 41 [2018-10-03 08:44:08,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-03 08:44:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-03 08:44:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-03 08:44:08,660 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 41 states. [2018-10-03 08:44:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:08,884 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-10-03 08:44:08,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-03 08:44:08,884 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 115 [2018-10-03 08:44:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:08,886 INFO L225 Difference]: With dead ends: 154 [2018-10-03 08:44:08,886 INFO L226 Difference]: Without dead ends: 123 [2018-10-03 08:44:08,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-03 08:44:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-03 08:44:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-10-03 08:44:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-03 08:44:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-10-03 08:44:08,893 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 115 [2018-10-03 08:44:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:08,893 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-10-03 08:44:08,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-03 08:44:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-10-03 08:44:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-03 08:44:08,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:08,894 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 29, 10, 1, 1, 1] [2018-10-03 08:44:08,895 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:08,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:08,895 INFO L82 PathProgramCache]: Analyzing trace with hash -291193188, now seen corresponding path program 28 times [2018-10-03 08:44:08,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:08,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:08,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:09,413 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-03 08:44:09,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:09,413 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-03 08:44:09,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:44:09,456 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:44:09,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:09,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:09,487 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-03 08:44:09,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:09,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-03 08:44:09,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-03 08:44:09,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-03 08:44:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-03 08:44:09,508 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 32 states. [2018-10-03 08:44:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:09,675 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2018-10-03 08:44:09,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-03 08:44:09,675 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 121 [2018-10-03 08:44:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:09,676 INFO L225 Difference]: With dead ends: 159 [2018-10-03 08:44:09,677 INFO L226 Difference]: Without dead ends: 125 [2018-10-03 08:44:09,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-03 08:44:09,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-03 08:44:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-10-03 08:44:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-03 08:44:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-10-03 08:44:09,684 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 121 [2018-10-03 08:44:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:09,684 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-10-03 08:44:09,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-03 08:44:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-10-03 08:44:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-03 08:44:09,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:09,685 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 30, 10, 1, 1, 1] [2018-10-03 08:44:09,685 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:09,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:09,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1151252089, now seen corresponding path program 29 times [2018-10-03 08:44:09,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:09,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:09,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:09,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:09,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:10,133 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-03 08:44:10,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:10,133 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-03 08:44:10,142 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:44:10,205 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2018-10-03 08:44:10,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:10,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:10,230 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-03 08:44:10,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:10,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-03 08:44:10,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-03 08:44:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-03 08:44:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-03 08:44:10,252 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 33 states. [2018-10-03 08:44:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:10,381 INFO L93 Difference]: Finished difference Result 162 states and 183 transitions. [2018-10-03 08:44:10,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-03 08:44:10,381 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-10-03 08:44:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:10,382 INFO L225 Difference]: With dead ends: 162 [2018-10-03 08:44:10,382 INFO L226 Difference]: Without dead ends: 128 [2018-10-03 08:44:10,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-03 08:44:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-03 08:44:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-10-03 08:44:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-03 08:44:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-10-03 08:44:10,388 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 124 [2018-10-03 08:44:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:10,388 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-10-03 08:44:10,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-03 08:44:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-10-03 08:44:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-03 08:44:10,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:10,389 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 31, 10, 1, 1, 1] [2018-10-03 08:44:10,389 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:10,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash 608916156, now seen corresponding path program 30 times [2018-10-03 08:44:10,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:10,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:10,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:10,879 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-03 08:44:10,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:10,879 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:44:10,886 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:44:10,942 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2018-10-03 08:44:10,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:10,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:11,464 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-03 08:44:11,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:11,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13] total 45 [2018-10-03 08:44:11,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-03 08:44:11,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-03 08:44:11,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-03 08:44:11,486 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 45 states. [2018-10-03 08:44:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:11,705 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2018-10-03 08:44:11,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-03 08:44:11,705 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 127 [2018-10-03 08:44:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:11,706 INFO L225 Difference]: With dead ends: 169 [2018-10-03 08:44:11,707 INFO L226 Difference]: Without dead ends: 135 [2018-10-03 08:44:11,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-03 08:44:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-03 08:44:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-10-03 08:44:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-03 08:44:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-10-03 08:44:11,714 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 127 [2018-10-03 08:44:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:11,714 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-10-03 08:44:11,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-03 08:44:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-10-03 08:44:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-03 08:44:11,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:11,715 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 32, 11, 1, 1, 1] [2018-10-03 08:44:11,715 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:11,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:11,715 INFO L82 PathProgramCache]: Analyzing trace with hash 918148890, now seen corresponding path program 31 times [2018-10-03 08:44:11,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:11,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:11,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:11,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:11,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:12,717 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-03 08:44:12,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:12,718 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-03 08:44:12,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:12,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:12,775 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-03 08:44:12,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:12,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-03 08:44:12,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-03 08:44:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-03 08:44:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-03 08:44:12,797 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 35 states. [2018-10-03 08:44:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:12,939 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2018-10-03 08:44:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-03 08:44:12,940 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-10-03 08:44:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:12,941 INFO L225 Difference]: With dead ends: 174 [2018-10-03 08:44:12,941 INFO L226 Difference]: Without dead ends: 137 [2018-10-03 08:44:12,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-03 08:44:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-03 08:44:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-10-03 08:44:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-03 08:44:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-10-03 08:44:12,948 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 133 [2018-10-03 08:44:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:12,949 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-10-03 08:44:12,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-03 08:44:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-10-03 08:44:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-03 08:44:12,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:12,949 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 33, 11, 1, 1, 1] [2018-10-03 08:44:12,950 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:12,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:12,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1564367237, now seen corresponding path program 32 times [2018-10-03 08:44:12,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:12,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:12,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:12,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:12,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:13,468 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-03 08:44:13,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:13,468 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-03 08:44:13,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:44:13,515 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:44:13,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:13,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:13,562 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-03 08:44:13,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:13,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-03 08:44:13,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-03 08:44:13,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-03 08:44:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-03 08:44:13,585 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 36 states. [2018-10-03 08:44:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:13,770 INFO L93 Difference]: Finished difference Result 177 states and 200 transitions. [2018-10-03 08:44:13,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-03 08:44:13,770 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 136 [2018-10-03 08:44:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:13,771 INFO L225 Difference]: With dead ends: 177 [2018-10-03 08:44:13,771 INFO L226 Difference]: Without dead ends: 140 [2018-10-03 08:44:13,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-03 08:44:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-03 08:44:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-10-03 08:44:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-03 08:44:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-10-03 08:44:13,779 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 136 [2018-10-03 08:44:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:13,779 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-10-03 08:44:13,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-03 08:44:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-10-03 08:44:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-03 08:44:13,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:13,780 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 34, 11, 1, 1, 1] [2018-10-03 08:44:13,780 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:13,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1283245254, now seen corresponding path program 33 times [2018-10-03 08:44:13,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:13,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:13,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:13,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:13,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:14,357 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-03 08:44:14,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:14,357 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:44:14,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:44:14,395 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-03 08:44:14,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:14,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:14,794 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-03 08:44:14,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:14,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14] total 49 [2018-10-03 08:44:14,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-03 08:44:14,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-03 08:44:14,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-03 08:44:14,816 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 49 states. [2018-10-03 08:44:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:15,061 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2018-10-03 08:44:15,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-03 08:44:15,062 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 139 [2018-10-03 08:44:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:15,063 INFO L225 Difference]: With dead ends: 184 [2018-10-03 08:44:15,063 INFO L226 Difference]: Without dead ends: 147 [2018-10-03 08:44:15,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-03 08:44:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-03 08:44:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-10-03 08:44:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-03 08:44:15,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-10-03 08:44:15,072 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 139 [2018-10-03 08:44:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:15,072 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-10-03 08:44:15,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-03 08:44:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-10-03 08:44:15,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-03 08:44:15,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:15,073 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 35, 12, 1, 1, 1] [2018-10-03 08:44:15,073 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:15,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:15,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1757982300, now seen corresponding path program 34 times [2018-10-03 08:44:15,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:15,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:15,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:15,803 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-03 08:44:15,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:15,803 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-03 08:44:15,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:44:15,846 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:44:15,846 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:15,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:15,875 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-03 08:44:15,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:15,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-03 08:44:15,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-03 08:44:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-03 08:44:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-03 08:44:15,899 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 38 states. [2018-10-03 08:44:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:16,647 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2018-10-03 08:44:16,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-03 08:44:16,647 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 145 [2018-10-03 08:44:16,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:16,649 INFO L225 Difference]: With dead ends: 189 [2018-10-03 08:44:16,649 INFO L226 Difference]: Without dead ends: 149 [2018-10-03 08:44:16,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-03 08:44:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-03 08:44:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-10-03 08:44:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-03 08:44:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2018-10-03 08:44:16,656 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 145 [2018-10-03 08:44:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:16,657 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2018-10-03 08:44:16,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-03 08:44:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2018-10-03 08:44:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-03 08:44:16,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:16,658 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 36, 12, 1, 1, 1] [2018-10-03 08:44:16,658 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:16,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash 593356871, now seen corresponding path program 35 times [2018-10-03 08:44:16,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:16,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:16,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:16,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:16,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:17,473 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-03 08:44:17,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:17,473 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:44:17,480 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:44:18,023 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-03 08:44:18,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:18,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:18,054 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-03 08:44:18,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:18,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-03 08:44:18,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-03 08:44:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-03 08:44:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-03 08:44:18,076 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand 39 states. [2018-10-03 08:44:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:18,317 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-10-03 08:44:18,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-03 08:44:18,318 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2018-10-03 08:44:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:18,319 INFO L225 Difference]: With dead ends: 192 [2018-10-03 08:44:18,319 INFO L226 Difference]: Without dead ends: 152 [2018-10-03 08:44:18,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-03 08:44:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-03 08:44:18,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-10-03 08:44:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-03 08:44:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-10-03 08:44:18,328 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 148 [2018-10-03 08:44:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:18,328 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-10-03 08:44:18,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-03 08:44:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2018-10-03 08:44:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-03 08:44:18,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:18,329 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 37, 12, 1, 1, 1] [2018-10-03 08:44:18,329 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:18,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:18,330 INFO L82 PathProgramCache]: Analyzing trace with hash -16981380, now seen corresponding path program 36 times [2018-10-03 08:44:18,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:18,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:18,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:18,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:18,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:19,597 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-03 08:44:19,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:19,597 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-03 08:44:19,604 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:44:19,666 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-10-03 08:44:19,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:19,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:20,159 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-03 08:44:20,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:20,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 53 [2018-10-03 08:44:20,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-03 08:44:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-03 08:44:20,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-03 08:44:20,192 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 53 states. [2018-10-03 08:44:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:20,489 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2018-10-03 08:44:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-03 08:44:20,489 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 151 [2018-10-03 08:44:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:20,491 INFO L225 Difference]: With dead ends: 199 [2018-10-03 08:44:20,491 INFO L226 Difference]: Without dead ends: 159 [2018-10-03 08:44:20,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-03 08:44:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-03 08:44:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-10-03 08:44:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-03 08:44:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-10-03 08:44:20,500 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 151 [2018-10-03 08:44:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:20,500 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-10-03 08:44:20,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-03 08:44:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-10-03 08:44:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-03 08:44:20,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:20,501 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 38, 13, 1, 1, 1] [2018-10-03 08:44:20,502 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:20,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash 758997082, now seen corresponding path program 37 times [2018-10-03 08:44:20,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:20,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:20,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:21,552 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-03 08:44:21,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:21,553 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-03 08:44:21,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:21,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:21,621 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-03 08:44:21,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:21,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-03 08:44:21,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-03 08:44:21,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-03 08:44:21,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-03 08:44:21,652 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 41 states. [2018-10-03 08:44:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:21,893 INFO L93 Difference]: Finished difference Result 204 states and 231 transitions. [2018-10-03 08:44:21,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-03 08:44:21,893 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 157 [2018-10-03 08:44:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:21,895 INFO L225 Difference]: With dead ends: 204 [2018-10-03 08:44:21,895 INFO L226 Difference]: Without dead ends: 161 [2018-10-03 08:44:21,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-03 08:44:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-03 08:44:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-10-03 08:44:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-03 08:44:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2018-10-03 08:44:21,904 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 157 [2018-10-03 08:44:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:21,905 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2018-10-03 08:44:21,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-03 08:44:21,905 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2018-10-03 08:44:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-03 08:44:21,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:21,906 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 39, 13, 1, 1, 1] [2018-10-03 08:44:21,906 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:21,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash -821292603, now seen corresponding path program 38 times [2018-10-03 08:44:21,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:21,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:21,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:21,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:21,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:22,581 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-03 08:44:22,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:22,582 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-03 08:44:22,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:44:22,645 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:44:22,646 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:22,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:22,677 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-03 08:44:22,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:22,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-03 08:44:22,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-03 08:44:22,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-03 08:44:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-03 08:44:22,699 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand 42 states. [2018-10-03 08:44:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:22,910 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2018-10-03 08:44:22,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-03 08:44:22,910 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-10-03 08:44:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:22,912 INFO L225 Difference]: With dead ends: 207 [2018-10-03 08:44:22,912 INFO L226 Difference]: Without dead ends: 164 [2018-10-03 08:44:22,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-03 08:44:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-03 08:44:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-10-03 08:44:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-03 08:44:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2018-10-03 08:44:22,920 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 160 [2018-10-03 08:44:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:22,921 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2018-10-03 08:44:22,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-03 08:44:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2018-10-03 08:44:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-03 08:44:22,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:22,922 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 40, 13, 1, 1, 1] [2018-10-03 08:44:22,922 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:22,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2094766982, now seen corresponding path program 39 times [2018-10-03 08:44:22,923 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:22,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:22,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:24,339 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-03 08:44:24,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:24,340 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-03 08:44:24,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:44:24,382 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-03 08:44:24,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:24,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:25,292 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-03 08:44:25,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:25,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 16] total 57 [2018-10-03 08:44:25,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-03 08:44:25,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-03 08:44:25,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-10-03 08:44:25,314 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand 57 states. [2018-10-03 08:44:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:25,764 INFO L93 Difference]: Finished difference Result 214 states and 244 transitions. [2018-10-03 08:44:25,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-03 08:44:25,764 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 163 [2018-10-03 08:44:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:25,765 INFO L225 Difference]: With dead ends: 214 [2018-10-03 08:44:25,765 INFO L226 Difference]: Without dead ends: 171 [2018-10-03 08:44:25,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-10-03 08:44:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-03 08:44:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-10-03 08:44:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-03 08:44:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2018-10-03 08:44:25,772 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 163 [2018-10-03 08:44:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:25,772 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2018-10-03 08:44:25,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-03 08:44:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2018-10-03 08:44:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-03 08:44:25,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:25,774 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 41, 14, 1, 1, 1] [2018-10-03 08:44:25,774 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:25,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1878872548, now seen corresponding path program 40 times [2018-10-03 08:44:25,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:25,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:25,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:26,898 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-03 08:44:26,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:26,899 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-03 08:44:26,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:44:26,950 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:44:26,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:26,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:26,987 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-03 08:44:27,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:27,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-03 08:44:27,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-03 08:44:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-03 08:44:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-03 08:44:27,021 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand 44 states. [2018-10-03 08:44:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:28,313 INFO L93 Difference]: Finished difference Result 219 states and 248 transitions. [2018-10-03 08:44:28,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-03 08:44:28,314 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 169 [2018-10-03 08:44:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:28,315 INFO L225 Difference]: With dead ends: 219 [2018-10-03 08:44:28,315 INFO L226 Difference]: Without dead ends: 173 [2018-10-03 08:44:28,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-03 08:44:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-03 08:44:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-10-03 08:44:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-03 08:44:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2018-10-03 08:44:28,324 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 169 [2018-10-03 08:44:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:28,324 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2018-10-03 08:44:28,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-03 08:44:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2018-10-03 08:44:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-03 08:44:28,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:28,325 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 42, 14, 1, 1, 1] [2018-10-03 08:44:28,326 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:28,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:28,326 INFO L82 PathProgramCache]: Analyzing trace with hash 890476295, now seen corresponding path program 41 times [2018-10-03 08:44:28,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:28,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:28,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:28,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:28,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:29,232 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-03 08:44:29,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:29,232 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:44:29,240 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:44:29,329 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2018-10-03 08:44:29,329 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:29,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:29,364 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-03 08:44:29,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:29,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-03 08:44:29,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-03 08:44:29,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-03 08:44:29,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-03 08:44:29,386 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand 45 states. [2018-10-03 08:44:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:29,546 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2018-10-03 08:44:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-03 08:44:29,546 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2018-10-03 08:44:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:29,547 INFO L225 Difference]: With dead ends: 222 [2018-10-03 08:44:29,548 INFO L226 Difference]: Without dead ends: 176 [2018-10-03 08:44:29,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-03 08:44:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-03 08:44:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-10-03 08:44:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-03 08:44:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2018-10-03 08:44:29,555 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 172 [2018-10-03 08:44:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:29,555 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2018-10-03 08:44:29,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-03 08:44:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2018-10-03 08:44:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-03 08:44:29,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:29,556 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 43, 14, 1, 1, 1] [2018-10-03 08:44:29,556 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:29,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash 535069244, now seen corresponding path program 42 times [2018-10-03 08:44:29,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:29,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:29,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:29,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:29,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:30,610 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-03 08:44:30,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:30,611 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:44:30,618 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:44:30,699 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2018-10-03 08:44:30,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:30,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:31,273 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-03 08:44:31,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:31,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 17] total 61 [2018-10-03 08:44:31,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-03 08:44:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-03 08:44:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-10-03 08:44:31,295 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand 61 states. [2018-10-03 08:44:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:31,754 INFO L93 Difference]: Finished difference Result 229 states and 261 transitions. [2018-10-03 08:44:31,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-03 08:44:31,754 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 175 [2018-10-03 08:44:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:31,756 INFO L225 Difference]: With dead ends: 229 [2018-10-03 08:44:31,756 INFO L226 Difference]: Without dead ends: 183 [2018-10-03 08:44:31,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-10-03 08:44:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-03 08:44:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-10-03 08:44:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-03 08:44:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2018-10-03 08:44:31,763 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 175 [2018-10-03 08:44:31,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:31,763 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2018-10-03 08:44:31,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-03 08:44:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2018-10-03 08:44:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-03 08:44:31,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:31,765 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 44, 15, 1, 1, 1] [2018-10-03 08:44:31,765 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:31,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1003346330, now seen corresponding path program 43 times [2018-10-03 08:44:31,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:31,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:31,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:31,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:31,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:33,341 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-03 08:44:33,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:33,341 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-03 08:44:33,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:33,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:33,422 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-03 08:44:33,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:33,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-03 08:44:33,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-03 08:44:33,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-03 08:44:33,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-03 08:44:33,443 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand 47 states. [2018-10-03 08:44:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:33,625 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2018-10-03 08:44:33,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-03 08:44:33,625 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 181 [2018-10-03 08:44:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:33,626 INFO L225 Difference]: With dead ends: 234 [2018-10-03 08:44:33,626 INFO L226 Difference]: Without dead ends: 185 [2018-10-03 08:44:33,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-03 08:44:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-03 08:44:33,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-10-03 08:44:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-03 08:44:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2018-10-03 08:44:33,632 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 181 [2018-10-03 08:44:33,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:33,633 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2018-10-03 08:44:33,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-03 08:44:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2018-10-03 08:44:33,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-03 08:44:33,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:33,634 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 45, 15, 1, 1, 1] [2018-10-03 08:44:33,634 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:33,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:33,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2030680581, now seen corresponding path program 44 times [2018-10-03 08:44:33,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:33,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:33,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:33,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:33,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:34,549 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-03 08:44:34,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:34,550 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-03 08:44:34,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:44:34,603 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:44:34,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:34,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:34,643 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-03 08:44:34,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:34,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-03 08:44:34,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-03 08:44:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-03 08:44:34,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-03 08:44:34,665 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand 48 states. [2018-10-03 08:44:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:34,881 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2018-10-03 08:44:34,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-03 08:44:34,881 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 184 [2018-10-03 08:44:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:34,882 INFO L225 Difference]: With dead ends: 237 [2018-10-03 08:44:34,883 INFO L226 Difference]: Without dead ends: 188 [2018-10-03 08:44:34,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-03 08:44:34,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-03 08:44:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-03 08:44:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-03 08:44:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2018-10-03 08:44:34,889 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 184 [2018-10-03 08:44:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:34,890 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2018-10-03 08:44:34,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-03 08:44:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2018-10-03 08:44:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-03 08:44:34,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:34,891 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 46, 15, 1, 1, 1] [2018-10-03 08:44:34,891 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:34,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1408400826, now seen corresponding path program 45 times [2018-10-03 08:44:34,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:34,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:34,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:35,867 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-03 08:44:35,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:35,867 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-03 08:44:35,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:44:35,914 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-03 08:44:35,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:35,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:36,955 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-03 08:44:36,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:36,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 18] total 65 [2018-10-03 08:44:36,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-03 08:44:36,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-03 08:44:36,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-10-03 08:44:36,976 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand 65 states. [2018-10-03 08:44:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:37,346 INFO L93 Difference]: Finished difference Result 244 states and 278 transitions. [2018-10-03 08:44:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-03 08:44:37,347 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 187 [2018-10-03 08:44:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:37,348 INFO L225 Difference]: With dead ends: 244 [2018-10-03 08:44:37,348 INFO L226 Difference]: Without dead ends: 195 [2018-10-03 08:44:37,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-10-03 08:44:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-03 08:44:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-10-03 08:44:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-03 08:44:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 210 transitions. [2018-10-03 08:44:37,355 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 210 transitions. Word has length 187 [2018-10-03 08:44:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:37,355 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 210 transitions. [2018-10-03 08:44:37,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-03 08:44:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 210 transitions. [2018-10-03 08:44:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-03 08:44:37,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:37,356 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 47, 16, 1, 1, 1] [2018-10-03 08:44:37,356 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:37,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash -622412324, now seen corresponding path program 46 times [2018-10-03 08:44:37,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:37,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:37,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:37,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:40,315 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-03 08:44:40,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:40,316 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:44:40,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:44:40,370 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:44:40,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:40,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:40,415 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-03 08:44:40,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:40,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-03 08:44:40,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-03 08:44:40,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-03 08:44:40,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-03 08:44:40,445 INFO L87 Difference]: Start difference. First operand 194 states and 210 transitions. Second operand 50 states. [2018-10-03 08:44:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:40,834 INFO L93 Difference]: Finished difference Result 249 states and 282 transitions. [2018-10-03 08:44:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-03 08:44:40,835 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-10-03 08:44:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:40,836 INFO L225 Difference]: With dead ends: 249 [2018-10-03 08:44:40,836 INFO L226 Difference]: Without dead ends: 197 [2018-10-03 08:44:40,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-03 08:44:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-03 08:44:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-10-03 08:44:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-03 08:44:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2018-10-03 08:44:40,843 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 193 [2018-10-03 08:44:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:40,844 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2018-10-03 08:44:40,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-03 08:44:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2018-10-03 08:44:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-03 08:44:40,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:40,845 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 48, 16, 1, 1, 1] [2018-10-03 08:44:40,845 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:40,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1846957511, now seen corresponding path program 47 times [2018-10-03 08:44:40,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:40,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:40,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:47,842 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-03 08:44:47,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:47,842 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-03 08:44:47,850 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:44:47,955 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2018-10-03 08:44:47,956 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:47,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:47,994 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-03 08:44:48,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:48,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-03 08:44:48,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-03 08:44:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-03 08:44:48,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-03 08:44:48,015 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand 51 states. [2018-10-03 08:44:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:49,118 INFO L93 Difference]: Finished difference Result 252 states and 285 transitions. [2018-10-03 08:44:49,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-03 08:44:49,118 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2018-10-03 08:44:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:49,119 INFO L225 Difference]: With dead ends: 252 [2018-10-03 08:44:49,120 INFO L226 Difference]: Without dead ends: 200 [2018-10-03 08:44:49,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-03 08:44:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-03 08:44:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-10-03 08:44:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-03 08:44:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 216 transitions. [2018-10-03 08:44:49,129 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 216 transitions. Word has length 196 [2018-10-03 08:44:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:49,129 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 216 transitions. [2018-10-03 08:44:49,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-03 08:44:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 216 transitions. [2018-10-03 08:44:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-03 08:44:49,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:49,131 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 49, 16, 1, 1, 1] [2018-10-03 08:44:49,131 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:49,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:49,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1651101188, now seen corresponding path program 48 times [2018-10-03 08:44:49,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:49,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:49,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:49,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:50,623 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-03 08:44:50,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:50,624 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-03 08:44:50,631 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:44:50,742 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-10-03 08:44:50,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:50,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:51,440 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-03 08:44:51,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:51,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 19] total 69 [2018-10-03 08:44:51,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-03 08:44:51,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-03 08:44:51,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-10-03 08:44:51,462 INFO L87 Difference]: Start difference. First operand 200 states and 216 transitions. Second operand 69 states. [2018-10-03 08:44:51,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:51,892 INFO L93 Difference]: Finished difference Result 259 states and 295 transitions. [2018-10-03 08:44:51,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-03 08:44:51,893 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 199 [2018-10-03 08:44:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:51,895 INFO L225 Difference]: With dead ends: 259 [2018-10-03 08:44:51,895 INFO L226 Difference]: Without dead ends: 207 [2018-10-03 08:44:51,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-10-03 08:44:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-03 08:44:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-10-03 08:44:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-03 08:44:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-10-03 08:44:51,902 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 199 [2018-10-03 08:44:51,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:51,903 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-10-03 08:44:51,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-03 08:44:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-10-03 08:44:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-03 08:44:51,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:51,904 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 50, 17, 1, 1, 1] [2018-10-03 08:44:51,904 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:51,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1403567398, now seen corresponding path program 49 times [2018-10-03 08:44:51,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:51,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:51,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:52,459 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-03 08:44:52,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:52,459 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-03 08:44:52,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:52,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:54,439 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-03 08:44:54,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:54,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 69] total 72 [2018-10-03 08:44:54,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-03 08:44:54,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-03 08:44:54,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-10-03 08:44:54,460 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 72 states. [2018-10-03 08:44:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:54,864 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2018-10-03 08:44:54,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-03 08:44:54,865 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 205 [2018-10-03 08:44:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:54,867 INFO L225 Difference]: With dead ends: 218 [2018-10-03 08:44:54,867 INFO L226 Difference]: Without dead ends: 216 [2018-10-03 08:44:54,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1900 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-10-03 08:44:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-03 08:44:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-10-03 08:44:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-03 08:44:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 235 transitions. [2018-10-03 08:44:54,875 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 235 transitions. Word has length 205 [2018-10-03 08:44:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:54,876 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 235 transitions. [2018-10-03 08:44:54,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-03 08:44:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 235 transitions. [2018-10-03 08:44:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-03 08:44:54,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:54,877 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 50, 20, 1, 1, 1] [2018-10-03 08:44:54,878 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:54,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:54,878 INFO L82 PathProgramCache]: Analyzing trace with hash 29832167, now seen corresponding path program 50 times [2018-10-03 08:44:54,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:54,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:54,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:54,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:44:54,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:55,240 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-03 08:44:55,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:55,240 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-03 08:44:55,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:44:55,296 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:44:55,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:55,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:57,421 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-03 08:44:57,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:57,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 72] total 75 [2018-10-03 08:44:57,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-03 08:44:57,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-03 08:44:57,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-10-03 08:44:57,443 INFO L87 Difference]: Start difference. First operand 215 states and 235 transitions. Second operand 75 states. [2018-10-03 08:44:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:57,783 INFO L93 Difference]: Finished difference Result 227 states and 253 transitions. [2018-10-03 08:44:57,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-03 08:44:57,783 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 214 [2018-10-03 08:44:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:57,786 INFO L225 Difference]: With dead ends: 227 [2018-10-03 08:44:57,786 INFO L226 Difference]: Without dead ends: 225 [2018-10-03 08:44:57,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-10-03 08:44:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-03 08:44:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2018-10-03 08:44:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-03 08:44:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 247 transitions. [2018-10-03 08:44:57,795 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 247 transitions. Word has length 214 [2018-10-03 08:44:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:57,796 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 247 transitions. [2018-10-03 08:44:57,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-03 08:44:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 247 transitions. [2018-10-03 08:44:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-03 08:44:57,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:57,797 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 50, 23, 1, 1, 1] [2018-10-03 08:44:57,798 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:57,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:57,798 INFO L82 PathProgramCache]: Analyzing trace with hash -462347910, now seen corresponding path program 51 times [2018-10-03 08:44:57,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:57,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:57,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:57,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:57,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:58,261 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-03 08:44:58,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:58,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:44:58,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:44:58,328 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-03 08:44:58,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:58,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:44:58,368 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-03 08:44:58,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:44:58,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 28 [2018-10-03 08:44:58,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-03 08:44:58,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-03 08:44:58,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-03 08:44:58,398 INFO L87 Difference]: Start difference. First operand 224 states and 247 transitions. Second operand 28 states. [2018-10-03 08:44:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:44:58,639 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-10-03 08:44:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-03 08:44:58,640 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 223 [2018-10-03 08:44:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:44:58,642 INFO L225 Difference]: With dead ends: 236 [2018-10-03 08:44:58,642 INFO L226 Difference]: Without dead ends: 234 [2018-10-03 08:44:58,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-03 08:44:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-03 08:44:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-10-03 08:44:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-03 08:44:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2018-10-03 08:44:58,652 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 223 [2018-10-03 08:44:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:44:58,652 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2018-10-03 08:44:58,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-03 08:44:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2018-10-03 08:44:58,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-03 08:44:58,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:44:58,654 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 50, 26, 1, 1, 1] [2018-10-03 08:44:58,654 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:44:58,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:44:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash 869124423, now seen corresponding path program 52 times [2018-10-03 08:44:58,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:44:58,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:44:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:58,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:44:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:44:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:44:59,910 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-03 08:44:59,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:44:59,910 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-03 08:44:59,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:44:59,969 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:44:59,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:44:59,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:45:00,964 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-03 08:45:00,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:45:00,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 78] total 81 [2018-10-03 08:45:00,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-03 08:45:00,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-03 08:45:00,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-10-03 08:45:00,986 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand 81 states. [2018-10-03 08:45:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:45:01,653 INFO L93 Difference]: Finished difference Result 245 states and 277 transitions. [2018-10-03 08:45:01,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-03 08:45:01,653 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 232 [2018-10-03 08:45:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:45:01,655 INFO L225 Difference]: With dead ends: 245 [2018-10-03 08:45:01,655 INFO L226 Difference]: Without dead ends: 243 [2018-10-03 08:45:01,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-10-03 08:45:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-03 08:45:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2018-10-03 08:45:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-03 08:45:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2018-10-03 08:45:01,661 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 232 [2018-10-03 08:45:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:45:01,662 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2018-10-03 08:45:01,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-03 08:45:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2018-10-03 08:45:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-03 08:45:01,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:45:01,663 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 50, 29, 1, 1, 1] [2018-10-03 08:45:01,663 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:45:01,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:45:01,664 INFO L82 PathProgramCache]: Analyzing trace with hash -208889830, now seen corresponding path program 53 times [2018-10-03 08:45:01,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:45:01,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:45:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:45:01,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:45:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:45:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:45:02,504 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-03 08:45:02,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:45:02,505 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 08:45:02,511 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:45:02,985 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) [2018-10-03 08:45:02,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:45:02,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:45:03,592 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-03 08:45:03,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:45:03,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 52] total 52 [2018-10-03 08:45:03,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-03 08:45:03,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-03 08:45:03,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-03 08:45:03,615 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand 52 states. [2018-10-03 08:45:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:45:04,037 INFO L93 Difference]: Finished difference Result 307 states and 377 transitions. [2018-10-03 08:45:04,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-03 08:45:04,037 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 241 [2018-10-03 08:45:04,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:45:04,039 INFO L225 Difference]: With dead ends: 307 [2018-10-03 08:45:04,039 INFO L226 Difference]: Without dead ends: 305 [2018-10-03 08:45:04,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-03 08:45:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-03 08:45:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-10-03 08:45:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-03 08:45:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 355 transitions. [2018-10-03 08:45:04,050 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 355 transitions. Word has length 241 [2018-10-03 08:45:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:45:04,050 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 355 transitions. [2018-10-03 08:45:04,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-03 08:45:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 355 transitions. [2018-10-03 08:45:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-03 08:45:04,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:45:04,052 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 50, 50, 1, 1, 1] [2018-10-03 08:45:04,052 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:45:04,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:45:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash 602025671, now seen corresponding path program 54 times [2018-10-03 08:45:04,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:45:04,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:45:04,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:45:04,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:45:04,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:45:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:45:06,499 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-03 08:45:06,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:45:06,499 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-03 08:45:06,506 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:45:06,802 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2018-10-03 08:45:06,802 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:45:06,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:45:07,241 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-03 08:45:07,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:45:07,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-03 08:45:07,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-03 08:45:07,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-03 08:45:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-03 08:45:07,263 INFO L87 Difference]: Start difference. First operand 305 states and 355 transitions. Second operand 53 states. [2018-10-03 08:45:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:45:09,788 INFO L93 Difference]: Finished difference Result 4284 states and 5659 transitions. [2018-10-03 08:45:09,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-03 08:45:09,789 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 304 [2018-10-03 08:45:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:45:09,804 INFO L225 Difference]: With dead ends: 4284 [2018-10-03 08:45:09,804 INFO L226 Difference]: Without dead ends: 4282 [2018-10-03 08:45:09,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-03 08:45:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2018-10-03 08:45:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 308. [2018-10-03 08:45:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-03 08:45:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 359 transitions. [2018-10-03 08:45:09,970 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 359 transitions. Word has length 304 [2018-10-03 08:45:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:45:09,970 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 359 transitions. [2018-10-03 08:45:09,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-03 08:45:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2018-10-03 08:45:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-03 08:45:09,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:45:09,973 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 51, 50, 1, 1, 1] [2018-10-03 08:45:09,973 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:45:09,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:45:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash -834605638, now seen corresponding path program 55 times [2018-10-03 08:45:09,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:45:09,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:45:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:45:09,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:45:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:45:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:45:12,172 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-03 08:45:12,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:45:12,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-10-03 08:45:12,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-03 08:45:12,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-03 08:45:12,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-03 08:45:12,174 INFO L87 Difference]: Start difference. First operand 308 states and 359 transitions. Second operand 52 states. [2018-10-03 08:45:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:45:12,618 INFO L93 Difference]: Finished difference Result 457 states and 557 transitions. [2018-10-03 08:45:12,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-03 08:45:12,619 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 307 [2018-10-03 08:45:12,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:45:12,620 INFO L225 Difference]: With dead ends: 457 [2018-10-03 08:45:12,620 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 08:45:12,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-03 08:45:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 08:45:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 08:45:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 08:45:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 08:45:12,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-10-03 08:45:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:45:12,623 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 08:45:12,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-03 08:45:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 08:45:12,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 08:45:12,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 08:45:13,429 WARN L178 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 1832 DAG size of output: 407 [2018-10-03 08:45:14,158 WARN L178 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 1827 DAG size of output: 400 [2018-10-03 08:45:14,782 WARN L178 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 1832 DAG size of output: 407 [2018-10-03 08:45:19,664 WARN L178 SmtUtils]: Spent 4.85 s on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2018-10-03 08:45:21,374 WARN L178 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 400 DAG size of output: 351 [2018-10-03 08:45:23,185 WARN L178 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2018-10-03 08:45:23,190 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-10-03 08:45:23,192 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 (<= 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 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 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 (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 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 (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 (<= 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 (<= 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 (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 (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 (<= 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 (<= 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-03 08:45:23,192 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2018-10-03 08:45:23,192 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-10-03 08:45:23,192 INFO L421 ceAbstractionStarter]: At program point L26(lines 26 30) the Hoare annotation is: false [2018-10-03 08:45:23,193 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 (<= 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 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 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 (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 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 (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 (<= 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 (<= 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 (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 (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 (<= 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 (<= 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 (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 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-03 08:45:23,194 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 (<= 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 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 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 (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 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 (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 (<= 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 (<= 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 (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 (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 (<= 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 (<= 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 (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 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-03 08:45:23,194 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2018-10-03 08:45:23,225 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 08:45:23 BoogieIcfgContainer [2018-10-03 08:45:23,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:45:23,227 INFO L168 Benchmark]: Toolchain (without parser) took 95060.81 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 539.0 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -113.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-03 08:45:23,228 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-03 08:45:23,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.99 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-03 08:45:23,228 INFO L168 Benchmark]: Boogie Preprocessor took 24.10 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-03 08:45:23,229 INFO L168 Benchmark]: RCFGBuilder took 280.12 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-03 08:45:23,229 INFO L168 Benchmark]: TraceAbstraction took 94707.07 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 539.0 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -134.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-03 08:45:23,233 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.99 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 24.10 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 280.12 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 94707.07 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 539.0 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -134.5 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)) || (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 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= 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)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= 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)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (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)) || (((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)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (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_~y~4 <= 100 && 99 < main_~y~4) && 100 <= 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)) || (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 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= 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)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= 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)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (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)) || (((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)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (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_~y~4 <= 100 && 99 < main_~y~4) && 100 <= 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)) || (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 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= 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)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= 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)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (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)) || (((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)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (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, 94.6s OverallTime, 57 OverallIterations, 102 TraceHistogramMax, 17.5s AutomataDifference, 0.0s DeadEndRemovalTime, 10.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 947 SDslu, 10266 SDs, 0 SdLazy, 8094 SolverSat, 1708 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8028 GetRequests, 6199 SyntacticMatches, 2 SemanticMatches, 1827 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6900 ImplicationChecksByTransitivity, 56.0s 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, 40190 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 596 FormulaSimplificationTreeSizeReductionInter, 8.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 58.9s InterpolantComputationTime, 13339 NumberOfCodeBlocks, 12541 NumberOfCodeBlocksAsserted, 964 NumberOfCheckSat, 13227 ConstructedInterpolants, 0 QuantifiedInterpolants, 5674359 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-45-23-251.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_08-45-23-251.csv Received shutdown request...