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-d19836b [2018-09-26 21:31:52,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:31:52,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:31:52,872 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:31:52,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:31:52,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:31:52,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:31:52,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:31:52,878 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:31:52,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:31:52,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:31:52,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:31:52,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:31:52,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:31:52,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:31:52,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:31:52,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:31:52,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:31:52,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:31:52,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:31:52,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:31:52,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:31:52,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:31:52,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:31:52,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:31:52,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:31:52,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:31:52,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:31:52,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:31:52,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:31:52,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:31:52,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:31:52,910 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:31:52,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:31:52,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:31:52,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:31:52,915 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-26 21:31:52,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:31:52,946 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:31:52,947 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:31:52,948 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:31:52,948 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:31:52,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:31:52,949 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:31:52,949 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:31:52,949 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:31:52,949 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:31:52,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:31:52,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:31:52,950 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:31:52,950 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:31:52,952 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:31:52,952 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:31:52,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:31:52,954 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:31:52,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:31:52,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:31:52,955 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:31:52,955 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:31:52,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:31:52,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:31:52,955 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:31:52,956 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:31:52,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:31:52,956 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:31:52,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:31:52,958 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:31:53,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:31:53,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:31:53,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:31:53,044 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:31:53,044 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:31:53,045 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-26 21:31:53,046 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-09-26 21:31:53,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:31:53,132 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:31:53,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:31:53,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:31:53,133 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:31:53,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (1/1) ... [2018-09-26 21:31:53,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (1/1) ... [2018-09-26 21:31:53,179 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:31:53,180 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:31:53,180 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:31:53,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:31:53,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:31:53,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:31:53,202 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:31:53,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (1/1) ... [2018-09-26 21:31:53,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (1/1) ... [2018-09-26 21:31:53,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (1/1) ... [2018-09-26 21:31:53,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (1/1) ... [2018-09-26 21:31:53,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (1/1) ... [2018-09-26 21:31:53,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (1/1) ... [2018-09-26 21:31:53,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (1/1) ... [2018-09-26 21:31:53,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:31:53,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:31:53,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:31:53,236 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:31:53,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (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-26 21:31:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 21:31:53,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 21:31:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-26 21:31:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-26 21:31:53,625 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:31:53,626 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:31:53 BoogieIcfgContainer [2018-09-26 21:31:53,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:31:53,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:31:53,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:31:53,631 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:31:53,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:31:53" (1/2) ... [2018-09-26 21:31:53,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d510a0a and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:31:53, skipping insertion in model container [2018-09-26 21:31:53,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:31:53" (2/2) ... [2018-09-26 21:31:53,635 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-09-26 21:31:53,645 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:31:53,655 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-26 21:31:53,701 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:31:53,702 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:31:53,702 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:31:53,702 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:31:53,703 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:31:53,703 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:31:53,703 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:31:53,703 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:31:53,703 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:31:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-09-26 21:31:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:31:53,724 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:31:53,725 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 21:31:53,727 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:31:53,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:31:53,732 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-26 21:31:53,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:31:53,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:31:53,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:53,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:31:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:31:54,003 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-26 21:31:54,005 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:31:54,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:31:54,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:31:54,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:31:54,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:31:54,030 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2018-09-26 21:31:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:31:54,142 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-09-26 21:31:54,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:31:54,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 21:31:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:31:54,155 INFO L225 Difference]: With dead ends: 20 [2018-09-26 21:31:54,156 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 21:31:54,159 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-26 21:31:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 21:31:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-09-26 21:31:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 21:31:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-26 21:31:54,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-09-26 21:31:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:31:54,188 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-26 21:31:54,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:31:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-26 21:31:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:31:54,189 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:31:54,189 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:31:54,189 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:31:54,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:31:54,189 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2018-09-26 21:31:54,190 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:31:54,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:31:54,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:54,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:31:54,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:31:54,291 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-26 21:31:54,292 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:31:54,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:31:54,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:31:54,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:31:54,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:31:54,295 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-09-26 21:31:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:31:54,509 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-26 21:31:54,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:31:54,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 21:31:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:31:54,510 INFO L225 Difference]: With dead ends: 17 [2018-09-26 21:31:54,510 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 21:31:54,511 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-26 21:31:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 21:31:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-09-26 21:31:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 21:31:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-09-26 21:31:54,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-09-26 21:31:54,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:31:54,519 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-09-26 21:31:54,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:31:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-09-26 21:31:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:31:54,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:31:54,520 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:31:54,521 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:31:54,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:31:54,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2018-09-26 21:31:54,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:31:54,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:31:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:54,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:31:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:31:54,597 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-26 21:31:54,597 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:31:54,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:31:54,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:31:54,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:31:54,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:31:54,599 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-09-26 21:31:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:31:54,615 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-09-26 21:31:54,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:31:54,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-26 21:31:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:31:54,617 INFO L225 Difference]: With dead ends: 18 [2018-09-26 21:31:54,617 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 21:31:54,618 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-26 21:31:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 21:31:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 21:31:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 21:31:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 21:31:54,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 21:31:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:31:54,623 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 21:31:54,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:31:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 21:31:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:31:54,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:31:54,624 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2018-09-26 21:31:54,625 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:31:54,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:31:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2018-09-26 21:31:54,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:31:54,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:31:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:54,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:31:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:31:54,757 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-26 21:31:54,758 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:31:54,758 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-26 21:31:54,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:31:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:31:54,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:31:54,869 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-26 21:31:54,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:31:54,922 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-26 21:31:54,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:31:55,169 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-26 21:31:55,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:31:55,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-26 21:31:55,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:31:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:31:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:31:55,192 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-09-26 21:31:55,310 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-09-26 21:31:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:31:55,568 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 21:31:55,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:31:55,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 21:31:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:31:55,570 INFO L225 Difference]: With dead ends: 20 [2018-09-26 21:31:55,570 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 21:31:55,570 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-26 21:31:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 21:31:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-09-26 21:31:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 21:31:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 21:31:55,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-09-26 21:31:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:31:55,577 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 21:31:55,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:31:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 21:31:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:31:55,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:31:55,578 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-09-26 21:31:55,578 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:31:55,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:31:55,579 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2018-09-26 21:31:55,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:31:55,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:31:55,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:55,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:31:55,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:31:55,760 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-26 21:31:55,761 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:31:55,761 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-26 21:31:55,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:31:55,799 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:31:55,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:31:55,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:31:55,818 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-26 21:31:55,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:31:55,827 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-26 21:31:55,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:31:56,208 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-26 21:31:56,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:31:56,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-26 21:31:56,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:31:56,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:31:56,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:31:56,232 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2018-09-26 21:31:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:31:56,460 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 21:31:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:31:56,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-09-26 21:31:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:31:56,462 INFO L225 Difference]: With dead ends: 25 [2018-09-26 21:31:56,462 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 21:31:56,463 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-26 21:31:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 21:31:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-09-26 21:31:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 21:31:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 21:31:56,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-09-26 21:31:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:31:56,468 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 21:31:56,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:31:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 21:31:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:31:56,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:31:56,470 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2018-09-26 21:31:56,470 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:31:56,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:31:56,471 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2018-09-26 21:31:56,471 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:31:56,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:31:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:56,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:31:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:31:56,628 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-26 21:31:56,628 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:31:56,628 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) [2018-09-26 21:31:56,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:31:56,668 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-26 21:31:56,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:31:56,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:31:56,680 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-26 21:31:56,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:31:56,690 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-26 21:31:56,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:31:56,840 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-26 21:31:56,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:31:56,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-26 21:31:56,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:31:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:31:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:31:56,862 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-26 21:31:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:31:57,159 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 21:31:57,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:31:57,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 21:31:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:31:57,161 INFO L225 Difference]: With dead ends: 30 [2018-09-26 21:31:57,162 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 21:31:57,162 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-26 21:31:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 21:31:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-09-26 21:31:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 21:31:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 21:31:57,168 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-09-26 21:31:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:31:57,169 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 21:31:57,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:31:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 21:31:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 21:31:57,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:31:57,170 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2018-09-26 21:31:57,171 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:31:57,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:31:57,171 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2018-09-26 21:31:57,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:31:57,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:31:57,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:57,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:31:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:31:57,404 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-26 21:31:57,404 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:31:57,404 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-26 21:31:57,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:31:57,462 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:31:57,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:31:57,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:31:57,487 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-26 21:31:57,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:31:57,498 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-26 21:31:57,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:31:57,609 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-26 21:31:57,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:31:57,630 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-26 21:31:57,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:31:57,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:31:57,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:31:57,632 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-09-26 21:31:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:31:57,890 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 21:31:57,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:31:57,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-09-26 21:31:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:31:57,892 INFO L225 Difference]: With dead ends: 35 [2018-09-26 21:31:57,892 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 21:31:57,893 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-26 21:31:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 21:31:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-09-26 21:31:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 21:31:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 21:31:57,900 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-09-26 21:31:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:31:57,900 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 21:31:57,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:31:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 21:31:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:31:57,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:31:57,901 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2018-09-26 21:31:57,902 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:31:57,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:31:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2018-09-26 21:31:57,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:31:57,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:31:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:57,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:31:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:31:58,036 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-26 21:31:58,036 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:31:58,036 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-26 21:31:58,044 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:31:58,075 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-26 21:31:58,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:31:58,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:31:58,086 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-26 21:31:58,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:31:58,096 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-26 21:31:58,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:31:58,407 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-26 21:31:58,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:31:58,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-26 21:31:58,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:31:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:31:58,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:31:58,431 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-09-26 21:31:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:31:58,878 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 21:31:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:31:58,878 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-26 21:31:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:31:58,880 INFO L225 Difference]: With dead ends: 40 [2018-09-26 21:31:58,880 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 21:31:58,881 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-26 21:31:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 21:31:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-09-26 21:31:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 21:31:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 21:31:58,889 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-09-26 21:31:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:31:58,889 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 21:31:58,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:31:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 21:31:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 21:31:58,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:31:58,891 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2018-09-26 21:31:58,891 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:31:58,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:31:58,891 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2018-09-26 21:31:58,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:31:58,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:31:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:58,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:31:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:31:59,046 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-26 21:31:59,047 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:31:59,047 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-26 21:31:59,056 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:31:59,103 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-26 21:31:59,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:31:59,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:31:59,112 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-26 21:31:59,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:31:59,122 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-26 21:31:59,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:31:59,442 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-26 21:31:59,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:31:59,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-26 21:31:59,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:31:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:31:59,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:31:59,473 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2018-09-26 21:31:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:31:59,800 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 21:31:59,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:31:59,801 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-09-26 21:31:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:31:59,802 INFO L225 Difference]: With dead ends: 45 [2018-09-26 21:31:59,802 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 21:31:59,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:31:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 21:31:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-09-26 21:31:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 21:31:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 21:31:59,811 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-09-26 21:31:59,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:31:59,811 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 21:31:59,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:31:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 21:31:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 21:31:59,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:31:59,813 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2018-09-26 21:31:59,813 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:31:59,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:31:59,814 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2018-09-26 21:31:59,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:31:59,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:31:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:59,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:31:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:31:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:00,216 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-26 21:32:00,217 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:00,217 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-26 21:32:00,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:00,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:00,295 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-26 21:32:00,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:00,316 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-26 21:32:00,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:00,608 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-26 21:32:00,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:00,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-26 21:32:00,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:32:00,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:32:00,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:32:00,630 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2018-09-26 21:32:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:00,933 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 21:32:00,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:32:00,934 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-09-26 21:32:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:00,935 INFO L225 Difference]: With dead ends: 50 [2018-09-26 21:32:00,935 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 21:32:00,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2018-09-26 21:32:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 21:32:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-26 21:32:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 21:32:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 21:32:00,945 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-09-26 21:32:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:00,946 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 21:32:00,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:32:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 21:32:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 21:32:00,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:00,947 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2018-09-26 21:32:00,947 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:00,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2018-09-26 21:32:00,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:00,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:00,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:01,760 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-26 21:32:01,760 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:01,760 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-26 21:32:01,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:01,821 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:01,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:01,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:01,844 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-26 21:32:01,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:01,892 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-26 21:32:01,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:02,052 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-26 21:32:02,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:02,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-26 21:32:02,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 21:32:02,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 21:32:02,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:32:02,080 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2018-09-26 21:32:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:02,598 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 21:32:02,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:32:02,598 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-09-26 21:32:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:02,599 INFO L225 Difference]: With dead ends: 55 [2018-09-26 21:32:02,599 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 21:32:02,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:32:02,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 21:32:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-26 21:32:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 21:32:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 21:32:02,609 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-09-26 21:32:02,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:02,609 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 21:32:02,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 21:32:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 21:32:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 21:32:02,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:02,611 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2018-09-26 21:32:02,611 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:02,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:02,611 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2018-09-26 21:32:02,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:02,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:02,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:02,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:02,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:02,974 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-26 21:32:02,974 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:02,975 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-26 21:32:02,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:03,084 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-26 21:32:03,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:03,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:03,098 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-26 21:32:03,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:03,106 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-26 21:32:03,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:03,574 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-26 21:32:03,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:03,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-26 21:32:03,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 21:32:03,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 21:32:03,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:32:03,597 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2018-09-26 21:32:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:04,194 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 21:32:04,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:32:04,196 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-09-26 21:32:04,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:04,197 INFO L225 Difference]: With dead ends: 60 [2018-09-26 21:32:04,197 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 21:32:04,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 21:32:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 21:32:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-09-26 21:32:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 21:32:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 21:32:04,208 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-09-26 21:32:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:04,208 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 21:32:04,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 21:32:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 21:32:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 21:32:04,209 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:04,209 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2018-09-26 21:32:04,209 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:04,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2018-09-26 21:32:04,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:04,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:04,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:04,437 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-26 21:32:04,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:04,438 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-26 21:32:04,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:04,486 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:04,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:04,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:04,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-26 21:32:04,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:04,524 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-26 21:32:04,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:04,780 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-26 21:32:04,800 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:04,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-26 21:32:04,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 21:32:04,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 21:32:04,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:32:04,801 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2018-09-26 21:32:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:05,302 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 21:32:05,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:32:05,303 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-09-26 21:32:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:05,304 INFO L225 Difference]: With dead ends: 65 [2018-09-26 21:32:05,304 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 21:32:05,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=481, Invalid=925, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 21:32:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 21:32:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-09-26 21:32:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 21:32:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 21:32:05,316 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-09-26 21:32:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:05,317 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 21:32:05,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 21:32:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 21:32:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 21:32:05,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:05,318 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2018-09-26 21:32:05,318 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:05,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2018-09-26 21:32:05,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:05,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:05,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:05,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:05,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:05,664 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-26 21:32:05,664 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:05,664 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-26 21:32:05,672 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:05,740 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-26 21:32:05,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:05,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:05,758 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-26 21:32:05,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:05,768 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-26 21:32:05,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:06,022 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-26 21:32:06,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:06,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-26 21:32:06,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 21:32:06,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 21:32:06,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2018-09-26 21:32:06,044 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-09-26 21:32:06,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:06,523 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 21:32:06,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:32:06,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-09-26 21:32:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:06,525 INFO L225 Difference]: With dead ends: 70 [2018-09-26 21:32:06,525 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 21:32:06,526 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-26 21:32:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 21:32:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-09-26 21:32:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 21:32:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 21:32:06,537 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-09-26 21:32:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:06,537 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 21:32:06,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 21:32:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 21:32:06,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 21:32:06,538 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:06,538 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2018-09-26 21:32:06,539 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:06,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:06,539 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2018-09-26 21:32:06,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:06,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:06,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:06,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:06,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:06,811 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-26 21:32:06,811 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:06,811 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-26 21:32:06,819 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:06,875 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-26 21:32:06,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:06,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:06,899 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-26 21:32:06,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:06,911 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-26 21:32:06,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:07,160 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-26 21:32:07,181 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:07,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-26 21:32:07,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 21:32:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 21:32:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:32:07,182 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2018-09-26 21:32:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:07,730 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 21:32:07,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:32:07,730 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-09-26 21:32:07,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:07,731 INFO L225 Difference]: With dead ends: 75 [2018-09-26 21:32:07,731 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 21:32:07,732 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-26 21:32:07,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 21:32:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-09-26 21:32:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 21:32:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 21:32:07,747 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-09-26 21:32:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:07,747 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 21:32:07,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 21:32:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 21:32:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 21:32:07,748 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:07,748 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2018-09-26 21:32:07,749 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:07,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2018-09-26 21:32:07,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:07,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:07,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:08,157 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-26 21:32:08,157 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:08,157 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:32:08,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:08,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:08,241 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-26 21:32:08,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:08,255 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-26 21:32:08,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:08,710 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-26 21:32:08,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:08,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-26 21:32:08,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 21:32:08,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 21:32:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:32:08,732 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2018-09-26 21:32:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:09,561 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 21:32:09,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:32:09,562 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2018-09-26 21:32:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:09,563 INFO L225 Difference]: With dead ends: 80 [2018-09-26 21:32:09,563 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 21:32:09,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 21:32:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 21:32:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-09-26 21:32:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 21:32:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 21:32:09,576 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-09-26 21:32:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:09,577 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 21:32:09,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 21:32:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 21:32:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 21:32:09,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:09,578 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2018-09-26 21:32:09,578 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:09,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2018-09-26 21:32:09,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:09,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:09,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:09,950 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-26 21:32:09,951 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:09,951 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-26 21:32:09,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:10,034 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:10,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:10,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:10,045 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-26 21:32:10,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:10,057 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-26 21:32:10,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:10,356 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-26 21:32:10,378 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:10,378 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-26 21:32:10,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 21:32:10,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 21:32:10,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 21:32:10,380 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2018-09-26 21:32:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:10,955 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 21:32:10,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:32:10,956 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-09-26 21:32:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:10,957 INFO L225 Difference]: With dead ends: 85 [2018-09-26 21:32:10,957 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 21:32:10,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=833, Invalid=1617, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:32:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 21:32:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-09-26 21:32:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 21:32:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 21:32:10,970 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-09-26 21:32:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:10,970 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 21:32:10,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 21:32:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 21:32:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 21:32:10,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:10,971 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2018-09-26 21:32:10,972 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:10,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:10,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2018-09-26 21:32:10,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:10,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:10,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:10,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:10,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:11,598 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-26 21:32:11,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:11,598 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:32:11,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:11,702 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-26 21:32:11,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:11,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:11,724 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-26 21:32:11,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:11,728 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-26 21:32:11,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:12,049 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-26 21:32:12,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:12,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-26 21:32:12,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 21:32:12,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 21:32:12,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=815, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:32:12,071 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2018-09-26 21:32:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:12,795 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 21:32:12,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:32:12,796 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2018-09-26 21:32:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:12,797 INFO L225 Difference]: With dead ends: 90 [2018-09-26 21:32:12,797 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 21:32:12,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 21:32:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 21:32:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-09-26 21:32:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 21:32:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 21:32:12,810 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-09-26 21:32:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:12,811 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 21:32:12,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 21:32:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 21:32:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 21:32:12,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:12,812 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2018-09-26 21:32:12,812 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:12,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:12,812 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2018-09-26 21:32:12,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:12,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:12,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:12,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:12,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:13,796 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-26 21:32:13,796 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:13,796 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-26 21:32:13,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:13,863 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:13,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:13,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:13,871 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-26 21:32:13,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:13,881 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-26 21:32:13,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:14,265 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-26 21:32:14,288 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:14,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-26 21:32:14,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 21:32:14,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 21:32:14,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=908, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 21:32:14,289 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2018-09-26 21:32:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:14,896 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 21:32:14,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:32:14,897 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2018-09-26 21:32:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:14,898 INFO L225 Difference]: With dead ends: 95 [2018-09-26 21:32:14,898 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 21:32:14,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1045, Invalid=2035, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 21:32:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 21:32:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-09-26 21:32:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 21:32:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 21:32:14,911 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-09-26 21:32:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:14,911 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 21:32:14,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 21:32:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 21:32:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 21:32:14,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:14,912 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2018-09-26 21:32:14,912 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:14,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2018-09-26 21:32:14,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:14,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:14,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:14,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:15,232 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-26 21:32:15,232 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:15,232 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:32:15,240 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:15,320 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-26 21:32:15,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:15,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:15,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-26 21:32:15,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:15,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-26 21:32:15,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:15,685 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-26 21:32:15,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:15,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-26 21:32:15,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 21:32:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 21:32:15,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 21:32:15,708 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2018-09-26 21:32:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:16,329 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 21:32:16,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 21:32:16,330 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-09-26 21:32:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:16,331 INFO L225 Difference]: With dead ends: 100 [2018-09-26 21:32:16,331 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 21:32:16,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1160, Invalid=2262, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 21:32:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 21:32:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-09-26 21:32:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 21:32:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 21:32:16,344 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-09-26 21:32:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:16,344 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 21:32:16,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 21:32:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 21:32:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 21:32:16,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:16,346 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2018-09-26 21:32:16,346 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:16,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2018-09-26 21:32:16,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:16,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:16,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:16,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:16,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:16,861 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-26 21:32:16,861 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:16,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 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-26 21:32:16,868 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:16,981 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-26 21:32:16,981 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:16,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:16,996 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-26 21:32:16,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:17,006 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-26 21:32:17,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:17,336 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-26 21:32:17,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:17,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-26 21:32:17,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 21:32:17,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 21:32:17,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=1109, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 21:32:17,358 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2018-09-26 21:32:17,722 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-26 21:32:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:18,211 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 21:32:18,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:32:18,212 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-09-26 21:32:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:18,213 INFO L225 Difference]: With dead ends: 105 [2018-09-26 21:32:18,213 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 21:32:18,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1281, Invalid=2501, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 21:32:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 21:32:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-09-26 21:32:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 21:32:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 21:32:18,229 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-09-26 21:32:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:18,229 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 21:32:18,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 21:32:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 21:32:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 21:32:18,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:18,230 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2018-09-26 21:32:18,231 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:18,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2018-09-26 21:32:18,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:18,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:18,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:18,876 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-26 21:32:18,876 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:18,877 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-26 21:32:18,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:18,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:18,956 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-26 21:32:18,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:18,965 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-26 21:32:18,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:19,347 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-26 21:32:19,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:19,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-26 21:32:19,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 21:32:19,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 21:32:19,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1217, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 21:32:19,370 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2018-09-26 21:32:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:20,117 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 21:32:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:32:20,120 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2018-09-26 21:32:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:20,121 INFO L225 Difference]: With dead ends: 110 [2018-09-26 21:32:20,121 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 21:32:20,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1408, Invalid=2752, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 21:32:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 21:32:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-09-26 21:32:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 21:32:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 21:32:20,138 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-09-26 21:32:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:20,138 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 21:32:20,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 21:32:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 21:32:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 21:32:20,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:20,139 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2018-09-26 21:32:20,139 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:20,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2018-09-26 21:32:20,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:20,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:20,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:20,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:20,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:21,091 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-26 21:32:21,091 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:21,091 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-26 21:32:21,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:21,172 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:21,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:21,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:21,179 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-26 21:32:21,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:21,187 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-26 21:32:21,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:23,295 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-26 21:32:23,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:23,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-26 21:32:23,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 21:32:23,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 21:32:23,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=1330, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 21:32:23,318 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2018-09-26 21:32:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:24,316 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 21:32:24,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:32:24,316 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2018-09-26 21:32:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:24,317 INFO L225 Difference]: With dead ends: 115 [2018-09-26 21:32:24,318 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 21:32:24,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1541, Invalid=3015, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 21:32:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 21:32:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-09-26 21:32:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 21:32:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 21:32:24,331 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-09-26 21:32:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:24,331 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 21:32:24,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 21:32:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 21:32:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 21:32:24,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:24,332 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2018-09-26 21:32:24,333 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:24,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2018-09-26 21:32:24,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:24,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:24,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:24,829 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-26 21:32:24,830 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:24,830 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-26 21:32:24,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:24,955 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-26 21:32:24,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:24,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:24,962 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-26 21:32:24,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:24,972 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-26 21:32:24,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:25,430 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-26 21:32:25,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:25,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-26 21:32:25,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 21:32:25,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 21:32:25,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=1448, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 21:32:25,453 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2018-09-26 21:32:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:26,349 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 21:32:26,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 21:32:26,350 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2018-09-26 21:32:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:26,351 INFO L225 Difference]: With dead ends: 120 [2018-09-26 21:32:26,351 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 21:32:26,353 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-26 21:32:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 21:32:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-09-26 21:32:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 21:32:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 21:32:26,370 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-09-26 21:32:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:26,370 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 21:32:26,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 21:32:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 21:32:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 21:32:26,371 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:26,371 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2018-09-26 21:32:26,372 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:26,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:26,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2018-09-26 21:32:26,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:26,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:26,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:26,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:26,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:26,826 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-26 21:32:26,826 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:26,826 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-26 21:32:26,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:26,913 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:26,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:26,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:26,937 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-26 21:32:26,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:27,026 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-26 21:32:27,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:27,535 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-26 21:32:27,555 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:27,555 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-26 21:32:27,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 21:32:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 21:32:27,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=1571, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:32:27,557 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2018-09-26 21:32:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:28,500 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 21:32:28,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:32:28,500 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2018-09-26 21:32:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:28,501 INFO L225 Difference]: With dead ends: 125 [2018-09-26 21:32:28,502 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 21:32:28,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1825, Invalid=3577, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 21:32:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 21:32:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-09-26 21:32:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 21:32:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 21:32:28,517 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-09-26 21:32:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:28,518 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 21:32:28,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 21:32:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 21:32:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 21:32:28,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:28,519 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2018-09-26 21:32:28,519 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:28,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:28,519 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2018-09-26 21:32:28,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:28,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:28,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:28,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:28,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:29,333 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-26 21:32:29,333 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:29,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:32:29,357 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:29,463 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-26 21:32:29,464 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:29,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:29,471 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-26 21:32:29,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:29,479 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-26 21:32:29,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:29,991 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-26 21:32:30,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:30,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-26 21:32:30,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 21:32:30,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 21:32:30,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1699, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 21:32:30,014 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2018-09-26 21:32:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:31,156 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 21:32:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:32:31,156 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2018-09-26 21:32:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:31,158 INFO L225 Difference]: With dead ends: 130 [2018-09-26 21:32:31,158 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 21:32:31,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1976, Invalid=3876, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 21:32:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 21:32:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-09-26 21:32:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 21:32:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-26 21:32:31,173 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-09-26 21:32:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:31,174 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-26 21:32:31,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 21:32:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-26 21:32:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 21:32:31,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:31,175 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2018-09-26 21:32:31,175 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:31,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:31,175 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2018-09-26 21:32:31,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:31,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:31,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:31,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:31,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:31,826 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-26 21:32:31,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:31,827 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-26 21:32:31,834 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:31,959 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-26 21:32:31,959 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:31,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:31,982 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-26 21:32:31,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:31,995 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-26 21:32:31,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:32,520 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-26 21:32:32,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:32,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-26 21:32:32,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 21:32:32,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 21:32:32,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1030, Invalid=1832, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 21:32:32,542 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2018-09-26 21:32:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:33,536 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 21:32:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:32:33,537 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2018-09-26 21:32:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:33,538 INFO L225 Difference]: With dead ends: 135 [2018-09-26 21:32:33,538 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 21:32:33,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2133, Invalid=4187, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 21:32:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 21:32:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-09-26 21:32:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 21:32:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 21:32:33,560 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-09-26 21:32:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:33,561 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 21:32:33,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 21:32:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 21:32:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 21:32:33,562 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:33,562 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2018-09-26 21:32:33,562 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:33,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:33,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2018-09-26 21:32:33,563 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:33,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:33,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:33,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:33,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:35,139 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-26 21:32:35,139 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:35,139 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:32:35,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:35,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:35,259 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-26 21:32:35,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:35,270 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-26 21:32:35,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:35,864 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-26 21:32:35,884 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:35,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-26 21:32:35,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 21:32:35,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 21:32:35,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=1970, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 21:32:35,886 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2018-09-26 21:32:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:36,914 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 21:32:36,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:32:36,915 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2018-09-26 21:32:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:36,916 INFO L225 Difference]: With dead ends: 140 [2018-09-26 21:32:36,916 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 21:32:36,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2296, Invalid=4510, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 21:32:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 21:32:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-09-26 21:32:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 21:32:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-26 21:32:36,938 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-09-26 21:32:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:36,939 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-26 21:32:36,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 21:32:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-26 21:32:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 21:32:36,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:36,940 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2018-09-26 21:32:36,940 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:36,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2018-09-26 21:32:36,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:36,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:36,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:36,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:36,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:37,554 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-26 21:32:37,554 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:37,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:37,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:37,650 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:37,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:37,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:37,676 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-26 21:32:37,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:37,768 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-26 21:32:37,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:39,131 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-26 21:32:39,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:39,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-26 21:32:39,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 21:32:39,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 21:32:39,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=2113, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 21:32:39,154 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2018-09-26 21:32:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:40,300 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 21:32:40,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 21:32:40,300 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2018-09-26 21:32:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:40,301 INFO L225 Difference]: With dead ends: 145 [2018-09-26 21:32:40,301 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 21:32:40,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2465, Invalid=4845, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 21:32:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 21:32:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-09-26 21:32:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 21:32:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 21:32:40,321 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-09-26 21:32:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:40,321 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 21:32:40,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 21:32:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 21:32:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 21:32:40,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:40,322 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2018-09-26 21:32:40,322 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:40,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:40,323 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2018-09-26 21:32:40,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:40,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:40,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:40,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:40,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:40,990 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-26 21:32:40,991 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:40,991 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-26 21:32:41,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:41,154 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-26 21:32:41,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:41,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:41,164 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-26 21:32:41,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:41,172 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-26 21:32:41,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:42,004 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-26 21:32:42,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:42,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-26 21:32:42,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 21:32:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 21:32:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=2261, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 21:32:42,026 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2018-09-26 21:32:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:43,283 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 21:32:43,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 21:32:43,283 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2018-09-26 21:32:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:43,284 INFO L225 Difference]: With dead ends: 150 [2018-09-26 21:32:43,284 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 21:32:43,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2640, Invalid=5192, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 21:32:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 21:32:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-09-26 21:32:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 21:32:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 21:32:43,311 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-09-26 21:32:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:43,311 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 21:32:43,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 21:32:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 21:32:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 21:32:43,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:43,313 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2018-09-26 21:32:43,313 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:43,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:43,313 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2018-09-26 21:32:43,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:43,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:43,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:43,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:43,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:44,028 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-26 21:32:44,029 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:44,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 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-26 21:32:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:44,134 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:44,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:44,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:44,141 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-26 21:32:44,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:44,154 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-26 21:32:44,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:45,094 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-26 21:32:45,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:45,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-26 21:32:45,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 21:32:45,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 21:32:45,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=2414, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 21:32:45,118 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2018-09-26 21:32:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:46,402 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 21:32:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 21:32:46,403 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2018-09-26 21:32:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:46,404 INFO L225 Difference]: With dead ends: 155 [2018-09-26 21:32:46,404 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 21:32:46,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2821, Invalid=5551, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 21:32:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 21:32:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-09-26 21:32:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 21:32:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 21:32:46,432 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-09-26 21:32:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:46,433 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 21:32:46,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 21:32:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 21:32:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 21:32:46,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:46,434 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2018-09-26 21:32:46,434 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:46,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2018-09-26 21:32:46,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:46,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:46,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:46,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:46,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:47,118 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-26 21:32:47,119 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:47,119 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-26 21:32:47,127 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:47,272 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-26 21:32:47,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:47,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:47,280 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-26 21:32:47,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:47,291 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-26 21:32:47,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:48,212 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-26 21:32:48,234 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:48,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-26 21:32:48,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 21:32:48,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 21:32:48,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1460, Invalid=2572, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 21:32:48,235 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2018-09-26 21:32:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:49,665 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 21:32:49,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 21:32:49,666 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2018-09-26 21:32:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:49,667 INFO L225 Difference]: With dead ends: 160 [2018-09-26 21:32:49,667 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 21:32:49,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3008, Invalid=5922, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 21:32:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 21:32:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-09-26 21:32:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 21:32:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-26 21:32:49,691 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-09-26 21:32:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:49,692 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-26 21:32:49,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 21:32:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-26 21:32:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 21:32:49,692 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:49,693 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2018-09-26 21:32:49,693 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:49,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2018-09-26 21:32:49,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:49,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:49,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:49,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:49,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:50,857 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-26 21:32:50,858 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:50,858 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-26 21:32:50,865 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:51,035 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-26 21:32:51,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:51,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:51,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-26 21:32:51,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:51,053 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-26 21:32:51,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:51,964 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-26 21:32:51,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:51,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-26 21:32:51,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 21:32:51,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 21:32:51,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=2735, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 21:32:51,987 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2018-09-26 21:32:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:53,482 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 21:32:53,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 21:32:53,482 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2018-09-26 21:32:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:53,483 INFO L225 Difference]: With dead ends: 165 [2018-09-26 21:32:53,483 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 21:32:53,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2939 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3201, Invalid=6305, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 21:32:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 21:32:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-09-26 21:32:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 21:32:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 21:32:53,509 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-09-26 21:32:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:53,509 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 21:32:53,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 21:32:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 21:32:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 21:32:53,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:53,511 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2018-09-26 21:32:53,511 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:53,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2018-09-26 21:32:53,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:53,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:53,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:53,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:53,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:54,420 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-26 21:32:54,420 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:54,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:32:54,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:54,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:54,538 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-26 21:32:54,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:54,548 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-26 21:32:54,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:55,457 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-26 21:32:55,477 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:55,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-26 21:32:55,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 21:32:55,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 21:32:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=2903, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 21:32:55,479 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2018-09-26 21:32:56,194 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-26 21:32:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:57,196 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 21:32:57,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 21:32:57,196 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2018-09-26 21:32:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:57,198 INFO L225 Difference]: With dead ends: 170 [2018-09-26 21:32:57,198 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 21:32:57,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3130 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3400, Invalid=6700, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 21:32:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 21:32:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-09-26 21:32:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 21:32:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-26 21:32:57,228 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-09-26 21:32:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:57,229 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-26 21:32:57,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 21:32:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-26 21:32:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 21:32:57,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:57,229 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2018-09-26 21:32:57,230 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:32:57,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:57,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2018-09-26 21:32:57,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:57,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:57,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:58,414 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-26 21:32:58,415 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:58,415 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-26 21:32:58,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:58,525 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:58,525 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:58,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:58,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:58,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:58,556 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-26 21:32:58,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:59,373 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-26 21:32:59,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:59,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-26 21:32:59,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 21:32:59,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 21:32:59,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1754, Invalid=3076, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 21:32:59,394 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2018-09-26 21:33:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:01,193 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 21:33:01,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 21:33:01,194 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2018-09-26 21:33:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:01,195 INFO L225 Difference]: With dead ends: 175 [2018-09-26 21:33:01,195 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 21:33:01,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3605, Invalid=7107, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 21:33:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 21:33:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-09-26 21:33:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 21:33:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 21:33:01,222 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-09-26 21:33:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:01,222 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 21:33:01,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 21:33:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 21:33:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 21:33:01,223 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:01,224 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2018-09-26 21:33:01,224 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:01,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2018-09-26 21:33:01,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:01,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:01,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:01,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:01,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:02,132 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-26 21:33:02,132 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:02,132 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:33:02,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:02,332 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-26 21:33:02,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:02,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:02,342 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-26 21:33:02,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:02,350 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-26 21:33:02,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:03,231 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-26 21:33:03,254 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:03,254 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-26 21:33:03,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 21:33:03,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 21:33:03,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=3254, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 21:33:03,255 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2018-09-26 21:33:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:04,840 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 21:33:04,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 21:33:04,841 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2018-09-26 21:33:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:04,842 INFO L225 Difference]: With dead ends: 180 [2018-09-26 21:33:04,843 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 21:33:04,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3816, Invalid=7526, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 21:33:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 21:33:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-09-26 21:33:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 21:33:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 21:33:04,875 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-09-26 21:33:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:04,875 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 21:33:04,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 21:33:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 21:33:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 21:33:04,876 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:04,876 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2018-09-26 21:33:04,877 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:04,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:04,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2018-09-26 21:33:04,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:04,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:04,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:04,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:04,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:06,153 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-26 21:33:06,154 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:06,154 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-26 21:33:06,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:33:06,281 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:33:06,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:06,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:06,304 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-26 21:33:06,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:06,389 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-26 21:33:06,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:07,294 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-26 21:33:07,315 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:07,315 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-26 21:33:07,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 21:33:07,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 21:33:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1965, Invalid=3437, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 21:33:07,317 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2018-09-26 21:33:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:09,291 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 21:33:09,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 21:33:09,291 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2018-09-26 21:33:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:09,293 INFO L225 Difference]: With dead ends: 185 [2018-09-26 21:33:09,293 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 21:33:09,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4033, Invalid=7957, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 21:33:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 21:33:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-09-26 21:33:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 21:33:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 21:33:09,323 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-09-26 21:33:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:09,323 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 21:33:09,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 21:33:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 21:33:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 21:33:09,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:09,324 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2018-09-26 21:33:09,325 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:09,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2018-09-26 21:33:09,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:09,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:10,663 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-26 21:33:10,664 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:10,664 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-26 21:33:10,670 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:33:10,960 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-26 21:33:10,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:10,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:10,984 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-26 21:33:10,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:11,081 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-26 21:33:11,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:12,137 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-26 21:33:12,159 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:12,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-26 21:33:12,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 21:33:12,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 21:33:12,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2075, Invalid=3625, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 21:33:12,161 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2018-09-26 21:33:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:13,782 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-26 21:33:13,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 21:33:13,782 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2018-09-26 21:33:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:13,783 INFO L225 Difference]: With dead ends: 190 [2018-09-26 21:33:13,783 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 21:33:13,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3954 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4256, Invalid=8400, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 21:33:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 21:33:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-09-26 21:33:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 21:33:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-26 21:33:13,812 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-09-26 21:33:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:13,812 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-26 21:33:13,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 21:33:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-26 21:33:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-26 21:33:13,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:13,813 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2018-09-26 21:33:13,814 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:13,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:13,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2018-09-26 21:33:13,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:13,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:13,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:13,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:13,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:14,867 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-26 21:33:14,867 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:14,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 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-26 21:33:14,876 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:33:15,106 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-26 21:33:15,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:15,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:15,144 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-26 21:33:15,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:15,218 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-26 21:33:15,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:17,176 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-26 21:33:17,199 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:17,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-26 21:33:17,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 21:33:17,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 21:33:17,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2188, Invalid=3818, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 21:33:17,200 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2018-09-26 21:33:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:18,974 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 21:33:18,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 21:33:18,975 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2018-09-26 21:33:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:18,976 INFO L225 Difference]: With dead ends: 195 [2018-09-26 21:33:18,976 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 21:33:18,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4485, Invalid=8855, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 21:33:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 21:33:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-09-26 21:33:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 21:33:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 21:33:19,017 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-09-26 21:33:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:19,017 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 21:33:19,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 21:33:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 21:33:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 21:33:19,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:19,019 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2018-09-26 21:33:19,019 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:19,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:19,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2018-09-26 21:33:19,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:19,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:19,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:19,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:19,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:20,009 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-26 21:33:20,010 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:20,010 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-26 21:33:20,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:20,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:20,150 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-26 21:33:20,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:20,161 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-26 21:33:20,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:21,289 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-26 21:33:21,310 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:21,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-26 21:33:21,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 21:33:21,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 21:33:21,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2304, Invalid=4016, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 21:33:21,312 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2018-09-26 21:33:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:23,055 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-26 21:33:23,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 21:33:23,056 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2018-09-26 21:33:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:23,057 INFO L225 Difference]: With dead ends: 200 [2018-09-26 21:33:23,057 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 21:33:23,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4720, Invalid=9322, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 21:33:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 21:33:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-09-26 21:33:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 21:33:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-26 21:33:23,101 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-09-26 21:33:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:23,102 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-26 21:33:23,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 21:33:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-26 21:33:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-26 21:33:23,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:23,103 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2018-09-26 21:33:23,103 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:23,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2018-09-26 21:33:23,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:23,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:23,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:23,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:23,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:24,331 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-26 21:33:24,331 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:24,331 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-26 21:33:24,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:24,473 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:24,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:24,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:24,483 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-26 21:33:24,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:24,494 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-26 21:33:24,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:25,979 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-26 21:33:25,999 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:26,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-26 21:33:26,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 21:33:26,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 21:33:26,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2423, Invalid=4219, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 21:33:26,001 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2018-09-26 21:33:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:27,859 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-26 21:33:27,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:33:27,859 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2018-09-26 21:33:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:27,860 INFO L225 Difference]: With dead ends: 205 [2018-09-26 21:33:27,860 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 21:33:27,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4635 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4961, Invalid=9801, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 21:33:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 21:33:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-09-26 21:33:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 21:33:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 21:33:27,898 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-09-26 21:33:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:27,898 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 21:33:27,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 21:33:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 21:33:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 21:33:27,899 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:27,899 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2018-09-26 21:33:27,899 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:27,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2018-09-26 21:33:27,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:27,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:27,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:28,895 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-26 21:33:28,895 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:28,895 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-26 21:33:28,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:29,191 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-26 21:33:29,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:29,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:29,200 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-26 21:33:29,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:29,210 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-26 21:33:29,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:30,693 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-26 21:33:30,715 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:30,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-26 21:33:30,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 21:33:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 21:33:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2545, Invalid=4427, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 21:33:30,717 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2018-09-26 21:33:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:32,671 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-26 21:33:32,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 21:33:32,671 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2018-09-26 21:33:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:32,672 INFO L225 Difference]: With dead ends: 210 [2018-09-26 21:33:32,672 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 21:33:32,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4874 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5208, Invalid=10292, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 21:33:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 21:33:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-09-26 21:33:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 21:33:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-26 21:33:32,710 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-09-26 21:33:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:32,710 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-26 21:33:32,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 21:33:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-26 21:33:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 21:33:32,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:32,711 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2018-09-26 21:33:32,711 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:32,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:32,712 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2018-09-26 21:33:32,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:32,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:32,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:32,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:32,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:34,028 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-26 21:33:34,029 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:34,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 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-26 21:33:34,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:33:34,173 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:33:34,173 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:34,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:34,182 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-26 21:33:34,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:34,198 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-26 21:33:34,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:35,383 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-26 21:33:35,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:35,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-26 21:33:35,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 21:33:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 21:33:35,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2670, Invalid=4640, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 21:33:35,406 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2018-09-26 21:33:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:37,530 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-26 21:33:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 21:33:37,530 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2018-09-26 21:33:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:37,531 INFO L225 Difference]: With dead ends: 215 [2018-09-26 21:33:37,531 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 21:33:37,532 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-26 21:33:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 21:33:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-09-26 21:33:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 21:33:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-26 21:33:37,568 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-09-26 21:33:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:37,569 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-26 21:33:37,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 21:33:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-26 21:33:37,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 21:33:37,570 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:37,570 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2018-09-26 21:33:37,570 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:37,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:37,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2018-09-26 21:33:37,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:37,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:37,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:37,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:37,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:38,728 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-26 21:33:38,729 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:38,729 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-26 21:33:38,736 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:33:39,112 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-26 21:33:39,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:39,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:39,136 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-26 21:33:39,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:39,151 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-26 21:33:39,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:40,462 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-26 21:33:40,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:40,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-26 21:33:40,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 21:33:40,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 21:33:40,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2798, Invalid=4858, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 21:33:40,487 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2018-09-26 21:33:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:42,658 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-26 21:33:42,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 21:33:42,658 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2018-09-26 21:33:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:42,659 INFO L225 Difference]: With dead ends: 220 [2018-09-26 21:33:42,659 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 21:33:42,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5370 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5720, Invalid=11310, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 21:33:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 21:33:42,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-09-26 21:33:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-26 21:33:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-26 21:33:42,699 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-09-26 21:33:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:42,699 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-26 21:33:42,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 21:33:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-26 21:33:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-26 21:33:42,700 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:42,700 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2018-09-26 21:33:42,700 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:42,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2018-09-26 21:33:42,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:42,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:42,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:42,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:44,180 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-26 21:33:44,181 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:44,181 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-26 21:33:44,189 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:33:44,467 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-26 21:33:44,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:44,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:44,476 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-26 21:33:44,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:44,488 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-26 21:33:44,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:45,880 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-26 21:33:45,901 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:45,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-26 21:33:45,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 21:33:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 21:33:45,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=5081, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 21:33:45,903 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2018-09-26 21:33:46,261 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-26 21:33:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:48,584 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-26 21:33:48,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 21:33:48,584 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2018-09-26 21:33:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:48,585 INFO L225 Difference]: With dead ends: 225 [2018-09-26 21:33:48,585 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 21:33:48,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5627 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5985, Invalid=11837, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 21:33:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 21:33:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-09-26 21:33:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 21:33:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 21:33:48,624 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-09-26 21:33:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:48,625 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 21:33:48,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 21:33:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 21:33:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 21:33:48,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:48,626 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2018-09-26 21:33:48,626 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:48,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2018-09-26 21:33:48,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:48,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:48,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:50,115 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-26 21:33:50,115 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:50,115 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-26 21:33:50,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:50,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:50,270 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-26 21:33:50,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:50,279 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-26 21:33:50,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:51,976 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-26 21:33:51,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:51,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-26 21:33:51,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 21:33:51,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 21:33:51,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3063, Invalid=5309, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 21:33:51,999 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2018-09-26 21:33:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:54,155 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-26 21:33:54,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 21:33:54,155 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2018-09-26 21:33:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:54,156 INFO L225 Difference]: With dead ends: 230 [2018-09-26 21:33:54,156 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 21:33:54,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6256, Invalid=12376, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 21:33:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 21:33:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-09-26 21:33:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 21:33:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-26 21:33:54,207 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-09-26 21:33:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:54,207 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-26 21:33:54,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 21:33:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-26 21:33:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-26 21:33:54,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:54,208 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2018-09-26 21:33:54,209 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:33:54,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:54,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2018-09-26 21:33:54,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:54,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:54,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:54,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:54,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:56,367 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-26 21:33:56,367 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:56,367 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:33:56,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:56,521 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:56,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:56,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:56,532 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-26 21:33:56,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:56,540 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-26 21:33:56,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:58,089 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-26 21:33:58,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:58,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-26 21:33:58,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 21:33:58,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 21:33:58,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3200, Invalid=5542, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 21:33:58,112 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2018-09-26 21:34:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:00,589 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-26 21:34:00,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 21:34:00,589 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2018-09-26 21:34:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:00,590 INFO L225 Difference]: With dead ends: 235 [2018-09-26 21:34:00,591 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 21:34:00,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6159 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6533, Invalid=12927, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 21:34:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 21:34:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-09-26 21:34:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 21:34:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-26 21:34:00,650 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-09-26 21:34:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:00,650 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-26 21:34:00,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 21:34:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-26 21:34:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 21:34:00,652 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:00,652 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2018-09-26 21:34:00,652 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:00,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:00,653 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2018-09-26 21:34:00,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:00,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:00,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:00,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:02,184 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-26 21:34:02,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:02,184 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-26 21:34:02,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:34:02,498 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-26 21:34:02,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:02,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:02,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-26 21:34:02,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:02,518 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-26 21:34:02,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:03,971 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-26 21:34:03,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:03,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-26 21:34:03,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 21:34:03,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 21:34:03,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3340, Invalid=5780, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 21:34:03,994 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2018-09-26 21:34:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:06,572 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-26 21:34:06,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 21:34:06,573 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2018-09-26 21:34:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:06,574 INFO L225 Difference]: With dead ends: 240 [2018-09-26 21:34:06,574 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 21:34:06,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6434 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6816, Invalid=13490, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 21:34:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 21:34:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-09-26 21:34:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 21:34:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-26 21:34:06,627 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-09-26 21:34:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:06,628 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-26 21:34:06,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 21:34:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-26 21:34:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-26 21:34:06,629 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:06,629 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2018-09-26 21:34:06,630 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:06,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:06,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2018-09-26 21:34:06,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:06,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:06,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:06,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:06,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:07,944 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-26 21:34:07,945 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:07,945 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-26 21:34:07,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:34:08,113 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:34:08,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:08,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:08,138 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-26 21:34:08,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:08,151 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-26 21:34:08,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:09,671 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-26 21:34:09,692 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:09,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-26 21:34:09,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 21:34:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 21:34:09,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=6023, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 21:34:09,694 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2018-09-26 21:34:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:12,493 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-26 21:34:12,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 21:34:12,496 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2018-09-26 21:34:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:12,497 INFO L225 Difference]: With dead ends: 245 [2018-09-26 21:34:12,497 INFO L226 Difference]: Without dead ends: 244 [2018-09-26 21:34:12,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6715 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7105, Invalid=14065, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 21:34:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-26 21:34:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-09-26 21:34:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 21:34:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-26 21:34:12,563 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-09-26 21:34:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:12,563 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-26 21:34:12,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 21:34:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-26 21:34:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 21:34:12,565 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:12,565 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2018-09-26 21:34:12,565 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:12,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2018-09-26 21:34:12,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:12,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:12,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:12,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:12,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:14,186 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-26 21:34:14,187 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:14,187 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-26 21:34:14,216 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:34:14,520 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-26 21:34:14,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:14,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:14,530 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-26 21:34:14,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:14,539 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-26 21:34:14,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:16,134 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-26 21:34:16,155 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:16,155 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-26 21:34:16,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 21:34:16,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 21:34:16,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3629, Invalid=6271, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 21:34:16,157 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2018-09-26 21:34:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:18,900 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-09-26 21:34:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 21:34:18,901 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2018-09-26 21:34:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:18,902 INFO L225 Difference]: With dead ends: 250 [2018-09-26 21:34:18,902 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 21:34:18,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7002 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7400, Invalid=14652, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 21:34:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 21:34:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-09-26 21:34:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-26 21:34:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-09-26 21:34:18,946 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-09-26 21:34:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:18,946 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-09-26 21:34:18,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 21:34:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-09-26 21:34:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-26 21:34:18,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:18,947 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2018-09-26 21:34:18,948 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:18,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:18,948 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2018-09-26 21:34:18,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:18,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:18,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:18,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:18,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:20,301 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-26 21:34:20,301 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:20,301 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-26 21:34:20,309 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:34:20,650 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-26 21:34:20,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:20,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:20,660 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-26 21:34:20,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:20,671 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-26 21:34:20,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:22,894 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-26 21:34:22,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:22,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-26 21:34:22,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 21:34:22,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 21:34:22,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3778, Invalid=6524, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 21:34:22,918 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2018-09-26 21:34:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:25,651 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-26 21:34:25,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 21:34:25,651 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2018-09-26 21:34:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:25,653 INFO L225 Difference]: With dead ends: 255 [2018-09-26 21:34:25,653 INFO L226 Difference]: Without dead ends: 254 [2018-09-26 21:34:25,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7295 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7701, Invalid=15251, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 21:34:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-26 21:34:25,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-09-26 21:34:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 21:34:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-26 21:34:25,713 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-09-26 21:34:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:25,714 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-26 21:34:25,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 21:34:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-26 21:34:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 21:34:25,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:25,715 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2018-09-26 21:34:25,716 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:25,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2018-09-26 21:34:25,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:25,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:25,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:25,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:25,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:27,383 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-26 21:34:27,383 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:27,383 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:34:27,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:27,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:27,561 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-26 21:34:27,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:27,575 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-26 21:34:27,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:29,331 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-26 21:34:29,353 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:29,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-26 21:34:29,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 21:34:29,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 21:34:29,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3930, Invalid=6782, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 21:34:29,356 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2018-09-26 21:34:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:32,340 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-09-26 21:34:32,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 21:34:32,340 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2018-09-26 21:34:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:32,341 INFO L225 Difference]: With dead ends: 260 [2018-09-26 21:34:32,341 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 21:34:32,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7594 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8008, Invalid=15862, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 21:34:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 21:34:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-09-26 21:34:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-26 21:34:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-09-26 21:34:32,401 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-09-26 21:34:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:32,402 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-09-26 21:34:32,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 21:34:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-09-26 21:34:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-26 21:34:32,403 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:32,403 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2018-09-26 21:34:32,403 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:32,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:32,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2018-09-26 21:34:32,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:32,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:32,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:32,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:32,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:34,061 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-26 21:34:34,061 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:34,062 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-26 21:34:34,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:34:34,242 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:34:34,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:34,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:34,253 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-26 21:34:34,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:34,262 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-26 21:34:34,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:36,057 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-26 21:34:36,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:36,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-26 21:34:36,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 21:34:36,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 21:34:36,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4085, Invalid=7045, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 21:34:36,081 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2018-09-26 21:34:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:39,052 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-09-26 21:34:39,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 21:34:39,053 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2018-09-26 21:34:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:39,054 INFO L225 Difference]: With dead ends: 265 [2018-09-26 21:34:39,054 INFO L226 Difference]: Without dead ends: 264 [2018-09-26 21:34:39,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8321, Invalid=16485, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 21:34:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-26 21:34:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-09-26 21:34:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 21:34:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-26 21:34:39,106 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-09-26 21:34:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:39,106 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-26 21:34:39,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 21:34:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-26 21:34:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 21:34:39,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:39,108 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2018-09-26 21:34:39,108 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:39,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2018-09-26 21:34:39,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:39,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:39,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:39,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:39,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:40,617 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-26 21:34:40,617 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:40,617 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-26 21:34:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:34:41,013 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-26 21:34:41,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:41,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:41,028 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-26 21:34:41,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:41,037 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-26 21:34:41,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:43,046 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-26 21:34:43,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:43,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-26 21:34:43,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 21:34:43,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 21:34:43,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4243, Invalid=7313, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 21:34:43,070 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2018-09-26 21:34:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:45,961 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-09-26 21:34:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 21:34:45,962 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2018-09-26 21:34:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:45,963 INFO L225 Difference]: With dead ends: 270 [2018-09-26 21:34:45,963 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 21:34:45,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8210 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8640, Invalid=17120, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 21:34:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 21:34:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-09-26 21:34:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-09-26 21:34:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-09-26 21:34:46,027 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-09-26 21:34:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:46,027 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-09-26 21:34:46,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 21:34:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-09-26 21:34:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-26 21:34:46,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:46,029 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2018-09-26 21:34:46,029 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:46,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2018-09-26 21:34:46,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:46,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:46,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:46,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:46,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:47,926 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-26 21:34:47,926 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:47,927 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-26 21:34:47,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:34:48,116 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:34:48,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:48,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:48,132 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-26 21:34:48,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:48,140 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-26 21:34:48,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:49,966 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-26 21:34:49,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:49,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-26 21:34:49,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 21:34:49,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 21:34:49,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4404, Invalid=7586, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 21:34:49,990 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2018-09-26 21:34:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:53,212 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-26 21:34:53,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 21:34:53,213 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2018-09-26 21:34:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:53,214 INFO L225 Difference]: With dead ends: 275 [2018-09-26 21:34:53,214 INFO L226 Difference]: Without dead ends: 274 [2018-09-26 21:34:53,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8527 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8965, Invalid=17767, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 21:34:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-26 21:34:53,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-09-26 21:34:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 21:34:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-09-26 21:34:53,280 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-09-26 21:34:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:53,280 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-09-26 21:34:53,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 21:34:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-09-26 21:34:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-26 21:34:53,282 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:53,282 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2018-09-26 21:34:53,282 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:34:53,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:53,282 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2018-09-26 21:34:53,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:53,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:53,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:53,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:53,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:55,046 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-26 21:34:55,046 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:55,046 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-26 21:34:55,054 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:34:55,413 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-26 21:34:55,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:55,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:55,425 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-26 21:34:55,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:55,435 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-26 21:34:55,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:57,319 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-26 21:34:57,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:57,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-26 21:34:57,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 21:34:57,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 21:34:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4568, Invalid=7864, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 21:34:57,343 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2018-09-26 21:35:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:00,553 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-09-26 21:35:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 21:35:00,554 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2018-09-26 21:35:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:00,555 INFO L225 Difference]: With dead ends: 280 [2018-09-26 21:35:00,555 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 21:35:00,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9296, Invalid=18426, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 21:35:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 21:35:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-09-26 21:35:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-26 21:35:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-09-26 21:35:00,619 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-09-26 21:35:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:00,619 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-09-26 21:35:00,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 21:35:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-09-26 21:35:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-09-26 21:35:00,621 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:00,621 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2018-09-26 21:35:00,621 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:00,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2018-09-26 21:35:00,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:00,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:00,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:02,185 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-26 21:35:02,186 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:02,186 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-26 21:35:02,192 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:35:02,608 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-26 21:35:02,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:02,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:02,650 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-26 21:35:02,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:02,658 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-26 21:35:02,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:04,748 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-26 21:35:04,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:04,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-26 21:35:04,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 21:35:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 21:35:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4735, Invalid=8147, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 21:35:04,772 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2018-09-26 21:35:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:08,248 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-09-26 21:35:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 21:35:08,249 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2018-09-26 21:35:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:08,250 INFO L225 Difference]: With dead ends: 285 [2018-09-26 21:35:08,250 INFO L226 Difference]: Without dead ends: 284 [2018-09-26 21:35:08,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9633, Invalid=19097, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 21:35:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-26 21:35:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-09-26 21:35:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 21:35:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-26 21:35:08,312 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2018-09-26 21:35:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:08,312 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-26 21:35:08,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 21:35:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-26 21:35:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 21:35:08,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:08,314 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2018-09-26 21:35:08,314 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:08,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:08,314 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2018-09-26 21:35:08,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:08,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:08,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:08,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:08,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:09,988 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-26 21:35:09,988 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:09,988 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:35:09,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:10,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:10,189 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-26 21:35:10,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:10,197 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-26 21:35:10,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:12,297 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-26 21:35:12,318 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:12,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-26 21:35:12,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 21:35:12,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 21:35:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4905, Invalid=8435, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 21:35:12,320 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2018-09-26 21:35:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:15,752 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-09-26 21:35:15,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 21:35:15,753 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2018-09-26 21:35:15,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:15,754 INFO L225 Difference]: With dead ends: 290 [2018-09-26 21:35:15,754 INFO L226 Difference]: Without dead ends: 289 [2018-09-26 21:35:15,756 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-26 21:35:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-26 21:35:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2018-09-26 21:35:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-26 21:35:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-09-26 21:35:15,818 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2018-09-26 21:35:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:15,818 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-09-26 21:35:15,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 21:35:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-09-26 21:35:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-26 21:35:15,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:15,820 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2018-09-26 21:35:15,820 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:15,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2018-09-26 21:35:15,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:15,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:15,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:15,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:15,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:17,555 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-26 21:35:17,556 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:17,556 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-26 21:35:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:35:17,746 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:35:17,746 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:17,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:17,764 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-26 21:35:17,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:17,770 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-26 21:35:17,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:20,129 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-26 21:35:20,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:20,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-26 21:35:20,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 21:35:20,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 21:35:20,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5078, Invalid=8728, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 21:35:20,151 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2018-09-26 21:35:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:23,608 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-26 21:35:23,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 21:35:23,608 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2018-09-26 21:35:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:23,610 INFO L225 Difference]: With dead ends: 295 [2018-09-26 21:35:23,610 INFO L226 Difference]: Without dead ends: 294 [2018-09-26 21:35:23,611 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-26 21:35:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-26 21:35:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-09-26 21:35:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-26 21:35:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-09-26 21:35:23,680 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2018-09-26 21:35:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:23,680 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-09-26 21:35:23,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 21:35:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-09-26 21:35:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-26 21:35:23,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:23,682 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2018-09-26 21:35:23,682 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:23,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:23,682 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2018-09-26 21:35:23,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:23,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:23,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:23,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:23,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:25,419 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-26 21:35:25,419 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:25,419 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-26 21:35:25,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:35:25,880 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-26 21:35:25,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:25,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:25,894 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-26 21:35:25,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:25,906 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-26 21:35:25,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:28,163 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-26 21:35:28,184 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:28,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-26 21:35:28,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 21:35:28,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 21:35:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5254, Invalid=9026, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 21:35:28,186 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2018-09-26 21:35:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:31,674 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-09-26 21:35:31,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 21:35:31,675 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2018-09-26 21:35:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:31,676 INFO L225 Difference]: With dead ends: 300 [2018-09-26 21:35:31,676 INFO L226 Difference]: Without dead ends: 299 [2018-09-26 21:35:31,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10202 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10680, Invalid=21182, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 21:35:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-26 21:35:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-09-26 21:35:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-26 21:35:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-09-26 21:35:31,756 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2018-09-26 21:35:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:31,757 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-09-26 21:35:31,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 21:35:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-09-26 21:35:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-26 21:35:31,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:31,758 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2018-09-26 21:35:31,759 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:31,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2018-09-26 21:35:31,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:31,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:31,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:31,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:31,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:33,785 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-26 21:35:33,785 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:33,785 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-26 21:35:33,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:35:33,990 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:35:33,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:33,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:34,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-26 21:35:34,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:34,011 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-26 21:35:34,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:36,236 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-26 21:35:36,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:36,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-26 21:35:36,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 21:35:36,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 21:35:36,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5433, Invalid=9329, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 21:35:36,261 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2018-09-26 21:35:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:39,920 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-09-26 21:35:39,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 21:35:39,920 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2018-09-26 21:35:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:39,921 INFO L225 Difference]: With dead ends: 305 [2018-09-26 21:35:39,921 INFO L226 Difference]: Without dead ends: 304 [2018-09-26 21:35:39,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11041, Invalid=21901, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 21:35:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-09-26 21:35:39,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-09-26 21:35:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 21:35:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-26 21:35:39,992 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2018-09-26 21:35:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:39,992 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-26 21:35:39,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 21:35:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-26 21:35:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 21:35:39,993 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:39,993 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2018-09-26 21:35:39,993 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:39,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2018-09-26 21:35:39,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:39,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:39,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:39,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:39,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:41,856 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-26 21:35:41,857 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:41,857 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:35:41,863 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:35:42,291 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-26 21:35:42,291 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:42,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:42,304 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-26 21:35:42,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:42,316 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-26 21:35:42,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:44,819 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-26 21:35:44,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:44,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-26 21:35:44,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 21:35:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 21:35:44,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5615, Invalid=9637, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 21:35:44,845 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2018-09-26 21:35:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:48,505 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-09-26 21:35:48,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 21:35:48,505 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2018-09-26 21:35:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:48,507 INFO L225 Difference]: With dead ends: 310 [2018-09-26 21:35:48,507 INFO L226 Difference]: Without dead ends: 309 [2018-09-26 21:35:48,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10914 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11408, Invalid=22632, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 21:35:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-26 21:35:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2018-09-26 21:35:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-26 21:35:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-09-26 21:35:48,579 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2018-09-26 21:35:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:48,579 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-09-26 21:35:48,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 21:35:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-09-26 21:35:48,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-26 21:35:48,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:48,581 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2018-09-26 21:35:48,581 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-09-26 21:35:48,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2018-09-26 21:35:48,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:48,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:48,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:50,568 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:50,568 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:50,576 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:35:51,087 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-26 21:35:51,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:51,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:51,100 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-26 21:35:51,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:51,110 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-26 21:35:51,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-09-26 21:35:51,825 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-26 21:35:52,026 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:52,027 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:35:52,032 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:35:52,033 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:35:52 BoogieIcfgContainer [2018-09-26 21:35:52,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:35:52,034 INFO L168 Benchmark]: Toolchain (without parser) took 238904.58 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-26 21:35:52,034 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:35:52,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:35:52,034 INFO L168 Benchmark]: Boogie Preprocessor took 32.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:35:52,035 INFO L168 Benchmark]: RCFGBuilder took 390.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:35:52,035 INFO L168 Benchmark]: TraceAbstraction took 238404.97 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-26 21:35:52,036 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 390.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238404.97 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 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 TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 96 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 TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 96 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 2 error locations. TIMEOUT Result, 238.3s OverallTime, 63 OverallIterations, 61 TraceHistogramMax, 97.9s 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12872 GetRequests, 7200 SyntacticMatches, 0 SemanticMatches, 5672 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224732 ImplicationChecksByTransitivity, 177.3s 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.8s AutomataMinimizationTime, 62 MinimizatonAttempts, 185 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.5s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 118.8s 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-26_21-35-52-044.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-26_21-35-52-044.csv Completed graceful shutdown