java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/enc-zip_map2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:43:36,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:43:36,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:43:36,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:43:36,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:43:36,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:43:36,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:43:36,520 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:43:36,521 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:43:36,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:43:36,524 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:43:36,524 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:43:36,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:43:36,526 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:43:36,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:43:36,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:43:36,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:43:36,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:43:36,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:43:36,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:43:36,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:43:36,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:43:36,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:43:36,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:43:36,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:43:36,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:43:36,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:43:36,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:43:36,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:43:36,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:43:36,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:43:36,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:43:36,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:43:36,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:43:36,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:43:36,559 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:43:36,572 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:43:36,573 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:43:36,573 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:43:36,573 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:43:36,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:43:36,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:43:36,575 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:43:36,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:43:36,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:43:36,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:43:36,575 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:43:36,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:43:36,576 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:43:36,576 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:43:36,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:43:36,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:43:36,576 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:43:36,578 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:43:36,578 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:43:36,626 INFO ]: Repository-Root is: /tmp [2018-06-22 01:43:36,641 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:43:36,647 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:43:36,648 INFO ]: Initializing SmtParser... [2018-06-22 01:43:36,649 INFO ]: SmtParser initialized [2018-06-22 01:43:36,649 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-zip_map2.smt2 [2018-06-22 01:43:36,651 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:43:36,741 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_map2.smt2 unknown [2018-06-22 01:43:36,944 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_map2.smt2 [2018-06-22 01:43:36,949 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:43:36,958 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:43:36,959 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:43:36,959 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:43:36,959 INFO ]: ChcToBoogie initialized [2018-06-22 01:43:36,963 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:43:36" (1/1) ... [2018-06-22 01:43:37,015 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:43:37 Unit [2018-06-22 01:43:37,118 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:43:37,119 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:43:37,119 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:43:37,119 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:43:37,139 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:43:37" (1/1) ... [2018-06-22 01:43:37,140 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:43:37" (1/1) ... [2018-06-22 01:43:37,149 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:43:37" (1/1) ... [2018-06-22 01:43:37,149 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:43:37" (1/1) ... [2018-06-22 01:43:37,153 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:43:37" (1/1) ... [2018-06-22 01:43:37,158 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:43:37" (1/1) ... [2018-06-22 01:43:37,160 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:43:37" (1/1) ... [2018-06-22 01:43:37,162 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:43:37,162 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:43:37,162 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:43:37,162 INFO ]: RCFGBuilder initialized [2018-06-22 01:43:37,163 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:43:37" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:43:37,183 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:43:37,183 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:43:37,183 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:43:37,183 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:43:37,183 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:43:37,183 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:43:37,578 INFO ]: Using library mode [2018-06-22 01:43:37,579 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:43:37 BoogieIcfgContainer [2018-06-22 01:43:37,579 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:43:37,581 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:43:37,581 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:43:37,584 INFO ]: TraceAbstraction initialized [2018-06-22 01:43:37,584 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:43:36" (1/3) ... [2018-06-22 01:43:37,585 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd0d244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:43:37, skipping insertion in model container [2018-06-22 01:43:37,585 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:43:37" (2/3) ... [2018-06-22 01:43:37,585 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd0d244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:43:37, skipping insertion in model container [2018-06-22 01:43:37,585 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:43:37" (3/3) ... [2018-06-22 01:43:37,587 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:43:37,596 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:43:37,604 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:43:37,644 INFO ]: Using default assertion order modulation [2018-06-22 01:43:37,644 INFO ]: Interprodecural is true [2018-06-22 01:43:37,644 INFO ]: Hoare is false [2018-06-22 01:43:37,644 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:43:37,644 INFO ]: Backedges is TWOTRACK [2018-06-22 01:43:37,644 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:43:37,644 INFO ]: Difference is false [2018-06-22 01:43:37,644 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:43:37,644 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:43:37,657 INFO ]: Start isEmpty. Operand 17 states. [2018-06-22 01:43:37,667 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:43:37,667 INFO ]: Found error trace [2018-06-22 01:43:37,668 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:37,668 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:37,673 INFO ]: Analyzing trace with hash 51612684, now seen corresponding path program 1 times [2018-06-22 01:43:37,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:37,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:37,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:37,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:37,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:37,732 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:37,757 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:43:37,760 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:43:37,760 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:43:37,762 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:43:37,773 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:43:37,773 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:43:37,775 INFO ]: Start difference. First operand 17 states. Second operand 2 states. [2018-06-22 01:43:37,792 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:37,792 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 01:43:37,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:43:37,793 INFO ]: Start accepts. Automaton has 2 states. Word has length 7 [2018-06-22 01:43:37,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:37,802 INFO ]: With dead ends: 15 [2018-06-22 01:43:37,802 INFO ]: Without dead ends: 15 [2018-06-22 01:43:37,803 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:43:37,817 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:43:37,834 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:43:37,835 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:43:37,836 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 01:43:37,837 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 7 [2018-06-22 01:43:37,838 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:37,838 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 01:43:37,838 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:43:37,838 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 01:43:37,839 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:43:37,840 INFO ]: Found error trace [2018-06-22 01:43:37,840 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:37,840 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:37,840 INFO ]: Analyzing trace with hash 1553778055, now seen corresponding path program 1 times [2018-06-22 01:43:37,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:37,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:37,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:37,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:37,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:37,859 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:37,930 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:43:37,930 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:43:37,930 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:43:37,932 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:43:37,932 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:43:37,932 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:43:37,932 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 4 states. [2018-06-22 01:43:38,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:38,038 INFO ]: Finished difference Result 24 states and 36 transitions. [2018-06-22 01:43:38,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:43:38,038 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:43:38,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:38,039 INFO ]: With dead ends: 24 [2018-06-22 01:43:38,039 INFO ]: Without dead ends: 24 [2018-06-22 01:43:38,040 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:43:38,040 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:43:38,045 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 01:43:38,045 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:43:38,046 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-06-22 01:43:38,046 INFO ]: Start accepts. Automaton has 24 states and 36 transitions. Word has length 8 [2018-06-22 01:43:38,046 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:38,046 INFO ]: Abstraction has 24 states and 36 transitions. [2018-06-22 01:43:38,046 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:43:38,046 INFO ]: Start isEmpty. Operand 24 states and 36 transitions. [2018-06-22 01:43:38,047 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:43:38,047 INFO ]: Found error trace [2018-06-22 01:43:38,047 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:38,047 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:38,047 INFO ]: Analyzing trace with hash 1583330727, now seen corresponding path program 1 times [2018-06-22 01:43:38,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:38,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:38,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:38,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:38,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:38,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:38,115 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:43:38,145 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:43:38,145 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:43:38,145 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:43:38,145 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:43:38,145 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:43:38,145 INFO ]: Start difference. First operand 24 states and 36 transitions. Second operand 3 states. [2018-06-22 01:43:38,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:38,188 INFO ]: Finished difference Result 25 states and 36 transitions. [2018-06-22 01:43:38,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:43:38,189 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:43:38,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:38,190 INFO ]: With dead ends: 25 [2018-06-22 01:43:38,190 INFO ]: Without dead ends: 23 [2018-06-22 01:43:38,190 INFO ]: 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-06-22 01:43:38,190 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:43:38,193 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 01:43:38,193 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:43:38,194 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-06-22 01:43:38,194 INFO ]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 8 [2018-06-22 01:43:38,194 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:38,194 INFO ]: Abstraction has 23 states and 30 transitions. [2018-06-22 01:43:38,195 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:43:38,195 INFO ]: Start isEmpty. Operand 23 states and 30 transitions. [2018-06-22 01:43:38,195 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:43:38,196 INFO ]: Found error trace [2018-06-22 01:43:38,196 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:38,196 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:38,196 INFO ]: Analyzing trace with hash 1410516979, now seen corresponding path program 1 times [2018-06-22 01:43:38,196 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:38,196 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:38,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:38,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:38,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:38,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:38,471 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:43:38,471 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:43:38,471 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 01:43:38,471 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:43:38,471 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:43:38,471 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:43:38,472 INFO ]: Start difference. First operand 23 states and 30 transitions. Second operand 7 states. [2018-06-22 01:43:38,896 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:38,896 INFO ]: Finished difference Result 35 states and 51 transitions. [2018-06-22 01:43:38,897 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:43:38,897 INFO ]: Start accepts. Automaton has 7 states. Word has length 16 [2018-06-22 01:43:38,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:38,900 INFO ]: With dead ends: 35 [2018-06-22 01:43:38,900 INFO ]: Without dead ends: 28 [2018-06-22 01:43:38,900 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:43:38,900 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:43:38,905 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-22 01:43:38,906 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:43:38,907 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-06-22 01:43:38,907 INFO ]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 16 [2018-06-22 01:43:38,907 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:38,907 INFO ]: Abstraction has 26 states and 33 transitions. [2018-06-22 01:43:38,907 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:43:38,907 INFO ]: Start isEmpty. Operand 26 states and 33 transitions. [2018-06-22 01:43:38,908 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:43:38,908 INFO ]: Found error trace [2018-06-22 01:43:38,908 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:38,908 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:38,908 INFO ]: Analyzing trace with hash -1047407506, now seen corresponding path program 1 times [2018-06-22 01:43:38,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:38,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:38,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:38,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:38,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:38,926 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:39,243 INFO ]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:43:39,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:39,243 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:39,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:39,274 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:39,281 INFO ]: Computing forward predicates... [2018-06-22 01:43:39,989 INFO ]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:43:40,020 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:43:40,020 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2018-06-22 01:43:40,020 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:43:40,020 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:43:40,020 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:43:40,020 INFO ]: Start difference. First operand 26 states and 33 transitions. Second operand 13 states. [2018-06-22 01:43:40,276 WARN ]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:43:42,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:42,804 INFO ]: Finished difference Result 36 states and 48 transitions. [2018-06-22 01:43:42,805 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:43:42,805 INFO ]: Start accepts. Automaton has 13 states. Word has length 24 [2018-06-22 01:43:42,805 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:42,806 INFO ]: With dead ends: 36 [2018-06-22 01:43:42,806 INFO ]: Without dead ends: 36 [2018-06-22 01:43:42,806 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:43:42,806 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:43:42,811 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-22 01:43:42,812 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:43:42,812 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2018-06-22 01:43:42,813 INFO ]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 24 [2018-06-22 01:43:42,813 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:42,813 INFO ]: Abstraction has 34 states and 44 transitions. [2018-06-22 01:43:42,813 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:43:42,813 INFO ]: Start isEmpty. Operand 34 states and 44 transitions. [2018-06-22 01:43:42,814 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:43:42,814 INFO ]: Found error trace [2018-06-22 01:43:42,814 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:42,814 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:42,814 INFO ]: Analyzing trace with hash 1890543239, now seen corresponding path program 1 times [2018-06-22 01:43:42,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:42,814 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:42,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:42,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:42,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:42,841 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:43,134 INFO ]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:43:43,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:43,134 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:43:43,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:43,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:43,179 INFO ]: Computing forward predicates... [2018-06-22 01:43:43,482 INFO ]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:43:43,512 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:43,512 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-06-22 01:43:43,512 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:43:43,513 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:43:43,513 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:43:43,513 INFO ]: Start difference. First operand 34 states and 44 transitions. Second operand 18 states. [2018-06-22 01:43:44,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:44,055 INFO ]: Finished difference Result 46 states and 61 transitions. [2018-06-22 01:43:44,060 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:43:44,060 INFO ]: Start accepts. Automaton has 18 states. Word has length 25 [2018-06-22 01:43:44,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:44,061 INFO ]: With dead ends: 46 [2018-06-22 01:43:44,061 INFO ]: Without dead ends: 46 [2018-06-22 01:43:44,062 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:43:44,062 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 01:43:44,071 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-06-22 01:43:44,071 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:43:44,074 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2018-06-22 01:43:44,074 INFO ]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 25 [2018-06-22 01:43:44,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:44,074 INFO ]: Abstraction has 42 states and 55 transitions. [2018-06-22 01:43:44,075 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:43:44,075 INFO ]: Start isEmpty. Operand 42 states and 55 transitions. [2018-06-22 01:43:44,076 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:43:44,076 INFO ]: Found error trace [2018-06-22 01:43:44,076 INFO ]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:44,076 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:44,076 INFO ]: Analyzing trace with hash -1522264178, now seen corresponding path program 2 times [2018-06-22 01:43:44,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:44,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:44,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:44,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:44,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:44,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:44,286 INFO ]: Checked inductivity of 17 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:43:44,286 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:44,286 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:44,292 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:43:44,308 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:43:44,308 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:44,310 INFO ]: Computing forward predicates... [2018-06-22 01:43:44,361 INFO ]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:43:44,380 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:44,380 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-06-22 01:43:44,380 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:43:44,380 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:43:44,381 INFO ]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:43:44,381 INFO ]: Start difference. First operand 42 states and 55 transitions. Second operand 14 states. [2018-06-22 01:43:44,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:44,731 INFO ]: Finished difference Result 48 states and 63 transitions. [2018-06-22 01:43:44,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:43:44,732 INFO ]: Start accepts. Automaton has 14 states. Word has length 26 [2018-06-22 01:43:44,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:44,733 INFO ]: With dead ends: 48 [2018-06-22 01:43:44,733 INFO ]: Without dead ends: 40 [2018-06-22 01:43:44,734 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:43:44,734 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:43:44,747 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-22 01:43:44,747 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:43:44,748 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2018-06-22 01:43:44,748 INFO ]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 26 [2018-06-22 01:43:44,748 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:44,748 INFO ]: Abstraction has 38 states and 49 transitions. [2018-06-22 01:43:44,748 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:43:44,748 INFO ]: Start isEmpty. Operand 38 states and 49 transitions. [2018-06-22 01:43:44,752 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:43:44,752 INFO ]: Found error trace [2018-06-22 01:43:44,752 INFO ]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:44,752 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:44,752 INFO ]: Analyzing trace with hash 728050156, now seen corresponding path program 3 times [2018-06-22 01:43:44,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:44,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:44,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:44,753 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:44,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:44,793 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:44,943 INFO ]: Checked inductivity of 33 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 01:43:44,943 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:44,943 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:44,949 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:43:44,971 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:43:44,971 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:44,974 INFO ]: Computing forward predicates... [2018-06-22 01:43:45,113 INFO ]: Checked inductivity of 33 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:43:45,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:45,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2018-06-22 01:43:45,145 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:43:45,145 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:43:45,145 INFO ]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:43:45,146 INFO ]: Start difference. First operand 38 states and 49 transitions. Second operand 14 states. [2018-06-22 01:43:45,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:45,518 INFO ]: Finished difference Result 42 states and 55 transitions. [2018-06-22 01:43:45,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:43:45,518 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 01:43:45,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:45,519 INFO ]: With dead ends: 42 [2018-06-22 01:43:45,519 INFO ]: Without dead ends: 42 [2018-06-22 01:43:45,520 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:43:45,520 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:43:45,525 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 01:43:45,525 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:43:45,526 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2018-06-22 01:43:45,526 INFO ]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 33 [2018-06-22 01:43:45,526 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:45,526 INFO ]: Abstraction has 40 states and 51 transitions. [2018-06-22 01:43:45,526 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:43:45,526 INFO ]: Start isEmpty. Operand 40 states and 51 transitions. [2018-06-22 01:43:45,528 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:43:45,528 INFO ]: Found error trace [2018-06-22 01:43:45,528 INFO ]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:45,528 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:45,528 INFO ]: Analyzing trace with hash 1095155913, now seen corresponding path program 4 times [2018-06-22 01:43:45,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:45,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:45,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:45,529 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:45,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:45,546 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:45,810 INFO ]: Checked inductivity of 35 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 01:43:45,810 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:45,810 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:45,815 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:43:45,852 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:43:45,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:45,855 INFO ]: Computing forward predicates... [2018-06-22 01:43:46,149 INFO ]: Checked inductivity of 35 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:43:46,169 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:46,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2018-06-22 01:43:46,170 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:43:46,170 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:43:46,170 INFO ]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:43:46,170 INFO ]: Start difference. First operand 40 states and 51 transitions. Second operand 23 states. [2018-06-22 01:43:46,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:46,848 INFO ]: Finished difference Result 54 states and 70 transitions. [2018-06-22 01:43:46,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:43:46,849 INFO ]: Start accepts. Automaton has 23 states. Word has length 34 [2018-06-22 01:43:46,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:46,850 INFO ]: With dead ends: 54 [2018-06-22 01:43:46,850 INFO ]: Without dead ends: 54 [2018-06-22 01:43:46,851 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:43:46,851 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:43:46,856 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-06-22 01:43:46,856 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:43:46,857 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2018-06-22 01:43:46,857 INFO ]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 34 [2018-06-22 01:43:46,857 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:46,857 INFO ]: Abstraction has 48 states and 62 transitions. [2018-06-22 01:43:46,857 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:43:46,857 INFO ]: Start isEmpty. Operand 48 states and 62 transitions. [2018-06-22 01:43:46,859 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:43:46,859 INFO ]: Found error trace [2018-06-22 01:43:46,859 INFO ]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:46,859 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:46,859 INFO ]: Analyzing trace with hash -409467508, now seen corresponding path program 5 times [2018-06-22 01:43:46,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:46,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:46,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:46,860 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:46,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:46,874 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:47,011 INFO ]: Checked inductivity of 38 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 01:43:47,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:47,011 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:47,020 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:43:47,092 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:43:47,092 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:47,095 INFO ]: Computing forward predicates... [2018-06-22 01:43:47,382 INFO ]: Checked inductivity of 38 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:43:47,400 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:47,400 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2018-06-22 01:43:47,401 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:43:47,401 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:43:47,401 INFO ]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:43:47,401 INFO ]: Start difference. First operand 48 states and 62 transitions. Second operand 16 states. [2018-06-22 01:43:47,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:47,590 INFO ]: Finished difference Result 56 states and 72 transitions. [2018-06-22 01:43:47,592 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:43:47,592 INFO ]: Start accepts. Automaton has 16 states. Word has length 35 [2018-06-22 01:43:47,593 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:47,594 INFO ]: With dead ends: 56 [2018-06-22 01:43:47,594 INFO ]: Without dead ends: 46 [2018-06-22 01:43:47,594 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:43:47,594 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 01:43:47,601 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-06-22 01:43:47,601 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:43:47,602 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-06-22 01:43:47,602 INFO ]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 35 [2018-06-22 01:43:47,602 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:47,602 INFO ]: Abstraction has 44 states and 56 transitions. [2018-06-22 01:43:47,602 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:43:47,602 INFO ]: Start isEmpty. Operand 44 states and 56 transitions. [2018-06-22 01:43:47,605 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:43:47,605 INFO ]: Found error trace [2018-06-22 01:43:47,605 INFO ]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:47,605 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:47,605 INFO ]: Analyzing trace with hash 1467316612, now seen corresponding path program 6 times [2018-06-22 01:43:47,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:47,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:47,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:47,606 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:47,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:47,630 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:47,744 INFO ]: Checked inductivity of 61 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 01:43:47,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:47,745 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:47,753 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:43:47,789 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:43:47,789 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:47,792 INFO ]: Computing forward predicates... [2018-06-22 01:43:47,836 INFO ]: Checked inductivity of 61 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 01:43:47,856 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:47,856 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2018-06-22 01:43:47,856 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:43:47,856 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:43:47,856 INFO ]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:43:47,856 INFO ]: Start difference. First operand 44 states and 56 transitions. Second operand 16 states. [2018-06-22 01:43:48,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:48,158 INFO ]: Finished difference Result 48 states and 62 transitions. [2018-06-22 01:43:48,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:43:48,158 INFO ]: Start accepts. Automaton has 16 states. Word has length 42 [2018-06-22 01:43:48,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:48,159 INFO ]: With dead ends: 48 [2018-06-22 01:43:48,159 INFO ]: Without dead ends: 48 [2018-06-22 01:43:48,160 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:43:48,160 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:43:48,164 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 01:43:48,164 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 01:43:48,164 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-06-22 01:43:48,164 INFO ]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 42 [2018-06-22 01:43:48,165 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:48,165 INFO ]: Abstraction has 46 states and 58 transitions. [2018-06-22 01:43:48,165 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:43:48,165 INFO ]: Start isEmpty. Operand 46 states and 58 transitions. [2018-06-22 01:43:48,166 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:43:48,166 INFO ]: Found error trace [2018-06-22 01:43:48,166 INFO ]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:48,166 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:48,166 INFO ]: Analyzing trace with hash -1757387727, now seen corresponding path program 7 times [2018-06-22 01:43:48,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:48,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:48,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:48,167 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:48,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:48,183 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:48,449 INFO ]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 01:43:48,449 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:48,449 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:48,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:48,481 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:48,484 INFO ]: Computing forward predicates... [2018-06-22 01:43:49,103 INFO ]: Checked inductivity of 64 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 01:43:49,157 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:49,157 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-06-22 01:43:49,158 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:43:49,158 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:43:49,158 INFO ]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:43:49,158 INFO ]: Start difference. First operand 46 states and 58 transitions. Second operand 27 states. [2018-06-22 01:43:49,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:49,985 INFO ]: Finished difference Result 62 states and 79 transitions. [2018-06-22 01:43:49,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:43:49,985 INFO ]: Start accepts. Automaton has 27 states. Word has length 43 [2018-06-22 01:43:49,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:49,986 INFO ]: With dead ends: 62 [2018-06-22 01:43:49,986 INFO ]: Without dead ends: 62 [2018-06-22 01:43:49,987 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=228, Invalid=1842, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:43:49,987 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 01:43:49,992 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-06-22 01:43:49,993 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:43:49,993 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2018-06-22 01:43:49,993 INFO ]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 43 [2018-06-22 01:43:49,994 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:49,994 INFO ]: Abstraction has 54 states and 69 transitions. [2018-06-22 01:43:49,994 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:43:49,994 INFO ]: Start isEmpty. Operand 54 states and 69 transitions. [2018-06-22 01:43:49,995 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:43:49,995 INFO ]: Found error trace [2018-06-22 01:43:49,995 INFO ]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:49,995 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:49,995 INFO ]: Analyzing trace with hash 1355992868, now seen corresponding path program 8 times [2018-06-22 01:43:49,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:49,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:49,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:49,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:49,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:50,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:50,179 INFO ]: Checked inductivity of 68 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 01:43:50,179 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:50,179 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:50,184 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:43:50,209 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:43:50,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:50,212 INFO ]: Computing forward predicates... [2018-06-22 01:43:50,309 INFO ]: Checked inductivity of 68 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 01:43:50,328 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:50,328 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2018-06-22 01:43:50,329 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:43:50,329 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:43:50,329 INFO ]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:43:50,329 INFO ]: Start difference. First operand 54 states and 69 transitions. Second operand 18 states. [2018-06-22 01:43:50,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:50,552 INFO ]: Finished difference Result 64 states and 81 transitions. [2018-06-22 01:43:50,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:43:50,552 INFO ]: Start accepts. Automaton has 18 states. Word has length 44 [2018-06-22 01:43:50,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:50,552 INFO ]: With dead ends: 64 [2018-06-22 01:43:50,552 INFO ]: Without dead ends: 52 [2018-06-22 01:43:50,553 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:43:50,553 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 01:43:50,557 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-06-22 01:43:50,557 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 01:43:50,557 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-06-22 01:43:50,557 INFO ]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 44 [2018-06-22 01:43:50,557 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:50,558 INFO ]: Abstraction has 50 states and 63 transitions. [2018-06-22 01:43:50,558 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:43:50,558 INFO ]: Start isEmpty. Operand 50 states and 63 transitions. [2018-06-22 01:43:50,558 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-22 01:43:50,558 INFO ]: Found error trace [2018-06-22 01:43:50,559 INFO ]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:50,559 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:50,559 INFO ]: Analyzing trace with hash -1313905834, now seen corresponding path program 9 times [2018-06-22 01:43:50,559 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:50,559 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:50,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:50,559 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:50,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:50,587 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:50,906 INFO ]: Checked inductivity of 98 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 01:43:50,906 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:50,906 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:50,912 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:43:50,995 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:43:50,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:50,999 INFO ]: Computing forward predicates... [2018-06-22 01:43:51,078 INFO ]: Checked inductivity of 98 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 01:43:51,100 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:51,100 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2018-06-22 01:43:51,100 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:43:51,101 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:43:51,101 INFO ]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:43:51,101 INFO ]: Start difference. First operand 50 states and 63 transitions. Second operand 18 states. [2018-06-22 01:43:51,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:51,432 INFO ]: Finished difference Result 54 states and 69 transitions. [2018-06-22 01:43:51,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:43:51,432 INFO ]: Start accepts. Automaton has 18 states. Word has length 51 [2018-06-22 01:43:51,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:51,433 INFO ]: With dead ends: 54 [2018-06-22 01:43:51,433 INFO ]: Without dead ends: 54 [2018-06-22 01:43:51,433 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:43:51,433 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:43:51,438 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-22 01:43:51,438 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 01:43:51,438 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2018-06-22 01:43:51,438 INFO ]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 51 [2018-06-22 01:43:51,439 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:51,439 INFO ]: Abstraction has 52 states and 65 transitions. [2018-06-22 01:43:51,439 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:43:51,439 INFO ]: Start isEmpty. Operand 52 states and 65 transitions. [2018-06-22 01:43:51,439 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 01:43:51,439 INFO ]: Found error trace [2018-06-22 01:43:51,439 INFO ]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:51,440 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:51,440 INFO ]: Analyzing trace with hash -2075937633, now seen corresponding path program 10 times [2018-06-22 01:43:51,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:51,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:51,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:51,440 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:51,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:51,467 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:52,295 WARN ]: Spent 505.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-06-22 01:43:52,450 INFO ]: Checked inductivity of 102 backedges. 10 proven. 53 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 01:43:52,450 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:52,450 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:52,461 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:43:52,497 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:43:52,497 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:52,501 INFO ]: Computing forward predicates... [2018-06-22 01:43:52,759 INFO ]: Checked inductivity of 102 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 01:43:52,778 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:52,778 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-06-22 01:43:52,779 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:43:52,779 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:43:52,779 INFO ]: CoverageRelationStatistics Valid=66, Invalid=864, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:43:52,779 INFO ]: Start difference. First operand 52 states and 65 transitions. Second operand 31 states. [2018-06-22 01:43:54,084 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:54,084 INFO ]: Finished difference Result 70 states and 88 transitions. [2018-06-22 01:43:54,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:43:54,085 INFO ]: Start accepts. Automaton has 31 states. Word has length 52 [2018-06-22 01:43:54,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:54,085 INFO ]: With dead ends: 70 [2018-06-22 01:43:54,085 INFO ]: Without dead ends: 70 [2018-06-22 01:43:54,086 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=2485, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:43:54,086 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 01:43:54,091 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 60. [2018-06-22 01:43:54,091 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 01:43:54,092 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2018-06-22 01:43:54,092 INFO ]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 52 [2018-06-22 01:43:54,092 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:54,092 INFO ]: Abstraction has 60 states and 76 transitions. [2018-06-22 01:43:54,092 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:43:54,092 INFO ]: Start isEmpty. Operand 60 states and 76 transitions. [2018-06-22 01:43:54,093 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 01:43:54,093 INFO ]: Found error trace [2018-06-22 01:43:54,093 INFO ]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:54,093 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:54,093 INFO ]: Analyzing trace with hash 70880374, now seen corresponding path program 11 times [2018-06-22 01:43:54,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:54,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:54,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:54,094 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:54,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:54,111 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:54,412 INFO ]: Checked inductivity of 107 backedges. 16 proven. 52 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 01:43:54,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:54,412 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-22 01:43:54,427 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:43:54,461 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:43:54,461 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:54,464 INFO ]: Computing forward predicates... [2018-06-22 01:43:54,539 INFO ]: Checked inductivity of 107 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 01:43:54,558 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:54,558 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2018-06-22 01:43:54,559 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:43:54,559 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:43:54,559 INFO ]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:43:54,559 INFO ]: Start difference. First operand 60 states and 76 transitions. Second operand 20 states. [2018-06-22 01:43:54,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:54,847 INFO ]: Finished difference Result 72 states and 90 transitions. [2018-06-22 01:43:54,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:43:54,849 INFO ]: Start accepts. Automaton has 20 states. Word has length 53 [2018-06-22 01:43:54,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:54,849 INFO ]: With dead ends: 72 [2018-06-22 01:43:54,849 INFO ]: Without dead ends: 58 [2018-06-22 01:43:54,850 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:43:54,850 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 01:43:54,853 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-22 01:43:54,853 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 01:43:54,853 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-06-22 01:43:54,853 INFO ]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 53 [2018-06-22 01:43:54,854 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:54,854 INFO ]: Abstraction has 56 states and 70 transitions. [2018-06-22 01:43:54,854 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:43:54,854 INFO ]: Start isEmpty. Operand 56 states and 70 transitions. [2018-06-22 01:43:54,854 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-22 01:43:54,855 INFO ]: Found error trace [2018-06-22 01:43:54,855 INFO ]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:54,855 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:54,855 INFO ]: Analyzing trace with hash 1405700506, now seen corresponding path program 12 times [2018-06-22 01:43:54,855 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:54,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:54,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:54,855 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:54,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:54,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:55,761 INFO ]: Checked inductivity of 144 backedges. 67 proven. 19 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-06-22 01:43:55,761 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:55,761 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:55,767 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:43:55,806 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:43:55,851 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:55,854 INFO ]: Computing forward predicates... [2018-06-22 01:43:55,901 INFO ]: Checked inductivity of 144 backedges. 67 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 01:43:55,920 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:55,920 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2018-06-22 01:43:55,921 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:43:55,921 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:43:55,921 INFO ]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:43:55,921 INFO ]: Start difference. First operand 56 states and 70 transitions. Second operand 20 states. [2018-06-22 01:43:56,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:56,159 INFO ]: Finished difference Result 60 states and 76 transitions. [2018-06-22 01:43:56,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:43:56,159 INFO ]: Start accepts. Automaton has 20 states. Word has length 60 [2018-06-22 01:43:56,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:56,159 INFO ]: With dead ends: 60 [2018-06-22 01:43:56,159 INFO ]: Without dead ends: 60 [2018-06-22 01:43:56,160 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:43:56,160 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 01:43:56,164 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-06-22 01:43:56,164 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 01:43:56,165 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2018-06-22 01:43:56,165 INFO ]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 60 [2018-06-22 01:43:56,165 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:56,165 INFO ]: Abstraction has 58 states and 72 transitions. [2018-06-22 01:43:56,165 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:43:56,165 INFO ]: Start isEmpty. Operand 58 states and 72 transitions. [2018-06-22 01:43:56,166 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 01:43:56,166 INFO ]: Found error trace [2018-06-22 01:43:56,166 INFO ]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:56,166 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:56,166 INFO ]: Analyzing trace with hash 627480283, now seen corresponding path program 13 times [2018-06-22 01:43:56,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:56,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:56,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:56,167 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:56,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:56,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:56,670 INFO ]: Checked inductivity of 149 backedges. 12 proven. 79 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-06-22 01:43:56,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:56,670 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:56,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:56,708 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:56,711 INFO ]: Computing forward predicates... [2018-06-22 01:43:57,074 INFO ]: Checked inductivity of 149 backedges. 12 proven. 70 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 01:43:57,094 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:57,094 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2018-06-22 01:43:57,094 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:43:57,094 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:43:57,094 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1115, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:43:57,095 INFO ]: Start difference. First operand 58 states and 72 transitions. Second operand 35 states. [2018-06-22 01:43:58,395 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:58,396 INFO ]: Finished difference Result 78 states and 97 transitions. [2018-06-22 01:43:58,396 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:43:58,396 INFO ]: Start accepts. Automaton has 35 states. Word has length 61 [2018-06-22 01:43:58,396 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:58,396 INFO ]: With dead ends: 78 [2018-06-22 01:43:58,396 INFO ]: Without dead ends: 78 [2018-06-22 01:43:58,397 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=314, Invalid=3226, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 01:43:58,398 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 01:43:58,405 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 66. [2018-06-22 01:43:58,405 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 01:43:58,406 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-06-22 01:43:58,406 INFO ]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 61 [2018-06-22 01:43:58,406 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:58,406 INFO ]: Abstraction has 66 states and 83 transitions. [2018-06-22 01:43:58,406 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:43:58,406 INFO ]: Start isEmpty. Operand 66 states and 83 transitions. [2018-06-22 01:43:58,407 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-22 01:43:58,407 INFO ]: Found error trace [2018-06-22 01:43:58,407 INFO ]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:58,407 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:58,407 INFO ]: Analyzing trace with hash -2022510150, now seen corresponding path program 14 times [2018-06-22 01:43:58,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:58,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:58,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:58,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:43:58,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:58,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:58,581 INFO ]: Checked inductivity of 155 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-06-22 01:43:58,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:58,582 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:58,588 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:43:58,623 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:43:58,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:58,626 INFO ]: Computing forward predicates... [2018-06-22 01:43:58,764 INFO ]: Checked inductivity of 155 backedges. 33 proven. 55 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 01:43:58,784 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:58,784 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 22 [2018-06-22 01:43:58,784 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:43:58,784 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:43:58,785 INFO ]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:43:58,785 INFO ]: Start difference. First operand 66 states and 83 transitions. Second operand 22 states. [2018-06-22 01:43:59,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:43:59,216 INFO ]: Finished difference Result 80 states and 99 transitions. [2018-06-22 01:43:59,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:43:59,216 INFO ]: Start accepts. Automaton has 22 states. Word has length 62 [2018-06-22 01:43:59,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:43:59,217 INFO ]: With dead ends: 80 [2018-06-22 01:43:59,217 INFO ]: Without dead ends: 64 [2018-06-22 01:43:59,217 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:43:59,218 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 01:43:59,223 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-06-22 01:43:59,223 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 01:43:59,223 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2018-06-22 01:43:59,223 INFO ]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 62 [2018-06-22 01:43:59,223 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:43:59,223 INFO ]: Abstraction has 62 states and 77 transitions. [2018-06-22 01:43:59,223 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:43:59,223 INFO ]: Start isEmpty. Operand 62 states and 77 transitions. [2018-06-22 01:43:59,224 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 01:43:59,224 INFO ]: Found error trace [2018-06-22 01:43:59,224 INFO ]: trace histogram [8, 8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:43:59,224 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:43:59,224 INFO ]: Analyzing trace with hash 2090181056, now seen corresponding path program 15 times [2018-06-22 01:43:59,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:43:59,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:43:59,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:59,225 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:43:59,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:43:59,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:59,479 INFO ]: Checked inductivity of 199 backedges. 92 proven. 26 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 01:43:59,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:43:59,479 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:43:59,486 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:43:59,594 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 01:43:59,594 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:43:59,596 INFO ]: Computing forward predicates... [2018-06-22 01:43:59,640 INFO ]: Checked inductivity of 199 backedges. 92 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-22 01:43:59,659 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:43:59,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 22 [2018-06-22 01:43:59,708 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:43:59,708 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:43:59,708 INFO ]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:43:59,709 INFO ]: Start difference. First operand 62 states and 77 transitions. Second operand 22 states. [2018-06-22 01:44:00,280 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:00,280 INFO ]: Finished difference Result 66 states and 83 transitions. [2018-06-22 01:44:00,280 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:44:00,280 INFO ]: Start accepts. Automaton has 22 states. Word has length 69 [2018-06-22 01:44:00,281 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:00,281 INFO ]: With dead ends: 66 [2018-06-22 01:44:00,281 INFO ]: Without dead ends: 66 [2018-06-22 01:44:00,281 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=362, Invalid=1530, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:44:00,282 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 01:44:00,284 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-06-22 01:44:00,284 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 01:44:00,285 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-06-22 01:44:00,285 INFO ]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 69 [2018-06-22 01:44:00,285 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:00,285 INFO ]: Abstraction has 64 states and 79 transitions. [2018-06-22 01:44:00,285 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:44:00,285 INFO ]: Start isEmpty. Operand 64 states and 79 transitions. [2018-06-22 01:44:00,285 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-22 01:44:00,285 INFO ]: Found error trace [2018-06-22 01:44:00,285 INFO ]: trace histogram [8, 8, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:00,285 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:00,286 INFO ]: Analyzing trace with hash 371540853, now seen corresponding path program 16 times [2018-06-22 01:44:00,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:00,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:00,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:00,286 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:00,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:00,306 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:00,983 INFO ]: Checked inductivity of 205 backedges. 14 proven. 110 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 01:44:00,983 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:00,983 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:00,992 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:44:01,030 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:44:01,030 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:01,034 INFO ]: Computing forward predicates... [2018-06-22 01:44:01,418 INFO ]: Checked inductivity of 205 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-22 01:44:01,437 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:01,437 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2018-06-22 01:44:01,437 INFO ]: Interpolant automaton has 39 states [2018-06-22 01:44:01,437 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 01:44:01,437 INFO ]: CoverageRelationStatistics Valid=84, Invalid=1398, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:44:01,437 INFO ]: Start difference. First operand 64 states and 79 transitions. Second operand 39 states. [2018-06-22 01:44:02,290 WARN ]: Spent 278.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2018-06-22 01:44:03,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:03,543 INFO ]: Finished difference Result 86 states and 106 transitions. [2018-06-22 01:44:03,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:44:03,543 INFO ]: Start accepts. Automaton has 39 states. Word has length 70 [2018-06-22 01:44:03,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:03,544 INFO ]: With dead ends: 86 [2018-06-22 01:44:03,544 INFO ]: Without dead ends: 86 [2018-06-22 01:44:03,545 INFO ]: 0 DeclaredPredicates, 129 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=357, Invalid=4065, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 01:44:03,545 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 01:44:03,549 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-06-22 01:44:03,549 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 01:44:03,550 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2018-06-22 01:44:03,550 INFO ]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 70 [2018-06-22 01:44:03,550 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:03,550 INFO ]: Abstraction has 72 states and 90 transitions. [2018-06-22 01:44:03,550 INFO ]: Interpolant automaton has 39 states. [2018-06-22 01:44:03,550 INFO ]: Start isEmpty. Operand 72 states and 90 transitions. [2018-06-22 01:44:03,551 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-22 01:44:03,551 INFO ]: Found error trace [2018-06-22 01:44:03,551 INFO ]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:03,551 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:03,551 INFO ]: Analyzing trace with hash -1366697888, now seen corresponding path program 17 times [2018-06-22 01:44:03,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:03,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:03,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:03,553 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:03,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:03,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:03,838 INFO ]: Checked inductivity of 212 backedges. 29 proven. 102 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 01:44:03,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:03,838 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:03,845 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:44:03,890 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 01:44:03,890 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:03,893 INFO ]: Computing forward predicates... [2018-06-22 01:44:04,014 INFO ]: Checked inductivity of 212 backedges. 42 proven. 78 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-22 01:44:04,123 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:04,123 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2018-06-22 01:44:04,123 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:44:04,123 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:44:04,123 INFO ]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:44:04,123 INFO ]: Start difference. First operand 72 states and 90 transitions. Second operand 24 states. [2018-06-22 01:44:05,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:05,139 INFO ]: Finished difference Result 88 states and 108 transitions. [2018-06-22 01:44:05,142 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:44:05,142 INFO ]: Start accepts. Automaton has 24 states. Word has length 71 [2018-06-22 01:44:05,142 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:05,143 INFO ]: With dead ends: 88 [2018-06-22 01:44:05,143 INFO ]: Without dead ends: 70 [2018-06-22 01:44:05,143 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=430, Invalid=1732, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:44:05,143 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 01:44:05,147 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-06-22 01:44:05,147 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 01:44:05,147 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-06-22 01:44:05,147 INFO ]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 71 [2018-06-22 01:44:05,147 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:05,147 INFO ]: Abstraction has 68 states and 84 transitions. [2018-06-22 01:44:05,147 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:44:05,148 INFO ]: Start isEmpty. Operand 68 states and 84 transitions. [2018-06-22 01:44:05,148 INFO ]: Finished isEmpty. Found accepting run of length 79 [2018-06-22 01:44:05,148 INFO ]: Found error trace [2018-06-22 01:44:05,148 INFO ]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:05,149 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:05,152 INFO ]: Analyzing trace with hash 1997333680, now seen corresponding path program 18 times [2018-06-22 01:44:05,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:05,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:05,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:05,153 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:05,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:05,168 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:05,375 INFO ]: Checked inductivity of 263 backedges. 121 proven. 34 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-06-22 01:44:05,375 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:05,375 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:05,382 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:44:05,429 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 01:44:05,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:05,432 INFO ]: Computing forward predicates... [2018-06-22 01:44:05,544 INFO ]: Checked inductivity of 263 backedges. 121 proven. 21 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 01:44:05,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:05,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2018-06-22 01:44:05,563 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:44:05,563 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:44:05,563 INFO ]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:44:05,563 INFO ]: Start difference. First operand 68 states and 84 transitions. Second operand 24 states. [2018-06-22 01:44:05,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:05,930 INFO ]: Finished difference Result 72 states and 90 transitions. [2018-06-22 01:44:05,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:44:05,930 INFO ]: Start accepts. Automaton has 24 states. Word has length 78 [2018-06-22 01:44:05,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:05,931 INFO ]: With dead ends: 72 [2018-06-22 01:44:05,931 INFO ]: Without dead ends: 72 [2018-06-22 01:44:05,932 INFO ]: 0 DeclaredPredicates, 135 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=448, Invalid=1904, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:44:05,932 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 01:44:05,939 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-06-22 01:44:05,939 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:44:05,940 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-06-22 01:44:05,940 INFO ]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 78 [2018-06-22 01:44:05,940 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:05,940 INFO ]: Abstraction has 70 states and 86 transitions. [2018-06-22 01:44:05,940 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:44:05,940 INFO ]: Start isEmpty. Operand 70 states and 86 transitions. [2018-06-22 01:44:05,941 INFO ]: Finished isEmpty. Found accepting run of length 80 [2018-06-22 01:44:05,941 INFO ]: Found error trace [2018-06-22 01:44:05,941 INFO ]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:05,941 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:05,941 INFO ]: Analyzing trace with hash 1788239493, now seen corresponding path program 19 times [2018-06-22 01:44:05,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:05,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:05,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:05,942 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:05,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:05,959 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:06,406 WARN ]: Spent 152.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-06-22 01:44:06,713 INFO ]: Checked inductivity of 270 backedges. 16 proven. 146 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-06-22 01:44:06,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:06,713 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:06,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:44:06,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:06,794 INFO ]: Computing forward predicates... [2018-06-22 01:44:07,284 INFO ]: Checked inductivity of 270 backedges. 16 proven. 133 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 01:44:07,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:07,347 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 43 [2018-06-22 01:44:07,347 INFO ]: Interpolant automaton has 43 states [2018-06-22 01:44:07,347 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 01:44:07,347 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1713, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:44:07,347 INFO ]: Start difference. First operand 70 states and 86 transitions. Second operand 43 states. [2018-06-22 01:44:08,107 WARN ]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:44:09,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:09,638 INFO ]: Finished difference Result 94 states and 115 transitions. [2018-06-22 01:44:09,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:44:09,638 INFO ]: Start accepts. Automaton has 43 states. Word has length 79 [2018-06-22 01:44:09,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:09,639 INFO ]: With dead ends: 94 [2018-06-22 01:44:09,639 INFO ]: Without dead ends: 94 [2018-06-22 01:44:09,640 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=400, Invalid=5002, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 01:44:09,640 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 01:44:09,643 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 78. [2018-06-22 01:44:09,643 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 01:44:09,644 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2018-06-22 01:44:09,644 INFO ]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 79 [2018-06-22 01:44:09,644 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:09,644 INFO ]: Abstraction has 78 states and 97 transitions. [2018-06-22 01:44:09,644 INFO ]: Interpolant automaton has 43 states. [2018-06-22 01:44:09,644 INFO ]: Start isEmpty. Operand 78 states and 97 transitions. [2018-06-22 01:44:09,645 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-22 01:44:09,645 INFO ]: Found error trace [2018-06-22 01:44:09,645 INFO ]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:09,645 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:09,645 INFO ]: Analyzing trace with hash -398713008, now seen corresponding path program 20 times [2018-06-22 01:44:09,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:09,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:09,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:09,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:44:09,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:09,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:09,870 INFO ]: Checked inductivity of 278 backedges. 37 proven. 133 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-06-22 01:44:09,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:09,870 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:09,875 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:44:09,954 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:44:09,954 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:09,958 INFO ]: Computing forward predicates... [2018-06-22 01:44:10,018 INFO ]: Checked inductivity of 278 backedges. 52 proven. 105 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 01:44:10,037 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:10,037 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 26 [2018-06-22 01:44:10,037 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:44:10,037 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:44:10,038 INFO ]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:44:10,038 INFO ]: Start difference. First operand 78 states and 97 transitions. Second operand 26 states. [2018-06-22 01:44:10,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:10,727 INFO ]: Finished difference Result 96 states and 117 transitions. [2018-06-22 01:44:10,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:44:10,727 INFO ]: Start accepts. Automaton has 26 states. Word has length 80 [2018-06-22 01:44:10,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:10,728 INFO ]: With dead ends: 96 [2018-06-22 01:44:10,728 INFO ]: Without dead ends: 76 [2018-06-22 01:44:10,729 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=531, Invalid=2121, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:44:10,729 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 01:44:10,738 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-06-22 01:44:10,738 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 01:44:10,738 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-06-22 01:44:10,738 INFO ]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 80 [2018-06-22 01:44:10,738 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:10,738 INFO ]: Abstraction has 74 states and 91 transitions. [2018-06-22 01:44:10,738 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:44:10,739 INFO ]: Start isEmpty. Operand 74 states and 91 transitions. [2018-06-22 01:44:10,739 INFO ]: Finished isEmpty. Found accepting run of length 88 [2018-06-22 01:44:10,739 INFO ]: Found error trace [2018-06-22 01:44:10,739 INFO ]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:10,740 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:10,740 INFO ]: Analyzing trace with hash 1185432874, now seen corresponding path program 21 times [2018-06-22 01:44:10,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:10,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:10,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:10,741 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:10,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:10,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:11,597 INFO ]: Checked inductivity of 336 backedges. 154 proven. 43 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-22 01:44:11,598 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:11,598 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:11,604 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:44:11,670 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 01:44:11,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:11,673 INFO ]: Computing forward predicates... [2018-06-22 01:44:11,762 INFO ]: Checked inductivity of 336 backedges. 154 proven. 28 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-06-22 01:44:11,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:11,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 26 [2018-06-22 01:44:11,782 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:44:11,782 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:44:11,783 INFO ]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:44:11,783 INFO ]: Start difference. First operand 74 states and 91 transitions. Second operand 26 states. [2018-06-22 01:44:12,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:12,160 INFO ]: Finished difference Result 78 states and 97 transitions. [2018-06-22 01:44:12,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:44:12,160 INFO ]: Start accepts. Automaton has 26 states. Word has length 87 [2018-06-22 01:44:12,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:12,161 INFO ]: With dead ends: 78 [2018-06-22 01:44:12,161 INFO ]: Without dead ends: 78 [2018-06-22 01:44:12,161 INFO ]: 0 DeclaredPredicates, 151 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=543, Invalid=2319, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:44:12,162 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 01:44:12,164 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-06-22 01:44:12,164 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 01:44:12,165 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-06-22 01:44:12,165 INFO ]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 87 [2018-06-22 01:44:12,165 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:12,165 INFO ]: Abstraction has 76 states and 93 transitions. [2018-06-22 01:44:12,165 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:44:12,165 INFO ]: Start isEmpty. Operand 76 states and 93 transitions. [2018-06-22 01:44:12,166 INFO ]: Finished isEmpty. Found accepting run of length 89 [2018-06-22 01:44:12,166 INFO ]: Found error trace [2018-06-22 01:44:12,166 INFO ]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:12,166 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:12,166 INFO ]: Analyzing trace with hash -1905849013, now seen corresponding path program 22 times [2018-06-22 01:44:12,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:12,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:12,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:12,167 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:12,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:12,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:12,796 WARN ]: Spent 302.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-06-22 01:44:13,098 INFO ]: Checked inductivity of 344 backedges. 18 proven. 187 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-22 01:44:13,098 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:13,098 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:13,103 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:44:13,168 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:44:13,168 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:13,174 INFO ]: Computing forward predicates... [2018-06-22 01:44:13,740 INFO ]: Checked inductivity of 344 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-06-22 01:44:13,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:13,761 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 47 [2018-06-22 01:44:13,761 INFO ]: Interpolant automaton has 47 states [2018-06-22 01:44:13,761 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-22 01:44:13,761 INFO ]: CoverageRelationStatistics Valid=102, Invalid=2060, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:44:13,761 INFO ]: Start difference. First operand 76 states and 93 transitions. Second operand 47 states. [2018-06-22 01:44:15,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:15,864 INFO ]: Finished difference Result 102 states and 124 transitions. [2018-06-22 01:44:15,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-22 01:44:15,864 INFO ]: Start accepts. Automaton has 47 states. Word has length 88 [2018-06-22 01:44:15,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:15,865 INFO ]: With dead ends: 102 [2018-06-22 01:44:15,865 INFO ]: Without dead ends: 102 [2018-06-22 01:44:15,867 INFO ]: 0 DeclaredPredicates, 161 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=443, Invalid=6037, Unknown=0, NotChecked=0, Total=6480 [2018-06-22 01:44:15,867 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 01:44:15,871 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-06-22 01:44:15,871 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 01:44:15,871 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-06-22 01:44:15,871 INFO ]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 88 [2018-06-22 01:44:15,872 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:15,872 INFO ]: Abstraction has 84 states and 104 transitions. [2018-06-22 01:44:15,872 INFO ]: Interpolant automaton has 47 states. [2018-06-22 01:44:15,872 INFO ]: Start isEmpty. Operand 84 states and 104 transitions. [2018-06-22 01:44:15,872 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 01:44:15,873 INFO ]: Found error trace [2018-06-22 01:44:15,873 INFO ]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:15,873 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:15,873 INFO ]: Analyzing trace with hash 1048660298, now seen corresponding path program 23 times [2018-06-22 01:44:15,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:15,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:15,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:15,873 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:15,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:15,890 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:16,385 INFO ]: Checked inductivity of 353 backedges. 46 proven. 168 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-22 01:44:16,385 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:16,385 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:16,390 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:44:16,451 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 01:44:16,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:16,456 INFO ]: Computing forward predicates... [2018-06-22 01:44:16,504 INFO ]: Checked inductivity of 353 backedges. 63 proven. 136 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-06-22 01:44:16,524 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:16,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 28 [2018-06-22 01:44:16,524 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:44:16,524 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:44:16,524 INFO ]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:44:16,524 INFO ]: Start difference. First operand 84 states and 104 transitions. Second operand 28 states. [2018-06-22 01:44:16,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:16,884 INFO ]: Finished difference Result 104 states and 126 transitions. [2018-06-22 01:44:16,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:44:16,884 INFO ]: Start accepts. Automaton has 28 states. Word has length 89 [2018-06-22 01:44:16,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:16,885 INFO ]: With dead ends: 104 [2018-06-22 01:44:16,885 INFO ]: Without dead ends: 82 [2018-06-22 01:44:16,885 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=643, Invalid=2549, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 01:44:16,885 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 01:44:16,888 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-06-22 01:44:16,888 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 01:44:16,889 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2018-06-22 01:44:16,893 INFO ]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 89 [2018-06-22 01:44:16,893 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:16,893 INFO ]: Abstraction has 80 states and 98 transitions. [2018-06-22 01:44:16,893 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:44:16,893 INFO ]: Start isEmpty. Operand 80 states and 98 transitions. [2018-06-22 01:44:16,894 INFO ]: Finished isEmpty. Found accepting run of length 97 [2018-06-22 01:44:16,894 INFO ]: Found error trace [2018-06-22 01:44:16,894 INFO ]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:16,894 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:16,894 INFO ]: Analyzing trace with hash -887100730, now seen corresponding path program 24 times [2018-06-22 01:44:16,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:16,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:16,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:16,895 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:16,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:16,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:17,494 INFO ]: Checked inductivity of 418 backedges. 191 proven. 53 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-06-22 01:44:17,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:17,494 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:17,500 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:44:17,560 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-22 01:44:17,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:17,563 INFO ]: Computing forward predicates... [2018-06-22 01:44:17,623 INFO ]: Checked inductivity of 418 backedges. 191 proven. 36 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-22 01:44:17,643 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:17,643 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 28 [2018-06-22 01:44:17,643 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:44:17,643 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:44:17,643 INFO ]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:44:17,643 INFO ]: Start difference. First operand 80 states and 98 transitions. Second operand 28 states. [2018-06-22 01:44:18,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:18,091 INFO ]: Finished difference Result 84 states and 104 transitions. [2018-06-22 01:44:18,091 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-22 01:44:18,091 INFO ]: Start accepts. Automaton has 28 states. Word has length 96 [2018-06-22 01:44:18,091 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:18,092 INFO ]: With dead ends: 84 [2018-06-22 01:44:18,092 INFO ]: Without dead ends: 84 [2018-06-22 01:44:18,092 INFO ]: 0 DeclaredPredicates, 167 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=647, Invalid=2775, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:44:18,092 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 01:44:18,097 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-06-22 01:44:18,097 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 01:44:18,098 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2018-06-22 01:44:18,098 INFO ]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 96 [2018-06-22 01:44:18,098 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:18,098 INFO ]: Abstraction has 82 states and 100 transitions. [2018-06-22 01:44:18,098 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:44:18,098 INFO ]: Start isEmpty. Operand 82 states and 100 transitions. [2018-06-22 01:44:18,098 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 01:44:18,098 INFO ]: Found error trace [2018-06-22 01:44:18,098 INFO ]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:18,099 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:18,099 INFO ]: Analyzing trace with hash -1729881297, now seen corresponding path program 25 times [2018-06-22 01:44:18,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:18,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:18,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:18,099 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:18,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:18,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:18,849 INFO ]: Checked inductivity of 427 backedges. 20 proven. 233 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-06-22 01:44:18,849 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:18,849 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:18,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:44:18,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:18,913 INFO ]: Computing forward predicates... [2018-06-22 01:44:19,634 INFO ]: Checked inductivity of 427 backedges. 20 proven. 216 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-22 01:44:19,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:19,654 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2018-06-22 01:44:19,654 INFO ]: Interpolant automaton has 51 states [2018-06-22 01:44:19,654 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 01:44:19,654 INFO ]: CoverageRelationStatistics Valid=111, Invalid=2439, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 01:44:19,655 INFO ]: Start difference. First operand 82 states and 100 transitions. Second operand 51 states. [2018-06-22 01:44:20,664 WARN ]: Spent 461.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2018-06-22 01:44:22,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:22,153 INFO ]: Finished difference Result 110 states and 133 transitions. [2018-06-22 01:44:22,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 01:44:22,153 INFO ]: Start accepts. Automaton has 51 states. Word has length 97 [2018-06-22 01:44:22,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:22,154 INFO ]: With dead ends: 110 [2018-06-22 01:44:22,154 INFO ]: Without dead ends: 110 [2018-06-22 01:44:22,155 INFO ]: 0 DeclaredPredicates, 177 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=486, Invalid=7170, Unknown=0, NotChecked=0, Total=7656 [2018-06-22 01:44:22,155 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 01:44:22,159 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 90. [2018-06-22 01:44:22,171 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-22 01:44:22,172 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2018-06-22 01:44:22,172 INFO ]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 97 [2018-06-22 01:44:22,172 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:22,172 INFO ]: Abstraction has 90 states and 111 transitions. [2018-06-22 01:44:22,172 INFO ]: Interpolant automaton has 51 states. [2018-06-22 01:44:22,172 INFO ]: Start isEmpty. Operand 90 states and 111 transitions. [2018-06-22 01:44:22,173 INFO ]: Finished isEmpty. Found accepting run of length 99 [2018-06-22 01:44:22,173 INFO ]: Found error trace [2018-06-22 01:44:22,173 INFO ]: trace histogram [11, 11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:22,173 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:22,173 INFO ]: Analyzing trace with hash -2086275098, now seen corresponding path program 26 times [2018-06-22 01:44:22,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:22,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:22,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:22,174 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:44:22,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:22,189 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:22,597 INFO ]: Checked inductivity of 437 backedges. 56 proven. 207 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-06-22 01:44:22,597 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:22,597 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:22,603 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:44:22,665 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:44:22,665 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:22,669 INFO ]: Computing forward predicates... [2018-06-22 01:44:22,760 INFO ]: Checked inductivity of 437 backedges. 75 proven. 171 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-22 01:44:22,779 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:22,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 30 [2018-06-22 01:44:22,782 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:44:22,782 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:44:22,783 INFO ]: CoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:44:22,783 INFO ]: Start difference. First operand 90 states and 111 transitions. Second operand 30 states. [2018-06-22 01:44:23,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:23,321 INFO ]: Finished difference Result 112 states and 135 transitions. [2018-06-22 01:44:23,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 01:44:23,321 INFO ]: Start accepts. Automaton has 30 states. Word has length 98 [2018-06-22 01:44:23,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:23,321 INFO ]: With dead ends: 112 [2018-06-22 01:44:23,321 INFO ]: Without dead ends: 88 [2018-06-22 01:44:23,322 INFO ]: 0 DeclaredPredicates, 172 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=766, Invalid=3016, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 01:44:23,322 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 01:44:23,324 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-06-22 01:44:23,324 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 01:44:23,325 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2018-06-22 01:44:23,325 INFO ]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 98 [2018-06-22 01:44:23,325 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:23,325 INFO ]: Abstraction has 86 states and 105 transitions. [2018-06-22 01:44:23,325 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:44:23,325 INFO ]: Start isEmpty. Operand 86 states and 105 transitions. [2018-06-22 01:44:23,326 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 01:44:23,326 INFO ]: Found error trace [2018-06-22 01:44:23,326 INFO ]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:23,326 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:23,326 INFO ]: Analyzing trace with hash -501764716, now seen corresponding path program 27 times [2018-06-22 01:44:23,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:23,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:23,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:23,326 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:23,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:23,344 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:23,848 INFO ]: Checked inductivity of 509 backedges. 232 proven. 64 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-06-22 01:44:23,848 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:23,849 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:23,854 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:44:23,922 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-22 01:44:23,922 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:23,926 INFO ]: Computing forward predicates... [2018-06-22 01:44:23,992 INFO ]: Checked inductivity of 509 backedges. 232 proven. 45 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-06-22 01:44:24,012 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:24,012 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 30 [2018-06-22 01:44:24,013 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:44:24,013 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:44:24,013 INFO ]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:44:24,013 INFO ]: Start difference. First operand 86 states and 105 transitions. Second operand 30 states. [2018-06-22 01:44:24,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:24,499 INFO ]: Finished difference Result 90 states and 111 transitions. [2018-06-22 01:44:24,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 01:44:24,500 INFO ]: Start accepts. Automaton has 30 states. Word has length 105 [2018-06-22 01:44:24,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:24,500 INFO ]: With dead ends: 90 [2018-06-22 01:44:24,500 INFO ]: Without dead ends: 90 [2018-06-22 01:44:24,501 INFO ]: 0 DeclaredPredicates, 183 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=760, Invalid=3272, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:44:24,501 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 01:44:24,506 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-06-22 01:44:24,506 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 01:44:24,506 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2018-06-22 01:44:24,506 INFO ]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 105 [2018-06-22 01:44:24,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:24,507 INFO ]: Abstraction has 88 states and 107 transitions. [2018-06-22 01:44:24,507 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:44:24,507 INFO ]: Start isEmpty. Operand 88 states and 107 transitions. [2018-06-22 01:44:24,507 INFO ]: Finished isEmpty. Found accepting run of length 107 [2018-06-22 01:44:24,507 INFO ]: Found error trace [2018-06-22 01:44:24,507 INFO ]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:24,507 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:24,508 INFO ]: Analyzing trace with hash 1625600545, now seen corresponding path program 28 times [2018-06-22 01:44:24,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:24,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:24,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:24,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:24,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:24,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:25,250 INFO ]: Checked inductivity of 519 backedges. 22 proven. 284 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-06-22 01:44:25,250 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:25,250 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:25,256 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:44:25,336 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:44:25,336 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:25,341 INFO ]: Computing forward predicates... [2018-06-22 01:44:26,091 INFO ]: Checked inductivity of 519 backedges. 22 proven. 265 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-06-22 01:44:26,111 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:26,111 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2018-06-22 01:44:26,111 INFO ]: Interpolant automaton has 55 states [2018-06-22 01:44:26,111 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-22 01:44:26,112 INFO ]: CoverageRelationStatistics Valid=120, Invalid=2850, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:44:26,112 INFO ]: Start difference. First operand 88 states and 107 transitions. Second operand 55 states. [2018-06-22 01:44:28,544 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:28,544 INFO ]: Finished difference Result 118 states and 142 transitions. [2018-06-22 01:44:28,544 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 01:44:28,544 INFO ]: Start accepts. Automaton has 55 states. Word has length 106 [2018-06-22 01:44:28,544 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:28,545 INFO ]: With dead ends: 118 [2018-06-22 01:44:28,545 INFO ]: Without dead ends: 118 [2018-06-22 01:44:28,546 INFO ]: 0 DeclaredPredicates, 193 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=529, Invalid=8401, Unknown=0, NotChecked=0, Total=8930 [2018-06-22 01:44:28,546 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 01:44:28,554 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 96. [2018-06-22 01:44:28,554 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 01:44:28,554 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2018-06-22 01:44:28,593 INFO ]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 106 [2018-06-22 01:44:28,593 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:28,593 INFO ]: Abstraction has 96 states and 118 transitions. [2018-06-22 01:44:28,593 INFO ]: Interpolant automaton has 55 states. [2018-06-22 01:44:28,593 INFO ]: Start isEmpty. Operand 96 states and 118 transitions. [2018-06-22 01:44:28,594 INFO ]: Finished isEmpty. Found accepting run of length 108 [2018-06-22 01:44:28,594 INFO ]: Found error trace [2018-06-22 01:44:28,594 INFO ]: trace histogram [12, 12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:28,594 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:28,594 INFO ]: Analyzing trace with hash -1145553100, now seen corresponding path program 29 times [2018-06-22 01:44:28,594 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:28,594 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:28,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:28,594 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:28,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:28,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:29,042 INFO ]: Checked inductivity of 530 backedges. 67 proven. 250 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-06-22 01:44:29,042 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:29,042 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-22 01:44:29,052 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:44:29,128 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 01:44:29,128 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:29,133 INFO ]: Computing forward predicates... [2018-06-22 01:44:29,244 INFO ]: Checked inductivity of 530 backedges. 88 proven. 210 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-06-22 01:44:29,266 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:29,266 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 32 [2018-06-22 01:44:29,266 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:44:29,266 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:44:29,266 INFO ]: CoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:44:29,267 INFO ]: Start difference. First operand 96 states and 118 transitions. Second operand 32 states. [2018-06-22 01:44:29,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:29,758 INFO ]: Finished difference Result 120 states and 144 transitions. [2018-06-22 01:44:29,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 01:44:29,758 INFO ]: Start accepts. Automaton has 32 states. Word has length 107 [2018-06-22 01:44:29,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:29,759 INFO ]: With dead ends: 120 [2018-06-22 01:44:29,759 INFO ]: Without dead ends: 94 [2018-06-22 01:44:29,759 INFO ]: 0 DeclaredPredicates, 188 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=900, Invalid=3522, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 01:44:29,760 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 01:44:29,763 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-06-22 01:44:29,763 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 01:44:29,764 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2018-06-22 01:44:29,764 INFO ]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 107 [2018-06-22 01:44:29,764 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:29,764 INFO ]: Abstraction has 92 states and 112 transitions. [2018-06-22 01:44:29,764 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:44:29,764 INFO ]: Start isEmpty. Operand 92 states and 112 transitions. [2018-06-22 01:44:29,765 INFO ]: Finished isEmpty. Found accepting run of length 115 [2018-06-22 01:44:29,765 INFO ]: Found error trace [2018-06-22 01:44:29,765 INFO ]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:29,765 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:29,765 INFO ]: Analyzing trace with hash 557972444, now seen corresponding path program 30 times [2018-06-22 01:44:29,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:29,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:29,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:29,766 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:29,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:29,788 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:30,207 INFO ]: Checked inductivity of 609 backedges. 277 proven. 76 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-06-22 01:44:30,207 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:30,207 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:30,214 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:44:30,293 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-22 01:44:30,293 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:30,303 INFO ]: Computing forward predicates... [2018-06-22 01:44:31,055 INFO ]: Checked inductivity of 609 backedges. 277 proven. 55 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-06-22 01:44:31,075 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:31,075 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 32 [2018-06-22 01:44:31,076 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:44:31,076 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:44:31,076 INFO ]: CoverageRelationStatistics Valid=205, Invalid=787, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:44:31,076 INFO ]: Start difference. First operand 92 states and 112 transitions. Second operand 32 states. [2018-06-22 01:44:31,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:31,649 INFO ]: Finished difference Result 96 states and 118 transitions. [2018-06-22 01:44:31,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 01:44:31,649 INFO ]: Start accepts. Automaton has 32 states. Word has length 114 [2018-06-22 01:44:31,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:31,650 INFO ]: With dead ends: 96 [2018-06-22 01:44:31,650 INFO ]: Without dead ends: 96 [2018-06-22 01:44:31,651 INFO ]: 0 DeclaredPredicates, 199 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=882, Invalid=3810, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 01:44:31,651 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 01:44:31,655 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-06-22 01:44:31,655 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 01:44:31,656 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-06-22 01:44:31,656 INFO ]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 114 [2018-06-22 01:44:31,656 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:31,656 INFO ]: Abstraction has 94 states and 114 transitions. [2018-06-22 01:44:31,657 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:44:31,657 INFO ]: Start isEmpty. Operand 94 states and 114 transitions. [2018-06-22 01:44:31,658 INFO ]: Finished isEmpty. Found accepting run of length 116 [2018-06-22 01:44:31,658 INFO ]: Found error trace [2018-06-22 01:44:31,658 INFO ]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:31,658 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:31,658 INFO ]: Analyzing trace with hash 117714137, now seen corresponding path program 31 times [2018-06-22 01:44:31,658 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:31,658 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:31,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:31,659 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:31,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:31,679 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:32,305 INFO ]: Checked inductivity of 620 backedges. 24 proven. 340 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-06-22 01:44:32,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:32,305 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:32,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:44:32,382 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:32,389 INFO ]: Computing forward predicates... [2018-06-22 01:44:33,267 INFO ]: Checked inductivity of 620 backedges. 24 proven. 319 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-06-22 01:44:33,286 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:33,287 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 59 [2018-06-22 01:44:33,287 INFO ]: Interpolant automaton has 59 states [2018-06-22 01:44:33,287 INFO ]: Constructing interpolant automaton starting with 59 interpolants. [2018-06-22 01:44:33,287 INFO ]: CoverageRelationStatistics Valid=129, Invalid=3293, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 01:44:33,287 INFO ]: Start difference. First operand 94 states and 114 transitions. Second operand 59 states. [2018-06-22 01:44:36,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:36,213 INFO ]: Finished difference Result 126 states and 151 transitions. [2018-06-22 01:44:36,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-22 01:44:36,213 INFO ]: Start accepts. Automaton has 59 states. Word has length 115 [2018-06-22 01:44:36,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:36,214 INFO ]: With dead ends: 126 [2018-06-22 01:44:36,214 INFO ]: Without dead ends: 126 [2018-06-22 01:44:36,215 INFO ]: 0 DeclaredPredicates, 209 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=572, Invalid=9730, Unknown=0, NotChecked=0, Total=10302 [2018-06-22 01:44:36,215 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-22 01:44:36,219 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 102. [2018-06-22 01:44:36,219 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 01:44:36,220 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2018-06-22 01:44:36,220 INFO ]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 115 [2018-06-22 01:44:36,221 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:36,221 INFO ]: Abstraction has 102 states and 125 transitions. [2018-06-22 01:44:36,221 INFO ]: Interpolant automaton has 59 states. [2018-06-22 01:44:36,221 INFO ]: Start isEmpty. Operand 102 states and 125 transitions. [2018-06-22 01:44:36,222 INFO ]: Finished isEmpty. Found accepting run of length 117 [2018-06-22 01:44:36,222 INFO ]: Found error trace [2018-06-22 01:44:36,222 INFO ]: trace histogram [13, 13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:36,222 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:36,222 INFO ]: Analyzing trace with hash -645391492, now seen corresponding path program 32 times [2018-06-22 01:44:36,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:36,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:36,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:36,223 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:44:36,223 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:36,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:36,801 INFO ]: Checked inductivity of 632 backedges. 79 proven. 297 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-06-22 01:44:36,802 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:36,802 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:36,807 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:44:36,872 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:44:36,921 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:36,924 INFO ]: Computing forward predicates... [2018-06-22 01:44:36,997 INFO ]: Checked inductivity of 632 backedges. 102 proven. 253 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-06-22 01:44:37,017 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:44:37,017 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 34 [2018-06-22 01:44:37,017 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:44:37,017 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:44:37,017 INFO ]: CoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:44:37,017 INFO ]: Start difference. First operand 102 states and 125 transitions. Second operand 34 states. [2018-06-22 01:44:37,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:44:37,614 INFO ]: Finished difference Result 128 states and 153 transitions. [2018-06-22 01:44:37,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 01:44:37,614 INFO ]: Start accepts. Automaton has 34 states. Word has length 116 [2018-06-22 01:44:37,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:44:37,616 INFO ]: With dead ends: 128 [2018-06-22 01:44:37,616 INFO ]: Without dead ends: 100 [2018-06-22 01:44:37,616 INFO ]: 0 DeclaredPredicates, 204 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1045, Invalid=4067, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 01:44:37,616 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 01:44:37,620 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-06-22 01:44:37,620 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 01:44:37,621 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-06-22 01:44:37,621 INFO ]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 116 [2018-06-22 01:44:37,621 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:44:37,621 INFO ]: Abstraction has 98 states and 119 transitions. [2018-06-22 01:44:37,621 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:44:37,621 INFO ]: Start isEmpty. Operand 98 states and 119 transitions. [2018-06-22 01:44:37,622 INFO ]: Finished isEmpty. Found accepting run of length 124 [2018-06-22 01:44:37,622 INFO ]: Found error trace [2018-06-22 01:44:37,622 INFO ]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:44:37,622 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:44:37,622 INFO ]: Analyzing trace with hash 984890110, now seen corresponding path program 33 times [2018-06-22 01:44:37,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:44:37,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:44:37,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:37,625 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:44:37,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:44:37,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:38,781 INFO ]: Checked inductivity of 718 backedges. 326 proven. 89 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-06-22 01:44:38,781 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:44:38,781 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:44:38,787 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:44:38,870 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-06-22 01:44:38,870 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:44:38,874 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 01:44:39,001 INFO ]: Timeout while computing interpolants [2018-06-22 01:44:39,201 WARN ]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:44:39,201 WARN ]: Verification canceled [2018-06-22 01:44:39,206 WARN ]: Timeout [2018-06-22 01:44:39,207 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:44:39 BoogieIcfgContainer [2018-06-22 01:44:39,207 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:44:39,207 INFO ]: Toolchain (without parser) took 62258.36 ms. Allocated memory was 305.1 MB in the beginning and 919.1 MB in the end (delta: 613.9 MB). Free memory was 260.7 MB in the beginning and 267.9 MB in the end (delta: -7.3 MB). Peak memory consumption was 606.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:44:39,208 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:44:39,208 INFO ]: ChcToBoogie took 159.80 ms. Allocated memory is still 305.1 MB. Free memory was 260.7 MB in the beginning and 257.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:44:39,209 INFO ]: Boogie Preprocessor took 43.03 ms. Allocated memory is still 305.1 MB. Free memory was 257.7 MB in the beginning and 256.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-22 01:44:39,211 INFO ]: RCFGBuilder took 416.79 ms. Allocated memory is still 305.1 MB. Free memory was 256.7 MB in the beginning and 246.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:44:39,211 INFO ]: TraceAbstraction took 61626.01 ms. Allocated memory was 305.1 MB in the beginning and 919.1 MB in the end (delta: 613.9 MB). Free memory was 246.7 MB in the beginning and 267.9 MB in the end (delta: -21.3 MB). Peak memory consumption was 592.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:44:39,214 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 159.80 ms. Allocated memory is still 305.1 MB. Free memory was 260.7 MB in the beginning and 257.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.03 ms. Allocated memory is still 305.1 MB. Free memory was 257.7 MB in the beginning and 256.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 416.79 ms. Allocated memory is still 305.1 MB. Free memory was 256.7 MB in the beginning and 246.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61626.01 ms. Allocated memory was 305.1 MB in the beginning and 919.1 MB in the end (delta: 613.9 MB). Free memory was 246.7 MB in the beginning and 267.9 MB in the end (delta: -21.3 MB). Peak memory consumption was 592.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 124 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. TIMEOUT Result, 61.5s OverallTime, 38 OverallIterations, 14 TraceHistogramMax, 31.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1100 SDtfs, 2046 SDslu, 16479 SDs, 0 SdLazy, 18265 SolverSat, 1815 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4111 GetRequests, 2428 SyntacticMatches, 0 SemanticMatches, 1683 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18202 ImplicationChecksByTransitivity, 41.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 200 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 4659 NumberOfCodeBlocks, 4659 NumberOfCodeBlocksAsserted, 186 NumberOfCheckSat, 4589 ConstructedInterpolants, 0 QuantifiedInterpolants, 1245081 SizeOfPredicates, 550 NumberOfNonLiveVariables, 12177 ConjunctsInSsa, 1661 ConjunctsInUnsatCore, 70 InterpolantComputations, 5 PerfectInterpolantSequences, 10693/16526 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_map2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-44-39-230.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_map2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-44-39-230.csv Completed graceful shutdown