java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:11:49,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:11:49,835 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:11:49,847 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:11:49,848 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:11:49,849 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:11:49,850 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:11:49,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:11:49,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:11:49,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:11:49,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:11:49,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:11:49,857 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:11:49,858 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:11:49,859 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:11:49,860 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:11:49,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:11:49,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:11:49,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:11:49,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:11:49,868 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:11:49,869 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:11:49,871 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:11:49,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:11:49,872 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:11:49,873 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:11:49,874 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:11:49,875 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:11:49,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:11:49,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:11:49,877 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:11:49,878 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:11:49,878 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:11:49,878 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:11:49,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:11:49,880 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:11:49,881 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-03 09:11:49,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:11:49,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:11:49,898 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:11:49,898 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:11:49,899 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:11:49,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:11:49,899 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:11:49,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:11:49,899 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:11:49,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:11:49,900 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:11:49,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:11:49,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:11:49,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:11:49,901 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:11:49,901 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:11:49,901 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:11:49,901 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:11:49,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:11:49,902 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:11:49,902 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:11:49,902 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:11:49,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:11:49,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:11:49,903 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:11:49,903 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:11:49,903 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:11:49,903 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:11:49,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:11:49,904 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:11:49,904 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:11:49,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:11:49,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:11:49,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:11:49,994 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:11:49,994 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:11:49,995 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 09:11:49,995 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl' [2018-10-03 09:11:50,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:11:50,055 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:11:50,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:11:50,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:11:50,056 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:11:50,078 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 09:11:50" (1/1) ... [2018-10-03 09:11:50,092 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 09:11:50" (1/1) ... [2018-10-03 09:11:50,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:11:50,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:11:50,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:11:50,100 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:11:50,113 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 09:11:50" (1/1) ... [2018-10-03 09:11:50,113 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 09:11:50" (1/1) ... [2018-10-03 09:11:50,114 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 09:11:50" (1/1) ... [2018-10-03 09:11:50,114 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 09:11:50" (1/1) ... [2018-10-03 09:11:50,119 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 09:11:50" (1/1) ... [2018-10-03 09:11:50,121 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 09:11:50" (1/1) ... [2018-10-03 09:11:50,122 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 09:11:50" (1/1) ... [2018-10-03 09:11:50,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:11:50,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:11:50,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:11:50,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:11:50,127 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 09:11:50" (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 09:11:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 09:11:50,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 09:11:50,429 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 09:11:50,430 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:11:50 BoogieIcfgContainer [2018-10-03 09:11:50,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:11:50,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:11:50,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:11:50,435 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:11:50,435 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 09:11:50" (1/2) ... [2018-10-03 09:11:50,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267529b4 and model type gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:11:50, skipping insertion in model container [2018-10-03 09:11:50,437 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 09:11:50" (2/2) ... [2018-10-03 09:11:50,439 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bpl [2018-10-03 09:11:50,449 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:11:50,457 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 09:11:50,503 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:11:50,504 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:11:50,504 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:11:50,504 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:11:50,505 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:11:50,505 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:11:50,505 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:11:50,505 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:11:50,505 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:11:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-03 09:11:50,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-03 09:11:50,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:50,528 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-03 09:11:50,530 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:50,536 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-03 09:11:50,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:50,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:50,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:50,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:11:50,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:50,715 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 09:11:50,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:11:50,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:11:50,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:11:50,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:11:50,744 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:50,747 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-03 09:11:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:50,865 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2018-10-03 09:11:50,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:11:50,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-03 09:11:50,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:50,881 INFO L225 Difference]: With dead ends: 14 [2018-10-03 09:11:50,881 INFO L226 Difference]: Without dead ends: 9 [2018-10-03 09:11:50,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:11:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-03 09:11:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-03 09:11:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-03 09:11:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-10-03 09:11:50,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-10-03 09:11:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:50,922 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-10-03 09:11:50,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:11:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-03 09:11:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-03 09:11:50,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:50,923 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-03 09:11:50,924 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:50,924 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1807905788, now seen corresponding path program 1 times [2018-10-03 09:11:50,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:50,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:50,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:11:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:50,987 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 09:11:50,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:50,988 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 09:11:50,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:11:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:51,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:51,220 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 09:11:51,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 09:11:51,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-03 09:11:51,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:11:51,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:11:51,251 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:51,252 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-10-03 09:11:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:51,334 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-10-03 09:11:51,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:11:51,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-03 09:11:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:51,336 INFO L225 Difference]: With dead ends: 20 [2018-10-03 09:11:51,337 INFO L226 Difference]: Without dead ends: 15 [2018-10-03 09:11:51,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 3 [2018-10-03 09:11:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-03 09:11:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-10-03 09:11:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-03 09:11:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-10-03 09:11:51,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 7 [2018-10-03 09:11:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:51,343 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-10-03 09:11:51,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:11:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-10-03 09:11:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 09:11:51,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:51,344 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1] [2018-10-03 09:11:51,344 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:51,345 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:51,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1839610074, now seen corresponding path program 1 times [2018-10-03 09:11:51,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:51,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:51,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:11:51,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:51,445 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 09:11:51,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11: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 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 09:11:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:11:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:51,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:51,570 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 09:11:51,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:51,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-03 09:11:51,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:11:51,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:11:51,593 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:51,593 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-10-03 09:11:51,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:51,716 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-10-03 09:11:51,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:11:51,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-03 09:11:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:51,717 INFO L225 Difference]: With dead ends: 24 [2018-10-03 09:11:51,717 INFO L226 Difference]: Without dead ends: 17 [2018-10-03 09:11:51,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-03 09:11:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-03 09:11:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-03 09:11:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-03 09:11:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-10-03 09:11:51,723 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-10-03 09:11:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:51,723 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-10-03 09:11:51,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:11:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-03 09:11:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 09:11:51,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:51,725 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1] [2018-10-03 09:11:51,725 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:51,725 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1731932091, now seen corresponding path program 2 times [2018-10-03 09:11:51,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:51,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:51,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:51,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:11:51,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:51,947 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 09:11:51,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:51,948 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:11:51,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:11:51,991 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:11:51,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:51,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:52,107 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 09:11:52,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:52,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-03 09:11:52,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 09:11:52,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 09:11:52,133 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:52,134 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-10-03 09:11:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:52,176 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-10-03 09:11:52,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 09:11:52,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-03 09:11:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:52,178 INFO L225 Difference]: With dead ends: 27 [2018-10-03 09:11:52,178 INFO L226 Difference]: Without dead ends: 20 [2018-10-03 09:11:52,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 4 [2018-10-03 09:11:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-03 09:11:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-03 09:11:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-03 09:11:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-10-03 09:11:52,184 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-10-03 09:11:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:52,185 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-10-03 09:11:52,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 09:11:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-10-03 09:11:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-03 09:11:52,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:52,186 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1] [2018-10-03 09:11:52,186 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:52,187 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1975221498, now seen corresponding path program 3 times [2018-10-03 09:11:52,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:52,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:52,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:52,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:52,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:52,381 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 09:11:52,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:52,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:11:52,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:11:52,401 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-03 09:11:52,402 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:52,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:52,445 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 09:11:52,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:52,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-10-03 09:11:52,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 09:11:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 09:11:52,468 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:52,469 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2018-10-03 09:11:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:52,540 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-10-03 09:11:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 09:11:52,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-10-03 09:11:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:52,544 INFO L225 Difference]: With dead ends: 34 [2018-10-03 09:11:52,544 INFO L226 Difference]: Without dead ends: 27 [2018-10-03 09:11:52,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 7 [2018-10-03 09:11:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-03 09:11:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-10-03 09:11:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-03 09:11:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-10-03 09:11:52,551 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-10-03 09:11:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:52,551 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-10-03 09:11:52,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 09:11:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-10-03 09:11:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-03 09:11:52,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:52,552 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1] [2018-10-03 09:11:52,553 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:52,553 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:52,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2006868068, now seen corresponding path program 4 times [2018-10-03 09:11:52,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:52,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:52,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:52,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:52,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:52,680 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 09:11:52,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:52,681 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 09:11:52,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:11:52,715 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:11:52,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:52,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:52,837 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 09:11:52,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:52,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 09:11:52,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 09:11:52,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 09:11:52,863 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:52,863 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2018-10-03 09:11:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:53,204 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-10-03 09:11:53,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-03 09:11:53,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-10-03 09:11:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:53,206 INFO L225 Difference]: With dead ends: 39 [2018-10-03 09:11:53,206 INFO L226 Difference]: Without dead ends: 29 [2018-10-03 09:11:53,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-03 09:11:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-03 09:11:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-03 09:11:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-03 09:11:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-03 09:11:53,213 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2018-10-03 09:11:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:53,213 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-03 09:11:53,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 09:11:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-03 09:11:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-03 09:11:53,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:53,215 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1] [2018-10-03 09:11:53,215 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:53,215 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:53,215 INFO L82 PathProgramCache]: Analyzing trace with hash -266768761, now seen corresponding path program 5 times [2018-10-03 09:11:53,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:53,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:53,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:53,425 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 09:11:53,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:53,426 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 09:11:53,440 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:11:53,459 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-03 09:11:53,460 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:53,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:53,644 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 09:11:53,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:53,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-03 09:11:53,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 09:11:53,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 09:11:53,667 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:53,668 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2018-10-03 09:11:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:53,731 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-10-03 09:11:53,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 09:11:53,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-03 09:11:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:53,733 INFO L225 Difference]: With dead ends: 42 [2018-10-03 09:11:53,734 INFO L226 Difference]: Without dead ends: 32 [2018-10-03 09:11:53,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 7 [2018-10-03 09:11:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-03 09:11:53,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-03 09:11:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-03 09:11:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-03 09:11:53,741 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2018-10-03 09:11:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:53,741 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-03 09:11:53,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 09:11:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-10-03 09:11:53,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-03 09:11:53,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:53,743 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 7, 2, 1, 1, 1] [2018-10-03 09:11:53,743 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:53,743 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:53,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1223576644, now seen corresponding path program 6 times [2018-10-03 09:11:53,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:53,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:53,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:53,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:53,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:53,917 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 09:11:53,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:53,918 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:11:53,927 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:11:53,948 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-03 09:11:53,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:53,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:54,050 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 09:11:54,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:54,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2018-10-03 09:11:54,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 09:11:54,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 09:11:54,083 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:54,083 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 13 states. [2018-10-03 09:11:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:54,219 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-10-03 09:11:54,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 09:11:54,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-10-03 09:11:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:54,222 INFO L225 Difference]: With dead ends: 49 [2018-10-03 09:11:54,222 INFO L226 Difference]: Without dead ends: 39 [2018-10-03 09:11:54,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-03 09:11:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-03 09:11:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-03 09:11:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-03 09:11:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-10-03 09:11:54,229 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 31 [2018-10-03 09:11:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:54,230 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-10-03 09:11:54,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 09:11:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-10-03 09:11:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-03 09:11:54,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:54,231 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1] [2018-10-03 09:11:54,232 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:54,232 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1547890150, now seen corresponding path program 7 times [2018-10-03 09:11:54,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:54,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:54,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:54,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:54,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:54,398 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 09:11:54,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:54,399 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 09:11:54,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:11:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:54,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:54,507 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 09:11:54,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:54,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-03 09:11:54,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 09:11:54,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 09:11:54,529 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:54,529 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2018-10-03 09:11:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:54,617 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-10-03 09:11:54,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-03 09:11:54,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-03 09:11:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:54,619 INFO L225 Difference]: With dead ends: 54 [2018-10-03 09:11:54,619 INFO L226 Difference]: Without dead ends: 41 [2018-10-03 09:11:54,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-03 09:11:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-03 09:11:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-03 09:11:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-03 09:11:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-03 09:11:54,634 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2018-10-03 09:11:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:54,635 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-03 09:11:54,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 09:11:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-03 09:11:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-03 09:11:54,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:54,639 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1] [2018-10-03 09:11:54,640 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:54,640 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1837705083, now seen corresponding path program 8 times [2018-10-03 09:11:54,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:54,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:54,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:54,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:11:54,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:54,870 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 09:11:54,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:54,872 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 09:11:54,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:11:54,901 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:11:54,901 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:54,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:55,012 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 09:11:55,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:55,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-03 09:11:55,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-03 09:11:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-03 09:11:55,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:55,034 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-10-03 09:11:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:55,098 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-10-03 09:11:55,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-03 09:11:55,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-10-03 09:11:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:55,099 INFO L225 Difference]: With dead ends: 57 [2018-10-03 09:11:55,099 INFO L226 Difference]: Without dead ends: 44 [2018-10-03 09:11:55,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 10 [2018-10-03 09:11:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-03 09:11:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-03 09:11:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-03 09:11:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-10-03 09:11:55,108 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 40 [2018-10-03 09:11:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:55,108 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-10-03 09:11:55,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-03 09:11:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-10-03 09:11:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-03 09:11:55,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:55,110 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 10, 3, 1, 1, 1] [2018-10-03 09:11:55,110 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:55,110 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1464858170, now seen corresponding path program 9 times [2018-10-03 09:11:55,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:55,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:55,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:55,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:55,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:55,248 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 09:11:55,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:55,248 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 09:11:55,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:11:55,269 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-03 09:11:55,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:55,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:55,340 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 09:11:55,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:55,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2018-10-03 09:11:55,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 09:11:55,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 09:11:55,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:55,364 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 17 states. [2018-10-03 09:11:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:55,482 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-10-03 09:11:55,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 09:11:55,482 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-10-03 09:11:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:55,483 INFO L225 Difference]: With dead ends: 64 [2018-10-03 09:11:55,483 INFO L226 Difference]: Without dead ends: 51 [2018-10-03 09:11:55,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 15 [2018-10-03 09:11:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-03 09:11:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-03 09:11:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-03 09:11:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-10-03 09:11:55,494 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 43 [2018-10-03 09:11:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:55,495 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-10-03 09:11:55,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 09:11:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-10-03 09:11:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-03 09:11:55,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:55,496 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 11, 4, 1, 1, 1] [2018-10-03 09:11:55,497 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:55,497 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash 469061468, now seen corresponding path program 10 times [2018-10-03 09:11:55,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:55,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:55,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:55,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:55,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:55,683 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 09:11:55,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:55,683 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 09:11:55,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:11:55,733 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:11:55,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:55,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:55,981 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 09:11:56,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:56,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-03 09:11:56,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 09:11:56,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 09:11:56,003 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:56,003 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 14 states. [2018-10-03 09:11:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:56,080 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-10-03 09:11:56,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-03 09:11:56,082 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-10-03 09:11:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:56,084 INFO L225 Difference]: With dead ends: 69 [2018-10-03 09:11:56,084 INFO L226 Difference]: Without dead ends: 53 [2018-10-03 09:11:56,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 12 [2018-10-03 09:11:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-03 09:11:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-03 09:11:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-03 09:11:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-10-03 09:11:56,092 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 49 [2018-10-03 09:11:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:56,092 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-10-03 09:11:56,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 09:11:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-10-03 09:11:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-03 09:11:56,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:56,093 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1] [2018-10-03 09:11:56,094 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:56,094 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash -990261945, now seen corresponding path program 11 times [2018-10-03 09:11:56,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:56,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:56,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:56,235 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 09:11:56,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:56,235 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 09:11:56,259 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:11:56,306 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-10-03 09:11:56,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:56,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:56,454 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 09:11:56,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:56,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-03 09:11:56,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 09:11:56,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 09:11:56,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:56,477 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 15 states. [2018-10-03 09:11:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:56,550 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-10-03 09:11:56,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-03 09:11:56,550 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-10-03 09:11:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:56,551 INFO L225 Difference]: With dead ends: 72 [2018-10-03 09:11:56,551 INFO L226 Difference]: Without dead ends: 56 [2018-10-03 09:11:56,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 13 [2018-10-03 09:11:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-03 09:11:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-03 09:11:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-03 09:11:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-10-03 09:11:56,559 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 52 [2018-10-03 09:11:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:56,559 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-03 09:11:56,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 09:11:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-10-03 09:11:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-03 09:11:56,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:56,560 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 13, 4, 1, 1, 1] [2018-10-03 09:11:56,561 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:56,561 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2035088516, now seen corresponding path program 12 times [2018-10-03 09:11:56,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:56,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:56,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:56,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:56,821 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 09:11:56,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:56,822 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:11:56,832 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:11:57,021 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-10-03 09:11:57,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:57,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:57,410 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 09:11:57,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:57,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 21 [2018-10-03 09:11:57,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-03 09:11:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-03 09:11:57,430 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:57,430 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 21 states. [2018-10-03 09:11:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:57,551 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-10-03 09:11:57,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 09:11:57,551 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-10-03 09:11:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:57,552 INFO L225 Difference]: With dead ends: 79 [2018-10-03 09:11:57,552 INFO L226 Difference]: Without dead ends: 63 [2018-10-03 09:11:57,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 19 [2018-10-03 09:11:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-03 09:11:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-03 09:11:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-03 09:11:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-10-03 09:11:57,563 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 55 [2018-10-03 09:11:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:57,564 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-10-03 09:11:57,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-03 09:11:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-10-03 09:11:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-03 09:11:57,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:57,565 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 14, 5, 1, 1, 1] [2018-10-03 09:11:57,566 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:57,566 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:57,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1900338010, now seen corresponding path program 13 times [2018-10-03 09:11:57,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:57,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:57,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:57,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:57,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:57,779 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 09:11:57,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:57,779 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 09:11:57,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:11:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:57,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:58,323 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 09:11:58,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:58,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-03 09:11:58,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 09:11:58,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 09:11:58,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:58,344 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 17 states. [2018-10-03 09:11:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:58,553 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-10-03 09:11:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 09:11:58,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-10-03 09:11:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:58,555 INFO L225 Difference]: With dead ends: 84 [2018-10-03 09:11:58,555 INFO L226 Difference]: Without dead ends: 65 [2018-10-03 09:11:58,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.0s impTime 15 [2018-10-03 09:11:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-03 09:11:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-03 09:11:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-03 09:11:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-10-03 09:11:58,563 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 61 [2018-10-03 09:11:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:58,563 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-10-03 09:11:58,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 09:11:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-10-03 09:11:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-03 09:11:58,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:58,567 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 15, 5, 1, 1, 1] [2018-10-03 09:11:58,567 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:58,567 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1598238523, now seen corresponding path program 14 times [2018-10-03 09:11:58,568 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:58,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:58,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:58,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:11:58,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:58,810 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 09:11:58,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:58,810 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 09:11:58,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:11:58,837 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:11:58,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:58,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:58,980 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 09:11:59,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:59,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-03 09:11:59,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 09:11:59,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 09:11:59,002 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:59,002 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 18 states. [2018-10-03 09:11:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:59,173 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-10-03 09:11:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-03 09:11:59,173 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-10-03 09:11:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:59,174 INFO L225 Difference]: With dead ends: 87 [2018-10-03 09:11:59,174 INFO L226 Difference]: Without dead ends: 68 [2018-10-03 09:11:59,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-03 09:11:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-03 09:11:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-03 09:11:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-03 09:11:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-10-03 09:11:59,183 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 64 [2018-10-03 09:11:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:11:59,183 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-10-03 09:11:59,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 09:11:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-10-03 09:11:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-03 09:11:59,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:11:59,185 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 16, 5, 1, 1, 1] [2018-10-03 09:11:59,185 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:11:59,185 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:11:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1720361094, now seen corresponding path program 15 times [2018-10-03 09:11:59,185 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:11:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:11:59,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:59,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:11:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:11:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:11:59,537 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 09:11:59,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:11:59,537 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 09:11:59,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:11:59,562 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-03 09:11:59,562 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:11:59,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:11:59,719 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 09:11:59,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:11:59,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 25 [2018-10-03 09:11:59,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-03 09:11:59,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-03 09:11:59,740 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:11:59,740 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 25 states. [2018-10-03 09:11:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:11:59,998 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2018-10-03 09:11:59,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-03 09:11:59,998 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-10-03 09:11:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:11:59,999 INFO L225 Difference]: With dead ends: 94 [2018-10-03 09:11:59,999 INFO L226 Difference]: Without dead ends: 75 [2018-10-03 09:11:59,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 23 [2018-10-03 09:12:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-03 09:12:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-03 09:12:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-03 09:12:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-10-03 09:12:00,005 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 67 [2018-10-03 09:12:00,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:00,005 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-10-03 09:12:00,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-03 09:12:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-10-03 09:12:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-03 09:12:00,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:00,007 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 17, 6, 1, 1, 1] [2018-10-03 09:12:00,007 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:00,007 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash -867234020, now seen corresponding path program 16 times [2018-10-03 09:12:00,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:00,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:00,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:00,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:00,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:00,389 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 09:12:00,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:00,390 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 09:12:00,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:12:00,424 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:12:00,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:00,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:00,579 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 09:12:00,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:00,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-03 09:12:00,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-03 09:12:00,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-03 09:12:00,600 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:00,600 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 20 states. [2018-10-03 09:12:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:00,671 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-10-03 09:12:00,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-03 09:12:00,672 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2018-10-03 09:12:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:00,673 INFO L225 Difference]: With dead ends: 99 [2018-10-03 09:12:00,673 INFO L226 Difference]: Without dead ends: 77 [2018-10-03 09:12:00,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-03 09:12:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-03 09:12:00,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-03 09:12:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-03 09:12:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-10-03 09:12:00,678 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 73 [2018-10-03 09:12:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:00,679 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-10-03 09:12:00,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-03 09:12:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-10-03 09:12:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-03 09:12:00,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:00,680 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 18, 6, 1, 1, 1] [2018-10-03 09:12:00,680 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:00,681 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:00,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1757201401, now seen corresponding path program 17 times [2018-10-03 09:12:00,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:00,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:00,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:00,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:00,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:01,510 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 09:12:01,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:01,511 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 09:12:01,519 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:12:01,593 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-03 09:12:01,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:01,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:01,845 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 09:12:01,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:01,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-03 09:12:01,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-03 09:12:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-03 09:12:01,867 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:01,867 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 21 states. [2018-10-03 09:12:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:01,938 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-10-03 09:12:01,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 09:12:01,939 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-10-03 09:12:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:01,940 INFO L225 Difference]: With dead ends: 102 [2018-10-03 09:12:01,940 INFO L226 Difference]: Without dead ends: 80 [2018-10-03 09:12:01,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.5s impTime 19 [2018-10-03 09:12:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-03 09:12:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-03 09:12:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-03 09:12:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-10-03 09:12:01,944 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 76 [2018-10-03 09:12:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:01,944 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-10-03 09:12:01,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-03 09:12:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-10-03 09:12:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-03 09:12:01,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:01,945 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 19, 6, 1, 1, 1] [2018-10-03 09:12:01,946 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:01,946 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:01,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1942330564, now seen corresponding path program 18 times [2018-10-03 09:12:01,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:01,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:01,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:01,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:01,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:02,194 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 09:12:02,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:02,195 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 09:12:02,202 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:12:02,234 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-10-03 09:12:02,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:02,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:02,365 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 09:12:02,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:02,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 29 [2018-10-03 09:12:02,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-03 09:12:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-03 09:12:02,388 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:02,388 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 29 states. [2018-10-03 09:12:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:02,538 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2018-10-03 09:12:02,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-03 09:12:02,538 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-10-03 09:12:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:02,539 INFO L225 Difference]: With dead ends: 109 [2018-10-03 09:12:02,540 INFO L226 Difference]: Without dead ends: 87 [2018-10-03 09:12:02,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 27 [2018-10-03 09:12:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-03 09:12:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-10-03 09:12:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-03 09:12:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-10-03 09:12:02,547 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 79 [2018-10-03 09:12:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:02,547 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-10-03 09:12:02,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-03 09:12:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-10-03 09:12:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-03 09:12:02,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:02,549 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 20, 7, 1, 1, 1] [2018-10-03 09:12:02,549 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:02,549 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:02,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1524001638, now seen corresponding path program 19 times [2018-10-03 09:12:02,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:02,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:02,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:02,918 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 09:12:02,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:02,918 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:02,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:02,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:03,065 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 09:12:03,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:03,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-03 09:12:03,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-03 09:12:03,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-03 09:12:03,085 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:03,086 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 23 states. [2018-10-03 09:12:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:03,216 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-10-03 09:12:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 09:12:03,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-10-03 09:12:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:03,218 INFO L225 Difference]: With dead ends: 114 [2018-10-03 09:12:03,219 INFO L226 Difference]: Without dead ends: 89 [2018-10-03 09:12:03,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 21 [2018-10-03 09:12:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-03 09:12:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-03 09:12:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-03 09:12:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-10-03 09:12:03,224 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 85 [2018-10-03 09:12:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:03,224 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-10-03 09:12:03,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-03 09:12:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-10-03 09:12:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-03 09:12:03,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:03,225 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 21, 7, 1, 1, 1] [2018-10-03 09:12:03,226 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:03,226 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:03,226 INFO L82 PathProgramCache]: Analyzing trace with hash 427997445, now seen corresponding path program 20 times [2018-10-03 09:12:03,226 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:03,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:03,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:03,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:03,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:03,503 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 09:12:03,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:03,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:03,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:12:03,533 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:12:03,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:03,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:03,649 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 09:12:03,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:03,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-03 09:12:03,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-03 09:12:03,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-03 09:12:03,671 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:03,671 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 24 states. [2018-10-03 09:12:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:03,812 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2018-10-03 09:12:03,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 09:12:03,815 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2018-10-03 09:12:03,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:03,816 INFO L225 Difference]: With dead ends: 117 [2018-10-03 09:12:03,817 INFO L226 Difference]: Without dead ends: 92 [2018-10-03 09:12:03,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 22 [2018-10-03 09:12:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-03 09:12:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-10-03 09:12:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-03 09:12:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-10-03 09:12:03,821 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 88 [2018-10-03 09:12:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:03,821 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-10-03 09:12:03,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-03 09:12:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-10-03 09:12:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-03 09:12:03,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:03,822 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 22, 7, 1, 1, 1] [2018-10-03 09:12:03,823 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:03,823 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1424508742, now seen corresponding path program 21 times [2018-10-03 09:12:03,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:03,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:03,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:04,096 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 09:12:04,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:04,096 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 09:12:04,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:12:04,125 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-03 09:12:04,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:04,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:04,285 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 09:12:04,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:04,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 33 [2018-10-03 09:12:04,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-03 09:12:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-03 09:12:04,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:04,308 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 33 states. [2018-10-03 09:12:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:04,494 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2018-10-03 09:12:04,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-03 09:12:04,494 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 91 [2018-10-03 09:12:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:04,495 INFO L225 Difference]: With dead ends: 124 [2018-10-03 09:12:04,496 INFO L226 Difference]: Without dead ends: 99 [2018-10-03 09:12:04,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 31 [2018-10-03 09:12:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-03 09:12:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-10-03 09:12:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-03 09:12:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-10-03 09:12:04,503 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 91 [2018-10-03 09:12:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:04,503 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-10-03 09:12:04,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-03 09:12:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-10-03 09:12:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-03 09:12:04,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:04,504 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 23, 8, 1, 1, 1] [2018-10-03 09:12:04,504 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:04,505 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash 201514716, now seen corresponding path program 22 times [2018-10-03 09:12:04,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:04,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:04,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:04,861 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 09:12:04,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:04,861 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 09:12:04,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:12:04,895 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:12:04,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:04,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:05,085 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 09:12:05,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:05,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-03 09:12:05,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-03 09:12:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-03 09:12:05,108 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:05,108 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 26 states. [2018-10-03 09:12:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:05,230 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2018-10-03 09:12:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-03 09:12:05,230 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2018-10-03 09:12:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:05,231 INFO L225 Difference]: With dead ends: 129 [2018-10-03 09:12:05,231 INFO L226 Difference]: Without dead ends: 101 [2018-10-03 09:12:05,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 24 [2018-10-03 09:12:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-03 09:12:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-03 09:12:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-03 09:12:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-10-03 09:12:05,237 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 97 [2018-10-03 09:12:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:05,237 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-10-03 09:12:05,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-03 09:12:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-10-03 09:12:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-03 09:12:05,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:05,238 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 24, 8, 1, 1, 1] [2018-10-03 09:12:05,238 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:05,238 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:05,238 INFO L82 PathProgramCache]: Analyzing trace with hash -527844665, now seen corresponding path program 23 times [2018-10-03 09:12:05,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:05,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:05,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:05,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:05,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:05,689 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 09:12:05,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:05,689 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 09:12:05,696 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:12:05,747 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-10-03 09:12:05,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:05,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:05,891 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 09:12:05,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:05,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-03 09:12:05,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-03 09:12:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-03 09:12:05,912 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:05,912 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 27 states. [2018-10-03 09:12:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:06,037 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-10-03 09:12:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 09:12:06,037 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2018-10-03 09:12:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:06,039 INFO L225 Difference]: With dead ends: 132 [2018-10-03 09:12:06,039 INFO L226 Difference]: Without dead ends: 104 [2018-10-03 09:12:06,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 25 [2018-10-03 09:12:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-03 09:12:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-03 09:12:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-03 09:12:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-10-03 09:12:06,045 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 100 [2018-10-03 09:12:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:06,046 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-10-03 09:12:06,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-03 09:12:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-10-03 09:12:06,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-03 09:12:06,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:06,047 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 25, 8, 1, 1, 1] [2018-10-03 09:12:06,047 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:06,047 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:06,047 INFO L82 PathProgramCache]: Analyzing trace with hash -633613572, now seen corresponding path program 24 times [2018-10-03 09:12:06,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:06,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:06,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:06,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:06,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:06,557 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 09:12:06,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:06,557 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 09:12:06,565 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:12:06,609 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-10-03 09:12:06,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:06,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:06,772 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 09:12:06,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:06,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11] total 37 [2018-10-03 09:12:06,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-03 09:12:06,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-03 09:12:06,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:06,793 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 37 states. [2018-10-03 09:12:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:06,989 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-10-03 09:12:06,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-03 09:12:06,990 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 103 [2018-10-03 09:12:06,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:06,991 INFO L225 Difference]: With dead ends: 139 [2018-10-03 09:12:06,991 INFO L226 Difference]: Without dead ends: 111 [2018-10-03 09:12:06,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 35 [2018-10-03 09:12:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-03 09:12:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-10-03 09:12:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-03 09:12:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2018-10-03 09:12:06,998 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 103 [2018-10-03 09:12:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:06,998 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2018-10-03 09:12:06,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-03 09:12:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2018-10-03 09:12:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-03 09:12:06,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:06,999 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 26, 9, 1, 1, 1] [2018-10-03 09:12:06,999 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:06,999 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash 223821274, now seen corresponding path program 25 times [2018-10-03 09:12:06,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:06,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:07,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:07,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:07,565 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 09:12:07,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:07,566 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 09:12:07,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:07,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:07,760 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 09:12:07,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:07,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-03 09:12:07,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-03 09:12:07,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-03 09:12:07,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:07,781 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 29 states. [2018-10-03 09:12:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:07,911 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2018-10-03 09:12:07,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-03 09:12:07,912 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-10-03 09:12:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:07,913 INFO L225 Difference]: With dead ends: 144 [2018-10-03 09:12:07,913 INFO L226 Difference]: Without dead ends: 113 [2018-10-03 09:12:07,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 27 [2018-10-03 09:12:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-03 09:12:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-10-03 09:12:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-03 09:12:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-10-03 09:12:07,920 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 109 [2018-10-03 09:12:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:07,920 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-10-03 09:12:07,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-03 09:12:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-10-03 09:12:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-03 09:12:07,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:07,921 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 27, 9, 1, 1, 1] [2018-10-03 09:12:07,921 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:07,921 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1370788165, now seen corresponding path program 26 times [2018-10-03 09:12:07,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:07,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:07,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:08,334 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 09:12:08,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:08,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:08,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:12:08,368 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:12:08,369 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:08,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:08,534 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 09:12:08,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:08,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-03 09:12:08,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-03 09:12:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-03 09:12:08,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:08,555 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 30 states. [2018-10-03 09:12:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:08,734 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2018-10-03 09:12:08,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-03 09:12:08,735 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2018-10-03 09:12:08,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:08,736 INFO L225 Difference]: With dead ends: 147 [2018-10-03 09:12:08,736 INFO L226 Difference]: Without dead ends: 116 [2018-10-03 09:12:08,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 28 [2018-10-03 09:12:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-03 09:12:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-10-03 09:12:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-03 09:12:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-10-03 09:12:08,742 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 112 [2018-10-03 09:12:08,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:08,743 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-10-03 09:12:08,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-03 09:12:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-10-03 09:12:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-03 09:12:08,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:08,744 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 28, 9, 1, 1, 1] [2018-10-03 09:12:08,744 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:08,744 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:08,744 INFO L82 PathProgramCache]: Analyzing trace with hash -98369030, now seen corresponding path program 27 times [2018-10-03 09:12:08,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:08,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:08,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:08,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:08,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:10,767 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 09:12:10,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:10,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:12:10,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:12:10,800 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-03 09:12:10,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:10,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:10,937 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 09:12:10,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:10,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12] total 41 [2018-10-03 09:12:10,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-03 09:12:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-03 09:12:10,958 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:10,958 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 41 states. [2018-10-03 09:12:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:11,162 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-10-03 09:12:11,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-03 09:12:11,162 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 115 [2018-10-03 09:12:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:11,163 INFO L225 Difference]: With dead ends: 154 [2018-10-03 09:12:11,164 INFO L226 Difference]: Without dead ends: 123 [2018-10-03 09:12:11,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.6s impTime 39 [2018-10-03 09:12:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-03 09:12:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-10-03 09:12:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-03 09:12:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-10-03 09:12:11,171 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 115 [2018-10-03 09:12:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:11,171 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-10-03 09:12:11,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-03 09:12:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-10-03 09:12:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-03 09:12:11,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:11,172 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 29, 10, 1, 1, 1] [2018-10-03 09:12:11,172 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:11,172 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:11,172 INFO L82 PathProgramCache]: Analyzing trace with hash -291193188, now seen corresponding path program 28 times [2018-10-03 09:12:11,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:11,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:11,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:11,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:11,656 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 09:12:11,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:11,656 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 09:12:11,664 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:12:11,693 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:12:11,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:11,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:12,016 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 09:12:12,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:12,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-03 09:12:12,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-03 09:12:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-03 09:12:12,037 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:12,037 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 32 states. [2018-10-03 09:12:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:12,158 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2018-10-03 09:12:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-03 09:12:12,158 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 121 [2018-10-03 09:12:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:12,160 INFO L225 Difference]: With dead ends: 159 [2018-10-03 09:12:12,160 INFO L226 Difference]: Without dead ends: 125 [2018-10-03 09:12:12,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.3s impTime 30 [2018-10-03 09:12:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-03 09:12:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-10-03 09:12:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-03 09:12:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-10-03 09:12:12,167 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 121 [2018-10-03 09:12:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:12,167 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-10-03 09:12:12,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-03 09:12:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-10-03 09:12:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-03 09:12:12,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:12,168 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 30, 10, 1, 1, 1] [2018-10-03 09:12:12,168 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:12,168 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:12,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1151252089, now seen corresponding path program 29 times [2018-10-03 09:12:12,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:12,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:12,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:12,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:12,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:12,870 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 09:12:12,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:12,871 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 09:12:12,880 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:12:12,948 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2018-10-03 09:12:12,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:12,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:13,182 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 09:12:13,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:13,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-03 09:12:13,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-03 09:12:13,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-03 09:12:13,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:13,204 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 33 states. [2018-10-03 09:12:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:13,338 INFO L93 Difference]: Finished difference Result 162 states and 183 transitions. [2018-10-03 09:12:13,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-03 09:12:13,339 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-10-03 09:12:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:13,340 INFO L225 Difference]: With dead ends: 162 [2018-10-03 09:12:13,340 INFO L226 Difference]: Without dead ends: 128 [2018-10-03 09:12:13,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 31 [2018-10-03 09:12:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-03 09:12:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-10-03 09:12:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-03 09:12:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-10-03 09:12:13,345 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 124 [2018-10-03 09:12:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:13,346 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-10-03 09:12:13,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-03 09:12:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-10-03 09:12:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-03 09:12:13,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:13,347 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 31, 10, 1, 1, 1] [2018-10-03 09:12:13,347 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:13,347 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:13,347 INFO L82 PathProgramCache]: Analyzing trace with hash 608916156, now seen corresponding path program 30 times [2018-10-03 09:12:13,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:13,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:13,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:13,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:13,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:13,930 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 09:12:13,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:13,930 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:13,938 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:12:13,993 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2018-10-03 09:12:13,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:13,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:14,198 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 09:12:14,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:14,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13] total 45 [2018-10-03 09:12:14,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-03 09:12:14,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-03 09:12:14,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:14,220 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 45 states. [2018-10-03 09:12:14,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:14,491 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2018-10-03 09:12:14,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-03 09:12:14,491 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 127 [2018-10-03 09:12:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:14,493 INFO L225 Difference]: With dead ends: 169 [2018-10-03 09:12:14,493 INFO L226 Difference]: Without dead ends: 135 [2018-10-03 09:12:14,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 43 [2018-10-03 09:12:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-03 09:12:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-10-03 09:12:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-03 09:12:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-10-03 09:12:14,500 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 127 [2018-10-03 09:12:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:14,500 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-10-03 09:12:14,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-03 09:12:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-10-03 09:12:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-03 09:12:14,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:14,501 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 32, 11, 1, 1, 1] [2018-10-03 09:12:14,501 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:14,501 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash 918148890, now seen corresponding path program 31 times [2018-10-03 09:12:14,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:14,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:14,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:14,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:14,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:14,921 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 09:12:14,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:14,921 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 09:12:14,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:14,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:15,156 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 09:12:15,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:15,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-03 09:12:15,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-03 09:12:15,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-03 09:12:15,177 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:15,177 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 35 states. [2018-10-03 09:12:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:15,332 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2018-10-03 09:12:15,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-03 09:12:15,332 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-10-03 09:12:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:15,333 INFO L225 Difference]: With dead ends: 174 [2018-10-03 09:12:15,333 INFO L226 Difference]: Without dead ends: 137 [2018-10-03 09:12:15,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 33 [2018-10-03 09:12:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-03 09:12:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-10-03 09:12:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-03 09:12:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-10-03 09:12:15,339 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 133 [2018-10-03 09:12:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:15,340 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-10-03 09:12:15,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-03 09:12:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-10-03 09:12:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-03 09:12:15,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:15,341 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 33, 11, 1, 1, 1] [2018-10-03 09:12:15,341 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:15,341 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:15,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1564367237, now seen corresponding path program 32 times [2018-10-03 09:12:15,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:15,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:15,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:15,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:15,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:15,948 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 09:12:15,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:15,948 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:15,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:12:15,990 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:12:15,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:15,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:16,154 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 09:12:16,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:16,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-03 09:12:16,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-03 09:12:16,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-03 09:12:16,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:16,176 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 36 states. [2018-10-03 09:12:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:16,550 INFO L93 Difference]: Finished difference Result 177 states and 200 transitions. [2018-10-03 09:12:16,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-03 09:12:16,550 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 136 [2018-10-03 09:12:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:16,552 INFO L225 Difference]: With dead ends: 177 [2018-10-03 09:12:16,552 INFO L226 Difference]: Without dead ends: 140 [2018-10-03 09:12:16,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 34 [2018-10-03 09:12:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-03 09:12:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-10-03 09:12:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-03 09:12:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-10-03 09:12:16,559 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 136 [2018-10-03 09:12:16,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:16,560 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-10-03 09:12:16,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-03 09:12:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-10-03 09:12:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-03 09:12:16,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:16,561 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 34, 11, 1, 1, 1] [2018-10-03 09:12:16,561 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:16,561 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:16,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1283245254, now seen corresponding path program 33 times [2018-10-03 09:12:16,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:16,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:16,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:16,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:17,908 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 09:12:17,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:17,908 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 09:12:17,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:12:17,948 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-03 09:12:17,949 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:17,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:18,795 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 09:12:18,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:18,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14] total 49 [2018-10-03 09:12:18,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-03 09:12:18,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-03 09:12:18,817 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:18,817 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 49 states. [2018-10-03 09:12:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:19,088 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2018-10-03 09:12:19,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-03 09:12:19,089 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 139 [2018-10-03 09:12:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:19,090 INFO L225 Difference]: With dead ends: 184 [2018-10-03 09:12:19,090 INFO L226 Difference]: Without dead ends: 147 [2018-10-03 09:12:19,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.4s impTime 47 [2018-10-03 09:12:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-03 09:12:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-10-03 09:12:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-03 09:12:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-10-03 09:12:19,098 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 139 [2018-10-03 09:12:19,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:19,099 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-10-03 09:12:19,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-03 09:12:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-10-03 09:12:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-03 09:12:19,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:19,100 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 35, 12, 1, 1, 1] [2018-10-03 09:12:19,100 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:19,100 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:19,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1757982300, now seen corresponding path program 34 times [2018-10-03 09:12:19,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:19,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:19,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:19,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:19,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:19,862 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 09:12:19,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:19,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:19,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:12:19,907 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:12:19,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:19,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:20,100 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 09:12:20,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:20,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-03 09:12:20,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-03 09:12:20,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-03 09:12:20,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:20,121 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 38 states. [2018-10-03 09:12:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:20,450 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2018-10-03 09:12:20,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-03 09:12:20,450 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 145 [2018-10-03 09:12:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:20,452 INFO L225 Difference]: With dead ends: 189 [2018-10-03 09:12:20,452 INFO L226 Difference]: Without dead ends: 149 [2018-10-03 09:12:20,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 36 [2018-10-03 09:12:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-03 09:12:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-10-03 09:12:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-03 09:12:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2018-10-03 09:12:20,460 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 145 [2018-10-03 09:12:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:20,460 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2018-10-03 09:12:20,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-03 09:12:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2018-10-03 09:12:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-03 09:12:20,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:20,462 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 36, 12, 1, 1, 1] [2018-10-03 09:12:20,462 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:20,462 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:20,462 INFO L82 PathProgramCache]: Analyzing trace with hash 593356871, now seen corresponding path program 35 times [2018-10-03 09:12:20,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:20,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:20,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:20,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:20,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:21,472 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 09:12:21,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:21,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 09:12:21,480 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:12:22,066 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-03 09:12:22,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:22,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:22,644 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 09:12:22,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:22,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-03 09:12:22,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-03 09:12:22,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-03 09:12:22,665 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:22,666 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand 39 states. [2018-10-03 09:12:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:22,920 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-10-03 09:12:22,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-03 09:12:22,920 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2018-10-03 09:12:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:22,922 INFO L225 Difference]: With dead ends: 192 [2018-10-03 09:12:22,922 INFO L226 Difference]: Without dead ends: 152 [2018-10-03 09:12:22,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.7s impTime 37 [2018-10-03 09:12:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-03 09:12:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-10-03 09:12:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-03 09:12:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-10-03 09:12:22,929 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 148 [2018-10-03 09:12:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:22,930 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-10-03 09:12:22,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-03 09:12:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2018-10-03 09:12:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-03 09:12:22,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:22,931 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 37, 12, 1, 1, 1] [2018-10-03 09:12:22,931 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:22,931 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash -16981380, now seen corresponding path program 36 times [2018-10-03 09:12:22,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:22,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:22,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:22,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:22,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:23,923 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 09:12:23,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:23,923 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 09:12:23,931 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:12:23,989 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-10-03 09:12:23,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:23,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:24,347 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 09:12:24,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:24,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 53 [2018-10-03 09:12:24,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-03 09:12:24,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-03 09:12:24,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:24,378 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 53 states. [2018-10-03 09:12:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:24,703 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2018-10-03 09:12:24,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-03 09:12:24,704 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 151 [2018-10-03 09:12:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:24,705 INFO L225 Difference]: With dead ends: 199 [2018-10-03 09:12:24,705 INFO L226 Difference]: Without dead ends: 159 [2018-10-03 09:12:24,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 51 [2018-10-03 09:12:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-03 09:12:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-10-03 09:12:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-03 09:12:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-10-03 09:12:24,714 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 151 [2018-10-03 09:12:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:24,714 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-10-03 09:12:24,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-03 09:12:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-10-03 09:12:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-03 09:12:24,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:24,716 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 38, 13, 1, 1, 1] [2018-10-03 09:12:24,716 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:24,716 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash 758997082, now seen corresponding path program 37 times [2018-10-03 09:12:24,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:24,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:24,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:24,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:26,139 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 09:12:26,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:26,139 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:26,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:26,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:26,375 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 09:12:26,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:26,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-03 09:12:26,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-03 09:12:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-03 09:12:26,405 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:26,405 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 41 states. [2018-10-03 09:12:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:26,643 INFO L93 Difference]: Finished difference Result 204 states and 231 transitions. [2018-10-03 09:12:26,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-03 09:12:26,643 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 157 [2018-10-03 09:12:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:26,645 INFO L225 Difference]: With dead ends: 204 [2018-10-03 09:12:26,645 INFO L226 Difference]: Without dead ends: 161 [2018-10-03 09:12:26,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime 39 [2018-10-03 09:12:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-03 09:12:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-10-03 09:12:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-03 09:12:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2018-10-03 09:12:26,652 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 157 [2018-10-03 09:12:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:26,653 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2018-10-03 09:12:26,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-03 09:12:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2018-10-03 09:12:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-03 09:12:26,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:26,654 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 39, 13, 1, 1, 1] [2018-10-03 09:12:26,654 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:26,654 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:26,654 INFO L82 PathProgramCache]: Analyzing trace with hash -821292603, now seen corresponding path program 38 times [2018-10-03 09:12:26,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:26,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:26,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:26,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:26,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:27,736 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 09:12:27,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:27,736 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 09:12:27,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:12:27,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:12:27,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:27,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:28,030 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 09:12:28,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:28,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-03 09:12:28,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-03 09:12:28,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-03 09:12:28,051 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:28,051 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand 42 states. [2018-10-03 09:12:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:28,178 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2018-10-03 09:12:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-03 09:12:28,179 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-10-03 09:12:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:28,181 INFO L225 Difference]: With dead ends: 207 [2018-10-03 09:12:28,181 INFO L226 Difference]: Without dead ends: 164 [2018-10-03 09:12:28,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 40 [2018-10-03 09:12:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-03 09:12:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-10-03 09:12:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-03 09:12:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2018-10-03 09:12:28,189 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 160 [2018-10-03 09:12:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:28,189 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2018-10-03 09:12:28,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-03 09:12:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2018-10-03 09:12:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-03 09:12:28,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:28,191 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 40, 13, 1, 1, 1] [2018-10-03 09:12:28,191 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:28,191 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:28,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2094766982, now seen corresponding path program 39 times [2018-10-03 09:12:28,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:28,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:28,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:30,002 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 09:12:30,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:30,003 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:30,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:12:30,044 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-03 09:12:30,045 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:30,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:30,779 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 09:12:30,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:30,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 16] total 57 [2018-10-03 09:12:30,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-03 09:12:30,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-03 09:12:30,800 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:30,800 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand 57 states. [2018-10-03 09:12:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:31,316 INFO L93 Difference]: Finished difference Result 214 states and 244 transitions. [2018-10-03 09:12:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-03 09:12:31,317 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 163 [2018-10-03 09:12:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:31,318 INFO L225 Difference]: With dead ends: 214 [2018-10-03 09:12:31,318 INFO L226 Difference]: Without dead ends: 171 [2018-10-03 09:12:31,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.8s impTime 55 [2018-10-03 09:12:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-03 09:12:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-10-03 09:12:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-03 09:12:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2018-10-03 09:12:31,325 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 163 [2018-10-03 09:12:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:31,325 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2018-10-03 09:12:31,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-03 09:12:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2018-10-03 09:12:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-03 09:12:31,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:31,326 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 41, 14, 1, 1, 1] [2018-10-03 09:12:31,326 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:31,326 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1878872548, now seen corresponding path program 40 times [2018-10-03 09:12:31,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:31,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:31,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:32,450 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 09:12:32,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:32,451 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:32,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:12:32,499 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:12:32,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:32,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:33,899 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 09:12:33,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:33,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-03 09:12:33,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-03 09:12:33,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-03 09:12:33,920 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:33,920 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand 44 states. [2018-10-03 09:12:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:34,103 INFO L93 Difference]: Finished difference Result 219 states and 248 transitions. [2018-10-03 09:12:34,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-03 09:12:34,104 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 169 [2018-10-03 09:12:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:34,105 INFO L225 Difference]: With dead ends: 219 [2018-10-03 09:12:34,105 INFO L226 Difference]: Without dead ends: 173 [2018-10-03 09:12:34,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 0.9s impTime 42 [2018-10-03 09:12:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-03 09:12:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-10-03 09:12:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-03 09:12:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2018-10-03 09:12:34,113 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 169 [2018-10-03 09:12:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:34,114 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2018-10-03 09:12:34,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-03 09:12:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2018-10-03 09:12:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-03 09:12:34,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:34,115 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 42, 14, 1, 1, 1] [2018-10-03 09:12:34,115 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:34,115 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash 890476295, now seen corresponding path program 41 times [2018-10-03 09:12:34,116 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:34,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:34,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:34,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:35,134 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 09:12:35,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:35,135 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:35,145 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:12:35,295 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2018-10-03 09:12:35,295 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:35,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:35,557 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 09:12:35,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:35,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-03 09:12:35,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-03 09:12:35,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-03 09:12:35,578 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:35,578 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand 45 states. [2018-10-03 09:12:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:35,759 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2018-10-03 09:12:35,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-03 09:12:35,760 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2018-10-03 09:12:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:35,761 INFO L225 Difference]: With dead ends: 222 [2018-10-03 09:12:35,761 INFO L226 Difference]: Without dead ends: 176 [2018-10-03 09:12:35,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 43 [2018-10-03 09:12:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-03 09:12:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-10-03 09:12:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-03 09:12:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2018-10-03 09:12:35,768 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 172 [2018-10-03 09:12:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:35,768 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2018-10-03 09:12:35,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-03 09:12:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2018-10-03 09:12:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-03 09:12:35,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:35,769 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 43, 14, 1, 1, 1] [2018-10-03 09:12:35,769 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:35,769 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash 535069244, now seen corresponding path program 42 times [2018-10-03 09:12:35,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:35,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:35,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:36,701 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 09:12:36,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:36,701 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:36,709 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:12:36,776 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2018-10-03 09:12:36,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:36,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:37,059 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 09:12:37,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:37,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 17] total 61 [2018-10-03 09:12:37,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-03 09:12:37,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-03 09:12:37,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:37,081 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand 61 states. [2018-10-03 09:12:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:37,429 INFO L93 Difference]: Finished difference Result 229 states and 261 transitions. [2018-10-03 09:12:37,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-03 09:12:37,430 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 175 [2018-10-03 09:12:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:37,430 INFO L225 Difference]: With dead ends: 229 [2018-10-03 09:12:37,431 INFO L226 Difference]: Without dead ends: 183 [2018-10-03 09:12:37,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 59 [2018-10-03 09:12:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-03 09:12:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-10-03 09:12:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-03 09:12:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2018-10-03 09:12:37,437 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 175 [2018-10-03 09:12:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:37,438 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2018-10-03 09:12:37,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-03 09:12:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2018-10-03 09:12:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-03 09:12:37,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:37,439 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 44, 15, 1, 1, 1] [2018-10-03 09:12:37,439 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:37,439 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:37,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1003346330, now seen corresponding path program 43 times [2018-10-03 09:12:37,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:37,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:37,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:37,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:37,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:39,179 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 09:12:39,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:39,180 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 09:12:39,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:39,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:39,467 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 09:12:39,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:39,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-03 09:12:39,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-03 09:12:39,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-03 09:12:39,488 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:39,488 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand 47 states. [2018-10-03 09:12:39,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:39,679 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2018-10-03 09:12:39,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-03 09:12:39,680 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 181 [2018-10-03 09:12:39,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:39,681 INFO L225 Difference]: With dead ends: 234 [2018-10-03 09:12:39,681 INFO L226 Difference]: Without dead ends: 185 [2018-10-03 09:12:39,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.3s impTime 45 [2018-10-03 09:12:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-03 09:12:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-10-03 09:12:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-03 09:12:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2018-10-03 09:12:39,689 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 181 [2018-10-03 09:12:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:39,690 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2018-10-03 09:12:39,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-03 09:12:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2018-10-03 09:12:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-03 09:12:39,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:39,691 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 45, 15, 1, 1, 1] [2018-10-03 09:12:39,691 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:39,691 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2030680581, now seen corresponding path program 44 times [2018-10-03 09:12:39,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:39,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:39,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:40,474 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 09:12:40,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:40,474 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:12:40,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:12:40,527 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:12:40,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:40,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:40,810 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 09:12:40,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:40,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-03 09:12:40,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-03 09:12:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-03 09:12:40,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:40,845 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand 48 states. [2018-10-03 09:12:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:41,123 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2018-10-03 09:12:41,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-03 09:12:41,123 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 184 [2018-10-03 09:12:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:41,126 INFO L225 Difference]: With dead ends: 237 [2018-10-03 09:12:41,126 INFO L226 Difference]: Without dead ends: 188 [2018-10-03 09:12:41,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 46 [2018-10-03 09:12:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-03 09:12:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-03 09:12:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-03 09:12:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2018-10-03 09:12:41,132 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 184 [2018-10-03 09:12:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:41,132 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2018-10-03 09:12:41,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-03 09:12:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2018-10-03 09:12:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-03 09:12:41,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:41,133 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 46, 15, 1, 1, 1] [2018-10-03 09:12:41,134 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:41,134 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:41,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1408400826, now seen corresponding path program 45 times [2018-10-03 09:12:41,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:41,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:41,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:41,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:41,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:44,035 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 09:12:44,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:44,035 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 09:12:44,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:12:44,081 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-03 09:12:44,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:44,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:44,532 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 09:12:44,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:44,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 18] total 65 [2018-10-03 09:12:44,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-03 09:12:44,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-03 09:12:44,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:44,554 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand 65 states. [2018-10-03 09:12:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:44,972 INFO L93 Difference]: Finished difference Result 244 states and 278 transitions. [2018-10-03 09:12:44,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-03 09:12:44,972 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 187 [2018-10-03 09:12:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:44,973 INFO L225 Difference]: With dead ends: 244 [2018-10-03 09:12:44,974 INFO L226 Difference]: Without dead ends: 195 [2018-10-03 09:12:44,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 2.6s impTime 63 [2018-10-03 09:12:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-03 09:12:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-10-03 09:12:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-03 09:12:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 210 transitions. [2018-10-03 09:12:44,980 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 210 transitions. Word has length 187 [2018-10-03 09:12:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:44,981 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 210 transitions. [2018-10-03 09:12:44,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-03 09:12:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 210 transitions. [2018-10-03 09:12:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-03 09:12:44,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:44,982 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 47, 16, 1, 1, 1] [2018-10-03 09:12:44,982 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:44,982 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:44,982 INFO L82 PathProgramCache]: Analyzing trace with hash -622412324, now seen corresponding path program 46 times [2018-10-03 09:12:44,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:44,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:44,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:44,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:44,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:48,011 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 09:12:48,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:48,011 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 09:12:48,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:12:48,063 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:12:48,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:48,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:48,576 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 09:12:48,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:48,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-03 09:12:48,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-03 09:12:48,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-03 09:12:48,598 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:48,598 INFO L87 Difference]: Start difference. First operand 194 states and 210 transitions. Second operand 50 states. [2018-10-03 09:12:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:49,891 INFO L93 Difference]: Finished difference Result 249 states and 282 transitions. [2018-10-03 09:12:49,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-03 09:12:49,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-10-03 09:12:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:49,893 INFO L225 Difference]: With dead ends: 249 [2018-10-03 09:12:49,893 INFO L226 Difference]: Without dead ends: 197 [2018-10-03 09:12:49,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s Time 2.4s impTime 48 [2018-10-03 09:12:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-03 09:12:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-10-03 09:12:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-03 09:12:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2018-10-03 09:12:49,900 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 193 [2018-10-03 09:12:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:49,900 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2018-10-03 09:12:49,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-03 09:12:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2018-10-03 09:12:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-03 09:12:49,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:49,901 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 48, 16, 1, 1, 1] [2018-10-03 09:12:49,901 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:49,902 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1846957511, now seen corresponding path program 47 times [2018-10-03 09:12:49,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:49,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:49,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:49,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:49,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:51,219 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 09:12:51,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:51,219 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:51,227 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:12:51,344 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2018-10-03 09:12:51,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:51,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:51,700 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 09:12:51,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:51,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-03 09:12:51,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-03 09:12:51,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-03 09:12:51,722 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:51,722 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand 51 states. [2018-10-03 09:12:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:51,932 INFO L93 Difference]: Finished difference Result 252 states and 285 transitions. [2018-10-03 09:12:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-03 09:12:51,933 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2018-10-03 09:12:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:51,935 INFO L225 Difference]: With dead ends: 252 [2018-10-03 09:12:51,935 INFO L226 Difference]: Without dead ends: 200 [2018-10-03 09:12:51,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime 49 [2018-10-03 09:12:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-03 09:12:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-10-03 09:12:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-03 09:12:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 216 transitions. [2018-10-03 09:12:51,944 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 216 transitions. Word has length 196 [2018-10-03 09:12:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:51,944 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 216 transitions. [2018-10-03 09:12:51,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-03 09:12:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 216 transitions. [2018-10-03 09:12:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-03 09:12:51,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:51,945 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 49, 16, 1, 1, 1] [2018-10-03 09:12:51,946 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:51,946 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:51,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1651101188, now seen corresponding path program 48 times [2018-10-03 09:12:51,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:51,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:51,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:51,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:51,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:53,919 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 09:12:53,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:53,920 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:53,927 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:12:54,007 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-10-03 09:12:54,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:54,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:54,331 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 09:12:54,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:54,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 19] total 69 [2018-10-03 09:12:54,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-03 09:12:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-03 09:12:54,352 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:54,352 INFO L87 Difference]: Start difference. First operand 200 states and 216 transitions. Second operand 69 states. [2018-10-03 09:12:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:54,740 INFO L93 Difference]: Finished difference Result 259 states and 295 transitions. [2018-10-03 09:12:54,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-03 09:12:54,741 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 199 [2018-10-03 09:12:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:54,742 INFO L225 Difference]: With dead ends: 259 [2018-10-03 09:12:54,743 INFO L226 Difference]: Without dead ends: 207 [2018-10-03 09:12:54,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.7s impTime 67 [2018-10-03 09:12:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-03 09:12:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-10-03 09:12:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-03 09:12:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-10-03 09:12:54,751 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 199 [2018-10-03 09:12:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:54,751 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-10-03 09:12:54,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-03 09:12:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-10-03 09:12:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-03 09:12:54,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:54,752 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 50, 17, 1, 1, 1] [2018-10-03 09:12:54,752 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:54,753 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:54,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1403567398, now seen corresponding path program 49 times [2018-10-03 09:12:54,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:54,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:54,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:54,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:12:54,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:55,107 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 09:12:55,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:55,107 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:12:55,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:55,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:12:55,794 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 09:12:55,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:12:55,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 69] total 72 [2018-10-03 09:12:55,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-03 09:12:55,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-03 09:12:55,816 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:12:55,816 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 72 states. [2018-10-03 09:12:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:12:56,206 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2018-10-03 09:12:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-03 09:12:56,206 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 205 [2018-10-03 09:12:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:12:56,208 INFO L225 Difference]: With dead ends: 218 [2018-10-03 09:12:56,208 INFO L226 Difference]: Without dead ends: 216 [2018-10-03 09:12:56,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 52 [2018-10-03 09:12:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-03 09:12:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-10-03 09:12:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-03 09:12:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 235 transitions. [2018-10-03 09:12:56,216 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 235 transitions. Word has length 205 [2018-10-03 09:12:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:12:56,217 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 235 transitions. [2018-10-03 09:12:56,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-03 09:12:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 235 transitions. [2018-10-03 09:12:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-03 09:12:56,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:12:56,219 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 50, 20, 1, 1, 1] [2018-10-03 09:12:56,219 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:12:56,219 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:12:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash 29832167, now seen corresponding path program 50 times [2018-10-03 09:12:56,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:12:56,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:12:56,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:56,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:12:56,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:12:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:12:56,858 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 09:12:56,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:12:56,859 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 09:12:56,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:12:56,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:12:56,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:12:56,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:13:00,125 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 09:13:00,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:13:00,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 72] total 75 [2018-10-03 09:13:00,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-03 09:13:00,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-03 09:13:00,147 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:00,147 INFO L87 Difference]: Start difference. First operand 215 states and 235 transitions. Second operand 75 states. [2018-10-03 09:13:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:00,644 INFO L93 Difference]: Finished difference Result 227 states and 253 transitions. [2018-10-03 09:13:00,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-03 09:13:00,644 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 214 [2018-10-03 09:13:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:00,646 INFO L225 Difference]: With dead ends: 227 [2018-10-03 09:13:00,646 INFO L226 Difference]: Without dead ends: 225 [2018-10-03 09:13:00,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time 2.3s impTime 52 [2018-10-03 09:13:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-03 09:13:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2018-10-03 09:13:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-03 09:13:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 247 transitions. [2018-10-03 09:13:00,655 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 247 transitions. Word has length 214 [2018-10-03 09:13:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:00,655 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 247 transitions. [2018-10-03 09:13:00,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-03 09:13:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 247 transitions. [2018-10-03 09:13:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-03 09:13:00,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:00,657 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 50, 23, 1, 1, 1] [2018-10-03 09:13:00,657 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:00,657 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:00,657 INFO L82 PathProgramCache]: Analyzing trace with hash -462347910, now seen corresponding path program 51 times [2018-10-03 09:13:00,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:00,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:00,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:13:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:01,285 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 09:13:01,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:13:01,286 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:13:01,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:13:01,356 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-03 09:13:01,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:13:01,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:13:01,929 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 09:13:01,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:13:01,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 28 [2018-10-03 09:13:01,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-03 09:13:01,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-03 09:13:01,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:01,950 INFO L87 Difference]: Start difference. First operand 224 states and 247 transitions. Second operand 28 states. [2018-10-03 09:13:02,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:02,072 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-10-03 09:13:02,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-03 09:13:02,072 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 223 [2018-10-03 09:13:02,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:02,074 INFO L225 Difference]: With dead ends: 236 [2018-10-03 09:13:02,074 INFO L226 Difference]: Without dead ends: 234 [2018-10-03 09:13:02,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.4s impTime 26 [2018-10-03 09:13:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-03 09:13:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-10-03 09:13:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-03 09:13:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2018-10-03 09:13:02,081 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 223 [2018-10-03 09:13:02,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:02,081 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2018-10-03 09:13:02,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-03 09:13:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2018-10-03 09:13:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-03 09:13:02,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:02,082 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 50, 26, 1, 1, 1] [2018-10-03 09:13:02,082 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:02,082 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:02,083 INFO L82 PathProgramCache]: Analyzing trace with hash 869124423, now seen corresponding path program 52 times [2018-10-03 09:13:02,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:02,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:02,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:02,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:13:02,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:03,439 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 09:13:03,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:13:03,439 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:13:03,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 09:13:03,499 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 09:13:03,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:13:03,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:13:04,275 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 09:13:04,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:13:04,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 78] total 81 [2018-10-03 09:13:04,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-03 09:13:04,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-03 09:13:04,296 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:04,296 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand 81 states. [2018-10-03 09:13:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:04,827 INFO L93 Difference]: Finished difference Result 245 states and 277 transitions. [2018-10-03 09:13:04,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-03 09:13:04,827 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 232 [2018-10-03 09:13:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:04,828 INFO L225 Difference]: With dead ends: 245 [2018-10-03 09:13:04,828 INFO L226 Difference]: Without dead ends: 243 [2018-10-03 09:13:04,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.2s impTime 52 [2018-10-03 09:13:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-03 09:13:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2018-10-03 09:13:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-03 09:13:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2018-10-03 09:13:04,834 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 232 [2018-10-03 09:13:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:04,835 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2018-10-03 09:13:04,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-03 09:13:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2018-10-03 09:13:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-03 09:13:04,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:04,837 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 50, 29, 1, 1, 1] [2018-10-03 09:13:04,837 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:04,837 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:04,837 INFO L82 PathProgramCache]: Analyzing trace with hash -208889830, now seen corresponding path program 53 times [2018-10-03 09:13:04,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:04,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:04,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:04,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:13:04,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:05,373 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 09:13:05,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:13:05,373 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 09:13:05,380 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 09:13:05,521 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) [2018-10-03 09:13:05,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:13:05,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:13:05,951 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 09:13:05,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:13:05,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 52] total 52 [2018-10-03 09:13:05,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-03 09:13:05,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-03 09:13:05,972 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:05,972 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand 52 states. [2018-10-03 09:13:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:06,361 INFO L93 Difference]: Finished difference Result 307 states and 377 transitions. [2018-10-03 09:13:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-03 09:13:06,361 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 241 [2018-10-03 09:13:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:06,363 INFO L225 Difference]: With dead ends: 307 [2018-10-03 09:13:06,364 INFO L226 Difference]: Without dead ends: 305 [2018-10-03 09:13:06,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 50 [2018-10-03 09:13:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-03 09:13:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-10-03 09:13:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-03 09:13:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 355 transitions. [2018-10-03 09:13:06,374 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 355 transitions. Word has length 241 [2018-10-03 09:13:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:06,374 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 355 transitions. [2018-10-03 09:13:06,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-03 09:13:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 355 transitions. [2018-10-03 09:13:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-03 09:13:06,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:06,377 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 50, 50, 1, 1, 1] [2018-10-03 09:13:06,377 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:06,377 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:06,378 INFO L82 PathProgramCache]: Analyzing trace with hash 602025671, now seen corresponding path program 54 times [2018-10-03 09:13:06,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:06,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:06,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:13:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:09,086 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 09:13:09,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:13:09,086 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 09:13:09,094 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 09:13:09,343 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2018-10-03 09:13:09,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:13:09,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:13:10,738 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 09:13:10,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:13:10,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-03 09:13:10,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-03 09:13:10,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-03 09:13:10,761 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:10,761 INFO L87 Difference]: Start difference. First operand 305 states and 355 transitions. Second operand 53 states. [2018-10-03 09:13:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:12,907 INFO L93 Difference]: Finished difference Result 4284 states and 5659 transitions. [2018-10-03 09:13:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-03 09:13:12,907 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 304 [2018-10-03 09:13:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:12,925 INFO L225 Difference]: With dead ends: 4284 [2018-10-03 09:13:12,925 INFO L226 Difference]: Without dead ends: 4282 [2018-10-03 09:13:12,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 2.0s impTime 51 [2018-10-03 09:13:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2018-10-03 09:13:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 308. [2018-10-03 09:13:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-03 09:13:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 359 transitions. [2018-10-03 09:13:13,117 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 359 transitions. Word has length 304 [2018-10-03 09:13:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:13,117 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 359 transitions. [2018-10-03 09:13:13,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-03 09:13:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2018-10-03 09:13:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-03 09:13:13,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:13,120 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 51, 50, 1, 1, 1] [2018-10-03 09:13:13,120 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:13,120 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash -834605638, now seen corresponding path program 55 times [2018-10-03 09:13:13,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:13,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:13,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:13:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:13,776 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 09:13:13,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:13:13,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-10-03 09:13:13,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-03 09:13:13,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-03 09:13:13,777 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:13,777 INFO L87 Difference]: Start difference. First operand 308 states and 359 transitions. Second operand 52 states. [2018-10-03 09:13:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:14,225 INFO L93 Difference]: Finished difference Result 457 states and 557 transitions. [2018-10-03 09:13:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-03 09:13:14,225 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 307 [2018-10-03 09:13:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:14,226 INFO L225 Difference]: With dead ends: 457 [2018-10-03 09:13:14,226 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 09:13:14,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 50 [2018-10-03 09:13:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 09:13:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 09:13:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 09:13:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 09:13:14,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-10-03 09:13:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:14,229 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 09:13:14,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-03 09:13:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 09:13:14,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 09:13:14,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 09:13:15,239 WARN L178 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 1835 DAG size of output: 410 [2018-10-03 09:13:15,968 WARN L178 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 1830 DAG size of output: 400 [2018-10-03 09:13:16,641 WARN L178 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 1835 DAG size of output: 410 [2018-10-03 09:13:19,088 WARN L178 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 410 DAG size of output: 357 [2018-10-03 09:13:21,366 WARN L178 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 400 DAG size of output: 351 [2018-10-03 09:13:23,430 WARN L178 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 410 DAG size of output: 357 [2018-10-03 09:13:23,433 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-10-03 09:13:23,434 INFO L421 ceAbstractionStarter]: At program point L32(lines 29 38) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 61 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61))) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (<= 58 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-10-03 09:13:23,434 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2018-10-03 09:13:23,434 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-10-03 09:13:23,434 INFO L421 ceAbstractionStarter]: At program point L26(lines 26 30) the Hoare annotation is: false [2018-10-03 09:13:23,435 INFO L421 ceAbstractionStarter]: At program point L16(lines 16 27) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 61 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61))) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (<= 58 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-10-03 09:13:23,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2018-10-03 09:13:23,436 INFO L421 ceAbstractionStarter]: At program point L42(lines 13 42) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 61 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61))) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (<= 58 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-10-03 09:13:23,479 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 09:13:23 BoogieIcfgContainer [2018-10-03 09:13:23,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 09:13:23,481 INFO L168 Benchmark]: Toolchain (without parser) took 93429.62 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 616.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 51.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-03 09:13:23,483 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:13:23,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:13:23,484 INFO L168 Benchmark]: Boogie Preprocessor took 24.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:13:23,484 INFO L168 Benchmark]: RCFGBuilder took 306.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-03 09:13:23,486 INFO L168 Benchmark]: TraceAbstraction took 93048.17 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 616.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 30.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-03 09:13:23,495 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 306.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93048.17 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 616.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 30.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (61 <= main_~x~4 && (main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (58 <= main_~x~4 && (main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (61 <= main_~x~4 && (main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (58 <= main_~x~4 && (main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (61 <= main_~x~4 && (main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (58 <= main_~x~4 && (main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 92.9s OverallTime, 57 OverallIterations, 102 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 9.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 945 SDslu, 10370 SDs, 0 SdLazy, 8263 SolverSat, 1805 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8028 GetRequests, 6199 SyntacticMatches, 2 SemanticMatches, 1827 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 57 MinimizatonAttempts, 3995 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 306 NumberOfFragments, 2114 HoareAnnotationTreeSize, 4 FomulaSimplifications, 41233 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 610 FormulaSimplificationTreeSizeReductionInter, 6.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 61.0s InterpolantComputationTime, 13339 NumberOfCodeBlocks, 12541 NumberOfCodeBlocksAsserted, 964 NumberOfCheckSat, 13227 ConstructedInterpolants, 0 QuantifiedInterpolants, 5682843 SizeOfPredicates, 25 NumberOfNonLiveVariables, 11131 ConjunctsInSsa, 1456 ConjunctsInUnsatCore, 112 InterpolantComputations, 3 PerfectInterpolantSequences, 183380/343178 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-13-23-519.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_09-13-23-519.csv Received shutdown request...