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/eldarica-misc/LIA/reve/005-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:21:56,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:21:56,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:21:56,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:21:56,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:21:56,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:21:56,627 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:21:56,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:21:56,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:21:56,632 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:21:56,633 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:21:56,633 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:21:56,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:21:56,635 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:21:56,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:21:56,638 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:21:56,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:21:56,649 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:21:56,650 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:21:56,651 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:21:56,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:21:56,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:21:56,657 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:21:56,657 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:21:56,658 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:21:56,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:21:56,662 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:21:56,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:21:56,664 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:21:56,664 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:21:56,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:21:56,668 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:21:56,668 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:21:56,669 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:21:56,669 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:21:56,670 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:21:56,693 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:21:56,693 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:21:56,694 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:21:56,694 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:21:56,695 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:21:56,695 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:21:56,695 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:21:56,695 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:21:56,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:21:56,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:21:56,696 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:21:56,696 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:21:56,696 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:21:56,696 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:21:56,696 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:21:56,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:21:56,697 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:21:56,699 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:21:56,699 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:21:56,751 INFO ]: Repository-Root is: /tmp [2018-06-22 01:21:56,765 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:21:56,768 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:21:56,770 INFO ]: Initializing SmtParser... [2018-06-22 01:21:56,770 INFO ]: SmtParser initialized [2018-06-22 01:21:56,770 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/005-horn.smt2 [2018-06-22 01:21:56,771 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:21:56,856 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005-horn.smt2 unknown [2018-06-22 01:21:57,040 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005-horn.smt2 [2018-06-22 01:21:57,045 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:21:57,052 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:21:57,053 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:21:57,053 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:21:57,053 INFO ]: ChcToBoogie initialized [2018-06-22 01:21:57,059 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:21:57" (1/1) ... [2018-06-22 01:21:57,106 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:57 Unit [2018-06-22 01:21:57,106 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:21:57,107 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:21:57,107 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:21:57,107 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:21:57,127 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:57" (1/1) ... [2018-06-22 01:21:57,127 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:57" (1/1) ... [2018-06-22 01:21:57,135 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:57" (1/1) ... [2018-06-22 01:21:57,135 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:57" (1/1) ... [2018-06-22 01:21:57,140 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:57" (1/1) ... [2018-06-22 01:21:57,149 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:57" (1/1) ... [2018-06-22 01:21:57,151 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:57" (1/1) ... [2018-06-22 01:21:57,152 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:21:57,153 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:21:57,153 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:21:57,153 INFO ]: RCFGBuilder initialized [2018-06-22 01:21:57,159 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:57" (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:21:57,173 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:21:57,173 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:21:57,173 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:21:57,174 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:21:57,174 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:21:57,174 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:21:57,597 INFO ]: Using library mode [2018-06-22 01:21:57,598 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:21:57 BoogieIcfgContainer [2018-06-22 01:21:57,598 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:21:57,599 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:21:57,599 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:21:57,606 INFO ]: TraceAbstraction initialized [2018-06-22 01:21:57,606 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:21:57" (1/3) ... [2018-06-22 01:21:57,607 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dcc766b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:21:57, skipping insertion in model container [2018-06-22 01:21:57,607 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:21:57" (2/3) ... [2018-06-22 01:21:57,608 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dcc766b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:21:57, skipping insertion in model container [2018-06-22 01:21:57,608 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:21:57" (3/3) ... [2018-06-22 01:21:57,610 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:21:57,618 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:21:57,625 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:21:57,663 INFO ]: Using default assertion order modulation [2018-06-22 01:21:57,663 INFO ]: Interprodecural is true [2018-06-22 01:21:57,663 INFO ]: Hoare is false [2018-06-22 01:21:57,663 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:21:57,663 INFO ]: Backedges is TWOTRACK [2018-06-22 01:21:57,663 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:21:57,663 INFO ]: Difference is false [2018-06-22 01:21:57,663 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:21:57,663 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:21:57,677 INFO ]: Start isEmpty. Operand 21 states. [2018-06-22 01:21:57,687 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:21:57,687 INFO ]: Found error trace [2018-06-22 01:21:57,688 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:57,688 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:57,692 INFO ]: Analyzing trace with hash -997398658, now seen corresponding path program 1 times [2018-06-22 01:21:57,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:57,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:57,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:57,726 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:57,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:57,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:57,863 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:21:57,864 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:21:57,864 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:21:57,866 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:21:57,876 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:21:57,876 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:21:57,878 INFO ]: Start difference. First operand 21 states. Second operand 4 states. [2018-06-22 01:21:58,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:58,279 INFO ]: Finished difference Result 28 states and 44 transitions. [2018-06-22 01:21:58,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:21:58,280 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:21:58,280 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:58,291 INFO ]: With dead ends: 28 [2018-06-22 01:21:58,291 INFO ]: Without dead ends: 28 [2018-06-22 01:21:58,293 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:21:58,313 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:21:58,333 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 01:21:58,334 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:21:58,335 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 44 transitions. [2018-06-22 01:21:58,336 INFO ]: Start accepts. Automaton has 28 states and 44 transitions. Word has length 8 [2018-06-22 01:21:58,337 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:58,337 INFO ]: Abstraction has 28 states and 44 transitions. [2018-06-22 01:21:58,337 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:21:58,337 INFO ]: Start isEmpty. Operand 28 states and 44 transitions. [2018-06-22 01:21:58,339 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:21:58,339 INFO ]: Found error trace [2018-06-22 01:21:58,339 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:58,339 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:58,339 INFO ]: Analyzing trace with hash -976157675, now seen corresponding path program 1 times [2018-06-22 01:21:58,339 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:58,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:58,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:58,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:58,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:58,347 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:58,396 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:21:58,396 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:21:58,396 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:21:58,398 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:21:58,398 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:21:58,398 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:21:58,398 INFO ]: Start difference. First operand 28 states and 44 transitions. Second operand 4 states. [2018-06-22 01:21:58,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:58,508 INFO ]: Finished difference Result 37 states and 58 transitions. [2018-06-22 01:21:58,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:21:58,508 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:21:58,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:58,510 INFO ]: With dead ends: 37 [2018-06-22 01:21:58,510 INFO ]: Without dead ends: 37 [2018-06-22 01:21:58,511 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:21:58,511 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:21:58,518 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-22 01:21:58,518 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:21:58,521 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 58 transitions. [2018-06-22 01:21:58,521 INFO ]: Start accepts. Automaton has 37 states and 58 transitions. Word has length 8 [2018-06-22 01:21:58,521 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:58,521 INFO ]: Abstraction has 37 states and 58 transitions. [2018-06-22 01:21:58,522 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:21:58,522 INFO ]: Start isEmpty. Operand 37 states and 58 transitions. [2018-06-22 01:21:58,524 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:21:58,524 INFO ]: Found error trace [2018-06-22 01:21:58,525 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:58,525 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:58,525 INFO ]: Analyzing trace with hash 818431035, now seen corresponding path program 1 times [2018-06-22 01:21:58,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:58,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:58,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:58,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:58,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:58,574 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:58,736 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:21:58,736 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:21:58,736 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:21:58,737 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:21:58,737 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:21:58,737 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:21:58,737 INFO ]: Start difference. First operand 37 states and 58 transitions. Second operand 6 states. [2018-06-22 01:21:59,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:21:59,652 INFO ]: Finished difference Result 73 states and 160 transitions. [2018-06-22 01:21:59,654 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:21:59,654 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 01:21:59,654 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:21:59,659 INFO ]: With dead ends: 73 [2018-06-22 01:21:59,659 INFO ]: Without dead ends: 56 [2018-06-22 01:21:59,659 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:21:59,659 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:21:59,669 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 41. [2018-06-22 01:21:59,669 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:21:59,671 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 67 transitions. [2018-06-22 01:21:59,671 INFO ]: Start accepts. Automaton has 41 states and 67 transitions. Word has length 17 [2018-06-22 01:21:59,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:21:59,671 INFO ]: Abstraction has 41 states and 67 transitions. [2018-06-22 01:21:59,671 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:21:59,671 INFO ]: Start isEmpty. Operand 41 states and 67 transitions. [2018-06-22 01:21:59,673 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:21:59,673 INFO ]: Found error trace [2018-06-22 01:21:59,673 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:21:59,673 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:21:59,673 INFO ]: Analyzing trace with hash -1434262375, now seen corresponding path program 1 times [2018-06-22 01:21:59,673 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:21:59,673 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:21:59,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:59,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:59,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:21:59,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:59,788 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:21:59,788 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:21:59,788 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:21:59,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:21:59,835 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:21:59,844 INFO ]: Computing forward predicates... [2018-06-22 01:22:00,178 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:22:00,203 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:00,203 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 01:22:00,204 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:22:00,204 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:22:00,204 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:22:00,204 INFO ]: Start difference. First operand 41 states and 67 transitions. Second operand 11 states. [2018-06-22 01:22:00,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:00,706 INFO ]: Finished difference Result 53 states and 101 transitions. [2018-06-22 01:22:00,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:22:00,706 INFO ]: Start accepts. Automaton has 11 states. Word has length 18 [2018-06-22 01:22:00,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:00,708 INFO ]: With dead ends: 53 [2018-06-22 01:22:00,708 INFO ]: Without dead ends: 53 [2018-06-22 01:22:00,708 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:22:00,710 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:22:00,720 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 44. [2018-06-22 01:22:00,720 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:22:00,721 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2018-06-22 01:22:00,722 INFO ]: Start accepts. Automaton has 44 states and 79 transitions. Word has length 18 [2018-06-22 01:22:00,722 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:00,722 INFO ]: Abstraction has 44 states and 79 transitions. [2018-06-22 01:22:00,722 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:22:00,722 INFO ]: Start isEmpty. Operand 44 states and 79 transitions. [2018-06-22 01:22:00,724 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:22:00,724 INFO ]: Found error trace [2018-06-22 01:22:00,724 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:00,724 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:00,724 INFO ]: Analyzing trace with hash -521483358, now seen corresponding path program 1 times [2018-06-22 01:22:00,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:00,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:00,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:00,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:00,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:00,741 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:00,797 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:22:00,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:00,798 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:22:00,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:00,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:00,835 INFO ]: Computing forward predicates... [2018-06-22 01:22:00,940 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:22:00,959 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:00,959 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:22:00,959 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:22:00,959 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:22:00,959 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:22:00,960 INFO ]: Start difference. First operand 44 states and 79 transitions. Second operand 12 states. [2018-06-22 01:22:01,753 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:01,753 INFO ]: Finished difference Result 79 states and 182 transitions. [2018-06-22 01:22:01,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:22:01,754 INFO ]: Start accepts. Automaton has 12 states. Word has length 18 [2018-06-22 01:22:01,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:01,757 INFO ]: With dead ends: 79 [2018-06-22 01:22:01,757 INFO ]: Without dead ends: 79 [2018-06-22 01:22:01,758 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:22:01,758 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 01:22:01,775 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 49. [2018-06-22 01:22:01,775 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 01:22:01,776 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 91 transitions. [2018-06-22 01:22:01,776 INFO ]: Start accepts. Automaton has 49 states and 91 transitions. Word has length 18 [2018-06-22 01:22:01,776 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:01,776 INFO ]: Abstraction has 49 states and 91 transitions. [2018-06-22 01:22:01,776 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:22:01,776 INFO ]: Start isEmpty. Operand 49 states and 91 transitions. [2018-06-22 01:22:01,779 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:22:01,779 INFO ]: Found error trace [2018-06-22 01:22:01,779 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:01,779 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:01,779 INFO ]: Analyzing trace with hash -1659105694, now seen corresponding path program 1 times [2018-06-22 01:22:01,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:01,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:01,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:01,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:01,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:01,788 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:01,822 INFO ]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:22:01,822 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:22:01,822 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:22:01,822 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:22:01,822 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:22:01,823 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:22:01,823 INFO ]: Start difference. First operand 49 states and 91 transitions. Second operand 4 states. [2018-06-22 01:22:01,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:01,898 INFO ]: Finished difference Result 70 states and 140 transitions. [2018-06-22 01:22:01,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:22:01,898 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-22 01:22:01,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:01,899 INFO ]: With dead ends: 70 [2018-06-22 01:22:01,899 INFO ]: Without dead ends: 48 [2018-06-22 01:22:01,899 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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:22:01,900 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:22:01,905 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 01:22:01,905 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:22:01,906 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2018-06-22 01:22:01,906 INFO ]: Start accepts. Automaton has 48 states and 85 transitions. Word has length 18 [2018-06-22 01:22:01,906 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:01,906 INFO ]: Abstraction has 48 states and 85 transitions. [2018-06-22 01:22:01,906 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:22:01,906 INFO ]: Start isEmpty. Operand 48 states and 85 transitions. [2018-06-22 01:22:01,908 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:22:01,908 INFO ]: Found error trace [2018-06-22 01:22:01,908 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:01,908 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:01,908 INFO ]: Analyzing trace with hash 645708202, now seen corresponding path program 1 times [2018-06-22 01:22:01,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:01,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:01,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:01,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:01,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:01,936 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:02,050 INFO ]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:22:02,050 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:02,078 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:22:02,091 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:02,119 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:02,122 INFO ]: Computing forward predicates... [2018-06-22 01:22:02,191 INFO ]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:22:02,223 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:02,223 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 01:22:02,223 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:22:02,223 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:22:02,223 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:22:02,224 INFO ]: Start difference. First operand 48 states and 85 transitions. Second operand 13 states. [2018-06-22 01:22:02,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:02,614 INFO ]: Finished difference Result 65 states and 130 transitions. [2018-06-22 01:22:02,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:22:02,614 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 01:22:02,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:02,616 INFO ]: With dead ends: 65 [2018-06-22 01:22:02,616 INFO ]: Without dead ends: 65 [2018-06-22 01:22:02,616 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:22:02,620 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 01:22:02,635 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 52. [2018-06-22 01:22:02,635 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 01:22:02,636 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 94 transitions. [2018-06-22 01:22:02,636 INFO ]: Start accepts. Automaton has 52 states and 94 transitions. Word has length 25 [2018-06-22 01:22:02,636 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:02,636 INFO ]: Abstraction has 52 states and 94 transitions. [2018-06-22 01:22:02,636 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:22:02,636 INFO ]: Start isEmpty. Operand 52 states and 94 transitions. [2018-06-22 01:22:02,638 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:22:02,638 INFO ]: Found error trace [2018-06-22 01:22:02,638 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:02,638 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:02,638 INFO ]: Analyzing trace with hash 489704866, now seen corresponding path program 1 times [2018-06-22 01:22:02,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:02,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:02,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:02,639 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:02,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:02,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:02,725 INFO ]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:22:02,725 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:22:02,725 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:22:02,725 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:22:02,725 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:22:02,725 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:22:02,725 INFO ]: Start difference. First operand 52 states and 94 transitions. Second operand 6 states. [2018-06-22 01:22:02,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:02,825 INFO ]: Finished difference Result 72 states and 147 transitions. [2018-06-22 01:22:02,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:22:02,826 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 01:22:02,826 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:02,827 INFO ]: With dead ends: 72 [2018-06-22 01:22:02,827 INFO ]: Without dead ends: 72 [2018-06-22 01:22:02,827 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:22:02,827 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 01:22:02,839 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-06-22 01:22:02,839 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 01:22:02,840 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2018-06-22 01:22:02,840 INFO ]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 25 [2018-06-22 01:22:02,841 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:02,841 INFO ]: Abstraction has 63 states and 122 transitions. [2018-06-22 01:22:02,841 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:22:02,841 INFO ]: Start isEmpty. Operand 63 states and 122 transitions. [2018-06-22 01:22:02,842 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:22:02,842 INFO ]: Found error trace [2018-06-22 01:22:02,843 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:02,843 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:02,843 INFO ]: Analyzing trace with hash 1342146552, now seen corresponding path program 1 times [2018-06-22 01:22:02,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:02,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:02,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:02,843 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:02,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:02,866 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:02,973 INFO ]: Checked inductivity of 19 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:22:02,973 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:02,973 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:22:02,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:03,019 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:03,022 INFO ]: Computing forward predicates... [2018-06-22 01:22:03,373 INFO ]: Checked inductivity of 19 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:22:03,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:03,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-06-22 01:22:03,392 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:22:03,392 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:22:03,392 INFO ]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:22:03,392 INFO ]: Start difference. First operand 63 states and 122 transitions. Second operand 15 states. [2018-06-22 01:22:03,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:03,845 INFO ]: Finished difference Result 86 states and 177 transitions. [2018-06-22 01:22:03,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:22:03,846 INFO ]: Start accepts. Automaton has 15 states. Word has length 26 [2018-06-22 01:22:03,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:03,848 INFO ]: With dead ends: 86 [2018-06-22 01:22:03,848 INFO ]: Without dead ends: 86 [2018-06-22 01:22:03,848 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:22:03,848 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 01:22:03,859 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 69. [2018-06-22 01:22:03,859 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:22:03,860 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 136 transitions. [2018-06-22 01:22:03,861 INFO ]: Start accepts. Automaton has 69 states and 136 transitions. Word has length 26 [2018-06-22 01:22:03,861 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:03,861 INFO ]: Abstraction has 69 states and 136 transitions. [2018-06-22 01:22:03,861 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:22:03,861 INFO ]: Start isEmpty. Operand 69 states and 136 transitions. [2018-06-22 01:22:03,863 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:22:03,863 INFO ]: Found error trace [2018-06-22 01:22:03,863 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:03,863 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:03,863 INFO ]: Analyzing trace with hash -1572085144, now seen corresponding path program 1 times [2018-06-22 01:22:03,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:03,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:03,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:03,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:03,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:03,876 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:03,911 INFO ]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:22:03,911 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:22:03,911 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:22:03,911 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:22:03,911 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:22:03,911 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:22:03,912 INFO ]: Start difference. First operand 69 states and 136 transitions. Second operand 5 states. [2018-06-22 01:22:03,988 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:03,988 INFO ]: Finished difference Result 77 states and 150 transitions. [2018-06-22 01:22:03,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:22:03,990 INFO ]: Start accepts. Automaton has 5 states. Word has length 26 [2018-06-22 01:22:03,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:03,991 INFO ]: With dead ends: 77 [2018-06-22 01:22:03,991 INFO ]: Without dead ends: 70 [2018-06-22 01:22:03,991 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:22:03,991 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 01:22:03,998 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 59. [2018-06-22 01:22:03,998 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 01:22:04,002 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2018-06-22 01:22:04,002 INFO ]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 26 [2018-06-22 01:22:04,002 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:04,002 INFO ]: Abstraction has 59 states and 102 transitions. [2018-06-22 01:22:04,002 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:22:04,002 INFO ]: Start isEmpty. Operand 59 states and 102 transitions. [2018-06-22 01:22:04,003 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:22:04,003 INFO ]: Found error trace [2018-06-22 01:22:04,003 INFO ]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:04,003 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:04,003 INFO ]: Analyzing trace with hash -1967892583, now seen corresponding path program 2 times [2018-06-22 01:22:04,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:04,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:04,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:04,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:04,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:04,039 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:04,165 INFO ]: Checked inductivity of 35 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:22:04,165 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:04,165 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:22:04,180 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:22:04,247 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:22:04,247 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:04,251 INFO ]: Computing forward predicates... [2018-06-22 01:22:04,483 INFO ]: Checked inductivity of 35 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:22:04,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:04,507 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 01:22:04,507 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:22:04,507 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:22:04,507 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:22:04,508 INFO ]: Start difference. First operand 59 states and 102 transitions. Second operand 13 states. [2018-06-22 01:22:05,035 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 01:22:05,295 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:05,295 INFO ]: Finished difference Result 75 states and 139 transitions. [2018-06-22 01:22:05,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:22:05,296 INFO ]: Start accepts. Automaton has 13 states. Word has length 33 [2018-06-22 01:22:05,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:05,297 INFO ]: With dead ends: 75 [2018-06-22 01:22:05,297 INFO ]: Without dead ends: 65 [2018-06-22 01:22:05,298 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:22:05,298 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 01:22:05,304 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-06-22 01:22:05,304 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 01:22:05,305 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 111 transitions. [2018-06-22 01:22:05,305 INFO ]: Start accepts. Automaton has 62 states and 111 transitions. Word has length 33 [2018-06-22 01:22:05,305 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:05,305 INFO ]: Abstraction has 62 states and 111 transitions. [2018-06-22 01:22:05,305 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:22:05,305 INFO ]: Start isEmpty. Operand 62 states and 111 transitions. [2018-06-22 01:22:05,306 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:22:05,307 INFO ]: Found error trace [2018-06-22 01:22:05,307 INFO ]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:05,307 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:05,307 INFO ]: Analyzing trace with hash 422767575, now seen corresponding path program 2 times [2018-06-22 01:22:05,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:05,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:05,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:05,308 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:05,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:05,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:05,519 INFO ]: Checked inductivity of 39 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 01:22:05,519 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:05,519 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:22:05,536 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:22:05,590 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:22:05,590 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:05,595 INFO ]: Computing forward predicates... [2018-06-22 01:22:05,859 INFO ]: Checked inductivity of 39 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 01:22:05,889 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:05,889 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2018-06-22 01:22:05,890 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:22:05,890 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:22:05,890 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:22:05,890 INFO ]: Start difference. First operand 62 states and 111 transitions. Second operand 16 states. [2018-06-22 01:22:06,324 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:06,324 INFO ]: Finished difference Result 63 states and 117 transitions. [2018-06-22 01:22:06,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:22:06,325 INFO ]: Start accepts. Automaton has 16 states. Word has length 34 [2018-06-22 01:22:06,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:06,325 INFO ]: With dead ends: 63 [2018-06-22 01:22:06,325 INFO ]: Without dead ends: 63 [2018-06-22 01:22:06,326 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:22:06,326 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 01:22:06,330 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-06-22 01:22:06,330 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:22:06,331 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 94 transitions. [2018-06-22 01:22:06,331 INFO ]: Start accepts. Automaton has 54 states and 94 transitions. Word has length 34 [2018-06-22 01:22:06,331 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:06,331 INFO ]: Abstraction has 54 states and 94 transitions. [2018-06-22 01:22:06,331 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:22:06,332 INFO ]: Start isEmpty. Operand 54 states and 94 transitions. [2018-06-22 01:22:06,333 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:22:06,333 INFO ]: Found error trace [2018-06-22 01:22:06,333 INFO ]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:06,333 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:06,333 INFO ]: Analyzing trace with hash 2115036887, now seen corresponding path program 1 times [2018-06-22 01:22:06,333 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:06,333 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:06,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:06,334 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:06,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:06,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:06,397 INFO ]: Checked inductivity of 37 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 01:22:06,397 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:22:06,397 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:22:06,397 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:22:06,397 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:22:06,397 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:22:06,397 INFO ]: Start difference. First operand 54 states and 94 transitions. Second operand 3 states. [2018-06-22 01:22:06,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:06,411 INFO ]: Finished difference Result 61 states and 108 transitions. [2018-06-22 01:22:06,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:22:06,412 INFO ]: Start accepts. Automaton has 3 states. Word has length 34 [2018-06-22 01:22:06,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:06,413 INFO ]: With dead ends: 61 [2018-06-22 01:22:06,413 INFO ]: Without dead ends: 54 [2018-06-22 01:22:06,413 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:22:06,413 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:22:06,416 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-22 01:22:06,416 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:22:06,417 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 86 transitions. [2018-06-22 01:22:06,417 INFO ]: Start accepts. Automaton has 54 states and 86 transitions. Word has length 34 [2018-06-22 01:22:06,417 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:06,417 INFO ]: Abstraction has 54 states and 86 transitions. [2018-06-22 01:22:06,418 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:22:06,418 INFO ]: Start isEmpty. Operand 54 states and 86 transitions. [2018-06-22 01:22:06,418 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:22:06,418 INFO ]: Found error trace [2018-06-22 01:22:06,419 INFO ]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:06,419 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:06,419 INFO ]: Analyzing trace with hash 1024454622, now seen corresponding path program 1 times [2018-06-22 01:22:06,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:06,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:06,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:06,419 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:06,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:06,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:06,641 INFO ]: Checked inductivity of 39 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:22:06,641 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:06,641 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:22:06,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:06,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:06,699 INFO ]: Computing forward predicates... [2018-06-22 01:22:06,855 INFO ]: Checked inductivity of 39 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:22:06,874 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:06,874 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-22 01:22:06,874 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:22:06,874 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:22:06,875 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:22:06,875 INFO ]: Start difference. First operand 54 states and 86 transitions. Second operand 17 states. [2018-06-22 01:22:08,769 WARN ]: Spent 495.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-06-22 01:22:09,248 WARN ]: Spent 298.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-06-22 01:22:09,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:09,393 INFO ]: Finished difference Result 80 states and 136 transitions. [2018-06-22 01:22:09,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:22:09,394 INFO ]: Start accepts. Automaton has 17 states. Word has length 34 [2018-06-22 01:22:09,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:09,395 INFO ]: With dead ends: 80 [2018-06-22 01:22:09,395 INFO ]: Without dead ends: 76 [2018-06-22 01:22:09,395 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:22:09,396 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 01:22:09,400 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 62. [2018-06-22 01:22:09,400 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 01:22:09,401 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2018-06-22 01:22:09,401 INFO ]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 34 [2018-06-22 01:22:09,401 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:09,401 INFO ]: Abstraction has 62 states and 98 transitions. [2018-06-22 01:22:09,401 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:22:09,401 INFO ]: Start isEmpty. Operand 62 states and 98 transitions. [2018-06-22 01:22:09,406 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:22:09,407 INFO ]: Found error trace [2018-06-22 01:22:09,407 INFO ]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:09,407 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:09,407 INFO ]: Analyzing trace with hash -1296697122, now seen corresponding path program 1 times [2018-06-22 01:22:09,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:09,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:09,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:09,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:09,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:09,422 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:09,803 INFO ]: Checked inductivity of 37 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 01:22:09,803 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:09,803 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:22:09,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:09,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:09,844 INFO ]: Computing forward predicates... [2018-06-22 01:22:10,356 INFO ]: Checked inductivity of 37 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 01:22:10,380 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:10,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-06-22 01:22:10,381 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:22:10,381 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:22:10,381 INFO ]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:22:10,381 INFO ]: Start difference. First operand 62 states and 98 transitions. Second operand 21 states. [2018-06-22 01:22:11,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:11,081 INFO ]: Finished difference Result 71 states and 117 transitions. [2018-06-22 01:22:11,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:22:11,082 INFO ]: Start accepts. Automaton has 21 states. Word has length 34 [2018-06-22 01:22:11,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:11,083 INFO ]: With dead ends: 71 [2018-06-22 01:22:11,083 INFO ]: Without dead ends: 71 [2018-06-22 01:22:11,083 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:22:11,083 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 01:22:11,088 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 66. [2018-06-22 01:22:11,088 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 01:22:11,089 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 104 transitions. [2018-06-22 01:22:11,089 INFO ]: Start accepts. Automaton has 66 states and 104 transitions. Word has length 34 [2018-06-22 01:22:11,089 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:11,089 INFO ]: Abstraction has 66 states and 104 transitions. [2018-06-22 01:22:11,089 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:22:11,089 INFO ]: Start isEmpty. Operand 66 states and 104 transitions. [2018-06-22 01:22:11,091 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:22:11,091 INFO ]: Found error trace [2018-06-22 01:22:11,091 INFO ]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:11,091 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:11,091 INFO ]: Analyzing trace with hash -903456463, now seen corresponding path program 2 times [2018-06-22 01:22:11,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:11,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:11,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:11,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:11,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:11,107 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:11,217 INFO ]: Checked inductivity of 42 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:22:11,217 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:11,217 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:22:11,222 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:22:11,285 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:22:11,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:11,289 INFO ]: Computing forward predicates... [2018-06-22 01:22:11,485 INFO ]: Checked inductivity of 42 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:22:11,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:11,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-06-22 01:22:11,504 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:22:11,504 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:22:11,504 INFO ]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:22:11,504 INFO ]: Start difference. First operand 66 states and 104 transitions. Second operand 19 states. [2018-06-22 01:22:12,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:12,244 INFO ]: Finished difference Result 87 states and 143 transitions. [2018-06-22 01:22:12,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:22:12,245 INFO ]: Start accepts. Automaton has 19 states. Word has length 35 [2018-06-22 01:22:12,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:12,245 INFO ]: With dead ends: 87 [2018-06-22 01:22:12,245 INFO ]: Without dead ends: 87 [2018-06-22 01:22:12,246 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=299, Invalid=1507, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:22:12,246 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 01:22:12,250 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 70. [2018-06-22 01:22:12,251 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:22:12,251 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2018-06-22 01:22:12,251 INFO ]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 35 [2018-06-22 01:22:12,251 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:12,251 INFO ]: Abstraction has 70 states and 110 transitions. [2018-06-22 01:22:12,251 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:22:12,252 INFO ]: Start isEmpty. Operand 70 states and 110 transitions. [2018-06-22 01:22:12,252 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:22:12,253 INFO ]: Found error trace [2018-06-22 01:22:12,253 INFO ]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:12,255 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:12,255 INFO ]: Analyzing trace with hash -1319632451, now seen corresponding path program 3 times [2018-06-22 01:22:12,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:12,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:12,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:12,256 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:12,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:12,273 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:12,394 INFO ]: Checked inductivity of 63 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 01:22:12,394 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:12,394 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:22:12,400 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:22:12,437 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:22:12,437 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:12,441 INFO ]: Computing forward predicates... [2018-06-22 01:22:12,606 INFO ]: Checked inductivity of 63 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 01:22:12,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:12,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-06-22 01:22:12,626 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:22:12,626 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:22:12,626 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:22:12,626 INFO ]: Start difference. First operand 70 states and 110 transitions. Second operand 18 states. [2018-06-22 01:22:13,156 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:13,156 INFO ]: Finished difference Result 79 states and 130 transitions. [2018-06-22 01:22:13,157 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:22:13,157 INFO ]: Start accepts. Automaton has 18 states. Word has length 42 [2018-06-22 01:22:13,157 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:13,157 INFO ]: With dead ends: 79 [2018-06-22 01:22:13,157 INFO ]: Without dead ends: 69 [2018-06-22 01:22:13,158 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:22:13,158 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 01:22:13,161 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-06-22 01:22:13,161 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 01:22:13,162 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2018-06-22 01:22:13,162 INFO ]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 42 [2018-06-22 01:22:13,162 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:13,162 INFO ]: Abstraction has 61 states and 96 transitions. [2018-06-22 01:22:13,162 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:22:13,162 INFO ]: Start isEmpty. Operand 61 states and 96 transitions. [2018-06-22 01:22:13,163 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:22:13,163 INFO ]: Found error trace [2018-06-22 01:22:13,163 INFO ]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:13,163 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:13,164 INFO ]: Analyzing trace with hash 1601187480, now seen corresponding path program 4 times [2018-06-22 01:22:13,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:13,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:13,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:13,164 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:13,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:13,181 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:14,239 INFO ]: Checked inductivity of 69 backedges. 14 proven. 35 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 01:22:14,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:14,239 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:22:14,245 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:22:14,282 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:22:14,282 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:14,287 INFO ]: Computing forward predicates... [2018-06-22 01:22:14,590 INFO ]: Checked inductivity of 69 backedges. 20 proven. 28 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:22:14,609 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:14,609 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-06-22 01:22:14,609 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:22:14,609 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:22:14,609 INFO ]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:22:14,609 INFO ]: Start difference. First operand 61 states and 96 transitions. Second operand 28 states. [2018-06-22 01:22:15,178 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-06-22 01:22:15,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:15,655 INFO ]: Finished difference Result 92 states and 151 transitions. [2018-06-22 01:22:15,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:22:15,656 INFO ]: Start accepts. Automaton has 28 states. Word has length 43 [2018-06-22 01:22:15,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:15,656 INFO ]: With dead ends: 92 [2018-06-22 01:22:15,656 INFO ]: Without dead ends: 70 [2018-06-22 01:22:15,657 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=352, Invalid=2000, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:22:15,657 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 01:22:15,660 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-06-22 01:22:15,660 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 01:22:15,660 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2018-06-22 01:22:15,660 INFO ]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 43 [2018-06-22 01:22:15,660 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:15,660 INFO ]: Abstraction has 62 states and 98 transitions. [2018-06-22 01:22:15,660 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:22:15,660 INFO ]: Start isEmpty. Operand 62 states and 98 transitions. [2018-06-22 01:22:15,661 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:22:15,661 INFO ]: Found error trace [2018-06-22 01:22:15,661 INFO ]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:15,662 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:15,662 INFO ]: Analyzing trace with hash 2023889306, now seen corresponding path program 1 times [2018-06-22 01:22:15,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:15,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:15,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:15,662 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:15,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:15,676 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:15,806 INFO ]: Checked inductivity of 69 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:22:15,806 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:15,806 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:22:15,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:15,865 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:15,867 INFO ]: Computing forward predicates... [2018-06-22 01:22:15,927 INFO ]: Checked inductivity of 69 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-06-22 01:22:15,950 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:22:15,950 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2018-06-22 01:22:15,951 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:22:15,951 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:22:15,951 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:22:15,951 INFO ]: Start difference. First operand 62 states and 98 transitions. Second operand 11 states. [2018-06-22 01:22:16,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:16,263 INFO ]: Finished difference Result 95 states and 166 transitions. [2018-06-22 01:22:16,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:22:16,263 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-22 01:22:16,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:16,264 INFO ]: With dead ends: 95 [2018-06-22 01:22:16,264 INFO ]: Without dead ends: 95 [2018-06-22 01:22:16,264 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:22:16,265 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 01:22:16,270 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 69. [2018-06-22 01:22:16,270 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:22:16,271 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 109 transitions. [2018-06-22 01:22:16,271 INFO ]: Start accepts. Automaton has 69 states and 109 transitions. Word has length 43 [2018-06-22 01:22:16,271 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:16,271 INFO ]: Abstraction has 69 states and 109 transitions. [2018-06-22 01:22:16,271 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:22:16,271 INFO ]: Start isEmpty. Operand 69 states and 109 transitions. [2018-06-22 01:22:16,272 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:22:16,272 INFO ]: Found error trace [2018-06-22 01:22:16,272 INFO ]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:16,272 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:16,272 INFO ]: Analyzing trace with hash 1820042198, now seen corresponding path program 2 times [2018-06-22 01:22:16,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:16,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:16,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:16,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:16,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:16,287 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:16,713 INFO ]: Checked inductivity of 69 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 01:22:16,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:16,713 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:22:16,719 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:22:16,760 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:22:16,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:16,763 INFO ]: Computing forward predicates... [2018-06-22 01:22:16,874 INFO ]: Checked inductivity of 69 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 01:22:16,894 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:16,895 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-06-22 01:22:16,895 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:22:16,895 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:22:16,895 INFO ]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:22:16,895 INFO ]: Start difference. First operand 69 states and 109 transitions. Second operand 18 states. [2018-06-22 01:22:17,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:17,256 INFO ]: Finished difference Result 90 states and 149 transitions. [2018-06-22 01:22:17,281 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:22:17,281 INFO ]: Start accepts. Automaton has 18 states. Word has length 43 [2018-06-22 01:22:17,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:17,283 INFO ]: With dead ends: 90 [2018-06-22 01:22:17,283 INFO ]: Without dead ends: 78 [2018-06-22 01:22:17,283 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:22:17,283 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 01:22:17,289 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 69. [2018-06-22 01:22:17,289 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:22:17,290 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 109 transitions. [2018-06-22 01:22:17,290 INFO ]: Start accepts. Automaton has 69 states and 109 transitions. Word has length 43 [2018-06-22 01:22:17,290 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:17,290 INFO ]: Abstraction has 69 states and 109 transitions. [2018-06-22 01:22:17,290 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:22:17,290 INFO ]: Start isEmpty. Operand 69 states and 109 transitions. [2018-06-22 01:22:17,291 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:22:17,291 INFO ]: Found error trace [2018-06-22 01:22:17,291 INFO ]: trace histogram [5, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:17,291 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:17,291 INFO ]: Analyzing trace with hash -233491427, now seen corresponding path program 5 times [2018-06-22 01:22:17,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:17,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:17,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:17,292 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:17,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:17,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:17,486 INFO ]: Checked inductivity of 76 backedges. 18 proven. 31 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 01:22:17,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:17,486 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:22:17,492 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:22:17,539 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:22:17,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:17,542 INFO ]: Computing forward predicates... [2018-06-22 01:22:17,769 INFO ]: Checked inductivity of 76 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 01:22:17,800 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:17,800 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-06-22 01:22:17,800 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:22:17,800 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:22:17,800 INFO ]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:22:17,800 INFO ]: Start difference. First operand 69 states and 109 transitions. Second operand 23 states. [2018-06-22 01:22:18,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:18,536 INFO ]: Finished difference Result 103 states and 171 transitions. [2018-06-22 01:22:18,537 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:22:18,537 INFO ]: Start accepts. Automaton has 23 states. Word has length 44 [2018-06-22 01:22:18,537 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:18,537 INFO ]: With dead ends: 103 [2018-06-22 01:22:18,537 INFO ]: Without dead ends: 98 [2018-06-22 01:22:18,538 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=367, Invalid=1889, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:22:18,538 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 01:22:18,542 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 76. [2018-06-22 01:22:18,542 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 01:22:18,543 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 120 transitions. [2018-06-22 01:22:18,543 INFO ]: Start accepts. Automaton has 76 states and 120 transitions. Word has length 44 [2018-06-22 01:22:18,543 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:18,543 INFO ]: Abstraction has 76 states and 120 transitions. [2018-06-22 01:22:18,543 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:22:18,543 INFO ]: Start isEmpty. Operand 76 states and 120 transitions. [2018-06-22 01:22:18,544 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:22:18,544 INFO ]: Found error trace [2018-06-22 01:22:18,544 INFO ]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:18,544 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:18,544 INFO ]: Analyzing trace with hash -2038929761, now seen corresponding path program 3 times [2018-06-22 01:22:18,544 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:18,544 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:18,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:18,545 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:18,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:18,559 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:18,999 INFO ]: Checked inductivity of 76 backedges. 18 proven. 31 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 01:22:18,999 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:18,999 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:22:19,005 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:22:19,046 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:22:19,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:19,048 INFO ]: Computing forward predicates... [2018-06-22 01:22:19,248 INFO ]: Checked inductivity of 76 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-22 01:22:19,267 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:19,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-06-22 01:22:19,268 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:22:19,268 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:22:19,268 INFO ]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:22:19,268 INFO ]: Start difference. First operand 76 states and 120 transitions. Second operand 17 states. [2018-06-22 01:22:20,369 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:20,369 INFO ]: Finished difference Result 148 states and 235 transitions. [2018-06-22 01:22:20,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-06-22 01:22:20,370 INFO ]: Start accepts. Automaton has 17 states. Word has length 44 [2018-06-22 01:22:20,370 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:20,371 INFO ]: With dead ends: 148 [2018-06-22 01:22:20,371 INFO ]: Without dead ends: 148 [2018-06-22 01:22:20,373 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=708, Invalid=4262, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 01:22:20,373 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 01:22:20,378 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 97. [2018-06-22 01:22:20,378 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-22 01:22:20,378 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 147 transitions. [2018-06-22 01:22:20,379 INFO ]: Start accepts. Automaton has 97 states and 147 transitions. Word has length 44 [2018-06-22 01:22:20,379 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:20,379 INFO ]: Abstraction has 97 states and 147 transitions. [2018-06-22 01:22:20,379 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:22:20,379 INFO ]: Start isEmpty. Operand 97 states and 147 transitions. [2018-06-22 01:22:20,380 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 01:22:20,380 INFO ]: Found error trace [2018-06-22 01:22:20,380 INFO ]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:20,380 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:20,380 INFO ]: Analyzing trace with hash -1593319044, now seen corresponding path program 6 times [2018-06-22 01:22:20,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:20,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:20,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:20,381 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:20,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:20,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:21,095 INFO ]: Checked inductivity of 112 backedges. 18 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 01:22:21,095 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:21,095 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:22:21,101 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:22:21,154 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:22:21,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:21,158 INFO ]: Computing forward predicates... [2018-06-22 01:22:21,837 INFO ]: Checked inductivity of 112 backedges. 26 proven. 55 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 01:22:21,856 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:21,856 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2018-06-22 01:22:21,856 INFO ]: Interpolant automaton has 39 states [2018-06-22 01:22:21,856 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 01:22:21,857 INFO ]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:22:21,857 INFO ]: Start difference. First operand 97 states and 147 transitions. Second operand 39 states. [2018-06-22 01:22:22,574 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-22 01:22:23,611 WARN ]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2018-06-22 01:22:24,037 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2018-06-22 01:22:24,464 WARN ]: Spent 307.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-06-22 01:22:24,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:24,818 INFO ]: Finished difference Result 167 states and 259 transitions. [2018-06-22 01:22:24,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:22:24,818 INFO ]: Start accepts. Automaton has 39 states. Word has length 52 [2018-06-22 01:22:24,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:24,819 INFO ]: With dead ends: 167 [2018-06-22 01:22:24,819 INFO ]: Without dead ends: 117 [2018-06-22 01:22:24,821 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=548, Invalid=3484, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:22:24,821 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 01:22:24,825 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-06-22 01:22:24,825 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 01:22:24,826 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 150 transitions. [2018-06-22 01:22:24,826 INFO ]: Start accepts. Automaton has 99 states and 150 transitions. Word has length 52 [2018-06-22 01:22:24,826 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:24,826 INFO ]: Abstraction has 99 states and 150 transitions. [2018-06-22 01:22:24,826 INFO ]: Interpolant automaton has 39 states. [2018-06-22 01:22:24,826 INFO ]: Start isEmpty. Operand 99 states and 150 transitions. [2018-06-22 01:22:24,827 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 01:22:24,827 INFO ]: Found error trace [2018-06-22 01:22:24,827 INFO ]: trace histogram [6, 6, 6, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:24,827 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:24,828 INFO ]: Analyzing trace with hash -1952508897, now seen corresponding path program 7 times [2018-06-22 01:22:24,828 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:24,828 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:24,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:24,828 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:24,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:24,845 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:25,373 INFO ]: Checked inductivity of 121 backedges. 42 proven. 37 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 01:22:25,373 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:25,373 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:22:25,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:25,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:25,428 INFO ]: Computing forward predicates... [2018-06-22 01:22:25,684 INFO ]: Checked inductivity of 121 backedges. 25 proven. 53 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 01:22:25,704 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:25,704 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-06-22 01:22:25,705 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:22:25,705 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:22:25,705 INFO ]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:22:25,705 INFO ]: Start difference. First operand 99 states and 150 transitions. Second operand 27 states. [2018-06-22 01:22:26,706 WARN ]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-22 01:22:27,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:27,092 INFO ]: Finished difference Result 166 states and 258 transitions. [2018-06-22 01:22:27,092 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 01:22:27,092 INFO ]: Start accepts. Automaton has 27 states. Word has length 53 [2018-06-22 01:22:27,092 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:27,093 INFO ]: With dead ends: 166 [2018-06-22 01:22:27,093 INFO ]: Without dead ends: 166 [2018-06-22 01:22:27,094 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=762, Invalid=4208, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 01:22:27,095 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 01:22:27,100 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 107. [2018-06-22 01:22:27,100 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 01:22:27,101 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2018-06-22 01:22:27,101 INFO ]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 53 [2018-06-22 01:22:27,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:27,101 INFO ]: Abstraction has 107 states and 162 transitions. [2018-06-22 01:22:27,101 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:22:27,101 INFO ]: Start isEmpty. Operand 107 states and 162 transitions. [2018-06-22 01:22:27,103 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 01:22:27,103 INFO ]: Found error trace [2018-06-22 01:22:27,103 INFO ]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:27,103 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:27,103 INFO ]: Analyzing trace with hash 471726470, now seen corresponding path program 8 times [2018-06-22 01:22:27,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:27,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:27,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:27,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:22:27,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:27,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:27,727 INFO ]: Checked inductivity of 166 backedges. 22 proven. 102 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 01:22:27,727 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:27,727 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:22:27,734 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:22:27,791 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:22:27,791 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:27,797 INFO ]: Computing forward predicates... [2018-06-22 01:22:28,307 WARN ]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:22:28,631 INFO ]: Checked inductivity of 166 backedges. 34 proven. 81 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 01:22:28,651 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:28,651 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 40 [2018-06-22 01:22:28,651 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:22:28,651 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:22:28,652 INFO ]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:22:28,652 INFO ]: Start difference. First operand 107 states and 162 transitions. Second operand 40 states. [2018-06-22 01:22:30,335 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:30,335 INFO ]: Finished difference Result 184 states and 284 transitions. [2018-06-22 01:22:30,335 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:22:30,335 INFO ]: Start accepts. Automaton has 40 states. Word has length 61 [2018-06-22 01:22:30,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:30,336 INFO ]: With dead ends: 184 [2018-06-22 01:22:30,336 INFO ]: Without dead ends: 126 [2018-06-22 01:22:30,338 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=628, Invalid=4064, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 01:22:30,338 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-22 01:22:30,343 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-06-22 01:22:30,343 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 01:22:30,344 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2018-06-22 01:22:30,344 INFO ]: Start accepts. Automaton has 108 states and 163 transitions. Word has length 61 [2018-06-22 01:22:30,344 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:30,344 INFO ]: Abstraction has 108 states and 163 transitions. [2018-06-22 01:22:30,344 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:22:30,344 INFO ]: Start isEmpty. Operand 108 states and 163 transitions. [2018-06-22 01:22:30,345 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 01:22:30,345 INFO ]: Found error trace [2018-06-22 01:22:30,345 INFO ]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:30,345 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:30,346 INFO ]: Analyzing trace with hash 746486084, now seen corresponding path program 4 times [2018-06-22 01:22:30,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:30,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:30,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:30,347 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:30,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:30,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:30,663 INFO ]: Checked inductivity of 166 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 01:22:30,663 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:30,663 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:22:30,669 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:22:30,724 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:22:30,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:30,727 INFO ]: Computing forward predicates... [2018-06-22 01:22:31,269 INFO ]: Checked inductivity of 166 backedges. 75 proven. 29 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-22 01:22:31,288 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:31,288 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-06-22 01:22:31,289 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:22:31,289 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:22:31,289 INFO ]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:22:31,289 INFO ]: Start difference. First operand 108 states and 163 transitions. Second operand 26 states. [2018-06-22 01:22:31,847 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:31,847 INFO ]: Finished difference Result 159 states and 245 transitions. [2018-06-22 01:22:31,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:22:31,848 INFO ]: Start accepts. Automaton has 26 states. Word has length 61 [2018-06-22 01:22:31,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:31,849 INFO ]: With dead ends: 159 [2018-06-22 01:22:31,849 INFO ]: Without dead ends: 125 [2018-06-22 01:22:31,849 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=456, Invalid=1994, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:22:31,850 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 01:22:31,854 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 108. [2018-06-22 01:22:31,855 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 01:22:31,855 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2018-06-22 01:22:31,855 INFO ]: Start accepts. Automaton has 108 states and 163 transitions. Word has length 61 [2018-06-22 01:22:31,856 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:31,856 INFO ]: Abstraction has 108 states and 163 transitions. [2018-06-22 01:22:31,856 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:22:31,856 INFO ]: Start isEmpty. Operand 108 states and 163 transitions. [2018-06-22 01:22:31,859 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-22 01:22:31,859 INFO ]: Found error trace [2018-06-22 01:22:31,859 INFO ]: trace histogram [7, 7, 7, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:31,859 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:31,859 INFO ]: Analyzing trace with hash 210342075, now seen corresponding path program 9 times [2018-06-22 01:22:31,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:31,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:31,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:31,859 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:31,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:31,880 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:32,292 INFO ]: Checked inductivity of 177 backedges. 33 proven. 81 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-22 01:22:32,292 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:32,292 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:22:32,298 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:22:32,451 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:22:32,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:32,456 INFO ]: Computing forward predicates... [2018-06-22 01:22:33,406 INFO ]: Checked inductivity of 177 backedges. 33 proven. 81 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-22 01:22:33,426 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:33,426 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-06-22 01:22:33,426 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:22:33,426 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:22:33,426 INFO ]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:22:33,426 INFO ]: Start difference. First operand 108 states and 163 transitions. Second operand 31 states. [2018-06-22 01:22:34,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:34,092 INFO ]: Finished difference Result 177 states and 272 transitions. [2018-06-22 01:22:34,092 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:22:34,092 INFO ]: Start accepts. Automaton has 31 states. Word has length 62 [2018-06-22 01:22:34,092 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:34,092 INFO ]: With dead ends: 177 [2018-06-22 01:22:34,092 INFO ]: Without dead ends: 169 [2018-06-22 01:22:34,093 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=734, Invalid=3556, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 01:22:34,093 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-22 01:22:34,099 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 120. [2018-06-22 01:22:34,099 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-22 01:22:34,100 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 180 transitions. [2018-06-22 01:22:34,100 INFO ]: Start accepts. Automaton has 120 states and 180 transitions. Word has length 62 [2018-06-22 01:22:34,100 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:34,100 INFO ]: Abstraction has 120 states and 180 transitions. [2018-06-22 01:22:34,100 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:22:34,100 INFO ]: Start isEmpty. Operand 120 states and 180 transitions. [2018-06-22 01:22:34,101 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-22 01:22:34,101 INFO ]: Found error trace [2018-06-22 01:22:34,101 INFO ]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:34,101 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:34,101 INFO ]: Analyzing trace with hash 137955517, now seen corresponding path program 5 times [2018-06-22 01:22:34,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:34,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:34,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:34,102 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:34,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:34,123 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:34,534 INFO ]: Checked inductivity of 177 backedges. 55 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 01:22:34,534 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:34,534 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:22:34,541 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:22:34,596 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:22:34,596 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:34,599 INFO ]: Computing forward predicates... [2018-06-22 01:22:34,674 INFO ]: Checked inductivity of 177 backedges. 41 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-06-22 01:22:34,693 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:34,693 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 21 [2018-06-22 01:22:34,693 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:22:34,693 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:22:34,693 INFO ]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:22:34,693 INFO ]: Start difference. First operand 120 states and 180 transitions. Second operand 21 states. [2018-06-22 01:22:38,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:38,225 INFO ]: Finished difference Result 290 states and 417 transitions. [2018-06-22 01:22:38,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-06-22 01:22:38,225 INFO ]: Start accepts. Automaton has 21 states. Word has length 62 [2018-06-22 01:22:38,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:38,227 INFO ]: With dead ends: 290 [2018-06-22 01:22:38,227 INFO ]: Without dead ends: 290 [2018-06-22 01:22:38,233 INFO ]: 0 DeclaredPredicates, 238 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12026 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3305, Invalid=26451, Unknown=0, NotChecked=0, Total=29756 [2018-06-22 01:22:38,233 INFO ]: Start minimizeSevpa. Operand 290 states. [2018-06-22 01:22:38,242 INFO ]: Finished minimizeSevpa. Reduced states from 290 to 135. [2018-06-22 01:22:38,242 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 01:22:38,243 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2018-06-22 01:22:38,243 INFO ]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 62 [2018-06-22 01:22:38,243 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:38,243 INFO ]: Abstraction has 135 states and 193 transitions. [2018-06-22 01:22:38,243 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:22:38,243 INFO ]: Start isEmpty. Operand 135 states and 193 transitions. [2018-06-22 01:22:38,245 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-22 01:22:38,245 INFO ]: Found error trace [2018-06-22 01:22:38,246 INFO ]: trace histogram [8, 8, 8, 7, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:38,246 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:38,246 INFO ]: Analyzing trace with hash 1038510106, now seen corresponding path program 10 times [2018-06-22 01:22:38,246 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:38,246 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:38,246 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:38,246 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:38,246 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:38,274 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:39,424 INFO ]: Checked inductivity of 231 backedges. 26 proven. 149 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 01:22:39,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:39,425 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:22:39,431 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:22:39,494 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:22:39,494 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:39,502 INFO ]: Computing forward predicates... [2018-06-22 01:22:40,223 INFO ]: Checked inductivity of 231 backedges. 41 proven. 118 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 01:22:40,257 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:40,257 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22] total 46 [2018-06-22 01:22:40,257 INFO ]: Interpolant automaton has 46 states [2018-06-22 01:22:40,258 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 01:22:40,258 INFO ]: CoverageRelationStatistics Valid=145, Invalid=1925, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:22:40,258 INFO ]: Start difference. First operand 135 states and 193 transitions. Second operand 46 states. [2018-06-22 01:22:42,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:42,305 INFO ]: Finished difference Result 243 states and 351 transitions. [2018-06-22 01:22:42,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:22:42,306 INFO ]: Start accepts. Automaton has 46 states. Word has length 70 [2018-06-22 01:22:42,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:42,307 INFO ]: With dead ends: 243 [2018-06-22 01:22:42,307 INFO ]: Without dead ends: 161 [2018-06-22 01:22:42,307 INFO ]: 0 DeclaredPredicates, 132 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=796, Invalid=5366, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 01:22:42,307 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-22 01:22:42,313 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 137. [2018-06-22 01:22:42,313 INFO ]: Start removeUnreachable. Operand 137 states. [2018-06-22 01:22:42,314 INFO ]: Finished removeUnreachable. Reduced from 137 states to 137 states and 196 transitions. [2018-06-22 01:22:42,314 INFO ]: Start accepts. Automaton has 137 states and 196 transitions. Word has length 70 [2018-06-22 01:22:42,314 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:42,314 INFO ]: Abstraction has 137 states and 196 transitions. [2018-06-22 01:22:42,314 INFO ]: Interpolant automaton has 46 states. [2018-06-22 01:22:42,314 INFO ]: Start isEmpty. Operand 137 states and 196 transitions. [2018-06-22 01:22:42,315 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-22 01:22:42,315 INFO ]: Found error trace [2018-06-22 01:22:42,316 INFO ]: trace histogram [8, 8, 8, 7, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:42,316 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:42,316 INFO ]: Analyzing trace with hash -207067891, now seen corresponding path program 11 times [2018-06-22 01:22:42,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:42,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:42,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:42,316 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:42,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:42,339 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:42,605 INFO ]: Checked inductivity of 244 backedges. 42 proven. 115 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 01:22:42,605 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:42,605 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:22:42,611 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:22:42,693 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 01:22:42,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:42,697 INFO ]: Computing forward predicates... [2018-06-22 01:22:42,978 INFO ]: Checked inductivity of 244 backedges. 42 proven. 115 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 01:22:42,997 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:43,013 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-06-22 01:22:43,013 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:22:43,013 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:22:43,013 INFO ]: CoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:22:43,014 INFO ]: Start difference. First operand 137 states and 196 transitions. Second operand 35 states. [2018-06-22 01:22:44,582 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:22:44,976 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 01:22:45,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:45,350 INFO ]: Finished difference Result 233 states and 336 transitions. [2018-06-22 01:22:45,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 01:22:45,350 INFO ]: Start accepts. Automaton has 35 states. Word has length 71 [2018-06-22 01:22:45,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:45,351 INFO ]: With dead ends: 233 [2018-06-22 01:22:45,351 INFO ]: Without dead ends: 223 [2018-06-22 01:22:45,351 INFO ]: 0 DeclaredPredicates, 142 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1772 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=982, Invalid=4870, Unknown=0, NotChecked=0, Total=5852 [2018-06-22 01:22:45,352 INFO ]: Start minimizeSevpa. Operand 223 states. [2018-06-22 01:22:45,358 INFO ]: Finished minimizeSevpa. Reduced states from 223 to 152. [2018-06-22 01:22:45,361 INFO ]: Start removeUnreachable. Operand 152 states. [2018-06-22 01:22:45,362 INFO ]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2018-06-22 01:22:45,362 INFO ]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 71 [2018-06-22 01:22:45,362 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:45,362 INFO ]: Abstraction has 152 states and 216 transitions. [2018-06-22 01:22:45,362 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:22:45,362 INFO ]: Start isEmpty. Operand 152 states and 216 transitions. [2018-06-22 01:22:45,364 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-22 01:22:45,364 INFO ]: Found error trace [2018-06-22 01:22:45,364 INFO ]: trace histogram [8, 8, 8, 7, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:45,364 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:45,365 INFO ]: Analyzing trace with hash -1236427189, now seen corresponding path program 6 times [2018-06-22 01:22:45,365 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:45,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:45,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:45,365 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:45,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:45,390 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:45,592 INFO ]: Checked inductivity of 244 backedges. 69 proven. 91 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 01:22:45,592 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:22:45,592 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:22:45,598 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:22:45,673 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:22:45,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:22:45,676 INFO ]: Computing forward predicates... [2018-06-22 01:22:45,784 INFO ]: Checked inductivity of 244 backedges. 50 proven. 20 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-06-22 01:22:45,803 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:22:45,803 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2018-06-22 01:22:45,803 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:22:45,803 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:22:45,803 INFO ]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:22:45,804 INFO ]: Start difference. First operand 152 states and 216 transitions. Second operand 25 states. [2018-06-22 01:22:51,570 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:22:51,570 INFO ]: Finished difference Result 395 states and 544 transitions. [2018-06-22 01:22:51,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2018-06-22 01:22:51,571 INFO ]: Start accepts. Automaton has 25 states. Word has length 71 [2018-06-22 01:22:51,571 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:22:51,572 INFO ]: With dead ends: 395 [2018-06-22 01:22:51,572 INFO ]: Without dead ends: 395 [2018-06-22 01:22:51,578 INFO ]: 0 DeclaredPredicates, 329 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28088 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6861, Invalid=57909, Unknown=0, NotChecked=0, Total=64770 [2018-06-22 01:22:51,579 INFO ]: Start minimizeSevpa. Operand 395 states. [2018-06-22 01:22:51,586 INFO ]: Finished minimizeSevpa. Reduced states from 395 to 157. [2018-06-22 01:22:51,586 INFO ]: Start removeUnreachable. Operand 157 states. [2018-06-22 01:22:51,587 INFO ]: Finished removeUnreachable. Reduced from 157 states to 157 states and 219 transitions. [2018-06-22 01:22:51,587 INFO ]: Start accepts. Automaton has 157 states and 219 transitions. Word has length 71 [2018-06-22 01:22:51,587 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:22:51,587 INFO ]: Abstraction has 157 states and 219 transitions. [2018-06-22 01:22:51,587 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:22:51,587 INFO ]: Start isEmpty. Operand 157 states and 219 transitions. [2018-06-22 01:22:51,588 INFO ]: Finished isEmpty. Found accepting run of length 80 [2018-06-22 01:22:51,588 INFO ]: Found error trace [2018-06-22 01:22:51,588 INFO ]: trace histogram [9, 9, 9, 8, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:22:51,589 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:22:51,589 INFO ]: Analyzing trace with hash 1646369396, now seen corresponding path program 12 times [2018-06-22 01:22:51,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:22:51,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:22:51,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:51,589 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:22:51,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:22:51,619 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 01:22:56,646 WARN ]: Verification canceled [2018-06-22 01:22:56,651 WARN ]: Timeout [2018-06-22 01:22:56,651 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:22:56 BoogieIcfgContainer [2018-06-22 01:22:56,651 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:22:56,652 INFO ]: Toolchain (without parser) took 59606.31 ms. Allocated memory was 305.1 MB in the beginning and 891.8 MB in the end (delta: 586.7 MB). Free memory was 259.5 MB in the beginning and 836.8 MB in the end (delta: -577.2 MB). Peak memory consumption was 524.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:22:56,653 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:22:56,653 INFO ]: ChcToBoogie took 53.81 ms. Allocated memory is still 305.1 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:22:56,653 INFO ]: Boogie Preprocessor took 45.64 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 255.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:22:56,654 INFO ]: RCFGBuilder took 445.34 ms. Allocated memory is still 305.1 MB. Free memory was 255.5 MB in the beginning and 242.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:22:56,654 INFO ]: TraceAbstraction took 59051.75 ms. Allocated memory was 305.1 MB in the beginning and 891.8 MB in the end (delta: 586.7 MB). Free memory was 241.5 MB in the beginning and 836.8 MB in the end (delta: -595.2 MB). Peak memory consumption was 506.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:22:56,658 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.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.81 ms. Allocated memory is still 305.1 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.64 ms. Allocated memory is still 305.1 MB. Free memory was 257.5 MB in the beginning and 255.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 445.34 ms. Allocated memory is still 305.1 MB. Free memory was 255.5 MB in the beginning and 242.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59051.75 ms. Allocated memory was 305.1 MB in the beginning and 891.8 MB in the end (delta: 586.7 MB). Free memory was 241.5 MB in the beginning and 836.8 MB in the end (delta: -595.2 MB). Peak memory consumption was 506.3 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 80 with TraceHistMax 9, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. TIMEOUT Result, 58.9s OverallTime, 32 OverallIterations, 9 TraceHistogramMax, 34.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 913 SDtfs, 2601 SDslu, 6881 SDs, 0 SdLazy, 13142 SolverSat, 1920 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2390 GetRequests, 995 SyntacticMatches, 9 SemanticMatches, 1386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51012 ImplicationChecksByTransitivity, 36.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=31, 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, 31 MinimizatonAttempts, 925 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 2294 NumberOfCodeBlocks, 2286 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 2239 ConstructedInterpolants, 0 QuantifiedInterpolants, 602395 SizeOfPredicates, 396 NumberOfNonLiveVariables, 9463 ConjunctsInSsa, 1200 ConjunctsInUnsatCore, 55 InterpolantComputations, 8 PerfectInterpolantSequences, 3086/4685 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/005-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-22-56-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-22-56-670.csv Completed graceful shutdown