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/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:25:49,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:25:49,963 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:25:49,976 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:25:49,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:25:49,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:25:49,979 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:25:49,981 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:25:49,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:25:49,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:25:49,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:25:49,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:25:49,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:25:49,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:25:49,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:25:49,996 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:25:49,997 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:25:50,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:25:50,007 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:25:50,009 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:25:50,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:25:50,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:25:50,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:25:50,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:25:50,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:25:50,022 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:25:50,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:25:50,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:25:50,028 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:25:50,029 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:25:50,029 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:25:50,030 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:25:50,030 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:25:50,032 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:25:50,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:25:50,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:25:50,036 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 20:25:50,055 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:25:50,055 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:25:50,056 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:25:50,056 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:25:50,057 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:25:50,057 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:25:50,057 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:25:50,057 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:25:50,058 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:25:50,058 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:25:50,058 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:25:50,058 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:25:50,058 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:25:50,059 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:25:50,059 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:25:50,059 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:25:50,059 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:25:50,059 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:25:50,060 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:25:50,060 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:25:50,060 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:25:50,060 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:25:50,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:25:50,061 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:25:50,061 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:25:50,061 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:25:50,061 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:25:50,061 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:25:50,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:25:50,062 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:25:50,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:25:50,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:25:50,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:25:50,129 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:25:50,130 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:25:50,130 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-09-30 20:25:50,131 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-09-30 20:25:50,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:25:50,183 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:25:50,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:25:50,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:25:50,184 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:25:50,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/1) ... [2018-09-30 20:25:50,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/1) ... [2018-09-30 20:25:50,229 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:25:50,229 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:25:50,229 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:25:50,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:25:50,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:25:50,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:25:50,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:25:50,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/1) ... [2018-09-30 20:25:50,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/1) ... [2018-09-30 20:25:50,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/1) ... [2018-09-30 20:25:50,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/1) ... [2018-09-30 20:25:50,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/1) ... [2018-09-30 20:25:50,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/1) ... [2018-09-30 20:25:50,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/1) ... [2018-09-30 20:25:50,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:25:50,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:25:50,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:25:50,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:25:50,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:25:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 20:25:50,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 20:25:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-30 20:25:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-30 20:25:50,742 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:25:50,743 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:25:50 BoogieIcfgContainer [2018-09-30 20:25:50,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:25:50,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:25:50,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:25:50,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:25:50,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:25:50" (1/2) ... [2018-09-30 20:25:50,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ec7f85 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:25:50, skipping insertion in model container [2018-09-30 20:25:50,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:25:50" (2/2) ... [2018-09-30 20:25:50,752 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-09-30 20:25:50,774 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:25:50,786 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-30 20:25:50,832 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:25:50,832 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:25:50,833 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:25:50,833 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:25:50,833 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:25:50,833 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:25:50,834 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:25:50,834 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:25:50,834 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:25:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-09-30 20:25:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 20:25:50,856 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:50,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 20:25:50,858 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:50,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:50,865 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-30 20:25:50,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:50,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:50,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:50,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:25:50,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:51,076 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 20:25:51,078 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:25:51,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:25:51,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:25:51,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:25:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:25:51,097 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2018-09-30 20:25:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:25:51,208 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-09-30 20:25:51,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:25:51,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-30 20:25:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:25:51,228 INFO L225 Difference]: With dead ends: 20 [2018-09-30 20:25:51,228 INFO L226 Difference]: Without dead ends: 10 [2018-09-30 20:25:51,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 20:25:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-30 20:25:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-09-30 20:25:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 20:25:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-30 20:25:51,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-09-30 20:25:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:25:51,264 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-30 20:25:51,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:25:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-30 20:25:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:25:51,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:51,264 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:25:51,265 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:51,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2018-09-30 20:25:51,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:51,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:51,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:51,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:25:51,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:51,395 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 20:25:51,396 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:25:51,396 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:25:51,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:25:51,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:25:51,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:25:51,399 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-09-30 20:25:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:25:51,578 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-30 20:25:51,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:25:51,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:25:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:25:51,579 INFO L225 Difference]: With dead ends: 17 [2018-09-30 20:25:51,579 INFO L226 Difference]: Without dead ends: 16 [2018-09-30 20:25:51,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:25:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-30 20:25:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-09-30 20:25:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 20:25:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-09-30 20:25:51,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-09-30 20:25:51,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:25:51,587 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-09-30 20:25:51,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:25:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-09-30 20:25:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:25:51,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:51,588 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-30 20:25:51,589 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:51,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:51,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2018-09-30 20:25:51,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:51,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:51,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:51,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:25:51,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:51,662 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:25:51,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:25:51,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:25:51,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:25:51,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:25:51,663 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-09-30 20:25:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:25:51,696 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-09-30 20:25:51,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:25:51,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-30 20:25:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:25:51,698 INFO L225 Difference]: With dead ends: 18 [2018-09-30 20:25:51,698 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 20:25:51,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:25:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 20:25:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 20:25:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 20:25:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 20:25:51,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-30 20:25:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:25:51,702 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-30 20:25:51,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:25:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 20:25:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:25:51,703 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:51,703 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2018-09-30 20:25:51,703 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:51,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2018-09-30 20:25:51,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:51,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:51,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:51,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:25:51,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:51,942 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 20:25:51,942 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:25:51,942 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:25:51,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:25:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:52,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:25:52,077 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 6 treesize of output 5 [2018-09-30 20:25:52,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:25:52,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:25:52,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:25:52,204 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 20:25:52,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:25:52,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-30 20:25:52,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:25:52,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:25:52,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:25:52,226 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-09-30 20:25:52,509 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-09-30 20:25:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:25:52,609 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-30 20:25:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:25:52,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-30 20:25:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:25:52,613 INFO L225 Difference]: With dead ends: 20 [2018-09-30 20:25:52,615 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 20:25:52,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:25:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 20:25:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-09-30 20:25:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-30 20:25:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-30 20:25:52,623 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-09-30 20:25:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:25:52,623 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-30 20:25:52,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:25:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-30 20:25:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:25:52,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:52,626 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-09-30 20:25:52,626 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:52,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:52,627 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2018-09-30 20:25:52,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:52,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:52,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:52,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:25:52,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:52,799 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:25:52,799 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 20:25:52,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:25:52,839 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:25:52,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:25:52,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:25:52,864 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 6 treesize of output 5 [2018-09-30 20:25:52,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:25:52,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:25:52,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:25:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:53,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:25:53,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-30 20:25:53,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:25:53,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:25:53,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:25:53,263 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2018-09-30 20:25:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:25:53,505 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-30 20:25:53,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:25:53,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-30 20:25:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:25:53,508 INFO L225 Difference]: With dead ends: 25 [2018-09-30 20:25:53,508 INFO L226 Difference]: Without dead ends: 24 [2018-09-30 20:25:53,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:25:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-30 20:25:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-09-30 20:25:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 20:25:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-30 20:25:53,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-09-30 20:25:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:25:53,515 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-30 20:25:53,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:25:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-30 20:25:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 20:25:53,516 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:53,516 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2018-09-30 20:25:53,516 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:53,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:53,517 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2018-09-30 20:25:53,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:53,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:53,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:53,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:25:53,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:53,665 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:25:53,665 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 20:25:53,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:25:53,712 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 20:25:53,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:25:53,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:25:53,735 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 6 treesize of output 5 [2018-09-30 20:25:53,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:25:53,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:25:53,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:25:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:53,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:25:53,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-30 20:25:53,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:25:53,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:25:53,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:25:53,907 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-30 20:25:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:25:54,222 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-30 20:25:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:25:54,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-30 20:25:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:25:54,224 INFO L225 Difference]: With dead ends: 30 [2018-09-30 20:25:54,225 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 20:25:54,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:25:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 20:25:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-09-30 20:25:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-30 20:25:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-30 20:25:54,231 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-09-30 20:25:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:25:54,232 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-30 20:25:54,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:25:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-30 20:25:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 20:25:54,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:54,233 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2018-09-30 20:25:54,234 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:54,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:54,234 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2018-09-30 20:25:54,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:54,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:54,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:54,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:25:54,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:54,372 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:25:54,372 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:25:54,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:25:54,430 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:25:54,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:25:54,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:25:54,446 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 6 treesize of output 5 [2018-09-30 20:25:54,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:25:54,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:25:54,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:25:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:54,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:25:54,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 20:25:54,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:25:54,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:25:54,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:25:54,587 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-09-30 20:25:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:25:54,945 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-30 20:25:54,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:25:54,946 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-09-30 20:25:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:25:54,947 INFO L225 Difference]: With dead ends: 35 [2018-09-30 20:25:54,947 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 20:25:54,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:25:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 20:25:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-09-30 20:25:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 20:25:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-30 20:25:54,955 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-09-30 20:25:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:25:54,955 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-30 20:25:54,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:25:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-30 20:25:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 20:25:54,957 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:54,957 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2018-09-30 20:25:54,957 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:54,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2018-09-30 20:25:54,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:54,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:54,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:54,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:25:54,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:55,231 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:25:55,231 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 20:25:55,240 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:25:55,272 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 20:25:55,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:25:55,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:25:55,282 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 6 treesize of output 5 [2018-09-30 20:25:55,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:25:55,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:25:55,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:25:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:55,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:25:55,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 20:25:55,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:25:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:25:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:25:55,531 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-09-30 20:25:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:25:55,948 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-30 20:25:55,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:25:55,951 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-30 20:25:55,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:25:55,953 INFO L225 Difference]: With dead ends: 40 [2018-09-30 20:25:55,953 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 20:25:55,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:25:55,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 20:25:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-09-30 20:25:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-30 20:25:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-30 20:25:55,961 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-09-30 20:25:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:25:55,961 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-30 20:25:55,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:25:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-30 20:25:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-30 20:25:55,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:55,962 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2018-09-30 20:25:55,963 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:55,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:55,963 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2018-09-30 20:25:55,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:55,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:55,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:55,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:25:55,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:56,509 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:25:56,509 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 20:25:56,517 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:25:56,575 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 20:25:56,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:25:56,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:25:56,600 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 6 treesize of output 5 [2018-09-30 20:25:56,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:25:56,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:25:56,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:25:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:56,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:25:56,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 20:25:56,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:25:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:25:56,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:25:56,902 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2018-09-30 20:25:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:25:57,243 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-30 20:25:57,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:25:57,244 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-09-30 20:25:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:25:57,245 INFO L225 Difference]: With dead ends: 45 [2018-09-30 20:25:57,245 INFO L226 Difference]: Without dead ends: 44 [2018-09-30 20:25:57,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:25:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-30 20:25:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-09-30 20:25:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 20:25:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-30 20:25:57,257 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-09-30 20:25:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:25:57,258 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-30 20:25:57,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:25:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-30 20:25:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 20:25:57,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:57,259 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2018-09-30 20:25:57,260 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:57,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:57,260 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2018-09-30 20:25:57,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:57,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:57,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:57,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:25:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:57,671 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:25:57,671 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:25:57,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:25:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:57,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:25:57,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:25:57,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:25:57,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:25:57,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:25:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:58,159 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:25:58,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-30 20:25:58,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 20:25:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 20:25:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:25:58,161 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2018-09-30 20:25:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:25:58,474 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-30 20:25:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:25:58,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-09-30 20:25:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:25:58,476 INFO L225 Difference]: With dead ends: 50 [2018-09-30 20:25:58,476 INFO L226 Difference]: Without dead ends: 49 [2018-09-30 20:25:58,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2018-09-30 20:25:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-30 20:25:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-30 20:25:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-30 20:25:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-30 20:25:58,485 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-09-30 20:25:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:25:58,486 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-30 20:25:58,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 20:25:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-30 20:25:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 20:25:58,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:25:58,487 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2018-09-30 20:25:58,487 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:25:58,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:25:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2018-09-30 20:25:58,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:25:58,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:25:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:58,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:25:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:25:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:25:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:59,369 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:25:59,369 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 20:25:59,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:25:59,412 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:25:59,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:25:59,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:25:59,435 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 6 treesize of output 5 [2018-09-30 20:25:59,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:25:59,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:25:59,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:25:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:25:59,663 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:25:59,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-30 20:25:59,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 20:25:59,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 20:25:59,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:25:59,665 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2018-09-30 20:26:00,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:00,355 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-30 20:26:00,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:26:00,355 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-09-30 20:26:00,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:00,356 INFO L225 Difference]: With dead ends: 55 [2018-09-30 20:26:00,356 INFO L226 Difference]: Without dead ends: 54 [2018-09-30 20:26:00,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2018-09-30 20:26:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-30 20:26:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-30 20:26:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-30 20:26:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-30 20:26:00,373 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-09-30 20:26:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:00,373 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-30 20:26:00,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 20:26:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-30 20:26:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 20:26:00,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:00,374 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2018-09-30 20:26:00,375 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:00,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2018-09-30 20:26:00,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:00,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:00,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:00,608 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:00,608 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 20:26:00,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:00,767 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 20:26:00,767 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:00,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:00,800 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 6 treesize of output 5 [2018-09-30 20:26:00,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:00,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:00,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:01,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:01,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-30 20:26:01,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 20:26:01,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 20:26:01,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-09-30 20:26:01,248 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2018-09-30 20:26:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:01,648 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-30 20:26:01,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:26:01,650 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-09-30 20:26:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:01,652 INFO L225 Difference]: With dead ends: 60 [2018-09-30 20:26:01,652 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 20:26:01,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 20:26:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 20:26:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-09-30 20:26:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-30 20:26:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-30 20:26:01,662 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-09-30 20:26:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:01,663 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-30 20:26:01,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 20:26:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-30 20:26:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-30 20:26:01,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:01,664 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2018-09-30 20:26:01,664 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:01,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2018-09-30 20:26:01,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:01,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:01,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:01,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:01,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:02,123 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:02,124 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 20:26:02,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:02,170 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:02,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:02,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:02,180 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 6 treesize of output 5 [2018-09-30 20:26:02,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:02,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:02,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:02,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:02,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-30 20:26:02,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 20:26:02,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 20:26:02,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:26:02,524 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2018-09-30 20:26:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:02,953 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-30 20:26:02,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:26:02,954 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-09-30 20:26:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:02,955 INFO L225 Difference]: With dead ends: 65 [2018-09-30 20:26:02,955 INFO L226 Difference]: Without dead ends: 64 [2018-09-30 20:26:02,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=481, Invalid=925, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 20:26:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-30 20:26:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-09-30 20:26:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-30 20:26:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-30 20:26:02,967 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-09-30 20:26:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:02,967 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-30 20:26:02,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 20:26:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-30 20:26:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 20:26:02,968 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:02,968 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2018-09-30 20:26:02,968 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:02,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2018-09-30 20:26:02,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:02,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:02,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:02,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:02,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:03,263 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:03,264 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 20:26:03,272 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:03,341 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 20:26:03,341 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:03,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:03,356 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 6 treesize of output 5 [2018-09-30 20:26:03,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:03,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:03,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:03,633 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:03,633 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-30 20:26:03,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-30 20:26:03,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-30 20:26:03,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2018-09-30 20:26:03,635 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-09-30 20:26:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:04,162 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-30 20:26:04,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:26:04,162 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-09-30 20:26:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:04,163 INFO L225 Difference]: With dead ends: 70 [2018-09-30 20:26:04,163 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 20:26:04,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=560, Invalid=1080, Unknown=0, NotChecked=0, Total=1640 [2018-09-30 20:26:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 20:26:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-09-30 20:26:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-30 20:26:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-30 20:26:04,173 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-09-30 20:26:04,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:04,174 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-30 20:26:04,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-30 20:26:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-30 20:26:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-30 20:26:04,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:04,176 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2018-09-30 20:26:04,176 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:04,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2018-09-30 20:26:04,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:04,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:04,422 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:04,422 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 20:26:04,434 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:04,494 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 20:26:04,495 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:04,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:04,518 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 6 treesize of output 5 [2018-09-30 20:26:04,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:04,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:04,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:04,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:04,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-30 20:26:04,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 20:26:04,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 20:26:04,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:26:04,796 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2018-09-30 20:26:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:05,395 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-30 20:26:05,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:26:05,396 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-09-30 20:26:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:05,396 INFO L225 Difference]: With dead ends: 75 [2018-09-30 20:26:05,397 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 20:26:05,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=645, Invalid=1247, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 20:26:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 20:26:05,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-09-30 20:26:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-30 20:26:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-30 20:26:05,408 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-09-30 20:26:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:05,409 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-30 20:26:05,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 20:26:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-30 20:26:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-30 20:26:05,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:05,410 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2018-09-30 20:26:05,410 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:05,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:05,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2018-09-30 20:26:05,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:05,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:05,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:05,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:05,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:05,846 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:05,847 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 20:26:05,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:05,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:05,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:05,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:05,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:05,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:06,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:06,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-30 20:26:06,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 20:26:06,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 20:26:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2018-09-30 20:26:06,255 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2018-09-30 20:26:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:07,028 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-30 20:26:07,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:26:07,029 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2018-09-30 20:26:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:07,030 INFO L225 Difference]: With dead ends: 80 [2018-09-30 20:26:07,030 INFO L226 Difference]: Without dead ends: 79 [2018-09-30 20:26:07,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 20:26:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-30 20:26:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-09-30 20:26:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-30 20:26:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-30 20:26:07,043 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-09-30 20:26:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:07,044 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-30 20:26:07,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 20:26:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-30 20:26:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 20:26:07,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:07,045 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2018-09-30 20:26:07,045 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:07,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2018-09-30 20:26:07,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:07,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:07,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:07,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:07,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:07,423 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:07,424 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 20:26:07,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:07,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:07,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:07,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:07,510 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 6 treesize of output 5 [2018-09-30 20:26:07,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:07,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:07,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:07,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:07,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-30 20:26:07,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 20:26:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 20:26:07,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:26:07,825 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2018-09-30 20:26:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:08,378 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-30 20:26:08,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:26:08,379 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-09-30 20:26:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:08,379 INFO L225 Difference]: With dead ends: 85 [2018-09-30 20:26:08,379 INFO L226 Difference]: Without dead ends: 84 [2018-09-30 20:26:08,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=833, Invalid=1617, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 20:26:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-30 20:26:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-09-30 20:26:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-30 20:26:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-30 20:26:08,396 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-09-30 20:26:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:08,396 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-30 20:26:08,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 20:26:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-30 20:26:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-30 20:26:08,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:08,397 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2018-09-30 20:26:08,397 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:08,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2018-09-30 20:26:08,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:08,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:08,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:08,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:08,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:09,403 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:09,403 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 20:26:09,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:09,493 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-30 20:26:09,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:09,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:09,500 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 6 treesize of output 5 [2018-09-30 20:26:09,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:09,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:09,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:09,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:09,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-30 20:26:09,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 20:26:09,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 20:26:09,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=815, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 20:26:09,864 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2018-09-30 20:26:10,951 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:26:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:11,220 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-30 20:26:11,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:26:11,221 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2018-09-30 20:26:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:11,222 INFO L225 Difference]: With dead ends: 90 [2018-09-30 20:26:11,222 INFO L226 Difference]: Without dead ends: 89 [2018-09-30 20:26:11,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2018-09-30 20:26:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-30 20:26:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-09-30 20:26:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-30 20:26:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-30 20:26:11,235 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-09-30 20:26:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:11,236 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-30 20:26:11,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 20:26:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-30 20:26:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 20:26:11,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:11,237 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2018-09-30 20:26:11,237 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:11,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:11,238 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2018-09-30 20:26:11,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:11,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:11,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:11,535 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:11,535 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 20:26:11,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:11,602 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:11,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:11,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:11,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 6 treesize of output 5 [2018-09-30 20:26:11,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:11,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:11,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:11,972 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:11,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-30 20:26:11,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 20:26:11,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 20:26:11,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=908, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 20:26:11,974 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2018-09-30 20:26:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:12,577 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-30 20:26:12,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:26:12,578 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2018-09-30 20:26:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:12,579 INFO L225 Difference]: With dead ends: 95 [2018-09-30 20:26:12,579 INFO L226 Difference]: Without dead ends: 94 [2018-09-30 20:26:12,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1045, Invalid=2035, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 20:26:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-30 20:26:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-09-30 20:26:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-30 20:26:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-30 20:26:12,592 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-09-30 20:26:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:12,593 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-30 20:26:12,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 20:26:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-30 20:26:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-30 20:26:12,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:12,594 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2018-09-30 20:26:12,594 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:12,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:12,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2018-09-30 20:26:12,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:12,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:12,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:12,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:12,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:13,365 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:13,365 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 20:26:13,376 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:13,457 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-30 20:26:13,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:13,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:13,463 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 6 treesize of output 5 [2018-09-30 20:26:13,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:13,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:13,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:13,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:13,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-30 20:26:13,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-30 20:26:13,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-30 20:26:13,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 20:26:13,849 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2018-09-30 20:26:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:14,503 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-30 20:26:14,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:26:14,504 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-09-30 20:26:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:14,505 INFO L225 Difference]: With dead ends: 100 [2018-09-30 20:26:14,505 INFO L226 Difference]: Without dead ends: 99 [2018-09-30 20:26:14,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1160, Invalid=2262, Unknown=0, NotChecked=0, Total=3422 [2018-09-30 20:26:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-30 20:26:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-09-30 20:26:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-30 20:26:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-30 20:26:14,518 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-09-30 20:26:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:14,519 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-30 20:26:14,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-30 20:26:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-30 20:26:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-30 20:26:14,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:14,520 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2018-09-30 20:26:14,520 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:14,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:14,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2018-09-30 20:26:14,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:14,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:14,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:14,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:14,944 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:14,944 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 20:26:14,950 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:15,040 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 20:26:15,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:15,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:15,054 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 6 treesize of output 5 [2018-09-30 20:26:15,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:15,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:15,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:15,680 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:15,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-30 20:26:15,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 20:26:15,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 20:26:15,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=1109, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 20:26:15,682 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2018-09-30 20:26:16,040 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:26:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:16,540 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-30 20:26:16,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:26:16,540 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-09-30 20:26:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:16,541 INFO L225 Difference]: With dead ends: 105 [2018-09-30 20:26:16,541 INFO L226 Difference]: Without dead ends: 104 [2018-09-30 20:26:16,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1281, Invalid=2501, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 20:26:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-30 20:26:16,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-09-30 20:26:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-30 20:26:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-30 20:26:16,555 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-09-30 20:26:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:16,555 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-30 20:26:16,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 20:26:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-30 20:26:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-30 20:26:16,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:16,556 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2018-09-30 20:26:16,556 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:16,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2018-09-30 20:26:16,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:16,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:16,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:16,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:16,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:16,949 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:16,949 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 20:26:16,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:17,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:17,043 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 6 treesize of output 5 [2018-09-30 20:26:17,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:17,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:17,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:17,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:17,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-30 20:26:17,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-30 20:26:17,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-30 20:26:17,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1217, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 20:26:17,640 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2018-09-30 20:26:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:18,392 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-30 20:26:18,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:26:18,393 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2018-09-30 20:26:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:18,394 INFO L225 Difference]: With dead ends: 110 [2018-09-30 20:26:18,395 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 20:26:18,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1408, Invalid=2752, Unknown=0, NotChecked=0, Total=4160 [2018-09-30 20:26:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 20:26:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-09-30 20:26:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-30 20:26:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-30 20:26:18,410 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-09-30 20:26:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:18,410 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-30 20:26:18,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-30 20:26:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-30 20:26:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-30 20:26:18,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:18,411 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2018-09-30 20:26:18,412 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:18,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2018-09-30 20:26:18,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:18,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:19,667 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:19,667 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 20:26:19,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:19,746 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:19,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:19,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:19,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:19,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:19,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:19,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:21,531 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:21,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-30 20:26:21,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 20:26:21,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 20:26:21,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=1330, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 20:26:21,533 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2018-09-30 20:26:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:22,327 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-30 20:26:22,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:26:22,327 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2018-09-30 20:26:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:22,328 INFO L225 Difference]: With dead ends: 115 [2018-09-30 20:26:22,329 INFO L226 Difference]: Without dead ends: 114 [2018-09-30 20:26:22,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1541, Invalid=3015, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 20:26:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-30 20:26:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-09-30 20:26:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 20:26:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-30 20:26:22,344 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-09-30 20:26:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:22,344 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-30 20:26:22,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 20:26:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-30 20:26:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-30 20:26:22,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:22,345 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2018-09-30 20:26:22,345 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:22,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:22,346 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2018-09-30 20:26:22,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:22,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:22,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:22,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:22,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:22,783 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:22,783 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 20:26:22,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:22,910 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-30 20:26:22,910 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:22,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:22,917 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 6 treesize of output 5 [2018-09-30 20:26:22,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:22,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:22,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:23,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:23,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-30 20:26:23,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 20:26:23,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 20:26:23,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=1448, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 20:26:23,427 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2018-09-30 20:26:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:24,285 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-30 20:26:24,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 20:26:24,285 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2018-09-30 20:26:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:24,286 INFO L225 Difference]: With dead ends: 120 [2018-09-30 20:26:24,287 INFO L226 Difference]: Without dead ends: 119 [2018-09-30 20:26:24,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1680, Invalid=3290, Unknown=0, NotChecked=0, Total=4970 [2018-09-30 20:26:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-30 20:26:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-09-30 20:26:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-30 20:26:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-30 20:26:24,306 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-09-30 20:26:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:24,306 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-30 20:26:24,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 20:26:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-30 20:26:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-30 20:26:24,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:24,307 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2018-09-30 20:26:24,308 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:24,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:24,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2018-09-30 20:26:24,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:24,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:24,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:24,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:24,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:25,554 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:25,554 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 20:26:25,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:25,638 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:25,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:25,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:25,667 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 6 treesize of output 5 [2018-09-30 20:26:25,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:25,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:25,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:26,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:26,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-30 20:26:26,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 20:26:26,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 20:26:26,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=1571, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 20:26:26,287 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2018-09-30 20:26:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:27,189 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-30 20:26:27,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:26:27,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2018-09-30 20:26:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:27,191 INFO L225 Difference]: With dead ends: 125 [2018-09-30 20:26:27,191 INFO L226 Difference]: Without dead ends: 124 [2018-09-30 20:26:27,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1825, Invalid=3577, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 20:26:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-30 20:26:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-09-30 20:26:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-30 20:26:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-30 20:26:27,209 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-09-30 20:26:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:27,209 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-30 20:26:27,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 20:26:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-30 20:26:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-30 20:26:27,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:27,210 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2018-09-30 20:26:27,210 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:27,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:27,211 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2018-09-30 20:26:27,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:27,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:27,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:27,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:27,867 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:27,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:26:27,875 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:27,991 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-30 20:26:27,992 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:27,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:28,000 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 6 treesize of output 5 [2018-09-30 20:26:28,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:28,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:28,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:28,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:28,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-30 20:26:28,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 20:26:28,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 20:26:28,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1699, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 20:26:28,568 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2018-09-30 20:26:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:29,621 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-30 20:26:29,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:26:29,622 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2018-09-30 20:26:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:29,622 INFO L225 Difference]: With dead ends: 130 [2018-09-30 20:26:29,622 INFO L226 Difference]: Without dead ends: 129 [2018-09-30 20:26:29,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1976, Invalid=3876, Unknown=0, NotChecked=0, Total=5852 [2018-09-30 20:26:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-30 20:26:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-09-30 20:26:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-30 20:26:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-30 20:26:29,639 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-09-30 20:26:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:29,639 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-30 20:26:29,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 20:26:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-30 20:26:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-30 20:26:29,640 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:29,640 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2018-09-30 20:26:29,641 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:29,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:29,641 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2018-09-30 20:26:29,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:29,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:29,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:30,193 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:30,193 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:26:30,201 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:30,328 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 20:26:30,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:30,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:30,351 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 6 treesize of output 5 [2018-09-30 20:26:30,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:30,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:30,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:31,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:31,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-30 20:26:31,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-30 20:26:31,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-30 20:26:31,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1030, Invalid=1832, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 20:26:31,136 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2018-09-30 20:26:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:32,119 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-30 20:26:32,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:26:32,121 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2018-09-30 20:26:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:32,121 INFO L225 Difference]: With dead ends: 135 [2018-09-30 20:26:32,122 INFO L226 Difference]: Without dead ends: 134 [2018-09-30 20:26:32,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2133, Invalid=4187, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 20:26:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-30 20:26:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-09-30 20:26:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-30 20:26:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-30 20:26:32,143 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-09-30 20:26:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:32,143 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-30 20:26:32,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-30 20:26:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-30 20:26:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-30 20:26:32,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:32,144 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2018-09-30 20:26:32,144 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:32,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:32,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2018-09-30 20:26:32,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:32,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:32,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:32,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:32,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:32,713 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:32,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 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 20:26:32,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:32,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:32,848 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 6 treesize of output 5 [2018-09-30 20:26:32,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:32,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:32,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:33,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:33,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-30 20:26:33,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-30 20:26:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-30 20:26:33,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=1970, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 20:26:33,421 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2018-09-30 20:26:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:34,502 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-30 20:26:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:26:34,503 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2018-09-30 20:26:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:34,504 INFO L225 Difference]: With dead ends: 140 [2018-09-30 20:26:34,504 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 20:26:34,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2296, Invalid=4510, Unknown=0, NotChecked=0, Total=6806 [2018-09-30 20:26:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 20:26:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-09-30 20:26:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-30 20:26:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-30 20:26:34,526 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-09-30 20:26:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:34,526 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-30 20:26:34,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-30 20:26:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-30 20:26:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-30 20:26:34,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:34,527 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2018-09-30 20:26:34,528 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:34,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:34,528 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2018-09-30 20:26:34,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:34,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:34,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:34,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:34,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:36,228 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:36,228 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) [2018-09-30 20:26:36,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:36,336 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:36,336 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:36,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:36,359 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 6 treesize of output 5 [2018-09-30 20:26:36,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:36,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:36,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:38,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:38,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-30 20:26:38,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 20:26:38,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 20:26:38,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=2113, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 20:26:38,026 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2018-09-30 20:26:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:39,087 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-30 20:26:39,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 20:26:39,087 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2018-09-30 20:26:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:39,088 INFO L225 Difference]: With dead ends: 145 [2018-09-30 20:26:39,088 INFO L226 Difference]: Without dead ends: 144 [2018-09-30 20:26:39,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2465, Invalid=4845, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 20:26:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-30 20:26:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-09-30 20:26:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 20:26:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-30 20:26:39,114 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-09-30 20:26:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:39,115 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-30 20:26:39,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 20:26:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-30 20:26:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-30 20:26:39,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:39,116 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2018-09-30 20:26:39,116 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:39,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:39,117 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2018-09-30 20:26:39,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:39,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:39,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:39,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:39,864 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:39,864 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 20:26:39,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:40,040 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-30 20:26:40,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:40,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:40,065 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 6 treesize of output 5 [2018-09-30 20:26:40,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:40,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:40,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:40,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:40,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-30 20:26:40,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-30 20:26:40,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-30 20:26:40,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=2261, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 20:26:40,941 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2018-09-30 20:26:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:42,266 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-30 20:26:42,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:26:42,267 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2018-09-30 20:26:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:42,268 INFO L225 Difference]: With dead ends: 150 [2018-09-30 20:26:42,268 INFO L226 Difference]: Without dead ends: 149 [2018-09-30 20:26:42,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2640, Invalid=5192, Unknown=0, NotChecked=0, Total=7832 [2018-09-30 20:26:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-30 20:26:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-09-30 20:26:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-30 20:26:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-30 20:26:42,290 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-09-30 20:26:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:42,290 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-30 20:26:42,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-30 20:26:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-30 20:26:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-30 20:26:42,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:42,291 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2018-09-30 20:26:42,291 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:42,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2018-09-30 20:26:42,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:42,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:42,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:42,949 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:42,949 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 20:26:42,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:43,051 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:43,051 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:43,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:43,061 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 6 treesize of output 5 [2018-09-30 20:26:43,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:43,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:43,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:43,886 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:43,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-30 20:26:43,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 20:26:43,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 20:26:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=2414, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 20:26:43,888 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2018-09-30 20:26:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:45,198 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-30 20:26:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 20:26:45,199 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2018-09-30 20:26:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:45,200 INFO L225 Difference]: With dead ends: 155 [2018-09-30 20:26:45,200 INFO L226 Difference]: Without dead ends: 154 [2018-09-30 20:26:45,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2821, Invalid=5551, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 20:26:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-30 20:26:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-09-30 20:26:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-30 20:26:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-30 20:26:45,228 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-09-30 20:26:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:45,229 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-30 20:26:45,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 20:26:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-30 20:26:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-30 20:26:45,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:45,230 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2018-09-30 20:26:45,230 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:45,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:45,231 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2018-09-30 20:26:45,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:45,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:45,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:46,256 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:46,256 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 20:26:46,266 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:46,409 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-30 20:26:46,409 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:46,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:46,419 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 6 treesize of output 5 [2018-09-30 20:26:46,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:46,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:46,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:47,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:47,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-30 20:26:47,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-30 20:26:47,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-30 20:26:47,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1460, Invalid=2572, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 20:26:47,305 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2018-09-30 20:26:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:48,559 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-30 20:26:48,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 20:26:48,560 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2018-09-30 20:26:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:48,561 INFO L225 Difference]: With dead ends: 160 [2018-09-30 20:26:48,561 INFO L226 Difference]: Without dead ends: 159 [2018-09-30 20:26:48,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3008, Invalid=5922, Unknown=0, NotChecked=0, Total=8930 [2018-09-30 20:26:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-30 20:26:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-09-30 20:26:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-30 20:26:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-30 20:26:48,589 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-09-30 20:26:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:48,589 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-30 20:26:48,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-30 20:26:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-30 20:26:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-30 20:26:48,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:48,591 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2018-09-30 20:26:48,591 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:48,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:48,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2018-09-30 20:26:48,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:48,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:48,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:48,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:48,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:49,477 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:49,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 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 20:26:49,484 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:49,654 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-30 20:26:49,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:49,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:49,667 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 6 treesize of output 5 [2018-09-30 20:26:49,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:49,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:49,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:50,425 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:50,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-30 20:26:50,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-30 20:26:50,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-30 20:26:50,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=2735, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 20:26:50,427 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2018-09-30 20:26:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:52,098 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-30 20:26:52,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 20:26:52,098 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2018-09-30 20:26:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:52,099 INFO L225 Difference]: With dead ends: 165 [2018-09-30 20:26:52,099 INFO L226 Difference]: Without dead ends: 164 [2018-09-30 20:26:52,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2939 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3201, Invalid=6305, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 20:26:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-30 20:26:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-09-30 20:26:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-30 20:26:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-30 20:26:52,124 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-09-30 20:26:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:52,125 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-30 20:26:52,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-30 20:26:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-30 20:26:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-30 20:26:52,126 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:52,126 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2018-09-30 20:26:52,126 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:52,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:52,127 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2018-09-30 20:26:52,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:52,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:52,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:52,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:52,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:52,920 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:52,920 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:26:52,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:53,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:53,042 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 6 treesize of output 5 [2018-09-30 20:26:53,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:53,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:53,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:53,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:53,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-30 20:26:53,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 20:26:53,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 20:26:53,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=2903, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 20:26:53,823 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2018-09-30 20:26:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:55,130 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-30 20:26:55,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 20:26:55,130 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2018-09-30 20:26:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:55,132 INFO L225 Difference]: With dead ends: 170 [2018-09-30 20:26:55,132 INFO L226 Difference]: Without dead ends: 169 [2018-09-30 20:26:55,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3130 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3400, Invalid=6700, Unknown=0, NotChecked=0, Total=10100 [2018-09-30 20:26:55,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-30 20:26:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-09-30 20:26:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-30 20:26:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-30 20:26:55,167 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-09-30 20:26:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:55,168 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-30 20:26:55,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 20:26:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-30 20:26:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-30 20:26:55,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:55,169 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2018-09-30 20:26:55,169 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:55,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2018-09-30 20:26:55,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:55,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:55,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:55,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:56,799 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:56,799 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 20:26:56,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:56,913 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:56,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:56,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:56,933 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 6 treesize of output 5 [2018-09-30 20:26:56,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:56,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:56,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:57,833 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:57,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-30 20:26:57,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 20:26:57,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 20:26:57,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1754, Invalid=3076, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 20:26:57,835 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2018-09-30 20:26:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:59,460 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-30 20:26:59,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 20:26:59,460 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2018-09-30 20:26:59,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:59,461 INFO L225 Difference]: With dead ends: 175 [2018-09-30 20:26:59,461 INFO L226 Difference]: Without dead ends: 174 [2018-09-30 20:26:59,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3605, Invalid=7107, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 20:26:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-30 20:26:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-09-30 20:26:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-30 20:26:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-30 20:26:59,488 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-09-30 20:26:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:59,489 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-30 20:26:59,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 20:26:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-30 20:26:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-30 20:26:59,490 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:59,490 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2018-09-30 20:26:59,490 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:26:59,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2018-09-30 20:26:59,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:59,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:59,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:59,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:59,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:00,294 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:00,294 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:27:00,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:00,488 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-30 20:27:00,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:00,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:00,498 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 6 treesize of output 5 [2018-09-30 20:27:00,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:00,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:00,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:01,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:01,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-30 20:27:01,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-30 20:27:01,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-30 20:27:01,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=3254, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 20:27:01,565 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2018-09-30 20:27:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:03,118 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-30 20:27:03,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 20:27:03,119 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2018-09-30 20:27:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:03,120 INFO L225 Difference]: With dead ends: 180 [2018-09-30 20:27:03,120 INFO L226 Difference]: Without dead ends: 179 [2018-09-30 20:27:03,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3816, Invalid=7526, Unknown=0, NotChecked=0, Total=11342 [2018-09-30 20:27:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-30 20:27:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-09-30 20:27:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-30 20:27:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-30 20:27:03,146 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-09-30 20:27:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:03,146 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-30 20:27:03,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-30 20:27:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-30 20:27:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-30 20:27:03,147 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:03,147 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2018-09-30 20:27:03,148 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:03,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2018-09-30 20:27:03,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:03,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:03,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:04,238 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:04,238 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 20:27:04,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:27:04,366 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:27:04,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:04,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:04,375 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 6 treesize of output 5 [2018-09-30 20:27:04,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:04,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:04,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:05,297 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:05,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-30 20:27:05,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 20:27:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 20:27:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1965, Invalid=3437, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 20:27:05,300 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2018-09-30 20:27:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:07,616 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-30 20:27:07,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 20:27:07,616 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2018-09-30 20:27:07,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:07,617 INFO L225 Difference]: With dead ends: 185 [2018-09-30 20:27:07,617 INFO L226 Difference]: Without dead ends: 184 [2018-09-30 20:27:07,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4033, Invalid=7957, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 20:27:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-30 20:27:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-09-30 20:27:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-30 20:27:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-30 20:27:07,657 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-09-30 20:27:07,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:07,658 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-30 20:27:07,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 20:27:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-30 20:27:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-30 20:27:07,659 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:07,659 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2018-09-30 20:27:07,659 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:07,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:07,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2018-09-30 20:27:07,660 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:07,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:07,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:07,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:07,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:08,847 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:08,848 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 20:27:08,859 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:27:09,042 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-30 20:27:09,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:09,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:09,066 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 6 treesize of output 5 [2018-09-30 20:27:09,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:09,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:09,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:10,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:10,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-30 20:27:10,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-30 20:27:10,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-30 20:27:10,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2075, Invalid=3625, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 20:27:10,378 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2018-09-30 20:27:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:12,385 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-30 20:27:12,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 20:27:12,386 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2018-09-30 20:27:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:12,387 INFO L225 Difference]: With dead ends: 190 [2018-09-30 20:27:12,387 INFO L226 Difference]: Without dead ends: 189 [2018-09-30 20:27:12,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3954 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4256, Invalid=8400, Unknown=0, NotChecked=0, Total=12656 [2018-09-30 20:27:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-30 20:27:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-09-30 20:27:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-30 20:27:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-30 20:27:12,418 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-09-30 20:27:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:12,418 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-30 20:27:12,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-30 20:27:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-30 20:27:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-30 20:27:12,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:12,419 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2018-09-30 20:27:12,420 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:12,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:12,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2018-09-30 20:27:12,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:12,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:12,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:12,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:12,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:13,338 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:13,338 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:27:13,346 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:27:13,573 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-30 20:27:13,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:13,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:13,596 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 6 treesize of output 5 [2018-09-30 20:27:13,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:13,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:13,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:16,023 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:16,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-30 20:27:16,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-30 20:27:16,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-30 20:27:16,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2188, Invalid=3818, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 20:27:16,024 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2018-09-30 20:27:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:17,857 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-30 20:27:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 20:27:17,858 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2018-09-30 20:27:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:17,859 INFO L225 Difference]: With dead ends: 195 [2018-09-30 20:27:17,859 INFO L226 Difference]: Without dead ends: 194 [2018-09-30 20:27:17,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4485, Invalid=8855, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 20:27:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-30 20:27:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-09-30 20:27:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-30 20:27:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-30 20:27:17,894 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-09-30 20:27:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:17,894 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-30 20:27:17,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-30 20:27:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-30 20:27:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-30 20:27:17,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:17,895 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2018-09-30 20:27:17,896 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:17,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:17,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2018-09-30 20:27:17,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:17,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:17,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:17,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:17,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:18,861 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:18,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:27:18,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:19,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:19,016 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 6 treesize of output 5 [2018-09-30 20:27:19,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:19,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:19,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:20,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:20,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-30 20:27:20,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-30 20:27:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-30 20:27:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2304, Invalid=4016, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 20:27:20,091 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2018-09-30 20:27:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:21,967 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-30 20:27:21,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 20:27:21,967 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2018-09-30 20:27:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:21,968 INFO L225 Difference]: With dead ends: 200 [2018-09-30 20:27:21,969 INFO L226 Difference]: Without dead ends: 199 [2018-09-30 20:27:21,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4720, Invalid=9322, Unknown=0, NotChecked=0, Total=14042 [2018-09-30 20:27:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-30 20:27:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-09-30 20:27:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-30 20:27:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-30 20:27:22,006 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-09-30 20:27:22,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:22,006 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-30 20:27:22,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-30 20:27:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-30 20:27:22,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-30 20:27:22,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:22,007 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2018-09-30 20:27:22,007 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:22,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:22,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2018-09-30 20:27:22,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:22,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:22,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:22,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:22,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:23,708 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:23,708 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:27:23,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:23,852 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:23,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:23,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:23,877 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 6 treesize of output 5 [2018-09-30 20:27:23,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:23,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:23,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:24,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:24,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-30 20:27:24,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 20:27:24,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 20:27:24,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2423, Invalid=4219, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 20:27:24,959 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2018-09-30 20:27:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:26,824 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-30 20:27:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 20:27:26,825 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2018-09-30 20:27:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:26,826 INFO L225 Difference]: With dead ends: 205 [2018-09-30 20:27:26,826 INFO L226 Difference]: Without dead ends: 204 [2018-09-30 20:27:26,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4635 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4961, Invalid=9801, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 20:27:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-30 20:27:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-09-30 20:27:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-30 20:27:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-30 20:27:26,860 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-09-30 20:27:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:26,861 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-30 20:27:26,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 20:27:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-30 20:27:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-30 20:27:26,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:26,862 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2018-09-30 20:27:26,862 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:26,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2018-09-30 20:27:26,862 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:26,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:26,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:26,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:26,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:28,053 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:28,053 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:27:28,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:28,383 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-30 20:27:28,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:28,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:28,392 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 6 treesize of output 5 [2018-09-30 20:27:28,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:28,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:28,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:29,567 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:29,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-30 20:27:29,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 20:27:29,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 20:27:29,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2545, Invalid=4427, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 20:27:29,568 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2018-09-30 20:27:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:31,415 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-30 20:27:31,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 20:27:31,416 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2018-09-30 20:27:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:31,417 INFO L225 Difference]: With dead ends: 210 [2018-09-30 20:27:31,417 INFO L226 Difference]: Without dead ends: 209 [2018-09-30 20:27:31,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4874 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5208, Invalid=10292, Unknown=0, NotChecked=0, Total=15500 [2018-09-30 20:27:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-30 20:27:31,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-09-30 20:27:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-30 20:27:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-30 20:27:31,455 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-09-30 20:27:31,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:31,456 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-30 20:27:31,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 20:27:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-30 20:27:31,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-30 20:27:31,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:31,457 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2018-09-30 20:27:31,457 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:31,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:31,457 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2018-09-30 20:27:31,457 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:31,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:31,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:31,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:31,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:32,859 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:32,859 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:27:32,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:27:33,004 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:27:33,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:33,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:33,017 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 6 treesize of output 5 [2018-09-30 20:27:33,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:33,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:33,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:34,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:34,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-30 20:27:34,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 20:27:34,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 20:27:34,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2670, Invalid=4640, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 20:27:34,235 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2018-09-30 20:27:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:36,224 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-30 20:27:36,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 20:27:36,225 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2018-09-30 20:27:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:36,226 INFO L225 Difference]: With dead ends: 215 [2018-09-30 20:27:36,226 INFO L226 Difference]: Without dead ends: 214 [2018-09-30 20:27:36,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5119 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5461, Invalid=10795, Unknown=0, NotChecked=0, Total=16256 [2018-09-30 20:27:36,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-30 20:27:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-09-30 20:27:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-30 20:27:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-30 20:27:36,267 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-09-30 20:27:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:36,268 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-30 20:27:36,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 20:27:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-30 20:27:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-30 20:27:36,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:36,269 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2018-09-30 20:27:36,269 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:36,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2018-09-30 20:27:36,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:36,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:36,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:37,623 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:37,623 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 20:27:37,630 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:27:38,066 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-30 20:27:38,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:38,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:38,091 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 6 treesize of output 5 [2018-09-30 20:27:38,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:38,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:38,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:39,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:39,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-30 20:27:39,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-30 20:27:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-30 20:27:39,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2798, Invalid=4858, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 20:27:39,443 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2018-09-30 20:27:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:41,488 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-30 20:27:41,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 20:27:41,488 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2018-09-30 20:27:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:41,489 INFO L225 Difference]: With dead ends: 220 [2018-09-30 20:27:41,489 INFO L226 Difference]: Without dead ends: 219 [2018-09-30 20:27:41,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5370 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5720, Invalid=11310, Unknown=0, NotChecked=0, Total=17030 [2018-09-30 20:27:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-30 20:27:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-09-30 20:27:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-30 20:27:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-30 20:27:41,536 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-09-30 20:27:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:41,536 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-30 20:27:41,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-30 20:27:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-30 20:27:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-30 20:27:41,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:41,537 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2018-09-30 20:27:41,537 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:41,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:41,538 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2018-09-30 20:27:41,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:41,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:41,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:41,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:43,111 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:43,111 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 20:27:43,118 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:27:43,406 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-30 20:27:43,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:43,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:43,419 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 6 treesize of output 5 [2018-09-30 20:27:43,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:43,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:43,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:44,737 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:44,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-30 20:27:44,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-30 20:27:44,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-30 20:27:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=5081, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 20:27:44,739 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2018-09-30 20:27:45,114 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:27:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:47,591 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-30 20:27:47,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 20:27:47,591 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2018-09-30 20:27:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:47,592 INFO L225 Difference]: With dead ends: 225 [2018-09-30 20:27:47,592 INFO L226 Difference]: Without dead ends: 224 [2018-09-30 20:27:47,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5627 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5985, Invalid=11837, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 20:27:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-30 20:27:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-09-30 20:27:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-30 20:27:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-30 20:27:47,632 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-09-30 20:27:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:47,632 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-30 20:27:47,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-30 20:27:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-30 20:27:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-30 20:27:47,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:47,633 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2018-09-30 20:27:47,633 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:47,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2018-09-30 20:27:47,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:47,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:47,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:47,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:47,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:49,150 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:49,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 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 20:27:49,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:49,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:49,306 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 6 treesize of output 5 [2018-09-30 20:27:49,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:49,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:49,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:50,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:50,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-30 20:27:50,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 20:27:50,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 20:27:50,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3063, Invalid=5309, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 20:27:50,703 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2018-09-30 20:27:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:53,037 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-30 20:27:53,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 20:27:53,038 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2018-09-30 20:27:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:53,039 INFO L225 Difference]: With dead ends: 230 [2018-09-30 20:27:53,039 INFO L226 Difference]: Without dead ends: 229 [2018-09-30 20:27:53,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6256, Invalid=12376, Unknown=0, NotChecked=0, Total=18632 [2018-09-30 20:27:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-30 20:27:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-09-30 20:27:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-30 20:27:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-30 20:27:53,089 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-09-30 20:27:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:53,089 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-30 20:27:53,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 20:27:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-30 20:27:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-30 20:27:53,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:53,090 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2018-09-30 20:27:53,090 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:53,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2018-09-30 20:27:53,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:53,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:53,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:54,292 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:54,293 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 20:27:54,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:54,443 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:54,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:54,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:54,456 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 6 treesize of output 5 [2018-09-30 20:27:54,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:54,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:54,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:56,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:56,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-30 20:27:56,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-30 20:27:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-30 20:27:56,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3200, Invalid=5542, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 20:27:56,042 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2018-09-30 20:27:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:58,689 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-30 20:27:58,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 20:27:58,689 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2018-09-30 20:27:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:58,691 INFO L225 Difference]: With dead ends: 235 [2018-09-30 20:27:58,691 INFO L226 Difference]: Without dead ends: 234 [2018-09-30 20:27:58,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6159 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6533, Invalid=12927, Unknown=0, NotChecked=0, Total=19460 [2018-09-30 20:27:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-30 20:27:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-09-30 20:27:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-30 20:27:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-30 20:27:58,751 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-09-30 20:27:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:58,752 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-30 20:27:58,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-30 20:27:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-30 20:27:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-30 20:27:58,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:58,753 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2018-09-30 20:27:58,753 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:27:58,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2018-09-30 20:27:58,754 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:58,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:58,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:00,029 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:00,029 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 20:28:00,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:28:00,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-30 20:28:00,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:00,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:00,397 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 6 treesize of output 5 [2018-09-30 20:28:00,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:00,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:00,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:01,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:01,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-30 20:28:01,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-30 20:28:01,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-30 20:28:01,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3340, Invalid=5780, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 20:28:01,896 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2018-09-30 20:28:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:04,507 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-30 20:28:04,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 20:28:04,507 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2018-09-30 20:28:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:04,509 INFO L225 Difference]: With dead ends: 240 [2018-09-30 20:28:04,510 INFO L226 Difference]: Without dead ends: 239 [2018-09-30 20:28:04,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6434 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6816, Invalid=13490, Unknown=0, NotChecked=0, Total=20306 [2018-09-30 20:28:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-30 20:28:04,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-09-30 20:28:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-30 20:28:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-30 20:28:04,566 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-09-30 20:28:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:04,567 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-30 20:28:04,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-30 20:28:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-30 20:28:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-30 20:28:04,568 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:04,568 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2018-09-30 20:28:04,568 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:04,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2018-09-30 20:28:04,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:04,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:04,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:04,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:04,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:06,117 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:06,117 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 20:28:06,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:28:06,292 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:28:06,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:06,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:06,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 6 treesize of output 5 [2018-09-30 20:28:06,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:06,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:06,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:07,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:07,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-30 20:28:07,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-30 20:28:07,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-30 20:28:07,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=6023, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 20:28:07,908 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2018-09-30 20:28:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:10,724 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-30 20:28:10,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 20:28:10,730 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2018-09-30 20:28:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:10,731 INFO L225 Difference]: With dead ends: 245 [2018-09-30 20:28:10,731 INFO L226 Difference]: Without dead ends: 244 [2018-09-30 20:28:10,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6715 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7105, Invalid=14065, Unknown=0, NotChecked=0, Total=21170 [2018-09-30 20:28:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-30 20:28:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-09-30 20:28:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-30 20:28:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-30 20:28:10,792 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-09-30 20:28:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:10,792 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-30 20:28:10,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-30 20:28:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-30 20:28:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-30 20:28:10,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:10,794 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2018-09-30 20:28:10,794 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:10,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:10,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2018-09-30 20:28:10,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:10,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:10,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:10,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:10,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:12,530 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:12,530 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 20:28:12,539 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:28:12,851 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-30 20:28:12,851 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:12,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:12,862 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 6 treesize of output 5 [2018-09-30 20:28:12,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:12,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:12,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:14,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:14,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-30 20:28:14,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 20:28:14,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 20:28:14,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3629, Invalid=6271, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 20:28:14,731 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2018-09-30 20:28:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:17,301 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-09-30 20:28:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 20:28:17,301 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2018-09-30 20:28:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:17,302 INFO L225 Difference]: With dead ends: 250 [2018-09-30 20:28:17,302 INFO L226 Difference]: Without dead ends: 249 [2018-09-30 20:28:17,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7002 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7400, Invalid=14652, Unknown=0, NotChecked=0, Total=22052 [2018-09-30 20:28:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-30 20:28:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-09-30 20:28:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-30 20:28:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-09-30 20:28:17,350 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-09-30 20:28:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:17,350 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-09-30 20:28:17,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 20:28:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-09-30 20:28:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-30 20:28:17,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:17,352 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2018-09-30 20:28:17,352 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:17,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2018-09-30 20:28:17,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:17,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:17,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:17,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:17,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:19,006 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:19,006 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:28:19,014 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:28:19,359 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-30 20:28:19,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:19,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:19,372 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 6 treesize of output 5 [2018-09-30 20:28:19,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:19,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:19,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:21,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:21,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-30 20:28:21,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-30 20:28:21,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-30 20:28:21,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3778, Invalid=6524, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 20:28:21,205 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2018-09-30 20:28:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:24,231 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-30 20:28:24,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 20:28:24,231 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2018-09-30 20:28:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:24,233 INFO L225 Difference]: With dead ends: 255 [2018-09-30 20:28:24,233 INFO L226 Difference]: Without dead ends: 254 [2018-09-30 20:28:24,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7295 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7701, Invalid=15251, Unknown=0, NotChecked=0, Total=22952 [2018-09-30 20:28:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-30 20:28:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-09-30 20:28:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-30 20:28:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-30 20:28:24,301 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-09-30 20:28:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:24,301 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-30 20:28:24,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-30 20:28:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-30 20:28:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-30 20:28:24,303 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:24,303 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2018-09-30 20:28:24,303 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:24,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2018-09-30 20:28:24,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:24,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:24,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:25,677 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:25,677 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:28:25,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:25,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:25,858 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 6 treesize of output 5 [2018-09-30 20:28:25,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:25,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:25,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:27,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:27,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-30 20:28:27,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-30 20:28:27,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-30 20:28:27,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3930, Invalid=6782, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 20:28:27,648 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2018-09-30 20:28:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:30,661 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-09-30 20:28:30,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 20:28:30,661 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2018-09-30 20:28:30,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:30,662 INFO L225 Difference]: With dead ends: 260 [2018-09-30 20:28:30,662 INFO L226 Difference]: Without dead ends: 259 [2018-09-30 20:28:30,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7594 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8008, Invalid=15862, Unknown=0, NotChecked=0, Total=23870 [2018-09-30 20:28:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-30 20:28:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-09-30 20:28:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-30 20:28:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-09-30 20:28:30,728 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-09-30 20:28:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:30,728 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-09-30 20:28:30,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-30 20:28:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-09-30 20:28:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-30 20:28:30,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:30,730 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2018-09-30 20:28:30,730 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:30,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2018-09-30 20:28:30,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:30,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:30,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:30,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:30,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:32,137 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:32,137 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 20:28:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:28:32,315 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:28:32,315 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:32,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:32,325 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 6 treesize of output 5 [2018-09-30 20:28:32,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:32,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:32,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:34,324 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:34,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-30 20:28:34,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-30 20:28:34,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-30 20:28:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4085, Invalid=7045, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 20:28:34,327 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2018-09-30 20:28:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:37,262 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-09-30 20:28:37,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 20:28:37,262 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2018-09-30 20:28:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:37,263 INFO L225 Difference]: With dead ends: 265 [2018-09-30 20:28:37,263 INFO L226 Difference]: Without dead ends: 264 [2018-09-30 20:28:37,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8321, Invalid=16485, Unknown=0, NotChecked=0, Total=24806 [2018-09-30 20:28:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-30 20:28:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-09-30 20:28:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-30 20:28:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-30 20:28:37,317 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-09-30 20:28:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:37,318 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-30 20:28:37,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-30 20:28:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-30 20:28:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-30 20:28:37,319 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:37,319 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2018-09-30 20:28:37,319 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:37,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2018-09-30 20:28:37,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:37,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:37,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:37,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:37,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:39,067 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:39,067 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 20:28:39,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:28:39,451 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-30 20:28:39,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:39,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:39,466 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 6 treesize of output 5 [2018-09-30 20:28:39,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:39,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:39,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:41,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:41,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-30 20:28:41,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-30 20:28:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-30 20:28:41,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4243, Invalid=7313, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 20:28:41,287 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2018-09-30 20:28:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:44,348 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-09-30 20:28:44,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 20:28:44,349 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2018-09-30 20:28:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:44,350 INFO L225 Difference]: With dead ends: 270 [2018-09-30 20:28:44,350 INFO L226 Difference]: Without dead ends: 269 [2018-09-30 20:28:44,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8210 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8640, Invalid=17120, Unknown=0, NotChecked=0, Total=25760 [2018-09-30 20:28:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-30 20:28:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-09-30 20:28:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-09-30 20:28:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-09-30 20:28:44,413 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-09-30 20:28:44,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:44,413 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-09-30 20:28:44,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-30 20:28:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-09-30 20:28:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-30 20:28:44,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:44,414 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2018-09-30 20:28:44,414 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:44,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2018-09-30 20:28:44,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:44,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:44,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:44,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:45,913 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:45,914 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:45,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:28:46,106 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:28:46,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:46,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:46,121 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 6 treesize of output 5 [2018-09-30 20:28:46,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:46,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:46,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:47,989 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:47,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-30 20:28:47,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-30 20:28:47,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-30 20:28:47,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4404, Invalid=7586, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 20:28:47,991 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2018-09-30 20:28:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:51,162 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-30 20:28:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 20:28:51,162 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2018-09-30 20:28:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:51,163 INFO L225 Difference]: With dead ends: 275 [2018-09-30 20:28:51,163 INFO L226 Difference]: Without dead ends: 274 [2018-09-30 20:28:51,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8527 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8965, Invalid=17767, Unknown=0, NotChecked=0, Total=26732 [2018-09-30 20:28:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-30 20:28:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-09-30 20:28:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-30 20:28:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-09-30 20:28:51,242 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-09-30 20:28:51,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:51,242 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-09-30 20:28:51,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-30 20:28:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-09-30 20:28:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-30 20:28:51,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:51,244 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2018-09-30 20:28:51,244 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:51,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:51,245 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2018-09-30 20:28:51,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:51,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:51,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:52,930 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:52,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:28:52,938 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:28:53,293 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-30 20:28:53,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:53,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:53,305 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 6 treesize of output 5 [2018-09-30 20:28:53,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:53,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:53,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:55,483 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:55,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-30 20:28:55,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-30 20:28:55,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-30 20:28:55,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4568, Invalid=7864, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 20:28:55,486 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2018-09-30 20:28:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:58,582 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-09-30 20:28:58,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-30 20:28:58,583 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2018-09-30 20:28:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:58,584 INFO L225 Difference]: With dead ends: 280 [2018-09-30 20:28:58,584 INFO L226 Difference]: Without dead ends: 279 [2018-09-30 20:28:58,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9296, Invalid=18426, Unknown=0, NotChecked=0, Total=27722 [2018-09-30 20:28:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-30 20:28:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-09-30 20:28:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-30 20:28:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-09-30 20:28:58,649 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-09-30 20:28:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:58,649 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-09-30 20:28:58,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-30 20:28:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-09-30 20:28:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-09-30 20:28:58,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:58,651 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2018-09-30 20:28:58,651 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:28:58,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:58,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2018-09-30 20:28:58,652 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:58,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:58,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:58,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:58,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:00,566 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:00,566 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:00,573 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:29:00,973 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-30 20:29:00,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:00,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:00,989 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 6 treesize of output 5 [2018-09-30 20:29:00,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:01,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:01,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:03,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:03,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-30 20:29:03,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-30 20:29:03,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-30 20:29:03,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4735, Invalid=8147, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 20:29:03,073 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2018-09-30 20:29:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:06,511 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-09-30 20:29:06,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 20:29:06,511 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2018-09-30 20:29:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:06,512 INFO L225 Difference]: With dead ends: 285 [2018-09-30 20:29:06,512 INFO L226 Difference]: Without dead ends: 284 [2018-09-30 20:29:06,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9633, Invalid=19097, Unknown=0, NotChecked=0, Total=28730 [2018-09-30 20:29:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-30 20:29:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-09-30 20:29:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-30 20:29:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-30 20:29:06,574 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2018-09-30 20:29:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:06,574 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-30 20:29:06,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-30 20:29:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-30 20:29:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-30 20:29:06,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:06,576 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2018-09-30 20:29:06,576 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:06,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:06,576 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2018-09-30 20:29:06,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:06,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:06,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:08,257 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:08,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:08,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:08,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:08,460 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 6 treesize of output 5 [2018-09-30 20:29:08,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:08,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:08,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:10,797 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:10,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-30 20:29:10,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 20:29:10,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 20:29:10,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4905, Invalid=8435, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 20:29:10,799 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2018-09-30 20:29:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:14,056 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-09-30 20:29:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-30 20:29:14,056 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2018-09-30 20:29:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:14,057 INFO L225 Difference]: With dead ends: 290 [2018-09-30 20:29:14,057 INFO L226 Difference]: Without dead ends: 289 [2018-09-30 20:29:14,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9514 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9976, Invalid=19780, Unknown=0, NotChecked=0, Total=29756 [2018-09-30 20:29:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-30 20:29:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2018-09-30 20:29:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-30 20:29:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-09-30 20:29:14,116 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2018-09-30 20:29:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:14,116 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-09-30 20:29:14,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 20:29:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-09-30 20:29:14,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-30 20:29:14,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:14,117 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2018-09-30 20:29:14,117 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:14,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:14,118 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2018-09-30 20:29:14,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:14,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:14,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:14,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:16,137 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:16,137 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:16,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:29:16,325 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:29:16,325 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:16,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:16,336 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 6 treesize of output 5 [2018-09-30 20:29:16,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:16,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:16,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:18,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:18,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-30 20:29:18,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-30 20:29:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-30 20:29:18,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5078, Invalid=8728, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 20:29:18,463 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2018-09-30 20:29:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:21,940 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-30 20:29:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-30 20:29:21,940 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2018-09-30 20:29:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:21,942 INFO L225 Difference]: With dead ends: 295 [2018-09-30 20:29:21,942 INFO L226 Difference]: Without dead ends: 294 [2018-09-30 20:29:21,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9855 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10325, Invalid=20475, Unknown=0, NotChecked=0, Total=30800 [2018-09-30 20:29:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-30 20:29:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-09-30 20:29:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-30 20:29:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-09-30 20:29:22,009 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2018-09-30 20:29:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:22,009 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-09-30 20:29:22,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-30 20:29:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-09-30 20:29:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-30 20:29:22,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:22,010 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2018-09-30 20:29:22,011 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:22,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:22,011 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2018-09-30 20:29:22,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:22,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:22,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:23,765 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:23,765 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:23,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:29:24,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-30 20:29:24,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:24,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:24,236 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 6 treesize of output 5 [2018-09-30 20:29:24,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:24,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:24,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:26,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:26,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-30 20:29:26,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-30 20:29:26,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-30 20:29:26,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5254, Invalid=9026, Unknown=0, NotChecked=0, Total=14280 [2018-09-30 20:29:26,750 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2018-09-30 20:29:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:30,259 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-09-30 20:29:30,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-30 20:29:30,260 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2018-09-30 20:29:30,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:30,261 INFO L225 Difference]: With dead ends: 300 [2018-09-30 20:29:30,261 INFO L226 Difference]: Without dead ends: 299 [2018-09-30 20:29:30,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10202 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10680, Invalid=21182, Unknown=0, NotChecked=0, Total=31862 [2018-09-30 20:29:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-30 20:29:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-09-30 20:29:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-30 20:29:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-09-30 20:29:30,331 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2018-09-30 20:29:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:30,331 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-09-30 20:29:30,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-30 20:29:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-09-30 20:29:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-30 20:29:30,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:30,333 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2018-09-30 20:29:30,333 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:30,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2018-09-30 20:29:30,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:30,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:30,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:30,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:30,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:32,109 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:32,109 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:32,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:29:32,318 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:29:32,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:32,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:32,330 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 6 treesize of output 5 [2018-09-30 20:29:32,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:32,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:32,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:34,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:34,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-30 20:29:34,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-30 20:29:34,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-30 20:29:34,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5433, Invalid=9329, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 20:29:34,619 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2018-09-30 20:29:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:38,159 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-09-30 20:29:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-30 20:29:38,159 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2018-09-30 20:29:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:38,161 INFO L225 Difference]: With dead ends: 305 [2018-09-30 20:29:38,161 INFO L226 Difference]: Without dead ends: 304 [2018-09-30 20:29:38,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=11041, Invalid=21901, Unknown=0, NotChecked=0, Total=32942 [2018-09-30 20:29:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-09-30 20:29:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-09-30 20:29:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-30 20:29:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-30 20:29:38,232 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2018-09-30 20:29:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:38,232 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-30 20:29:38,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-30 20:29:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-30 20:29:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-30 20:29:38,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:38,234 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2018-09-30 20:29:38,234 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:38,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2018-09-30 20:29:38,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:38,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:38,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:38,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:38,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:40,056 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:40,057 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:29:40,064 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:29:40,486 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-30 20:29:40,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:40,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:40,499 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 6 treesize of output 5 [2018-09-30 20:29:40,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:40,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:40,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:42,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:42,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-30 20:29:42,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-30 20:29:42,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-30 20:29:42,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5615, Invalid=9637, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 20:29:42,868 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2018-09-30 20:29:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:46,589 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-09-30 20:29:46,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-30 20:29:46,589 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2018-09-30 20:29:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:46,590 INFO L225 Difference]: With dead ends: 310 [2018-09-30 20:29:46,590 INFO L226 Difference]: Without dead ends: 309 [2018-09-30 20:29:46,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10914 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11408, Invalid=22632, Unknown=0, NotChecked=0, Total=34040 [2018-09-30 20:29:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-30 20:29:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2018-09-30 20:29:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-30 20:29:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-09-30 20:29:46,665 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2018-09-30 20:29:46,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:46,666 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-09-30 20:29:46,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-30 20:29:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-09-30 20:29:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-30 20:29:46,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:46,667 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2018-09-30 20:29:46,667 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-30 20:29:46,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2018-09-30 20:29:46,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:46,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:46,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:46,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:46,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-30 20:29:47,228 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:29:47,233 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:29:47,233 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:29:47 BoogieIcfgContainer [2018-09-30 20:29:47,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:29:47,234 INFO L168 Benchmark]: Toolchain (without parser) took 237053.64 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -769.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-30 20:29:47,235 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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 20:29:47,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.04 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 20:29:47,235 INFO L168 Benchmark]: Boogie Preprocessor took 42.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:29:47,235 INFO L168 Benchmark]: RCFGBuilder took 453.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:29:47,236 INFO L168 Benchmark]: TraceAbstraction took 236488.61 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -790.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-30 20:29:47,237 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.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. * Boogie Procedure Inliner took 63.04 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 42.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 453.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236488.61 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -790.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 306 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 306 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 2 error locations. TIMEOUT Result, 236.4s OverallTime, 63 OverallIterations, 61 TraceHistogramMax, 98.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 143 SDtfs, 10665 SDslu, 197 SDs, 0 SdLazy, 16677 SolverSat, 5351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12872 GetRequests, 7200 SyntacticMatches, 0 SemanticMatches, 5672 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224732 ImplicationChecksByTransitivity, 177.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 62 MinimizatonAttempts, 185 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.5s SsaConstructionTime, 9.6s SatisfiabilityAnalysisTime, 119.1s InterpolantComputationTime, 18307 NumberOfCodeBlocks, 18307 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 18186 ConstructedInterpolants, 0 QuantifiedInterpolants, 29486531 SizeOfPredicates, 639 NumberOfNonLiveVariables, 39176 ConjunctsInSsa, 6411 ConjunctsInUnsatCore, 121 InterpolantComputations, 3 PerfectInterpolantSequences, 2/356362 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/PointerIncrement-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-29-47-246.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-29-47-246.csv Completed graceful shutdown