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-00a8621 [2018-09-30 10:24:22,872 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:24:22,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:24:22,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:24:22,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:24:22,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:24:22,889 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:24:22,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:24:22,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:24:22,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:24:22,895 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:24:22,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:24:22,896 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:24:22,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:24:22,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:24:22,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:24:22,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:24:22,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:24:22,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:24:22,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:24:22,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:24:22,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:24:22,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:24:22,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:24:22,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:24:22,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:24:22,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:24:22,916 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:24:22,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:24:22,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:24:22,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:24:22,924 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:24:22,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:24:22,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:24:22,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:24:22,926 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:24:22,926 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-30 10:24:22,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:24:22,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:24:22,948 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:24:22,950 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:24:22,951 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:24:22,951 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:24:22,952 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:24:22,952 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:24:22,953 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:24:22,953 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:24:22,953 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:24:22,953 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:24:22,953 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:24:22,953 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:24:22,954 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:24:22,954 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:24:22,954 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:24:22,954 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:24:22,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:24:22,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:24:22,955 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:24:22,955 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:24:22,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:24:22,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:24:22,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:24:22,956 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:24:22,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:24:22,957 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:24:22,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:24:22,957 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:24:23,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:24:23,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:24:23,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:24:23,026 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:24:23,027 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:24:23,028 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-30 10:24:23,028 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-09-30 10:24:23,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:24:23,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:24:23,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:24:23,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:24:23,103 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:24:23,126 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 30.09 10:24:23" (1/1) ... [2018-09-30 10:24:23,145 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 30.09 10:24:23" (1/1) ... [2018-09-30 10:24:23,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:24:23,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:24:23,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:24:23,156 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:24:23,168 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 30.09 10:24:23" (1/1) ... [2018-09-30 10:24:23,168 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 30.09 10:24:23" (1/1) ... [2018-09-30 10:24:23,169 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 30.09 10:24:23" (1/1) ... [2018-09-30 10:24:23,170 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 30.09 10:24:23" (1/1) ... [2018-09-30 10:24:23,175 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 30.09 10:24:23" (1/1) ... [2018-09-30 10:24:23,177 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 30.09 10:24:23" (1/1) ... [2018-09-30 10:24:23,179 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 30.09 10:24:23" (1/1) ... [2018-09-30 10:24:23,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:24:23,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:24:23,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:24:23,187 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:24:23,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:24:23" (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-30 10:24:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:24:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:24:23,476 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:24:23,476 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:24:23 BoogieIcfgContainer [2018-09-30 10:24:23,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:24:23,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:24:23,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:24:23,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:24:23,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:24:23" (1/2) ... [2018-09-30 10:24:23,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a8318b and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:24:23, skipping insertion in model container [2018-09-30 10:24:23,483 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 30.09 10:24:23" (2/2) ... [2018-09-30 10:24:23,485 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-09-30 10:24:23,495 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:24:23,504 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:24:23,556 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:24:23,556 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:24:23,557 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:24:23,557 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:24:23,557 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:24:23,557 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:24:23,557 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:24:23,558 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:24:23,558 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:24:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-09-30 10:24:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 10:24:23,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:23,582 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-30 10:24:23,583 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:23,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:23,590 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-09-30 10:24:23,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:23,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:23,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:23,861 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-30 10:24:23,864 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:24:23,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:24:23,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:24:23,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:24:23,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:24:23,890 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-09-30 10:24:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:24,053 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-09-30 10:24:24,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:24:24,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-30 10:24:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:24,071 INFO L225 Difference]: With dead ends: 15 [2018-09-30 10:24:24,071 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 10:24:24,074 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-30 10:24:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 10:24:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 10:24:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 10:24:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-30 10:24:24,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-30 10:24:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:24,111 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-30 10:24:24,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:24:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-30 10:24:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:24:24,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:24,113 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:24:24,113 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:24,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-09-30 10:24:24,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:24,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:24,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:24,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:24,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:24,226 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-30 10:24:24,226 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:24,227 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-30 10:24:24,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:24,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:24,282 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-30 10:24:24,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:24,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-09-30 10:24:24,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:24:24,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:24:24,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:24:24,305 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-09-30 10:24:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:24,397 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-30 10:24:24,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:24:24,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-30 10:24:24,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:24,400 INFO L225 Difference]: With dead ends: 13 [2018-09-30 10:24:24,400 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 10:24:24,401 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-30 10:24:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 10:24:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 10:24:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 10:24:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-30 10:24:24,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-30 10:24:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:24,407 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-30 10:24:24,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:24:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-30 10:24:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:24:24,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:24,408 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:24:24,409 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:24,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:24,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-09-30 10:24:24,409 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:24,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:24,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:24,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:24,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:24,708 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-30 10:24:24,709 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:24,709 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-30 10:24:24,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:24,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:25,019 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-30 10:24:25,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:25,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:25,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:24:25,406 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-30 10:24:25,416 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-30 10:24:25,437 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:25,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-30 10:24:25,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:24:25,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:24:25,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:24:25,439 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-09-30 10:24:25,597 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-30 10:24:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:25,843 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-09-30 10:24:25,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:24:25,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-30 10:24:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:25,844 INFO L225 Difference]: With dead ends: 19 [2018-09-30 10:24:25,845 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 10:24:25,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:24:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 10:24:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 10:24:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 10:24:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-30 10:24:25,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-30 10:24:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:25,854 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-30 10:24:25,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:24:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-30 10:24:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:24:25,855 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:25,855 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:24:25,855 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:25,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:25,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 2 times [2018-09-30 10:24:25,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:25,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:25,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:25,971 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-30 10:24:25,971 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:25,971 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-30 10:24:25,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:24:26,012 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:24:26,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:26,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:26,021 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-30 10:24:26,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:26,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-09-30 10:24:26,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:24:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:24:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:24:26,052 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-30 10:24:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:26,433 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-30 10:24:26,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:24:26,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-30 10:24:26,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:26,435 INFO L225 Difference]: With dead ends: 17 [2018-09-30 10:24:26,435 INFO L226 Difference]: Without dead ends: 15 [2018-09-30 10:24:26,436 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-30 10:24:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-30 10:24:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-30 10:24:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-30 10:24:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-30 10:24:26,443 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-30 10:24:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:26,444 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-30 10:24:26,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:24:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-30 10:24:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:24:26,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:26,445 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-30 10:24:26,445 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:26,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2018-09-30 10:24:26,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:26,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:26,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:26,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:26,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:26,647 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-30 10:24:26,647 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:26,647 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-30 10:24:26,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:24:26,692 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 10:24:26,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:26,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:26,816 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-30 10:24:26,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:26,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:26,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:24:26,865 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-30 10:24:26,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:26,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:26,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-30 10:24:26,916 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-30 10:24:26,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:26,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-30 10:24:26,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:24:26,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:24:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:24:26,940 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2018-09-30 10:24:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:27,420 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-30 10:24:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:24:27,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-30 10:24:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:27,422 INFO L225 Difference]: With dead ends: 25 [2018-09-30 10:24:27,422 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 10:24:27,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:24:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 10:24:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-30 10:24:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 10:24:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-30 10:24:27,432 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-30 10:24:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:27,433 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-30 10:24:27,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:24:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-30 10:24:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:24:27,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:27,434 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-09-30 10:24:27,434 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:27,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:27,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 4 times [2018-09-30 10:24:27,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:27,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:27,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:27,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:27,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:27,521 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-30 10:24:27,522 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:27,522 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-30 10:24:27,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:24:27,565 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:24:27,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:27,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:27,618 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-30 10:24:27,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:27,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:27,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:24:27,667 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-30 10:24:27,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:27,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-09-30 10:24:27,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:24:27,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:24:27,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:24:27,689 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-09-30 10:24:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:27,936 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-30 10:24:27,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:24:27,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-30 10:24:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:27,937 INFO L225 Difference]: With dead ends: 21 [2018-09-30 10:24:27,938 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 10:24:27,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:24:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 10:24:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-30 10:24:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-30 10:24:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-30 10:24:27,945 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-30 10:24:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:27,946 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-30 10:24:27,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:24:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-30 10:24:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:24:27,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:27,947 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-30 10:24:27,947 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:27,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:27,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 5 times [2018-09-30 10:24:27,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:27,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:27,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:27,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:27,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:28,162 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-30 10:24:28,162 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:28,162 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-30 10:24:28,170 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:24:28,189 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-30 10:24:28,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:28,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:28,391 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-30 10:24:28,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:28,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:28,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:24:28,440 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-30 10:24:28,461 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:28,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-09-30 10:24:28,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:24:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:24:28,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:24:28,463 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-09-30 10:24:28,736 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-09-30 10:24:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:29,622 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-09-30 10:24:29,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:24:29,622 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 10:24:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:29,624 INFO L225 Difference]: With dead ends: 35 [2018-09-30 10:24:29,624 INFO L226 Difference]: Without dead ends: 23 [2018-09-30 10:24:29,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2018-09-30 10:24:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-30 10:24:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-30 10:24:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 10:24:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-30 10:24:29,634 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-09-30 10:24:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:29,635 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-30 10:24:29,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:24:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-30 10:24:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:24:29,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:29,636 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-30 10:24:29,636 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:29,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 6 times [2018-09-30 10:24:29,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:29,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:29,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:29,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:29,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:29,979 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-30 10:24:29,979 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:29,979 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-30 10:24:29,989 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:24:30,016 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-09-30 10:24:30,016 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:30,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:30,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-30 10:24:30,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:30,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:30,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:24:30,219 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-30 10:24:30,240 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:30,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-09-30 10:24:30,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 10:24:30,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 10:24:30,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:24:30,242 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 19 states. [2018-09-30 10:24:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:31,043 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-09-30 10:24:31,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:24:31,043 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2018-09-30 10:24:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:31,044 INFO L225 Difference]: With dead ends: 37 [2018-09-30 10:24:31,044 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 10:24:31,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:24:31,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 10:24:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-30 10:24:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 10:24:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-30 10:24:31,053 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-30 10:24:31,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:31,053 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-30 10:24:31,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 10:24:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-30 10:24:31,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 10:24:31,054 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:31,054 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-09-30 10:24:31,055 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:31,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:31,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1774380245, now seen corresponding path program 7 times [2018-09-30 10:24:31,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:31,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:31,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:31,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:31,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:31,202 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-30 10:24:31,202 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:31,202 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-30 10:24:31,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:31,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:31,256 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-30 10:24:31,287 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:31,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-09-30 10:24:31,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:24:31,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:24:31,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:24:31,288 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-09-30 10:24:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:31,621 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-30 10:24:31,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:24:31,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-09-30 10:24:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:31,622 INFO L225 Difference]: With dead ends: 29 [2018-09-30 10:24:31,622 INFO L226 Difference]: Without dead ends: 27 [2018-09-30 10:24:31,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:24:31,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-30 10:24:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-30 10:24:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 10:24:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-30 10:24:31,631 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-30 10:24:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:31,631 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-30 10:24:31,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:24:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-30 10:24:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 10:24:31,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:31,633 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-30 10:24:31,633 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:31,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:31,633 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 8 times [2018-09-30 10:24:31,633 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:31,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:31,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:31,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:31,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:31,987 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-30 10:24:31,987 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:31,988 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:24:31,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:24:32,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:24:32,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:32,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:32,555 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-30 10:24:32,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:32,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:32,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:24:32,590 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-30 10:24:32,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:32,611 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-09-30 10:24:32,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 10:24:32,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 10:24:32,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:24:32,612 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 22 states. [2018-09-30 10:24:32,924 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-30 10:24:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:33,289 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-30 10:24:33,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:24:33,290 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-09-30 10:24:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:33,291 INFO L225 Difference]: With dead ends: 43 [2018-09-30 10:24:33,291 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 10:24:33,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2018-09-30 10:24:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 10:24:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-30 10:24:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 10:24:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-30 10:24:33,301 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-30 10:24:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:33,301 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-30 10:24:33,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 10:24:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-30 10:24:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 10:24:33,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:33,302 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-09-30 10:24:33,303 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:33,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1980325449, now seen corresponding path program 9 times [2018-09-30 10:24:33,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:33,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:33,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:33,477 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-30 10:24:33,477 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:33,477 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:24:33,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:24:33,533 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-30 10:24:33,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:33,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:33,627 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-30 10:24:33,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:33,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:33,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:24:33,663 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-30 10:24:33,685 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:33,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-30 10:24:33,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:24:33,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:24:33,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:24:33,687 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 16 states. [2018-09-30 10:24:34,284 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-09-30 10:24:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:34,340 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-30 10:24:34,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:24:34,340 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-30 10:24:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:34,341 INFO L225 Difference]: With dead ends: 33 [2018-09-30 10:24:34,341 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 10:24:34,342 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-30 10:24:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 10:24:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-30 10:24:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 10:24:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-30 10:24:34,352 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-09-30 10:24:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:34,352 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-30 10:24:34,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:24:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-30 10:24:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:24:34,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:34,353 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-30 10:24:34,353 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:34,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:34,354 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 10 times [2018-09-30 10:24:34,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:34,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:34,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:34,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:34,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:34,601 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-30 10:24:34,602 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:34,602 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-30 10:24:34,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:24:34,622 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:24:34,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:34,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:34,757 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-30 10:24:34,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:34,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:34,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:24:34,794 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-30 10:24:34,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:34,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 23 [2018-09-30 10:24:34,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-30 10:24:34,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-30 10:24:34,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:24:34,817 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 23 states. [2018-09-30 10:24:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:35,529 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-09-30 10:24:35,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 10:24:35,529 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-09-30 10:24:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:35,530 INFO L225 Difference]: With dead ends: 53 [2018-09-30 10:24:35,530 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 10:24:35,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:24:35,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 10:24:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-30 10:24:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 10:24:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-30 10:24:35,544 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-09-30 10:24:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:35,544 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-30 10:24:35,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-30 10:24:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-30 10:24:35,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:24:35,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:35,546 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-30 10:24:35,546 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:35,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:35,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 11 times [2018-09-30 10:24:35,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:35,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:35,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:35,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:35,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:35,994 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-30 10:24:35,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:35,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 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-30 10:24:36,002 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:24:36,033 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-30 10:24:36,033 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:36,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:36,428 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-30 10:24:36,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:36,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:36,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:24:36,483 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-30 10:24:36,504 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:36,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-09-30 10:24:36,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 10:24:36,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 10:24:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-09-30 10:24:36,506 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-09-30 10:24:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:38,462 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-09-30 10:24:38,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:24:38,462 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-09-30 10:24:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:38,463 INFO L225 Difference]: With dead ends: 59 [2018-09-30 10:24:38,464 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 10:24:38,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=313, Invalid=2549, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 10:24:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 10:24:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-30 10:24:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-30 10:24:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-30 10:24:38,477 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-09-30 10:24:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:38,477 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-30 10:24:38,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 10:24:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-30 10:24:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-30 10:24:38,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:38,479 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-30 10:24:38,479 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:38,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:38,479 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 12 times [2018-09-30 10:24:38,479 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:38,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:38,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:38,840 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-30 10:24:38,841 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:38,841 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-30 10:24:38,848 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:24:38,900 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-30 10:24:38,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:38,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:39,163 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-30 10:24:39,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:39,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:39,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:24:39,203 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-30 10:24:39,224 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:39,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-09-30 10:24:39,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-30 10:24:39,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-30 10:24:39,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-09-30 10:24:39,225 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 31 states. [2018-09-30 10:24:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:39,944 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-09-30 10:24:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:24:39,944 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-09-30 10:24:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:39,946 INFO L225 Difference]: With dead ends: 61 [2018-09-30 10:24:39,946 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 10:24:39,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=1535, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 10:24:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 10:24:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-30 10:24:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 10:24:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-30 10:24:39,961 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-09-30 10:24:39,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:39,961 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-30 10:24:39,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-30 10:24:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-30 10:24:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 10:24:39,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:39,962 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-09-30 10:24:39,963 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:39,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:39,963 INFO L82 PathProgramCache]: Analyzing trace with hash 830172837, now seen corresponding path program 13 times [2018-09-30 10:24:39,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:39,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:39,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:39,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:39,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:40,152 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-30 10:24:40,152 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:40,152 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-30 10:24:40,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:40,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:40,194 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-30 10:24:40,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:40,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2018-09-30 10:24:40,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:24:40,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:24:40,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:24:40,216 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2018-09-30 10:24:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:40,347 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-30 10:24:40,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:24:40,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-09-30 10:24:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:40,348 INFO L225 Difference]: With dead ends: 45 [2018-09-30 10:24:40,348 INFO L226 Difference]: Without dead ends: 43 [2018-09-30 10:24:40,349 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-30 10:24:40,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-30 10:24:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-30 10:24:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-30 10:24:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-30 10:24:40,363 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-30 10:24:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:40,363 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-30 10:24:40,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:24:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-30 10:24:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 10:24:40,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:40,364 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-30 10:24:40,365 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:40,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:40,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 14 times [2018-09-30 10:24:40,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:40,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:40,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:40,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:40,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:41,312 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-30 10:24:41,312 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:41,312 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-30 10:24:41,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:24:41,343 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:24:41,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:41,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:41,712 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-30 10:24:41,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:41,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:41,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:24:41,921 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-30 10:24:41,942 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:41,942 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2018-09-30 10:24:41,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 10:24:41,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 10:24:41,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:24:41,943 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 34 states. [2018-09-30 10:24:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:42,940 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-30 10:24:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:24:42,940 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2018-09-30 10:24:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:42,941 INFO L225 Difference]: With dead ends: 67 [2018-09-30 10:24:42,941 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 10:24:42,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 10:24:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 10:24:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-30 10:24:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-30 10:24:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-30 10:24:42,958 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-30 10:24:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:42,959 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-30 10:24:42,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 10:24:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-30 10:24:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 10:24:42,959 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:42,960 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-09-30 10:24:42,960 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:42,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:42,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2070347801, now seen corresponding path program 15 times [2018-09-30 10:24:42,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:42,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:42,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:42,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:42,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:43,132 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-30 10:24:43,132 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:43,132 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:24:43,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:24:43,172 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 10:24:43,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:43,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:43,331 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-30 10:24:43,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:43,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:43,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:24:43,365 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-30 10:24:43,386 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:43,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-09-30 10:24:43,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 10:24:43,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 10:24:43,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-09-30 10:24:43,388 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 24 states. [2018-09-30 10:24:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:43,908 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-30 10:24:43,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:24:43,908 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-30 10:24:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:43,909 INFO L225 Difference]: With dead ends: 49 [2018-09-30 10:24:43,909 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 10:24:43,910 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-30 10:24:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 10:24:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-30 10:24:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 10:24:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-30 10:24:43,924 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-30 10:24:43,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:43,925 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-30 10:24:43,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 10:24:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-30 10:24:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 10:24:43,926 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:43,926 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-30 10:24:43,926 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:43,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:43,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 16 times [2018-09-30 10:24:43,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:43,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:43,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:43,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:43,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:44,608 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-30 10:24:44,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:44,609 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-30 10:24:44,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:24:44,647 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:24:44,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:44,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:44,953 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-30 10:24:44,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:44,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:44,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:24:44,997 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-30 10:24:45,021 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:45,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 35 [2018-09-30 10:24:45,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 10:24:45,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 10:24:45,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 10:24:45,022 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 35 states. [2018-09-30 10:24:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:46,193 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-09-30 10:24:46,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 10:24:46,193 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-09-30 10:24:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:46,194 INFO L225 Difference]: With dead ends: 77 [2018-09-30 10:24:46,194 INFO L226 Difference]: Without dead ends: 51 [2018-09-30 10:24:46,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=2245, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 10:24:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-30 10:24:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-30 10:24:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-30 10:24:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-30 10:24:46,215 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-09-30 10:24:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:46,216 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-30 10:24:46,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 10:24:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-30 10:24:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 10:24:46,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:46,217 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-30 10:24:46,217 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:46,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:46,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 17 times [2018-09-30 10:24:46,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:46,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:46,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:46,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:46,712 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-30 10:24:46,713 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:46,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:24:46,720 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:24:46,766 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 10:24:46,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:46,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:47,739 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-30 10:24:47,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:47,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:47,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:24:47,797 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-30 10:24:47,817 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:47,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2018-09-30 10:24:47,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 10:24:47,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 10:24:47,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2034, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 10:24:47,820 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 48 states. [2018-09-30 10:24:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:50,194 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-09-30 10:24:50,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 10:24:50,195 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 50 [2018-09-30 10:24:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:50,195 INFO L225 Difference]: With dead ends: 83 [2018-09-30 10:24:50,196 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 10:24:50,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=567, Invalid=5439, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 10:24:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 10:24:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-30 10:24:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-30 10:24:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-30 10:24:50,215 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-09-30 10:24:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:50,215 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-30 10:24:50,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 10:24:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-30 10:24:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-30 10:24:50,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:50,216 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-30 10:24:50,216 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:50,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 18 times [2018-09-30 10:24:50,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:50,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:50,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:50,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:50,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:50,856 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-30 10:24:50,856 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:50,857 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-30 10:24:50,865 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:24:50,913 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 10:24:50,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:50,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:51,574 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-30 10:24:51,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:51,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:51,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:24:51,641 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-30 10:24:51,663 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:51,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 41 [2018-09-30 10:24:51,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-30 10:24:51,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-30 10:24:51,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2018-09-30 10:24:51,664 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 41 states. [2018-09-30 10:24:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:53,285 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-09-30 10:24:53,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 10:24:53,285 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-09-30 10:24:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:53,286 INFO L225 Difference]: With dead ends: 89 [2018-09-30 10:24:53,286 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 10:24:53,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=239, Invalid=3067, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 10:24:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 10:24:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-30 10:24:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 10:24:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-30 10:24:53,313 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-09-30 10:24:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:53,313 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-30 10:24:53,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-30 10:24:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-30 10:24:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 10:24:53,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:53,314 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-30 10:24:53,314 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:53,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:53,314 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 19 times [2018-09-30 10:24:53,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:53,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:53,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:53,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:53,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:55,150 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-30 10:24:55,150 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:55,151 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:24:55,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:55,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:55,801 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-30 10:24:55,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:55,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:55,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:24:55,853 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-30 10:24:55,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:55,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 45 [2018-09-30 10:24:55,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 10:24:55,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 10:24:55,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 10:24:55,875 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 46 states. [2018-09-30 10:24:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:57,430 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-30 10:24:57,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 10:24:57,431 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 58 [2018-09-30 10:24:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:57,431 INFO L225 Difference]: With dead ends: 91 [2018-09-30 10:24:57,431 INFO L226 Difference]: Without dead ends: 61 [2018-09-30 10:24:57,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 10:24:57,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-30 10:24:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-30 10:24:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-30 10:24:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-30 10:24:57,455 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-30 10:24:57,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:57,455 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-30 10:24:57,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 10:24:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-30 10:24:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 10:24:57,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:57,456 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-09-30 10:24:57,456 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:57,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:57,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1210122729, now seen corresponding path program 20 times [2018-09-30 10:24:57,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:57,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:57,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:24:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:57,682 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-30 10:24:57,682 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:57,682 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-30 10:24:57,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:24:57,724 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:24:57,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:57,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:57,738 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-30 10:24:57,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:57,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-09-30 10:24:57,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:24:57,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:24:57,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:24:57,763 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2018-09-30 10:24:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:24:57,993 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-30 10:24:57,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:24:57,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-09-30 10:24:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:24:57,997 INFO L225 Difference]: With dead ends: 65 [2018-09-30 10:24:57,997 INFO L226 Difference]: Without dead ends: 63 [2018-09-30 10:24:57,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-30 10:24:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-30 10:24:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-30 10:24:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-30 10:24:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-30 10:24:58,022 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-30 10:24:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:24:58,023 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-30 10:24:58,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:24:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-30 10:24:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-30 10:24:58,023 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:24:58,024 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-30 10:24:58,024 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:24:58,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:24:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 21 times [2018-09-30 10:24:58,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:24:58,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:24:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:58,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:24:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:24:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:24:58,704 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-30 10:24:58,704 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:24:58,704 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:24:58,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:24:58,777 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-09-30 10:24:58,777 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:24:58,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:24:59,316 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-30 10:24:59,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:24:59,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:24:59,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:24:59,375 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-30 10:24:59,396 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:24:59,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17] total 47 [2018-09-30 10:24:59,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-30 10:24:59,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-30 10:24:59,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2044, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 10:24:59,398 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 47 states. [2018-09-30 10:25:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:01,331 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-09-30 10:25:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 10:25:01,331 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2018-09-30 10:25:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:01,332 INFO L225 Difference]: With dead ends: 101 [2018-09-30 10:25:01,332 INFO L226 Difference]: Without dead ends: 67 [2018-09-30 10:25:01,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=273, Invalid=4017, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 10:25:01,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-30 10:25:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-30 10:25:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 10:25:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-30 10:25:01,359 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-09-30 10:25:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:01,359 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-30 10:25:01,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-30 10:25:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-30 10:25:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 10:25:01,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:01,360 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-30 10:25:01,360 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:01,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:01,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 22 times [2018-09-30 10:25:01,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:01,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:01,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:01,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:01,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:02,925 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-30 10:25:02,926 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:02,926 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-30 10:25:02,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:25:02,969 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:25:02,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:02,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:03,771 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-30 10:25:03,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:03,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:03,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:25:03,836 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-30 10:25:03,856 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:03,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 50 [2018-09-30 10:25:03,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 10:25:03,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 10:25:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2324, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 10:25:03,858 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 50 states. [2018-09-30 10:25:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:05,700 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-09-30 10:25:05,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 10:25:05,701 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-09-30 10:25:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:05,702 INFO L225 Difference]: With dead ends: 107 [2018-09-30 10:25:05,702 INFO L226 Difference]: Without dead ends: 71 [2018-09-30 10:25:05,703 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-30 10:25:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-30 10:25:05,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-30 10:25:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-30 10:25:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-30 10:25:05,728 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-09-30 10:25:05,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:05,728 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-30 10:25:05,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 10:25:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-30 10:25:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-30 10:25:05,729 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:05,729 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-30 10:25:05,729 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:05,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 23 times [2018-09-30 10:25:05,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:05,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:05,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:05,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:05,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:06,586 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-30 10:25:06,586 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:06,586 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-30 10:25:06,594 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:25:06,687 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-09-30 10:25:06,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:06,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:08,238 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-30 10:25:08,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:08,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:08,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:25:08,305 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-30 10:25:08,325 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:08,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2018-09-30 10:25:08,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 10:25:08,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 10:25:08,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 10:25:08,327 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 68 states. [2018-09-30 10:25:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:11,599 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-09-30 10:25:11,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 10:25:11,600 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 70 [2018-09-30 10:25:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:11,600 INFO L225 Difference]: With dead ends: 113 [2018-09-30 10:25:11,601 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 10:25:11,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=997, Invalid=10559, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 10:25:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 10:25:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-30 10:25:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 10:25:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-30 10:25:11,624 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-09-30 10:25:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:11,624 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-30 10:25:11,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 10:25:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-30 10:25:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-30 10:25:11,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:11,625 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-30 10:25:11,625 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:11,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:11,625 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 24 times [2018-09-30 10:25:11,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:11,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:11,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:11,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:11,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:12,607 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-30 10:25:12,607 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:12,607 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:25:12,615 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:25:12,692 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-09-30 10:25:12,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:12,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:13,656 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-30 10:25:13,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:13,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:13,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:25:13,721 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-30 10:25:13,741 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:13,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 57 [2018-09-30 10:25:13,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 10:25:13,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 10:25:13,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 10:25:13,742 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 58 states. [2018-09-30 10:25:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:15,649 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-30 10:25:15,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 10:25:15,650 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2018-09-30 10:25:15,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:15,651 INFO L225 Difference]: With dead ends: 115 [2018-09-30 10:25:15,651 INFO L226 Difference]: Without dead ends: 77 [2018-09-30 10:25:15,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 10:25:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-30 10:25:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-30 10:25:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 10:25:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-30 10:25:15,678 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-30 10:25:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:15,678 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-30 10:25:15,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 10:25:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-30 10:25:15,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 10:25:15,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:15,678 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-09-30 10:25:15,679 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:15,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:15,679 INFO L82 PathProgramCache]: Analyzing trace with hash -42507335, now seen corresponding path program 25 times [2018-09-30 10:25:15,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:15,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:15,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:15,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:15,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:15,969 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-30 10:25:15,969 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:15,969 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:25:15,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:25:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:16,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:16,029 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-30 10:25:16,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:16,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-09-30 10:25:16,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 10:25:16,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 10:25:16,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:25:16,051 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 22 states. [2018-09-30 10:25:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:16,350 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-30 10:25:16,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 10:25:16,351 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-09-30 10:25:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:16,352 INFO L225 Difference]: With dead ends: 81 [2018-09-30 10:25:16,352 INFO L226 Difference]: Without dead ends: 79 [2018-09-30 10:25:16,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 10:25:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-30 10:25:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-30 10:25:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-30 10:25:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-30 10:25:16,382 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-09-30 10:25:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:16,382 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-30 10:25:16,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 10:25:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-30 10:25:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-30 10:25:16,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:16,383 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-30 10:25:16,383 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:16,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 26 times [2018-09-30 10:25:16,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:16,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:16,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:16,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:25:16,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:17,820 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-30 10:25:17,820 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:17,820 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:25:17,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:25:17,871 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:25:17,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:17,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:18,789 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-30 10:25:18,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:18,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:18,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:25:18,860 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-30 10:25:18,880 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:18,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 60 [2018-09-30 10:25:18,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-30 10:25:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-30 10:25:18,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3482, Unknown=0, NotChecked=0, Total=3660 [2018-09-30 10:25:18,881 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 61 states. [2018-09-30 10:25:20,481 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-30 10:25:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:21,053 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-09-30 10:25:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:25:21,053 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 78 [2018-09-30 10:25:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:21,054 INFO L225 Difference]: With dead ends: 121 [2018-09-30 10:25:21,055 INFO L226 Difference]: Without dead ends: 81 [2018-09-30 10:25:21,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=377, Invalid=6265, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 10:25:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-30 10:25:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-30 10:25:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-30 10:25:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-30 10:25:21,084 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-30 10:25:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:21,084 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-30 10:25:21,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-30 10:25:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-30 10:25:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-30 10:25:21,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:21,085 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-09-30 10:25:21,085 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:21,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:21,085 INFO L82 PathProgramCache]: Analyzing trace with hash 752544557, now seen corresponding path program 27 times [2018-09-30 10:25:21,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:21,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:21,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:21,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:21,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:21,683 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-30 10:25:21,683 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:21,683 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:25:21,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:25:21,793 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-09-30 10:25:21,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:21,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:22,610 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-30 10:25:22,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:22,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:22,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:25:22,664 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-30 10:25:22,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:22,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-09-30 10:25:22,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 10:25:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 10:25:22,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 10:25:22,693 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 42 states. [2018-09-30 10:25:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:24,005 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-30 10:25:24,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:25:24,005 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-30 10:25:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:24,007 INFO L225 Difference]: With dead ends: 85 [2018-09-30 10:25:24,007 INFO L226 Difference]: Without dead ends: 83 [2018-09-30 10:25:24,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=588, Invalid=3318, Unknown=0, NotChecked=0, Total=3906 [2018-09-30 10:25:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-30 10:25:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-30 10:25:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-30 10:25:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-30 10:25:24,042 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-30 10:25:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:24,043 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-30 10:25:24,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 10:25:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-30 10:25:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-30 10:25:24,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:24,043 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-30 10:25:24,043 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:24,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 28 times [2018-09-30 10:25:24,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:24,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:24,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:24,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:25,231 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-30 10:25:25,232 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:25,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 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-30 10:25:25,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:25:25,267 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:25:25,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:25,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:26,203 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-30 10:25:26,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:26,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:26,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:25:26,278 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-30 10:25:26,297 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:26,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 22] total 62 [2018-09-30 10:25:26,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 10:25:26,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 10:25:26,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=3624, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 10:25:26,299 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 62 states. [2018-09-30 10:25:29,357 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-30 10:25:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:29,573 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-09-30 10:25:29,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-30 10:25:29,573 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 82 [2018-09-30 10:25:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:29,574 INFO L225 Difference]: With dead ends: 131 [2018-09-30 10:25:29,575 INFO L226 Difference]: Without dead ends: 87 [2018-09-30 10:25:29,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=358, Invalid=6952, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 10:25:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-30 10:25:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-30 10:25:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-30 10:25:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-30 10:25:29,621 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-09-30 10:25:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:29,622 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-30 10:25:29,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 10:25:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-30 10:25:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-30 10:25:29,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:29,623 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-30 10:25:29,623 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:29,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:29,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 29 times [2018-09-30 10:25:29,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:29,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:29,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:31,083 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-30 10:25:31,083 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:31,083 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-30 10:25:31,091 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:25:31,218 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-09-30 10:25:31,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:31,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:33,326 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-30 10:25:33,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:33,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:33,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:25:33,419 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-30 10:25:33,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:33,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 83 [2018-09-30 10:25:33,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 10:25:33,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 10:25:33,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=6309, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 10:25:33,441 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 84 states. [2018-09-30 10:25:37,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:37,991 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-09-30 10:25:37,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 10:25:37,991 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 86 [2018-09-30 10:25:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:37,992 INFO L225 Difference]: With dead ends: 137 [2018-09-30 10:25:37,993 INFO L226 Difference]: Without dead ends: 91 [2018-09-30 10:25:37,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2976 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1431, Invalid=15861, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 10:25:37,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-30 10:25:38,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-30 10:25:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-30 10:25:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-30 10:25:38,041 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-09-30 10:25:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:38,041 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-30 10:25:38,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 10:25:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-30 10:25:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-30 10:25:38,042 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:38,042 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-30 10:25:38,042 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:38,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 30 times [2018-09-30 10:25:38,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:38,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:38,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:38,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:38,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:40,170 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-30 10:25:40,170 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:40,170 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-30 10:25:40,178 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:25:40,280 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-09-30 10:25:40,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:40,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:41,490 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-30 10:25:41,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:41,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:41,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:25:41,578 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-30 10:25:41,599 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:41,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 69 [2018-09-30 10:25:41,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 10:25:41,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 10:25:41,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 10:25:41,600 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 70 states. [2018-09-30 10:25:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:44,446 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-30 10:25:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 10:25:44,446 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 90 [2018-09-30 10:25:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:44,447 INFO L225 Difference]: With dead ends: 139 [2018-09-30 10:25:44,447 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 10:25:44,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 10:25:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 10:25:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-30 10:25:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 10:25:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-30 10:25:44,496 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-30 10:25:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:44,497 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-30 10:25:44,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 10:25:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-30 10:25:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-30 10:25:44,497 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:44,498 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-09-30 10:25:44,498 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:44,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1017783689, now seen corresponding path program 31 times [2018-09-30 10:25:44,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:44,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:44,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:44,878 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-30 10:25:44,879 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:44,879 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:25:44,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:25:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:44,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:44,955 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-30 10:25:44,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:44,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 25 [2018-09-30 10:25:44,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 10:25:44,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 10:25:44,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:25:44,986 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 26 states. [2018-09-30 10:25:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:45,409 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-30 10:25:45,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:25:45,409 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-09-30 10:25:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:45,410 INFO L225 Difference]: With dead ends: 97 [2018-09-30 10:25:45,410 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 10:25:45,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 10:25:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 10:25:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-30 10:25:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-30 10:25:45,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-30 10:25:45,451 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-09-30 10:25:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:45,451 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-30 10:25:45,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 10:25:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-30 10:25:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-30 10:25:45,452 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:45,452 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-30 10:25:45,452 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:45,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 32 times [2018-09-30 10:25:45,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:45,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:45,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:45,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:25:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:46,731 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-30 10:25:46,731 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:46,731 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:25:46,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:25:46,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:25:46,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:46,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:48,076 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-30 10:25:48,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:48,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:48,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:25:48,189 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-30 10:25:48,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:48,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 72 [2018-09-30 10:25:48,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-30 10:25:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-30 10:25:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=5042, Unknown=0, NotChecked=0, Total=5256 [2018-09-30 10:25:48,210 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 73 states. [2018-09-30 10:25:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:51,224 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-09-30 10:25:51,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 10:25:51,224 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 94 [2018-09-30 10:25:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:51,225 INFO L225 Difference]: With dead ends: 145 [2018-09-30 10:25:51,225 INFO L226 Difference]: Without dead ends: 97 [2018-09-30 10:25:51,226 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-30 10:25:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-30 10:25:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-30 10:25:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-30 10:25:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-30 10:25:51,267 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-09-30 10:25:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:51,267 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-30 10:25:51,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-30 10:25:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-30 10:25:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 10:25:51,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:51,268 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-09-30 10:25:51,268 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:51,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070211, now seen corresponding path program 33 times [2018-09-30 10:25:51,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:51,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:51,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:52,351 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-30 10:25:52,352 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:52,352 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:25:52,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:25:52,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-09-30 10:25:52,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:52,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:53,057 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-30 10:25:53,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:53,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:53,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:25:53,118 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-30 10:25:53,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:53,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-09-30 10:25:53,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 10:25:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 10:25:53,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 10:25:53,140 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 50 states. [2018-09-30 10:25:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:25:54,893 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-30 10:25:54,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 10:25:54,893 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-30 10:25:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:25:54,894 INFO L225 Difference]: With dead ends: 101 [2018-09-30 10:25:54,895 INFO L226 Difference]: Without dead ends: 99 [2018-09-30 10:25:54,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=800, Invalid=4750, Unknown=0, NotChecked=0, Total=5550 [2018-09-30 10:25:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-30 10:25:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-30 10:25:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-30 10:25:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-30 10:25:54,941 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-30 10:25:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:25:54,941 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-30 10:25:54,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 10:25:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-30 10:25:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-30 10:25:54,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:25:54,942 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-30 10:25:54,942 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:25:54,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:25:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 34 times [2018-09-30 10:25:54,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:25:54,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:25:54,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:54,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:25:54,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:25:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:25:56,358 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-30 10:25:56,358 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:25:56,358 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-30 10:25:56,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:25:56,407 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:25:56,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:25:56,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:25:57,763 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-30 10:25:57,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:25:57,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:25:57,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:25:57,851 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-30 10:25:57,871 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:25:57,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 26] total 74 [2018-09-30 10:25:57,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 10:25:57,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 10:25:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5212, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 10:25:57,873 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 74 states. [2018-09-30 10:26:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:26:01,873 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-09-30 10:26:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-30 10:26:01,874 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 98 [2018-09-30 10:26:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:26:01,875 INFO L225 Difference]: With dead ends: 155 [2018-09-30 10:26:01,875 INFO L226 Difference]: Without dead ends: 103 [2018-09-30 10:26:01,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=426, Invalid=9876, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 10:26:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-30 10:26:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-30 10:26:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-30 10:26:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-30 10:26:01,924 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-09-30 10:26:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:26:01,924 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-30 10:26:01,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 10:26:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-30 10:26:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-30 10:26:01,924 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:26:01,924 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-30 10:26:01,925 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:26:01,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:26:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 35 times [2018-09-30 10:26:01,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:26:01,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:26:01,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:01,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:26:01,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:26:03,402 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-30 10:26:03,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:26:03,402 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-30 10:26:03,409 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:26:03,607 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-30 10:26:03,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:26:03,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:26:06,496 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-30 10:26:06,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:26:06,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:26:06,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:26:06,602 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-30 10:26:06,624 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:26:06,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 99 [2018-09-30 10:26:06,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 10:26:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 10:26:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=937, Invalid=8963, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 10:26:06,626 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 100 states. [2018-09-30 10:26:09,787 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-30 10:26:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:26:12,762 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-09-30 10:26:12,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-30 10:26:12,762 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 102 [2018-09-30 10:26:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:26:12,763 INFO L225 Difference]: With dead ends: 161 [2018-09-30 10:26:12,764 INFO L226 Difference]: Without dead ends: 107 [2018-09-30 10:26:12,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4198 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1945, Invalid=22235, Unknown=0, NotChecked=0, Total=24180 [2018-09-30 10:26:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-30 10:26:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-30 10:26:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 10:26:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-30 10:26:12,814 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-09-30 10:26:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:26:12,814 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-30 10:26:12,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 10:26:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-30 10:26:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-30 10:26:12,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:26:12,815 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-30 10:26:12,815 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:26:12,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:26:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 36 times [2018-09-30 10:26:12,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:26:12,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:26:12,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:12,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:26:12,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:26:14,680 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-30 10:26:14,680 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:26:14,681 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:26:14,688 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:26:14,832 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-09-30 10:26:14,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:26:14,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:26:16,450 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-30 10:26:16,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:26:16,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:26:16,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:26:16,547 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-30 10:26:16,568 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:26:16,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 81 [2018-09-30 10:26:16,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 10:26:16,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 10:26:16,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 10:26:16,569 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 82 states. [2018-09-30 10:26:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:26:20,487 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-30 10:26:20,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 10:26:20,487 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 106 [2018-09-30 10:26:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:26:20,489 INFO L225 Difference]: With dead ends: 163 [2018-09-30 10:26:20,489 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 10:26:20,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 10:26:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 10:26:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 10:26:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 10:26:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-30 10:26:20,544 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-30 10:26:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:26:20,544 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-30 10:26:20,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 10:26:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-30 10:26:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-30 10:26:20,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:26:20,545 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-09-30 10:26:20,545 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:26:20,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:26:20,546 INFO L82 PathProgramCache]: Analyzing trace with hash 653870937, now seen corresponding path program 37 times [2018-09-30 10:26:20,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:26:20,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:26:20,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:20,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:26:20,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:26:21,157 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-30 10:26:21,157 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:26:21,157 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-30 10:26:21,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:26:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:26:21,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:26:21,249 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-30 10:26:21,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:26:21,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 29 [2018-09-30 10:26:21,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 10:26:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 10:26:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-09-30 10:26:21,283 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2018-09-30 10:26:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:26:21,831 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-30 10:26:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 10:26:21,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-09-30 10:26:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:26:21,832 INFO L225 Difference]: With dead ends: 113 [2018-09-30 10:26:21,833 INFO L226 Difference]: Without dead ends: 111 [2018-09-30 10:26:21,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 10:26:21,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-30 10:26:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-30 10:26:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 10:26:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-30 10:26:21,886 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-30 10:26:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:26:21,886 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-30 10:26:21,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 10:26:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-30 10:26:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-30 10:26:21,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:26:21,887 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-30 10:26:21,887 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:26:21,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:26:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 38 times [2018-09-30 10:26:21,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:26:21,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:26:21,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:21,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:26:21,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:26:23,549 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-30 10:26:23,549 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:26:23,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 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-30 10:26:23,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:26:23,719 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:26:23,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:26:23,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:26:25,921 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-30 10:26:25,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:26:25,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:26:25,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:26:26,018 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-30 10:26:26,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:26:26,039 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 84 [2018-09-30 10:26:26,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-30 10:26:26,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-30 10:26:26,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=6890, Unknown=0, NotChecked=0, Total=7140 [2018-09-30 10:26:26,040 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 85 states. [2018-09-30 10:26:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:26:30,377 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-09-30 10:26:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 10:26:30,377 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 110 [2018-09-30 10:26:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:26:30,378 INFO L225 Difference]: With dead ends: 169 [2018-09-30 10:26:30,378 INFO L226 Difference]: Without dead ends: 113 [2018-09-30 10:26:30,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=529, Invalid=12353, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 10:26:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-30 10:26:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-30 10:26:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-30 10:26:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-30 10:26:30,434 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-09-30 10:26:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:26:30,434 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-30 10:26:30,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-30 10:26:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-30 10:26:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-30 10:26:30,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:26:30,435 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-09-30 10:26:30,435 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:26:30,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:26:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -738263347, now seen corresponding path program 39 times [2018-09-30 10:26:30,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:26:30,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:26:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:30,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:26:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:26:31,221 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-30 10:26:31,221 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:26:31,221 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-30 10:26:31,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:26:31,409 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-09-30 10:26:31,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:26:31,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:26:33,129 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-30 10:26:33,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:26:33,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:26:33,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:26:33,198 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-30 10:26:33,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:26:33,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-09-30 10:26:33,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 10:26:33,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 10:26:33,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 10:26:33,220 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 58 states. [2018-09-30 10:26:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:26:35,396 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-30 10:26:35,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 10:26:35,396 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-30 10:26:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:26:35,397 INFO L225 Difference]: With dead ends: 117 [2018-09-30 10:26:35,397 INFO L226 Difference]: Without dead ends: 115 [2018-09-30 10:26:35,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1044, Invalid=6438, Unknown=0, NotChecked=0, Total=7482 [2018-09-30 10:26:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-30 10:26:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-30 10:26:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-30 10:26:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-30 10:26:35,460 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-30 10:26:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:26:35,460 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-30 10:26:35,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 10:26:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-30 10:26:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-30 10:26:35,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:26:35,461 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-30 10:26:35,461 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:26:35,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:26:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 40 times [2018-09-30 10:26:35,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:26:35,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:26:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:35,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:26:35,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:26:37,296 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-30 10:26:37,296 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:26:37,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:26:37,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:26:37,346 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:26:37,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:26:37,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:26:39,174 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-30 10:26:39,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:26:39,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:26:39,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:26:39,276 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-30 10:26:39,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:26:39,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 30] total 86 [2018-09-30 10:26:39,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 10:26:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 10:26:39,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=7088, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 10:26:39,298 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 86 states. [2018-09-30 10:26:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:26:45,107 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-09-30 10:26:45,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-30 10:26:45,107 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 114 [2018-09-30 10:26:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:26:45,108 INFO L225 Difference]: With dead ends: 179 [2018-09-30 10:26:45,108 INFO L226 Difference]: Without dead ends: 119 [2018-09-30 10:26:45,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=494, Invalid=13312, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 10:26:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-30 10:26:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-30 10:26:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-30 10:26:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-30 10:26:45,175 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-09-30 10:26:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:26:45,175 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-30 10:26:45,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 10:26:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-30 10:26:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-30 10:26:45,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:26:45,176 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-30 10:26:45,176 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:26:45,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:26:45,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 41 times [2018-09-30 10:26:45,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:26:45,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:26:45,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:45,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:26:45,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:26:47,367 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-30 10:26:47,367 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:26:47,367 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-30 10:26:47,374 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:26:47,685 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-09-30 10:26:47,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:26:47,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:26:51,318 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-30 10:26:51,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:26:51,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:26:51,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:26:51,426 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-30 10:26:51,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:26:51,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 115 [2018-09-30 10:26:51,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 10:26:51,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 10:26:51,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=12081, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 10:26:51,450 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 116 states. [2018-09-30 10:26:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:26:59,319 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-09-30 10:26:59,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-30 10:26:59,319 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 118 [2018-09-30 10:26:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:26:59,320 INFO L225 Difference]: With dead ends: 185 [2018-09-30 10:26:59,320 INFO L226 Difference]: Without dead ends: 123 [2018-09-30 10:26:59,322 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-30 10:26:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-30 10:26:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-30 10:26:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-30 10:26:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-30 10:26:59,390 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-09-30 10:26:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:26:59,390 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-30 10:26:59,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 10:26:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-30 10:26:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-30 10:26:59,391 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:26:59,391 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-30 10:26:59,392 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:26:59,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:26:59,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 42 times [2018-09-30 10:26:59,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:26:59,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:26:59,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:59,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:26:59,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:26:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:01,494 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-30 10:27:01,494 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:01,494 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-30 10:27:01,508 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:27:01,709 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2018-09-30 10:27:01,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:27:01,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:03,836 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-30 10:27:03,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:27:03,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:27:03,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:27:03,947 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-30 10:27:03,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:03,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 32] total 92 [2018-09-30 10:27:03,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 10:27:03,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 10:27:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=8134, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 10:27:03,971 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 92 states. [2018-09-30 10:27:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:09,851 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-09-30 10:27:09,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-30 10:27:09,851 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 122 [2018-09-30 10:27:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:09,852 INFO L225 Difference]: With dead ends: 191 [2018-09-30 10:27:09,852 INFO L226 Difference]: Without dead ends: 127 [2018-09-30 10:27:09,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=528, Invalid=15222, Unknown=0, NotChecked=0, Total=15750 [2018-09-30 10:27:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-30 10:27:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-30 10:27:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-30 10:27:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-30 10:27:09,952 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-09-30 10:27:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:09,952 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-30 10:27:09,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 10:27:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-30 10:27:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-30 10:27:09,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:09,953 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-30 10:27:09,953 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:09,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 43 times [2018-09-30 10:27:09,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:09,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:09,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:12,202 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-30 10:27:12,202 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:12,202 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-30 10:27:12,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:12,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:14,478 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-30 10:27:14,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:27:14,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:27:14,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:27:14,609 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-30 10:27:14,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:14,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 96 [2018-09-30 10:27:14,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-30 10:27:14,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-30 10:27:14,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=9026, Unknown=0, NotChecked=0, Total=9312 [2018-09-30 10:27:14,630 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 97 states. [2018-09-30 10:27:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:19,805 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-09-30 10:27:19,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-30 10:27:19,805 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 126 [2018-09-30 10:27:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:19,807 INFO L225 Difference]: With dead ends: 193 [2018-09-30 10:27:19,807 INFO L226 Difference]: Without dead ends: 129 [2018-09-30 10:27:19,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=605, Invalid=16165, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 10:27:19,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-30 10:27:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-30 10:27:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-30 10:27:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-30 10:27:19,881 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-30 10:27:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:19,881 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-30 10:27:19,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-30 10:27:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-30 10:27:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-30 10:27:19,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:19,882 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-09-30 10:27:19,882 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:19,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:19,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2012453021, now seen corresponding path program 44 times [2018-09-30 10:27:19,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:19,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:19,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:20,597 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-30 10:27:20,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:20,598 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:27:20,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:27:20,676 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:27:20,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:27:20,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:20,710 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-30 10:27:20,741 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:20,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 34 [2018-09-30 10:27:20,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 10:27:20,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 10:27:20,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 10:27:20,742 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 35 states. [2018-09-30 10:27:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:21,467 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-30 10:27:21,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-30 10:27:21,467 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2018-09-30 10:27:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:21,469 INFO L225 Difference]: With dead ends: 133 [2018-09-30 10:27:21,469 INFO L226 Difference]: Without dead ends: 131 [2018-09-30 10:27:21,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 10:27:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-30 10:27:21,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-30 10:27:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-30 10:27:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-30 10:27:21,543 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-30 10:27:21,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:21,543 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-30 10:27:21,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 10:27:21,543 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-30 10:27:21,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-30 10:27:21,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:21,544 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-30 10:27:21,545 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:21,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:21,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 45 times [2018-09-30 10:27:21,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:21,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:21,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:21,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:21,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:24,267 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-30 10:27:24,267 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:24,267 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-30 10:27:24,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:27:24,558 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-09-30 10:27:24,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:27:24,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:27,452 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-30 10:27:27,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:27:27,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:27:27,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:27:27,571 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-30 10:27:27,593 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:27,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 99 [2018-09-30 10:27:27,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 10:27:27,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 10:27:27,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 10:27:27,594 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 100 states. [2018-09-30 10:27:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:33,605 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-09-30 10:27:33,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 10:27:33,606 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 130 [2018-09-30 10:27:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:33,607 INFO L225 Difference]: With dead ends: 199 [2018-09-30 10:27:33,607 INFO L226 Difference]: Without dead ends: 133 [2018-09-30 10:27:33,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 10:27:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-30 10:27:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-30 10:27:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-30 10:27:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-30 10:27:33,683 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-30 10:27:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:33,683 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-30 10:27:33,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 10:27:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-30 10:27:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-30 10:27:33,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:33,684 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-09-30 10:27:33,684 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:33,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:33,684 INFO L82 PathProgramCache]: Analyzing trace with hash -452907503, now seen corresponding path program 46 times [2018-09-30 10:27:33,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:33,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:33,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:33,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:33,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:34,413 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-30 10:27:34,414 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:34,414 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-30 10:27:34,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:27:34,476 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:27:34,477 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:27:34,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:35,583 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-30 10:27:35,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:27:35,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:27:35,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:27:35,675 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-30 10:27:35,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:35,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-09-30 10:27:35,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 10:27:35,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 10:27:35,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=3894, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 10:27:35,697 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 68 states. [2018-09-30 10:27:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:38,653 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-30 10:27:38,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 10:27:38,653 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-30 10:27:38,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:38,655 INFO L225 Difference]: With dead ends: 137 [2018-09-30 10:27:38,655 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 10:27:38,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2143 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1394, Invalid=8908, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 10:27:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 10:27:38,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-30 10:27:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-30 10:27:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-30 10:27:38,750 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-30 10:27:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:38,751 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-30 10:27:38,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 10:27:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-30 10:27:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-30 10:27:38,752 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:38,752 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-30 10:27:38,752 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:38,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:38,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 47 times [2018-09-30 10:27:38,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:38,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:38,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:38,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:38,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:41,709 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-30 10:27:41,710 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:41,710 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:27:41,718 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:27:42,217 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-09-30 10:27:42,217 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:27:42,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:47,152 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-30 10:27:47,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:27:47,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:27:47,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 10:27:47,287 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-30 10:27:47,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:47,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-09-30 10:27:47,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-30 10:27:47,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-30 10:27:47,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1629, Invalid=15663, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 10:27:47,311 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 132 states. [2018-09-30 10:27:53,126 WARN L178 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-30 10:27:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:57,967 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-09-30 10:27:57,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-30 10:27:57,967 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 134 [2018-09-30 10:27:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:57,969 INFO L225 Difference]: With dead ends: 209 [2018-09-30 10:27:57,969 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 10:27:57,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7266 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=3213, Invalid=38199, Unknown=0, NotChecked=0, Total=41412 [2018-09-30 10:27:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 10:27:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-30 10:27:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-30 10:27:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-30 10:27:58,056 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-09-30 10:27:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:58,056 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-30 10:27:58,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-30 10:27:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-30 10:27:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-30 10:27:58,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:58,057 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-30 10:27:58,057 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:58,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:58,058 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 48 times [2018-09-30 10:27:58,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:58,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:58,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:00,916 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-30 10:28:00,917 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:00,917 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-30 10:28:00,924 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:28:01,216 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-09-30 10:28:01,216 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:28:01,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:04,230 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-30 10:28:04,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:28:04,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:28:04,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:28:04,353 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-30 10:28:04,375 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:28:04,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 105 [2018-09-30 10:28:04,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-30 10:28:04,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-30 10:28:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 10:28:04,376 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 106 states. [2018-09-30 10:28:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:10,753 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-30 10:28:10,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-30 10:28:10,753 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 138 [2018-09-30 10:28:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:10,754 INFO L225 Difference]: With dead ends: 211 [2018-09-30 10:28:10,755 INFO L226 Difference]: Without dead ends: 141 [2018-09-30 10:28:10,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2355 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 10:28:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-30 10:28:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-30 10:28:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 10:28:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-30 10:28:10,842 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-30 10:28:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:10,842 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-30 10:28:10,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-30 10:28:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-30 10:28:10,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-30 10:28:10,843 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:10,843 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-09-30 10:28:10,843 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:10,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:10,844 INFO L82 PathProgramCache]: Analyzing trace with hash 32287481, now seen corresponding path program 49 times [2018-09-30 10:28:10,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:10,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:10,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:28:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:11,527 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-30 10:28:11,528 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:11,528 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:28:11,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:11,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:11,655 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-30 10:28:11,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:28:11,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 37 [2018-09-30 10:28:11,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 10:28:11,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 10:28:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 10:28:11,691 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 38 states. [2018-09-30 10:28:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:12,797 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-30 10:28:12,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-30 10:28:12,798 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2018-09-30 10:28:12,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:12,799 INFO L225 Difference]: With dead ends: 145 [2018-09-30 10:28:12,799 INFO L226 Difference]: Without dead ends: 143 [2018-09-30 10:28:12,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 10:28:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-30 10:28:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-30 10:28:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-30 10:28:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-30 10:28:12,889 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-09-30 10:28:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:12,890 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-30 10:28:12,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 10:28:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-30 10:28:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-30 10:28:12,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:12,891 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-30 10:28:12,891 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:12,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 50 times [2018-09-30 10:28:12,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:12,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:12,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:15,421 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-30 10:28:15,421 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:15,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:28:15,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:28:15,515 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:28:15,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:28:15,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:18,601 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-30 10:28:18,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:28:18,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:28:18,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 10:28:18,732 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-30 10:28:18,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:28:18,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 108 [2018-09-30 10:28:18,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-30 10:28:18,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-30 10:28:18,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=11450, Unknown=0, NotChecked=0, Total=11772 [2018-09-30 10:28:18,755 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 109 states. Received shutdown request... [2018-09-30 10:28:24,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-30 10:28:24,609 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:28:24,613 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:28:24,614 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:28:24 BoogieIcfgContainer [2018-09-30 10:28:24,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:28:24,615 INFO L168 Benchmark]: Toolchain (without parser) took 241515.86 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 307.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:24,615 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:28:24,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:28:24,616 INFO L168 Benchmark]: Boogie Preprocessor took 25.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:28:24,616 INFO L168 Benchmark]: RCFGBuilder took 295.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:24,616 INFO L168 Benchmark]: TraceAbstraction took 241135.84 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 286.5 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:24,618 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 295.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241135.84 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 286.5 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 constructing difference of abstraction (143states) and FLOYD_HOARE automaton (currently 72 states, 109 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 143 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 241.0s OverallTime, 52 OverallIterations, 35 TraceHistogramMax, 125.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1791 SDtfs, 5093 SDslu, 78389 SDs, 0 SdLazy, 83539 SolverSat, 5605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6814 GetRequests, 3106 SyntacticMatches, 24 SemanticMatches, 3683 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52323 ImplicationChecksByTransitivity, 156.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=51, 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.8s AutomataMinimizationTime, 51 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 105.5s 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-30_10-28-24-626.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-30_10-28-24-626.csv Completed graceful shutdown