java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:40:41,653 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:40:41,655 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:40:41,671 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:40:41,672 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:40:41,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:40:41,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:40:41,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:40:41,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:40:41,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:40:41,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:40:41,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:40:41,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:40:41,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:40:41,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:40:41,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:40:41,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:40:41,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:40:41,700 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:40:41,705 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:40:41,706 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:40:41,707 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:40:41,709 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:40:41,709 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:40:41,710 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:40:41,710 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:40:41,711 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:40:41,712 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:40:41,713 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:40:41,714 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:40:41,714 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:40:41,715 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:40:41,715 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:40:41,715 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:40:41,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:40:41,717 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:40:41,717 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:40:41,732 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:40:41,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:40:41,733 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:40:41,733 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:40:41,734 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:40:41,734 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:40:41,734 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:40:41,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:40:41,735 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:40:41,735 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:40:41,735 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:40:41,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:40:41,735 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:40:41,736 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:40:41,736 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:40:41,736 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:40:41,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:40:41,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:40:41,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:40:41,737 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:40:41,737 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:40:41,737 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:40:41,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:40:41,738 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:40:41,738 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:40:41,738 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:40:41,738 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:40:41,739 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:40:41,739 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:40:41,739 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:40:41,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:40:41,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:40:41,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:40:41,802 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:40:41,803 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:40:41,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2018-09-23 19:40:41,804 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-09-23 19:40:41,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:40:41,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:40:41,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:40:41,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:40:41,882 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:40:41,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (1/1) ... [2018-09-23 19:40:41,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (1/1) ... [2018-09-23 19:40:41,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:40:41,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:40:41,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:40:41,929 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:40:41,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (1/1) ... [2018-09-23 19:40:41,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (1/1) ... [2018-09-23 19:40:41,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (1/1) ... [2018-09-23 19:40:41,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (1/1) ... [2018-09-23 19:40:41,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (1/1) ... [2018-09-23 19:40:41,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (1/1) ... [2018-09-23 19:40:41,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (1/1) ... [2018-09-23 19:40:41,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:40:41,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:40:41,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:40:41,957 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:40:41,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (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-09-23 19:40:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 19:40:42,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 19:40:42,267 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 19:40:42,267 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:40:42 BoogieIcfgContainer [2018-09-23 19:40:42,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:40:42,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:40:42,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:40:42,272 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:40:42,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:40:41" (1/2) ... [2018-09-23 19:40:42,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104c88ab and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:40:42, skipping insertion in model container [2018-09-23 19:40:42,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:40:42" (2/2) ... [2018-09-23 19:40:42,276 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-09-23 19:40:42,285 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:40:42,293 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:40:42,343 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:40:42,344 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:40:42,344 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:40:42,344 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:40:42,344 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:40:42,344 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:40:42,344 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:40:42,345 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:40:42,345 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:40:42,360 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-09-23 19:40:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-23 19:40:42,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:42,368 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-23 19:40:42,369 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:42,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-09-23 19:40:42,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:42,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:42,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:42,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:42,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:42,653 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:40:42,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:40:42,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:40:42,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:40:42,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:40:42,678 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-09-23 19:40:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:42,829 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-09-23 19:40:42,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:40:42,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-23 19:40:42,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:42,844 INFO L225 Difference]: With dead ends: 15 [2018-09-23 19:40:42,844 INFO L226 Difference]: Without dead ends: 9 [2018-09-23 19:40:42,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:40:42,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-23 19:40:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-23 19:40:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-23 19:40:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-23 19:40:42,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-23 19:40:42,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:42,878 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-23 19:40:42,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:40:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-23 19:40:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:40:42,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:42,879 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-23 19:40:42,880 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:42,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:42,880 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-09-23 19:40:42,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:42,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:42,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:42,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:42,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:42,994 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:42,994 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-09-23 19:40:43,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:43,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:43,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:43,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-09-23 19:40:43,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:40:43,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:40:43,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:40:43,080 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-09-23 19:40:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:43,189 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-23 19:40:43,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-23 19:40:43,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-23 19:40:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:43,191 INFO L225 Difference]: With dead ends: 13 [2018-09-23 19:40:43,191 INFO L226 Difference]: Without dead ends: 11 [2018-09-23 19:40:43,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:40:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-23 19:40:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-23 19:40:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-23 19:40:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-23 19:40:43,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-23 19:40:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:43,198 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-23 19:40:43,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:40:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-23 19:40:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-23 19:40:43,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:43,199 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-23 19:40:43,199 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:43,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:43,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-09-23 19:40:43,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:43,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:43,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:43,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:43,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:40:43,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:43,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:43,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:43,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:43,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:43,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:40:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:43,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:43,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-23 19:40:43,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-23 19:40:43,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-23 19:40:43,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:40:43,870 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-09-23 19:40:44,025 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-23 19:40:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:44,272 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-09-23 19:40:44,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:40:44,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-23 19:40:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:44,274 INFO L225 Difference]: With dead ends: 19 [2018-09-23 19:40:44,274 INFO L226 Difference]: Without dead ends: 13 [2018-09-23 19:40:44,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:40:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-23 19:40:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-23 19:40:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-23 19:40:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-23 19:40:44,283 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-23 19:40:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:44,283 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-23 19:40:44,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-23 19:40:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-23 19:40:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:40:44,284 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:44,284 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-23 19:40:44,285 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:44,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 2 times [2018-09-23 19:40:44,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:44,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:44,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:44,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:44,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:44,390 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:44,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 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-09-23 19:40:44,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:40:44,430 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:40:44,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:44,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:44,465 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:44,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-09-23 19:40:44,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 19:40:44,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 19:40:44,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:40:44,467 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-23 19:40:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:44,809 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-23 19:40:44,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 19:40:44,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-23 19:40:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:44,811 INFO L225 Difference]: With dead ends: 17 [2018-09-23 19:40:44,812 INFO L226 Difference]: Without dead ends: 15 [2018-09-23 19:40:44,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:40:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-23 19:40:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-23 19:40:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-23 19:40:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-23 19:40:44,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-23 19:40:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:44,819 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-23 19:40:44,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 19:40:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-23 19:40:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-23 19:40:44,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:44,820 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-23 19:40:44,821 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:44,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:44,821 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2018-09-23 19:40:44,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:44,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:44,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:44,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:44,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:44,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:44,995 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-09-23 19:40:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:40:45,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-23 19:40:45,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:45,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:45,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:45,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:45,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:45,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:40:45,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-09-23 19:40:45,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:45,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:45,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-23 19:40:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:45,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:45,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-23 19:40:45,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-23 19:40:45,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-23 19:40:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-23 19:40:45,268 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2018-09-23 19:40:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:45,743 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-23 19:40:45,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:40:45,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-23 19:40:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:45,745 INFO L225 Difference]: With dead ends: 25 [2018-09-23 19:40:45,745 INFO L226 Difference]: Without dead ends: 17 [2018-09-23 19:40:45,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:40:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-23 19:40:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-23 19:40:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-23 19:40:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-23 19:40:45,753 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-23 19:40:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:45,753 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-23 19:40:45,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-23 19:40:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-23 19:40:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:40:45,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:45,754 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-09-23 19:40:45,755 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:45,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:45,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 4 times [2018-09-23 19:40:45,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:45,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:45,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:45,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:45,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:45,953 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:45,953 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-09-23 19:40:45,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:40:45,992 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:40:45,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:45,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:46,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:46,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:46,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:46,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:40:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-23 19:40:46,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:46,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-09-23 19:40:46,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-23 19:40:46,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-23 19:40:46,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:40:46,126 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-09-23 19:40:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:46,364 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-23 19:40:46,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:40:46,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-23 19:40:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:46,365 INFO L225 Difference]: With dead ends: 21 [2018-09-23 19:40:46,365 INFO L226 Difference]: Without dead ends: 19 [2018-09-23 19:40:46,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-23 19:40:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-23 19:40:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-23 19:40:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-23 19:40:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-23 19:40:46,373 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-23 19:40:46,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:46,373 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-23 19:40:46,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-23 19:40:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-23 19:40:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 19:40:46,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:46,374 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-23 19:40:46,374 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:46,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:46,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 5 times [2018-09-23 19:40:46,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:46,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:46,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:46,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:46,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:46,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:46,615 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-09-23 19:40:46,625 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:40:46,643 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-23 19:40:46,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:46,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:46,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:46,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:46,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:46,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:40:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:46,893 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:46,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-09-23 19:40:46,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 19:40:46,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 19:40:46,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:40:46,894 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-09-23 19:40:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:47,817 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-09-23 19:40:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 19:40:47,817 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-23 19:40:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:47,818 INFO L225 Difference]: With dead ends: 35 [2018-09-23 19:40:47,818 INFO L226 Difference]: Without dead ends: 23 [2018-09-23 19:40:47,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:40:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-23 19:40:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-23 19:40:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-23 19:40:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-23 19:40:47,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-09-23 19:40:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:47,828 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-23 19:40:47,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 19:40:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-23 19:40:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-23 19:40:47,830 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:47,830 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-23 19:40:47,830 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:47,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:47,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 6 times [2018-09-23 19:40:47,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:47,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:47,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:48,182 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:48,182 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-09-23 19:40:48,191 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:40:48,214 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-09-23 19:40:48,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:48,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:48,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:48,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:48,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:48,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:40:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:48,621 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:48,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-09-23 19:40:48,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-23 19:40:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-23 19:40:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:40:48,623 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 19 states. [2018-09-23 19:40:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:49,379 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-09-23 19:40:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:40:49,380 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2018-09-23 19:40:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:49,381 INFO L225 Difference]: With dead ends: 37 [2018-09-23 19:40:49,381 INFO L226 Difference]: Without dead ends: 25 [2018-09-23 19:40:49,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:40:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-23 19:40:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-23 19:40:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-23 19:40:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-23 19:40:49,390 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-23 19:40:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:49,390 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-23 19:40:49,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-23 19:40:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-23 19:40:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-23 19:40:49,391 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:49,391 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-09-23 19:40:49,391 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:49,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1774380245, now seen corresponding path program 7 times [2018-09-23 19:40:49,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:49,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:49,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:49,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:49,482 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:49,483 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-09-23 19:40:49,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:49,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:49,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:49,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-09-23 19:40:49,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:40:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:40:49,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:40:49,559 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-09-23 19:40:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:49,958 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-23 19:40:49,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:40:49,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-09-23 19:40:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:49,959 INFO L225 Difference]: With dead ends: 29 [2018-09-23 19:40:49,959 INFO L226 Difference]: Without dead ends: 27 [2018-09-23 19:40:49,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:40:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-23 19:40:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-23 19:40:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-23 19:40:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-23 19:40:49,970 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-23 19:40:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:49,970 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-23 19:40:49,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:40:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-23 19:40:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-23 19:40:49,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:49,972 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-23 19:40:49,972 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:49,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 8 times [2018-09-23 19:40:49,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:49,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:49,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:49,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:49,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:50,338 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:50,338 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-09-23 19:40:50,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:40:50,390 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:40:50,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:50,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:50,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:50,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:50,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:50,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:40:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:50,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:50,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-09-23 19:40:50,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-23 19:40:50,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-23 19:40:50,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:40:50,843 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 22 states. [2018-09-23 19:40:51,073 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-23 19:40:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:51,409 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-23 19:40:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:40:51,409 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-09-23 19:40:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:51,411 INFO L225 Difference]: With dead ends: 43 [2018-09-23 19:40:51,411 INFO L226 Difference]: Without dead ends: 29 [2018-09-23 19:40:51,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:40:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-23 19:40:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-23 19:40:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-23 19:40:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-23 19:40:51,420 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-23 19:40:51,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:51,421 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-23 19:40:51,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-23 19:40:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-23 19:40:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-23 19:40:51,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:51,422 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-09-23 19:40:51,422 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:51,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1980325449, now seen corresponding path program 9 times [2018-09-23 19:40:51,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:51,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:51,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:51,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:51,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:51,560 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:51,560 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) [2018-09-23 19:40:51,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:40:51,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-23 19:40:51,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:51,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:51,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:51,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:51,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:51,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:40:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-23 19:40:51,750 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:51,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-23 19:40:51,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 19:40:51,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 19:40:51,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:40:51,752 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 16 states. [2018-09-23 19:40:52,329 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-09-23 19:40:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:52,359 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-23 19:40:52,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:40:52,359 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-23 19:40:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:52,360 INFO L225 Difference]: With dead ends: 33 [2018-09-23 19:40:52,360 INFO L226 Difference]: Without dead ends: 31 [2018-09-23 19:40:52,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-09-23 19:40:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-23 19:40:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-23 19:40:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-23 19:40:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-23 19:40:52,371 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-09-23 19:40:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:52,371 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-23 19:40:52,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 19:40:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-23 19:40:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-23 19:40:52,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:52,372 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-23 19:40:52,373 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:52,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:52,373 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 10 times [2018-09-23 19:40:52,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:52,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:52,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:52,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:52,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:52,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:52,645 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-09-23 19:40:52,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:40:52,665 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:40:52,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:52,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:52,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:52,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:52,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:52,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:40:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-23 19:40:52,897 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:52,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 23 [2018-09-23 19:40:52,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-23 19:40:52,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-23 19:40:52,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:40:52,898 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 23 states. [2018-09-23 19:40:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:53,731 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-09-23 19:40:53,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-23 19:40:53,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-09-23 19:40:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:53,732 INFO L225 Difference]: With dead ends: 53 [2018-09-23 19:40:53,733 INFO L226 Difference]: Without dead ends: 35 [2018-09-23 19:40:53,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:40:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-23 19:40:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-23 19:40:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-23 19:40:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-23 19:40:53,746 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-09-23 19:40:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:53,746 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-23 19:40:53,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-23 19:40:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-23 19:40:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:40:53,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:53,747 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-23 19:40:53,748 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:53,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:53,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 11 times [2018-09-23 19:40:53,748 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:53,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:53,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:54,053 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:54,053 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:40:54,061 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:40:54,088 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-23 19:40:54,089 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:54,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:54,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:54,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:54,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:54,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:40:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 20 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:54,650 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:54,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-09-23 19:40:54,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-23 19:40:54,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-23 19:40:54,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-09-23 19:40:54,652 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-09-23 19:40:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:56,403 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-09-23 19:40:56,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 19:40:56,404 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-09-23 19:40:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:56,405 INFO L225 Difference]: With dead ends: 59 [2018-09-23 19:40:56,405 INFO L226 Difference]: Without dead ends: 39 [2018-09-23 19:40:56,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=313, Invalid=2549, Unknown=0, NotChecked=0, Total=2862 [2018-09-23 19:40:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-23 19:40:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-23 19:40:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-23 19:40:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-23 19:40:56,419 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-09-23 19:40:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:56,419 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-23 19:40:56,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-23 19:40:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-23 19:40:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-23 19:40:56,420 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:56,420 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-23 19:40:56,421 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:56,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:56,421 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 12 times [2018-09-23 19:40:56,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:56,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:56,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:56,844 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:56,844 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-09-23 19:40:56,855 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:40:56,904 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-23 19:40:56,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:56,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:57,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:57,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:57,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:57,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:40:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:57,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:57,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-09-23 19:40:57,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-23 19:40:57,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-23 19:40:57,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-09-23 19:40:57,249 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 31 states. [2018-09-23 19:40:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:57,981 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-09-23 19:40:57,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:40:57,981 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-09-23 19:40:57,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:57,982 INFO L225 Difference]: With dead ends: 61 [2018-09-23 19:40:57,983 INFO L226 Difference]: Without dead ends: 41 [2018-09-23 19:40:57,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=1535, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 19:40:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-23 19:40:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-23 19:40:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-23 19:40:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-23 19:40:57,997 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-09-23 19:40:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:57,998 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-23 19:40:57,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-23 19:40:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-23 19:40:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-23 19:40:57,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:57,999 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-09-23 19:40:57,999 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:57,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:57,999 INFO L82 PathProgramCache]: Analyzing trace with hash 830172837, now seen corresponding path program 13 times [2018-09-23 19:40:57,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:58,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:58,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:58,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:40:58,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:58,232 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:58,232 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:40:58,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:58,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:58,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:40:58,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2018-09-23 19:40:58,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-23 19:40:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-23 19:40:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-09-23 19:40:58,301 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2018-09-23 19:40:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:40:58,448 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-23 19:40:58,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 19:40:58,449 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-09-23 19:40:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:40:58,451 INFO L225 Difference]: With dead ends: 45 [2018-09-23 19:40:58,451 INFO L226 Difference]: Without dead ends: 43 [2018-09-23 19:40:58,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:40:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-23 19:40:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-23 19:40:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-23 19:40:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-23 19:40:58,465 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-23 19:40:58,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:40:58,465 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-23 19:40:58,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-23 19:40:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-23 19:40:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-23 19:40:58,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:40:58,466 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-23 19:40:58,466 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:40:58,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:40:58,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 14 times [2018-09-23 19:40:58,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:40:58,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:40:58,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:58,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:40:58,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:40:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:40:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:40:59,455 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:40:59,455 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:40:59,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:40:59,498 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:40:59,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:40:59,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:40:59,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:40:59,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:40:59,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:40:59,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:40:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:00,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:00,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2018-09-23 19:41:00,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-23 19:41:00,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-23 19:41:00,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:41:00,010 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 34 states. [2018-09-23 19:41:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:00,991 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-23 19:41:00,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 19:41:00,991 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2018-09-23 19:41:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:00,992 INFO L225 Difference]: With dead ends: 67 [2018-09-23 19:41:00,993 INFO L226 Difference]: Without dead ends: 45 [2018-09-23 19:41:00,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 19:41:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-23 19:41:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-23 19:41:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-23 19:41:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-23 19:41:01,010 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-23 19:41:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:01,010 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-23 19:41:01,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-23 19:41:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-23 19:41:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-23 19:41:01,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:01,011 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-09-23 19:41:01,011 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:01,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:01,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2070347801, now seen corresponding path program 15 times [2018-09-23 19:41:01,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:01,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:01,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:01,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:01,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 90 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:01,192 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:01,192 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-09-23 19:41:01,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:41:01,232 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-23 19:41:01,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:01,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:01,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:01,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:01,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:01,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:41:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-23 19:41:01,455 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:01,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-09-23 19:41:01,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-23 19:41:01,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-23 19:41:01,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-09-23 19:41:01,457 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 24 states. [2018-09-23 19:41:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:02,060 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-23 19:41:02,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 19:41:02,061 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-23 19:41:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:02,061 INFO L225 Difference]: With dead ends: 49 [2018-09-23 19:41:02,062 INFO L226 Difference]: Without dead ends: 47 [2018-09-23 19:41:02,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2018-09-23 19:41:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-23 19:41:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-23 19:41:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-23 19:41:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-23 19:41:02,076 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-23 19:41:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:02,076 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-23 19:41:02,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-23 19:41:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-23 19:41:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-23 19:41:02,077 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:02,077 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-23 19:41:02,077 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:02,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:02,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 16 times [2018-09-23 19:41:02,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:02,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:02,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:02,723 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:02,723 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-09-23 19:41:02,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:41:02,763 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:41:02,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:02,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:03,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:03,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:03,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:03,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:41:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-23 19:41:03,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:03,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 35 [2018-09-23 19:41:03,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-23 19:41:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-23 19:41:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-23 19:41:03,165 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 35 states. [2018-09-23 19:41:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:04,514 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-09-23 19:41:04,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-23 19:41:04,515 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-09-23 19:41:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:04,516 INFO L225 Difference]: With dead ends: 77 [2018-09-23 19:41:04,516 INFO L226 Difference]: Without dead ends: 51 [2018-09-23 19:41:04,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=2245, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 19:41:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-23 19:41:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-23 19:41:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-23 19:41:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-23 19:41:04,535 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-09-23 19:41:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:04,536 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-23 19:41:04,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-23 19:41:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-23 19:41:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-23 19:41:04,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:04,539 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-23 19:41:04,539 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:04,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:04,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 17 times [2018-09-23 19:41:04,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:04,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:04,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:04,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:04,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:05,026 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:05,026 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-09-23 19:41:05,033 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:41:05,078 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-23 19:41:05,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:05,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:05,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:05,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:05,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:05,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:41:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 72 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:05,872 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:05,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2018-09-23 19:41:05,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-23 19:41:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-23 19:41:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2034, Unknown=0, NotChecked=0, Total=2256 [2018-09-23 19:41:05,876 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 48 states. [2018-09-23 19:41:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:08,158 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-09-23 19:41:08,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-23 19:41:08,158 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 50 [2018-09-23 19:41:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:08,159 INFO L225 Difference]: With dead ends: 83 [2018-09-23 19:41:08,159 INFO L226 Difference]: Without dead ends: 55 [2018-09-23 19:41:08,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=567, Invalid=5439, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 19:41:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-23 19:41:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-23 19:41:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-23 19:41:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-23 19:41:08,178 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-09-23 19:41:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:08,178 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-23 19:41:08,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-23 19:41:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-23 19:41:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-23 19:41:08,179 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:08,179 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-23 19:41:08,179 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:08,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:08,179 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 18 times [2018-09-23 19:41:08,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:08,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:08,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:08,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:08,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:09,242 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:09,242 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-09-23 19:41:09,250 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:41:09,299 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-23 19:41:09,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:09,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:09,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:09,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:09,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:09,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:41:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-23 19:41:10,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:10,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 41 [2018-09-23 19:41:10,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-23 19:41:10,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-23 19:41:10,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2018-09-23 19:41:10,027 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 41 states. [2018-09-23 19:41:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:11,496 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-09-23 19:41:11,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-23 19:41:11,496 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-09-23 19:41:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:11,497 INFO L225 Difference]: With dead ends: 89 [2018-09-23 19:41:11,497 INFO L226 Difference]: Without dead ends: 59 [2018-09-23 19:41:11,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=239, Invalid=3067, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 19:41:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-23 19:41:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-23 19:41:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-23 19:41:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-23 19:41:11,523 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-09-23 19:41:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:11,523 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-23 19:41:11,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-23 19:41:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-23 19:41:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-23 19:41:11,524 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:11,524 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-23 19:41:11,525 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:11,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:11,525 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 19 times [2018-09-23 19:41:11,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:11,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:11,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:11,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:11,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:12,759 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:12,759 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:41:12,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:41:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:12,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:13,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:13,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:13,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:13,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:41:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:13,441 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:13,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 45 [2018-09-23 19:41:13,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-23 19:41:13,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-23 19:41:13,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 19:41:13,442 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 46 states. [2018-09-23 19:41:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:15,036 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-23 19:41:15,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-23 19:41:15,037 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 58 [2018-09-23 19:41:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:15,038 INFO L225 Difference]: With dead ends: 91 [2018-09-23 19:41:15,038 INFO L226 Difference]: Without dead ends: 61 [2018-09-23 19:41:15,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 19:41:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-23 19:41:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-23 19:41:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-23 19:41:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-23 19:41:15,060 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-23 19:41:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:15,060 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-23 19:41:15,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-23 19:41:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-23 19:41:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-23 19:41:15,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:15,061 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-09-23 19:41:15,061 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:15,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:15,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1210122729, now seen corresponding path program 20 times [2018-09-23 19:41:15,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:15,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:15,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:41:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:15,428 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:15,428 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:41:15,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:41:15,471 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:41:15,472 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:15,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:15,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:15,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-09-23 19:41:15,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-23 19:41:15,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-23 19:41:15,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:41:15,508 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2018-09-23 19:41:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:15,735 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-23 19:41:15,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-23 19:41:15,737 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-09-23 19:41:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:15,737 INFO L225 Difference]: With dead ends: 65 [2018-09-23 19:41:15,738 INFO L226 Difference]: Without dead ends: 63 [2018-09-23 19:41:15,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-23 19:41:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-23 19:41:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-23 19:41:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-23 19:41:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-23 19:41:15,757 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-23 19:41:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:15,757 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-23 19:41:15,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-23 19:41:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-23 19:41:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-23 19:41:15,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:15,758 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-23 19:41:15,758 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:15,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:15,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 21 times [2018-09-23 19:41:15,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:15,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:15,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:15,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:15,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:16,596 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:16,596 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-09-23 19:41:16,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:41:16,665 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-09-23 19:41:16,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:16,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:17,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:17,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:17,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:17,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:41:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-09-23 19:41:17,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:17,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17] total 47 [2018-09-23 19:41:17,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-23 19:41:17,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-23 19:41:17,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2044, Unknown=0, NotChecked=0, Total=2162 [2018-09-23 19:41:17,280 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 47 states. [2018-09-23 19:41:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:19,427 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-09-23 19:41:19,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-23 19:41:19,427 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2018-09-23 19:41:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:19,428 INFO L225 Difference]: With dead ends: 101 [2018-09-23 19:41:19,429 INFO L226 Difference]: Without dead ends: 67 [2018-09-23 19:41:19,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=273, Invalid=4017, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 19:41:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-23 19:41:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-23 19:41:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-23 19:41:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-23 19:41:19,452 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-09-23 19:41:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:19,452 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-23 19:41:19,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-23 19:41:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-23 19:41:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-23 19:41:19,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:19,453 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-23 19:41:19,453 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:19,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:19,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 22 times [2018-09-23 19:41:19,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:19,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:19,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:19,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:19,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:20,935 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:20,935 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-09-23 19:41:20,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:41:20,974 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:41:20,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:20,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:21,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:21,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:21,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:21,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:41:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-23 19:41:21,881 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:21,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 50 [2018-09-23 19:41:21,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-23 19:41:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-23 19:41:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2324, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 19:41:21,883 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 50 states. [2018-09-23 19:41:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:23,781 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-09-23 19:41:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-23 19:41:23,781 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-09-23 19:41:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:23,782 INFO L225 Difference]: With dead ends: 107 [2018-09-23 19:41:23,782 INFO L226 Difference]: Without dead ends: 71 [2018-09-23 19:41:23,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=290, Invalid=4540, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 19:41:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-23 19:41:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-23 19:41:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-23 19:41:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-23 19:41:23,805 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-09-23 19:41:23,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:23,806 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-23 19:41:23,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-23 19:41:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-23 19:41:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-23 19:41:23,806 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:23,806 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-23 19:41:23,807 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:23,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 23 times [2018-09-23 19:41:23,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:23,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:23,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:23,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:23,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:24,963 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:24,963 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-09-23 19:41:24,971 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:41:25,064 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-09-23 19:41:25,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:25,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:26,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:26,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:26,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:26,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:41:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:26,909 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:26,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2018-09-23 19:41:26,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-23 19:41:26,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-23 19:41:26,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 19:41:26,912 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 68 states. [2018-09-23 19:41:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:30,369 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-09-23 19:41:30,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-23 19:41:30,369 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 70 [2018-09-23 19:41:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:30,370 INFO L225 Difference]: With dead ends: 113 [2018-09-23 19:41:30,370 INFO L226 Difference]: Without dead ends: 75 [2018-09-23 19:41:30,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=997, Invalid=10559, Unknown=0, NotChecked=0, Total=11556 [2018-09-23 19:41:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-23 19:41:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-23 19:41:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-23 19:41:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-23 19:41:30,397 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-09-23 19:41:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:30,398 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-23 19:41:30,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-23 19:41:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-23 19:41:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-23 19:41:30,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:30,398 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-23 19:41:30,398 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:30,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 24 times [2018-09-23 19:41:30,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:30,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:30,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:30,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:30,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:31,247 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:31,247 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-09-23 19:41:31,255 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:41:31,329 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-09-23 19:41:31,330 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:31,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:32,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:32,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:32,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:32,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:41:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:32,297 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:32,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 57 [2018-09-23 19:41:32,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-23 19:41:32,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-23 19:41:32,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 19:41:32,298 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 58 states. [2018-09-23 19:41:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:34,178 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-23 19:41:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-23 19:41:34,179 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2018-09-23 19:41:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:34,180 INFO L225 Difference]: With dead ends: 115 [2018-09-23 19:41:34,180 INFO L226 Difference]: Without dead ends: 77 [2018-09-23 19:41:34,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 19:41:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-23 19:41:34,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-23 19:41:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-23 19:41:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-23 19:41:34,217 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-23 19:41:34,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:34,217 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-23 19:41:34,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-23 19:41:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-23 19:41:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-23 19:41:34,218 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:34,218 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-09-23 19:41:34,218 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:34,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash -42507335, now seen corresponding path program 25 times [2018-09-23 19:41:34,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:34,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:34,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:34,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:34,804 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:34,804 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-09-23 19:41:34,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:41:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:34,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:34,895 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:34,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-09-23 19:41:34,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-23 19:41:34,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-23 19:41:34,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:41:34,896 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 22 states. [2018-09-23 19:41:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:35,198 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-23 19:41:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-23 19:41:35,199 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-09-23 19:41:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:35,199 INFO L225 Difference]: With dead ends: 81 [2018-09-23 19:41:35,200 INFO L226 Difference]: Without dead ends: 79 [2018-09-23 19:41:35,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-23 19:41:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-23 19:41:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-23 19:41:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-23 19:41:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-23 19:41:35,228 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-09-23 19:41:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:35,228 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-23 19:41:35,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-23 19:41:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-23 19:41:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-23 19:41:35,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:35,229 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-23 19:41:35,229 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:35,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:35,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 26 times [2018-09-23 19:41:35,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:35,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:35,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:41:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:36,443 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:36,443 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:41:36,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:41:36,498 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:41:36,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:36,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:37,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:37,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:37,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:37,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:41:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:37,496 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:37,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 60 [2018-09-23 19:41:37,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-23 19:41:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-23 19:41:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3482, Unknown=0, NotChecked=0, Total=3660 [2018-09-23 19:41:37,498 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 61 states. [2018-09-23 19:41:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:39,726 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-09-23 19:41:39,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-23 19:41:39,726 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 78 [2018-09-23 19:41:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:39,727 INFO L225 Difference]: With dead ends: 121 [2018-09-23 19:41:39,727 INFO L226 Difference]: Without dead ends: 81 [2018-09-23 19:41:39,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=377, Invalid=6265, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 19:41:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-23 19:41:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-23 19:41:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-23 19:41:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-23 19:41:39,756 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-23 19:41:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:39,757 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-23 19:41:39,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-23 19:41:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-23 19:41:39,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-23 19:41:39,757 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:39,757 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-09-23 19:41:39,758 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:39,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:39,758 INFO L82 PathProgramCache]: Analyzing trace with hash 752544557, now seen corresponding path program 27 times [2018-09-23 19:41:39,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:39,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:39,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:39,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 342 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:40,334 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:40,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 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-09-23 19:41:40,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:41:40,450 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-09-23 19:41:40,450 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:40,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:42,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:42,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:42,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:42,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:41:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-23 19:41:42,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:42,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-09-23 19:41:42,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-23 19:41:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-23 19:41:42,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 19:41:42,123 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 42 states. [2018-09-23 19:41:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:43,326 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-23 19:41:43,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-23 19:41:43,326 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-23 19:41:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:43,327 INFO L225 Difference]: With dead ends: 85 [2018-09-23 19:41:43,327 INFO L226 Difference]: Without dead ends: 83 [2018-09-23 19:41:43,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=588, Invalid=3318, Unknown=0, NotChecked=0, Total=3906 [2018-09-23 19:41:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-23 19:41:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-23 19:41:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-23 19:41:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-23 19:41:43,360 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-23 19:41:43,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:43,360 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-23 19:41:43,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-23 19:41:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-23 19:41:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-23 19:41:43,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:43,361 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-23 19:41:43,361 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:43,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:43,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 28 times [2018-09-23 19:41:43,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:43,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:43,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:43,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:43,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:44,432 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:44,432 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-09-23 19:41:44,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:41:44,470 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:41:44,470 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:44,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:45,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:45,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:45,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:45,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:41:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-23 19:41:45,741 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:45,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 22] total 62 [2018-09-23 19:41:45,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-23 19:41:45,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-23 19:41:45,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=3624, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 19:41:45,743 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 62 states. [2018-09-23 19:41:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:48,767 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-09-23 19:41:48,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-23 19:41:48,768 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 82 [2018-09-23 19:41:48,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:48,769 INFO L225 Difference]: With dead ends: 131 [2018-09-23 19:41:48,769 INFO L226 Difference]: Without dead ends: 87 [2018-09-23 19:41:48,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=358, Invalid=6952, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 19:41:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-23 19:41:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-23 19:41:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-23 19:41:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-23 19:41:48,816 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-09-23 19:41:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:48,817 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-23 19:41:48,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-23 19:41:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-23 19:41:48,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-23 19:41:48,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:48,817 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-23 19:41:48,818 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:48,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 29 times [2018-09-23 19:41:48,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:48,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:48,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:48,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:48,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:50,214 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:50,214 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-09-23 19:41:50,222 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:41:50,344 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-09-23 19:41:50,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:50,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:52,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:52,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:52,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:52,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:41:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 306 proven. 534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:52,323 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:52,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 83 [2018-09-23 19:41:52,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-23 19:41:52,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-23 19:41:52,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=6309, Unknown=0, NotChecked=0, Total=6972 [2018-09-23 19:41:52,324 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 84 states. [2018-09-23 19:41:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:41:57,109 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-09-23 19:41:57,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-23 19:41:57,109 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 86 [2018-09-23 19:41:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:41:57,111 INFO L225 Difference]: With dead ends: 137 [2018-09-23 19:41:57,111 INFO L226 Difference]: Without dead ends: 91 [2018-09-23 19:41:57,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2976 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1431, Invalid=15861, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 19:41:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-23 19:41:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-23 19:41:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-23 19:41:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-23 19:41:57,158 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-09-23 19:41:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:41:57,159 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-23 19:41:57,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-23 19:41:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-23 19:41:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-23 19:41:57,159 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:41:57,159 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-23 19:41:57,160 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:41:57,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:41:57,160 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 30 times [2018-09-23 19:41:57,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:41:57,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:41:57,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:57,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:41:57,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:41:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:41:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:58,372 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:41:58,372 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-09-23 19:41:58,380 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:41:58,485 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-09-23 19:41:58,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:41:58,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:41:59,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:41:59,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:41:59,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:41:59,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:41:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:41:59,852 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:41:59,852 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 69 [2018-09-23 19:41:59,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-23 19:41:59,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-23 19:41:59,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 19:41:59,853 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 70 states. [2018-09-23 19:42:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:42:02,589 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-23 19:42:02,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-23 19:42:02,590 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 90 [2018-09-23 19:42:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:42:02,591 INFO L225 Difference]: With dead ends: 139 [2018-09-23 19:42:02,591 INFO L226 Difference]: Without dead ends: 93 [2018-09-23 19:42:02,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2018-09-23 19:42:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-23 19:42:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-23 19:42:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-23 19:42:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-23 19:42:02,643 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-23 19:42:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:42:02,643 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-23 19:42:02,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-23 19:42:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-23 19:42:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-23 19:42:02,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:42:02,644 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-09-23 19:42:02,644 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:42:02,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:42:02,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1017783689, now seen corresponding path program 31 times [2018-09-23 19:42:02,644 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:42:02,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:42:02,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:02,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:42:02,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:03,173 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:42:03,173 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-09-23 19:42:03,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:42:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:03,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:42:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:03,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:42:03,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 25 [2018-09-23 19:42:03,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-23 19:42:03,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-23 19:42:03,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:42:03,285 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 26 states. [2018-09-23 19:42:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:42:03,754 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-23 19:42:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-23 19:42:03,755 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-09-23 19:42:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:42:03,755 INFO L225 Difference]: With dead ends: 97 [2018-09-23 19:42:03,755 INFO L226 Difference]: Without dead ends: 95 [2018-09-23 19:42:03,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-23 19:42:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-23 19:42:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-23 19:42:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-23 19:42:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-23 19:42:03,798 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-09-23 19:42:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:42:03,798 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-23 19:42:03,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-23 19:42:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-23 19:42:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-23 19:42:03,799 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:42:03,799 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-23 19:42:03,799 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:42:03,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:42:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 32 times [2018-09-23 19:42:03,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:42:03,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:42:03,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:03,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:42:03,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:05,024 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:42:05,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:42:05,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:42:05,081 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:42:05,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:42:05,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:42:06,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:42:06,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:42:06,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:42:06,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:42:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:06,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:42:06,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 72 [2018-09-23 19:42:06,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-23 19:42:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-23 19:42:06,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=5042, Unknown=0, NotChecked=0, Total=5256 [2018-09-23 19:42:06,596 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 73 states. [2018-09-23 19:42:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:42:09,513 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-09-23 19:42:09,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-23 19:42:09,513 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 94 [2018-09-23 19:42:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:42:09,514 INFO L225 Difference]: With dead ends: 145 [2018-09-23 19:42:09,514 INFO L226 Difference]: Without dead ends: 97 [2018-09-23 19:42:09,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=453, Invalid=9053, Unknown=0, NotChecked=0, Total=9506 [2018-09-23 19:42:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-23 19:42:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-23 19:42:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-23 19:42:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-23 19:42:09,557 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-09-23 19:42:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:42:09,557 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-23 19:42:09,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-23 19:42:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-23 19:42:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-23 19:42:09,558 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:42:09,558 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-09-23 19:42:09,558 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:42:09,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:42:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070211, now seen corresponding path program 33 times [2018-09-23 19:42:09,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:42:09,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:42:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:09,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:42:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 506 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:10,011 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:42:10,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 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-09-23 19:42:10,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:42:10,147 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-09-23 19:42:10,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:42:10,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:42:10,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:42:10,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:42:10,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:42:10,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:42:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-23 19:42:11,031 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:42:11,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-09-23 19:42:11,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-23 19:42:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-23 19:42:11,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 19:42:11,032 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 50 states. [2018-09-23 19:42:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:42:12,670 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-23 19:42:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-23 19:42:12,671 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-23 19:42:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:42:12,672 INFO L225 Difference]: With dead ends: 101 [2018-09-23 19:42:12,672 INFO L226 Difference]: Without dead ends: 99 [2018-09-23 19:42:12,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=800, Invalid=4750, Unknown=0, NotChecked=0, Total=5550 [2018-09-23 19:42:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-23 19:42:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-23 19:42:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-23 19:42:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-23 19:42:12,716 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-23 19:42:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:42:12,716 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-23 19:42:12,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-23 19:42:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-23 19:42:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-23 19:42:12,717 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:42:12,717 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-23 19:42:12,717 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:42:12,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:42:12,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 34 times [2018-09-23 19:42:12,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:42:12,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:42:12,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:12,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:42:12,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 1104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:14,159 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:42:14,159 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:42:14,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:42:14,204 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:42:14,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:42:14,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:42:15,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:42:15,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:42:15,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:42:15,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:42:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-23 19:42:15,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:42:15,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 26] total 74 [2018-09-23 19:42:15,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-23 19:42:15,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-23 19:42:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5212, Unknown=0, NotChecked=0, Total=5402 [2018-09-23 19:42:15,940 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 74 states. [2018-09-23 19:42:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:42:19,876 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-09-23 19:42:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-23 19:42:19,876 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 98 [2018-09-23 19:42:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:42:19,878 INFO L225 Difference]: With dead ends: 155 [2018-09-23 19:42:19,878 INFO L226 Difference]: Without dead ends: 103 [2018-09-23 19:42:19,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=426, Invalid=9876, Unknown=0, NotChecked=0, Total=10302 [2018-09-23 19:42:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-23 19:42:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-23 19:42:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-23 19:42:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-23 19:42:19,924 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-09-23 19:42:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:42:19,924 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-23 19:42:19,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-23 19:42:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-23 19:42:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-23 19:42:19,925 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:42:19,925 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-23 19:42:19,925 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:42:19,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:42:19,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 35 times [2018-09-23 19:42:19,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:42:19,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:42:19,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:19,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:42:19,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:21,549 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:42:21,549 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-09-23 19:42:21,557 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:42:21,759 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-23 19:42:21,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:42:21,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:42:24,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:42:24,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:42:24,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:42:24,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:42:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 462 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:24,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:42:24,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 99 [2018-09-23 19:42:24,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-23 19:42:24,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-23 19:42:24,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=937, Invalid=8963, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 19:42:24,487 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 100 states. [2018-09-23 19:42:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:42:30,558 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-09-23 19:42:30,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-23 19:42:30,558 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 102 [2018-09-23 19:42:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:42:30,559 INFO L225 Difference]: With dead ends: 161 [2018-09-23 19:42:30,559 INFO L226 Difference]: Without dead ends: 107 [2018-09-23 19:42:30,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4198 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1945, Invalid=22235, Unknown=0, NotChecked=0, Total=24180 [2018-09-23 19:42:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-23 19:42:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-23 19:42:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-23 19:42:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-23 19:42:30,611 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-09-23 19:42:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:42:30,611 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-23 19:42:30,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-23 19:42:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-23 19:42:30,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-23 19:42:30,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:42:30,612 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-23 19:42:30,613 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:42:30,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:42:30,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 36 times [2018-09-23 19:42:30,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:42:30,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:42:30,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:30,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:42:30,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:32,708 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:42:32,708 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-09-23 19:42:32,715 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:42:32,865 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-09-23 19:42:32,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:42:32,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:42:34,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:42:34,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:42:34,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:42:34,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:42:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:34,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:42:34,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 81 [2018-09-23 19:42:34,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-23 19:42:34,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-23 19:42:34,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 19:42:34,632 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 82 states. [2018-09-23 19:42:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:42:38,557 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-23 19:42:38,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-23 19:42:38,557 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 106 [2018-09-23 19:42:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:42:38,558 INFO L225 Difference]: With dead ends: 163 [2018-09-23 19:42:38,558 INFO L226 Difference]: Without dead ends: 109 [2018-09-23 19:42:38,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2018-09-23 19:42:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-23 19:42:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-23 19:42:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-23 19:42:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-23 19:42:38,617 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-23 19:42:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:42:38,617 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-23 19:42:38,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-23 19:42:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-23 19:42:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-23 19:42:38,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:42:38,618 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-09-23 19:42:38,618 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:42:38,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:42:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash 653870937, now seen corresponding path program 37 times [2018-09-23 19:42:38,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:42:38,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:42:38,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:38,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:42:38,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:39,308 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:42:39,309 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-09-23 19:42:39,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:42:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:39,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:42:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:39,434 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:42:39,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 29 [2018-09-23 19:42:39,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-23 19:42:39,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-23 19:42:39,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:42:39,436 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2018-09-23 19:42:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:42:40,080 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-23 19:42:40,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-23 19:42:40,082 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-09-23 19:42:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:42:40,083 INFO L225 Difference]: With dead ends: 113 [2018-09-23 19:42:40,083 INFO L226 Difference]: Without dead ends: 111 [2018-09-23 19:42:40,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-23 19:42:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-23 19:42:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-23 19:42:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-23 19:42:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-23 19:42:40,153 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-23 19:42:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:42:40,153 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-23 19:42:40,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-23 19:42:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-23 19:42:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-23 19:42:40,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:42:40,154 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-23 19:42:40,154 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:42:40,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:42:40,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 38 times [2018-09-23 19:42:40,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:42:40,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:42:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:40,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:42:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:42,090 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:42:42,090 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:42:42,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:42:42,170 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:42:42,171 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:42:42,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:42:44,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:42:44,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:42:44,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:42:44,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:42:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:44,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:42:44,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 84 [2018-09-23 19:42:44,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-23 19:42:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-23 19:42:44,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=6890, Unknown=0, NotChecked=0, Total=7140 [2018-09-23 19:42:44,149 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 85 states. [2018-09-23 19:42:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:42:49,119 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-09-23 19:42:49,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-23 19:42:49,119 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 110 [2018-09-23 19:42:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:42:49,120 INFO L225 Difference]: With dead ends: 169 [2018-09-23 19:42:49,120 INFO L226 Difference]: Without dead ends: 113 [2018-09-23 19:42:49,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=529, Invalid=12353, Unknown=0, NotChecked=0, Total=12882 [2018-09-23 19:42:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-23 19:42:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-23 19:42:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-23 19:42:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-23 19:42:49,176 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-09-23 19:42:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:42:49,176 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-23 19:42:49,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-23 19:42:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-23 19:42:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-23 19:42:49,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:42:49,177 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-09-23 19:42:49,177 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:42:49,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:42:49,177 INFO L82 PathProgramCache]: Analyzing trace with hash -738263347, now seen corresponding path program 39 times [2018-09-23 19:42:49,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:42:49,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:42:49,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:49,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:42:49,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 702 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:49,755 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:42:49,755 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-09-23 19:42:49,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:42:49,938 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-09-23 19:42:49,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:42:49,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:42:51,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:42:51,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:42:51,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:42:51,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:42:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-23 19:42:52,034 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:42:52,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-09-23 19:42:52,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-23 19:42:52,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-23 19:42:52,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 19:42:52,035 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 58 states. [2018-09-23 19:42:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:42:54,096 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-23 19:42:54,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-23 19:42:54,096 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-23 19:42:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:42:54,097 INFO L225 Difference]: With dead ends: 117 [2018-09-23 19:42:54,097 INFO L226 Difference]: Without dead ends: 115 [2018-09-23 19:42:54,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1044, Invalid=6438, Unknown=0, NotChecked=0, Total=7482 [2018-09-23 19:42:54,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-23 19:42:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-23 19:42:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-23 19:42:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-23 19:42:54,161 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-23 19:42:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:42:54,161 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-23 19:42:54,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-23 19:42:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-23 19:42:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-23 19:42:54,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:42:54,162 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-23 19:42:54,162 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:42:54,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:42:54,163 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 40 times [2018-09-23 19:42:54,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:42:54,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:42:54,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:54,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:42:54,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:42:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:42:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:42:56,006 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:42:56,006 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-09-23 19:42:56,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:42:56,060 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:42:56,061 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:42:56,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:42:58,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:42:58,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:42:58,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:42:58,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:42:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-23 19:42:58,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:42:58,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 30] total 86 [2018-09-23 19:42:58,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-23 19:42:58,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-23 19:42:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=7088, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 19:42:58,335 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 86 states. [2018-09-23 19:43:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:03,875 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-09-23 19:43:03,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-23 19:43:03,876 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 114 [2018-09-23 19:43:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:03,877 INFO L225 Difference]: With dead ends: 179 [2018-09-23 19:43:03,877 INFO L226 Difference]: Without dead ends: 119 [2018-09-23 19:43:03,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=494, Invalid=13312, Unknown=0, NotChecked=0, Total=13806 [2018-09-23 19:43:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-23 19:43:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-23 19:43:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-23 19:43:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-23 19:43:03,944 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-09-23 19:43:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:03,944 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-23 19:43:03,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-23 19:43:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-23 19:43:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-23 19:43:03,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:03,945 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-23 19:43:03,945 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:03,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 41 times [2018-09-23 19:43:03,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:03,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:03,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:43:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 1624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:05,904 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:43:05,904 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-09-23 19:43:05,911 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:43:06,214 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-09-23 19:43:06,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:43:06,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:43:09,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:43:09,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:43:09,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:43:09,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:43:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 650 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:10,097 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:43:10,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 115 [2018-09-23 19:43:10,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-23 19:43:10,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-23 19:43:10,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=12081, Unknown=0, NotChecked=0, Total=13340 [2018-09-23 19:43:10,100 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 116 states. [2018-09-23 19:43:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:18,239 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-09-23 19:43:18,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-23 19:43:18,239 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 118 [2018-09-23 19:43:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:18,240 INFO L225 Difference]: With dead ends: 185 [2018-09-23 19:43:18,240 INFO L226 Difference]: Without dead ends: 123 [2018-09-23 19:43:18,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5628 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2539, Invalid=29681, Unknown=0, NotChecked=0, Total=32220 [2018-09-23 19:43:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-23 19:43:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-23 19:43:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-23 19:43:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-23 19:43:18,305 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-09-23 19:43:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:18,305 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-23 19:43:18,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-23 19:43:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-23 19:43:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-23 19:43:18,306 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:18,306 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-23 19:43:18,306 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:18,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 42 times [2018-09-23 19:43:18,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:18,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:18,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:18,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:43:18,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:20,257 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:43:20,257 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-09-23 19:43:20,263 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:43:20,460 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2018-09-23 19:43:20,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:43:20,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:43:22,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:43:22,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:43:22,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:43:22,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:43:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-09-23 19:43:23,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:43:23,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 32] total 92 [2018-09-23 19:43:23,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-23 19:43:23,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-23 19:43:23,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=8134, Unknown=0, NotChecked=0, Total=8372 [2018-09-23 19:43:23,061 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 92 states. [2018-09-23 19:43:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:28,971 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-09-23 19:43:28,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-23 19:43:28,971 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 122 [2018-09-23 19:43:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:28,973 INFO L225 Difference]: With dead ends: 191 [2018-09-23 19:43:28,973 INFO L226 Difference]: Without dead ends: 127 [2018-09-23 19:43:28,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=528, Invalid=15222, Unknown=0, NotChecked=0, Total=15750 [2018-09-23 19:43:28,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-23 19:43:29,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-23 19:43:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-23 19:43:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-23 19:43:29,069 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-09-23 19:43:29,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:29,069 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-23 19:43:29,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-23 19:43:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-23 19:43:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-23 19:43:29,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:29,070 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-23 19:43:29,071 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:29,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:29,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 43 times [2018-09-23 19:43:29,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:29,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:29,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:29,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:43:29,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:31,387 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:43:31,387 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-09-23 19:43:31,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:31,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:43:33,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:43:33,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:43:33,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:43:33,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:43:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:34,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:43:34,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 96 [2018-09-23 19:43:34,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-23 19:43:34,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-23 19:43:34,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=9026, Unknown=0, NotChecked=0, Total=9312 [2018-09-23 19:43:34,023 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 97 states. [2018-09-23 19:43:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:39,222 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-09-23 19:43:39,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-23 19:43:39,222 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 126 [2018-09-23 19:43:39,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:39,224 INFO L225 Difference]: With dead ends: 193 [2018-09-23 19:43:39,224 INFO L226 Difference]: Without dead ends: 129 [2018-09-23 19:43:39,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=605, Invalid=16165, Unknown=0, NotChecked=0, Total=16770 [2018-09-23 19:43:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-23 19:43:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-23 19:43:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-23 19:43:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-23 19:43:39,319 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-23 19:43:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:39,319 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-23 19:43:39,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-23 19:43:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-23 19:43:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-23 19:43:39,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:39,320 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-09-23 19:43:39,320 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:39,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2012453021, now seen corresponding path program 44 times [2018-09-23 19:43:39,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:39,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:39,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:39,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:39,955 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:43:39,955 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-09-23 19:43:39,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:43:40,036 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:43:40,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:43:40,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:43:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:40,099 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:43:40,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 34 [2018-09-23 19:43:40,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-23 19:43:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-23 19:43:40,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-09-23 19:43:40,101 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 35 states. [2018-09-23 19:43:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:40,766 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-23 19:43:40,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-23 19:43:40,766 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2018-09-23 19:43:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:40,767 INFO L225 Difference]: With dead ends: 133 [2018-09-23 19:43:40,767 INFO L226 Difference]: Without dead ends: 131 [2018-09-23 19:43:40,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 19:43:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-23 19:43:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-23 19:43:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-23 19:43:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-23 19:43:40,832 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-23 19:43:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:40,832 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-23 19:43:40,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-23 19:43:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-23 19:43:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-23 19:43:40,832 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:40,832 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-23 19:43:40,833 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:40,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:40,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 45 times [2018-09-23 19:43:40,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:40,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:40,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:43:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:43,641 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:43:43,642 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-09-23 19:43:43,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:43:43,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-09-23 19:43:43,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:43:43,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:43:46,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:43:46,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:43:46,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:43:46,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:43:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:46,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:43:46,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 99 [2018-09-23 19:43:46,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-23 19:43:46,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-23 19:43:46,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 19:43:46,382 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 100 states. [2018-09-23 19:43:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:52,083 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-09-23 19:43:52,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-23 19:43:52,083 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 130 [2018-09-23 19:43:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:52,084 INFO L225 Difference]: With dead ends: 199 [2018-09-23 19:43:52,084 INFO L226 Difference]: Without dead ends: 133 [2018-09-23 19:43:52,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2018-09-23 19:43:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-23 19:43:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-23 19:43:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-23 19:43:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-23 19:43:52,163 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-23 19:43:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:52,163 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-23 19:43:52,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-23 19:43:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-23 19:43:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-23 19:43:52,163 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:52,164 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-09-23 19:43:52,164 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:52,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:52,164 INFO L82 PathProgramCache]: Analyzing trace with hash -452907503, now seen corresponding path program 46 times [2018-09-23 19:43:52,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:52,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:52,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:43:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 992 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:53,177 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:43:53,177 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-09-23 19:43:53,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:43:53,238 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:43:53,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:43:53,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:43:54,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:43:54,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:43:54,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:43:54,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:43:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-09-23 19:43:54,481 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:43:54,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-09-23 19:43:54,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-23 19:43:54,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-23 19:43:54,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=3894, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 19:43:54,482 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 68 states. [2018-09-23 19:43:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:57,225 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-23 19:43:57,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-23 19:43:57,225 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-23 19:43:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:57,226 INFO L225 Difference]: With dead ends: 137 [2018-09-23 19:43:57,226 INFO L226 Difference]: Without dead ends: 135 [2018-09-23 19:43:57,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2143 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1394, Invalid=8908, Unknown=0, NotChecked=0, Total=10302 [2018-09-23 19:43:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-23 19:43:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-23 19:43:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-23 19:43:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-23 19:43:57,323 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-23 19:43:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:57,323 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-23 19:43:57,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-23 19:43:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-23 19:43:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-23 19:43:57,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:57,324 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-23 19:43:57,324 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:57,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:57,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 47 times [2018-09-23 19:43:57,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:57,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:57,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:43:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 2112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:43:59,866 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:43:59,866 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-09-23 19:43:59,874 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:44:00,352 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-09-23 19:44:00,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:44:00,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:44:05,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:44:05,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:44:05,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:44:05,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-23 19:44:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 870 proven. 1242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:05,301 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:44:05,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-09-23 19:44:05,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-23 19:44:05,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-23 19:44:05,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1629, Invalid=15663, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 19:44:05,303 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 132 states. [2018-09-23 19:44:10,981 WARN L178 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-23 19:44:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:15,752 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-09-23 19:44:15,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-23 19:44:15,752 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 134 [2018-09-23 19:44:15,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:15,754 INFO L225 Difference]: With dead ends: 209 [2018-09-23 19:44:15,754 INFO L226 Difference]: Without dead ends: 139 [2018-09-23 19:44:15,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7266 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=3213, Invalid=38199, Unknown=0, NotChecked=0, Total=41412 [2018-09-23 19:44:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-23 19:44:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-23 19:44:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-23 19:44:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-23 19:44:15,843 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-09-23 19:44:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:15,843 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-23 19:44:15,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-23 19:44:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-23 19:44:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-23 19:44:15,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:15,844 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-23 19:44:15,844 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:15,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:15,845 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 48 times [2018-09-23 19:44:15,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:15,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:15,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:44:15,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:18,611 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:44:18,611 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:44:18,618 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:44:18,907 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-09-23 19:44:18,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:44:18,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:44:21,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:44:21,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:44:21,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:44:21,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:44:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:21,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:44:21,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 105 [2018-09-23 19:44:21,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-23 19:44:21,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-23 19:44:21,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 19:44:21,913 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 106 states. [2018-09-23 19:44:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:28,234 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-23 19:44:28,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-23 19:44:28,234 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 138 [2018-09-23 19:44:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:28,235 INFO L225 Difference]: With dead ends: 211 [2018-09-23 19:44:28,235 INFO L226 Difference]: Without dead ends: 141 [2018-09-23 19:44:28,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2355 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2018-09-23 19:44:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-23 19:44:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-23 19:44:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-23 19:44:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-23 19:44:28,327 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-23 19:44:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:28,328 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-23 19:44:28,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-23 19:44:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-23 19:44:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-23 19:44:28,328 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:28,328 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-09-23 19:44:28,329 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:28,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash 32287481, now seen corresponding path program 49 times [2018-09-23 19:44:28,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:28,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:28,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:28,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:44:28,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:29,425 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:44:29,425 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-09-23 19:44:29,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:29,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:44:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:29,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:44:29,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 37 [2018-09-23 19:44:29,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-23 19:44:29,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-23 19:44:29,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-09-23 19:44:29,586 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 38 states. [2018-09-23 19:44:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:30,455 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-23 19:44:30,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-23 19:44:30,455 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2018-09-23 19:44:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:30,457 INFO L225 Difference]: With dead ends: 145 [2018-09-23 19:44:30,457 INFO L226 Difference]: Without dead ends: 143 [2018-09-23 19:44:30,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-23 19:44:30,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-23 19:44:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-23 19:44:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-23 19:44:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-23 19:44:30,545 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-09-23 19:44:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:30,546 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-23 19:44:30,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-23 19:44:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-23 19:44:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-23 19:44:30,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:30,547 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-23 19:44:30,547 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:30,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:30,547 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 50 times [2018-09-23 19:44:30,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:30,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:30,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:30,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:30,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:34,102 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:44:34,102 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-09-23 19:44:34,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:44:34,190 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:44:34,190 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:44:34,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:44:36,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-23 19:44:36,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:44:36,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 19:44:36,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-23 19:44:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:37,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:44:37,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 108 [2018-09-23 19:44:37,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-23 19:44:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-23 19:44:37,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=11450, Unknown=0, NotChecked=0, Total=11772 [2018-09-23 19:44:37,129 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 109 states. [2018-09-23 19:44:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:43,156 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-09-23 19:44:43,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-23 19:44:43,156 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 142 [2018-09-23 19:44:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:43,157 INFO L225 Difference]: With dead ends: 217 [2018-09-23 19:44:43,158 INFO L226 Difference]: Without dead ends: 145 [2018-09-23 19:44:43,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2494 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=681, Invalid=20489, Unknown=0, NotChecked=0, Total=21170 [2018-09-23 19:44:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-23 19:44:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-23 19:44:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-23 19:44:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-09-23 19:44:43,251 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-09-23 19:44:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:43,251 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-09-23 19:44:43,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-23 19:44:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-09-23 19:44:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-23 19:44:43,252 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:43,252 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1] [2018-09-23 19:44:43,252 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:43,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2111083117, now seen corresponding path program 51 times [2018-09-23 19:44:43,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:43,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:43,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:43,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:44:43,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-23 19:44:44,064 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 19:44:44,069 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 19:44:44,069 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:44:44 BoogieIcfgContainer [2018-09-23 19:44:44,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:44:44,071 INFO L168 Benchmark]: Toolchain (without parser) took 242192.08 ms. Allocated memory was 1.6 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 387.6 MB. Max. memory is 7.1 GB. [2018-09-23 19:44:44,071 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:44:44,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.70 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:44:44,072 INFO L168 Benchmark]: Boogie Preprocessor took 27.30 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:44:44,072 INFO L168 Benchmark]: RCFGBuilder took 310.76 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-23 19:44:44,072 INFO L168 Benchmark]: TraceAbstraction took 241801.02 ms. Allocated memory was 1.6 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 366.4 MB. Max. memory is 7.1 GB. [2018-09-23 19:44:44,074 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.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.70 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.30 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 310.76 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241801.02 ms. Allocated memory was 1.6 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 366.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 80). Cancelled while BasicCegarLoop was analyzing trace of length 145 with TraceHistMax 36, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 143 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 241.7s OverallTime, 53 OverallIterations, 36 TraceHistogramMax, 124.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1794 SDtfs, 5099 SDslu, 78609 SDs, 0 SdLazy, 83763 SolverSat, 5611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6816 GetRequests, 3106 SyntacticMatches, 24 SemanticMatches, 3686 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52498 ImplicationChecksByTransitivity, 157.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 52 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 106.2s InterpolantComputationTime, 7566 NumberOfCodeBlocks, 7413 NumberOfCodeBlocksAsserted, 529 NumberOfCheckSat, 7463 ConstructedInterpolants, 0 QuantifiedInterpolants, 4137911 SizeOfPredicates, 297 NumberOfNonLiveVariables, 12745 ConjunctsInSsa, 3768 ConjunctsInUnsatCore, 103 InterpolantComputations, 1 PerfectInterpolantSequences, 18946/83904 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-44-44-083.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-44-44-083.csv Completed graceful shutdown