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/llreve-bench/smt2/rec__triangular.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:32:27,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:32:27,560 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:32:27,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:32:27,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:32:27,573 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:32:27,574 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:32:27,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:32:27,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:32:27,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:32:27,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:32:27,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:32:27,582 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:32:27,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:32:27,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:32:27,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:32:27,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:32:27,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:32:27,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:32:27,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:32:27,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:32:27,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:32:27,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:32:27,609 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:32:27,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:32:27,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:32:27,615 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:32:27,615 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:32:27,619 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:32:27,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:32:27,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:32:27,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:32:27,620 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:32:27,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:32:27,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:32:27,627 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:32:27,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:32:27,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:32:27,645 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:32:27,646 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:32:27,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:32:27,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:32:27,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:32:27,647 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:32:27,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:32:27,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:32:27,648 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:32:27,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:32:27,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:32:27,648 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:32:27,649 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:32:27,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:32:27,649 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:32:27,652 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:32:27,652 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:32:27,715 INFO ]: Repository-Root is: /tmp [2018-06-22 02:32:27,733 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:32:27,738 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:32:27,740 INFO ]: Initializing SmtParser... [2018-06-22 02:32:27,740 INFO ]: SmtParser initialized [2018-06-22 02:32:27,741 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__triangular.smt2 [2018-06-22 02:32:27,742 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 02:32:27,836 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__triangular.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@530f29ee [2018-06-22 02:32:28,076 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__triangular.smt2 [2018-06-22 02:32:28,082 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:32:28,088 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:32:28,088 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:32:28,088 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:32:28,088 INFO ]: ChcToBoogie initialized [2018-06-22 02:32:28,091 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:32:28" (1/1) ... [2018-06-22 02:32:28,166 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:32:28 Unit [2018-06-22 02:32:28,167 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:32:28,169 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:32:28,169 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:32:28,169 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:32:28,190 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:32:28" (1/1) ... [2018-06-22 02:32:28,190 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:32:28" (1/1) ... [2018-06-22 02:32:28,197 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:32:28" (1/1) ... [2018-06-22 02:32:28,197 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:32:28" (1/1) ... [2018-06-22 02:32:28,202 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:32:28" (1/1) ... [2018-06-22 02:32:28,205 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:32:28" (1/1) ... [2018-06-22 02:32:28,207 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:32:28" (1/1) ... [2018-06-22 02:32:28,209 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:32:28,210 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:32:28,210 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:32:28,210 INFO ]: RCFGBuilder initialized [2018-06-22 02:32:28,211 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:32:28" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:32:28,222 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:32:28,222 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:32:28,222 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:32:28,222 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:32:28,222 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:32:28,222 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 02:32:28,660 INFO ]: Using library mode [2018-06-22 02:32:28,660 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:32:28 BoogieIcfgContainer [2018-06-22 02:32:28,660 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:32:28,663 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:32:28,663 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:32:28,667 INFO ]: TraceAbstraction initialized [2018-06-22 02:32:28,667 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:32:28" (1/3) ... [2018-06-22 02:32:28,668 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d586bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:32:28, skipping insertion in model container [2018-06-22 02:32:28,668 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:32:28" (2/3) ... [2018-06-22 02:32:28,668 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d586bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:32:28, skipping insertion in model container [2018-06-22 02:32:28,668 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:32:28" (3/3) ... [2018-06-22 02:32:28,670 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:32:28,679 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:32:28,688 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:32:28,728 INFO ]: Using default assertion order modulation [2018-06-22 02:32:28,728 INFO ]: Interprodecural is true [2018-06-22 02:32:28,728 INFO ]: Hoare is false [2018-06-22 02:32:28,728 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:32:28,728 INFO ]: Backedges is TWOTRACK [2018-06-22 02:32:28,728 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:32:28,728 INFO ]: Difference is false [2018-06-22 02:32:28,728 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:32:28,728 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:32:28,743 INFO ]: Start isEmpty. Operand 28 states. [2018-06-22 02:32:28,756 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:32:28,757 INFO ]: Found error trace [2018-06-22 02:32:28,758 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:28,758 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:28,763 INFO ]: Analyzing trace with hash 1651176972, now seen corresponding path program 1 times [2018-06-22 02:32:28,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:28,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:28,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:28,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:28,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:28,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:28,916 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:32:28,918 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:28,918 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:32:28,920 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:28,931 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:28,931 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:28,933 INFO ]: Start difference. First operand 28 states. Second operand 4 states. [2018-06-22 02:32:29,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:29,443 INFO ]: Finished difference Result 49 states and 79 transitions. [2018-06-22 02:32:29,443 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:32:29,445 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 02:32:29,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:29,455 INFO ]: With dead ends: 49 [2018-06-22 02:32:29,455 INFO ]: Without dead ends: 49 [2018-06-22 02:32:29,456 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 02:32:29,471 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 02:32:29,502 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-22 02:32:29,505 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 02:32:29,510 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2018-06-22 02:32:29,511 INFO ]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 7 [2018-06-22 02:32:29,511 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:29,511 INFO ]: Abstraction has 49 states and 79 transitions. [2018-06-22 02:32:29,511 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:29,511 INFO ]: Start isEmpty. Operand 49 states and 79 transitions. [2018-06-22 02:32:29,513 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:32:29,513 INFO ]: Found error trace [2018-06-22 02:32:29,513 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:29,513 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:29,513 INFO ]: Analyzing trace with hash 1902538503, now seen corresponding path program 1 times [2018-06-22 02:32:29,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:29,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:29,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:29,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:29,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:29,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:29,588 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:32:29,588 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:29,588 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:32:29,589 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:29,590 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:29,590 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:29,590 INFO ]: Start difference. First operand 49 states and 79 transitions. Second operand 4 states. [2018-06-22 02:32:29,861 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:29,861 INFO ]: Finished difference Result 72 states and 117 transitions. [2018-06-22 02:32:29,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:32:29,861 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:32:29,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:29,864 INFO ]: With dead ends: 72 [2018-06-22 02:32:29,864 INFO ]: Without dead ends: 72 [2018-06-22 02:32:29,865 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 02:32:29,865 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 02:32:29,876 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 02:32:29,876 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 02:32:29,879 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions. [2018-06-22 02:32:29,879 INFO ]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 9 [2018-06-22 02:32:29,879 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:29,879 INFO ]: Abstraction has 72 states and 117 transitions. [2018-06-22 02:32:29,879 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:29,879 INFO ]: Start isEmpty. Operand 72 states and 117 transitions. [2018-06-22 02:32:29,880 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:32:29,880 INFO ]: Found error trace [2018-06-22 02:32:29,880 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:29,880 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:29,880 INFO ]: Analyzing trace with hash -884919162, now seen corresponding path program 1 times [2018-06-22 02:32:29,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:29,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:29,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:29,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:29,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:29,891 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:29,912 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:32:29,912 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:29,912 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:32:29,912 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:29,912 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:29,912 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:29,912 INFO ]: Start difference. First operand 72 states and 117 transitions. Second operand 4 states. [2018-06-22 02:32:30,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:30,055 INFO ]: Finished difference Result 95 states and 155 transitions. [2018-06-22 02:32:30,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:32:30,056 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 02:32:30,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:30,058 INFO ]: With dead ends: 95 [2018-06-22 02:32:30,058 INFO ]: Without dead ends: 95 [2018-06-22 02:32:30,059 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 02:32:30,059 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 02:32:30,071 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-06-22 02:32:30,071 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 02:32:30,075 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 155 transitions. [2018-06-22 02:32:30,075 INFO ]: Start accepts. Automaton has 95 states and 155 transitions. Word has length 10 [2018-06-22 02:32:30,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:30,075 INFO ]: Abstraction has 95 states and 155 transitions. [2018-06-22 02:32:30,075 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:30,075 INFO ]: Start isEmpty. Operand 95 states and 155 transitions. [2018-06-22 02:32:30,076 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:32:30,076 INFO ]: Found error trace [2018-06-22 02:32:30,076 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:30,076 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:30,076 INFO ]: Analyzing trace with hash -844495299, now seen corresponding path program 1 times [2018-06-22 02:32:30,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:30,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:30,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:30,077 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:30,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:30,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:30,144 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:32:30,144 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:30,144 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:32:30,145 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:30,145 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:30,145 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:30,145 INFO ]: Start difference. First operand 95 states and 155 transitions. Second operand 4 states. [2018-06-22 02:32:30,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:30,491 INFO ]: Finished difference Result 171 states and 320 transitions. [2018-06-22 02:32:30,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:32:30,491 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 02:32:30,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:30,498 INFO ]: With dead ends: 171 [2018-06-22 02:32:30,498 INFO ]: Without dead ends: 171 [2018-06-22 02:32:30,499 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:32:30,499 INFO ]: Start minimizeSevpa. Operand 171 states. [2018-06-22 02:32:30,522 INFO ]: Finished minimizeSevpa. Reduced states from 171 to 103. [2018-06-22 02:32:30,522 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 02:32:30,525 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 175 transitions. [2018-06-22 02:32:30,525 INFO ]: Start accepts. Automaton has 103 states and 175 transitions. Word has length 11 [2018-06-22 02:32:30,526 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:30,526 INFO ]: Abstraction has 103 states and 175 transitions. [2018-06-22 02:32:30,526 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:30,526 INFO ]: Start isEmpty. Operand 103 states and 175 transitions. [2018-06-22 02:32:30,527 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:32:30,527 INFO ]: Found error trace [2018-06-22 02:32:30,527 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:30,527 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:30,527 INFO ]: Analyzing trace with hash -411442194, now seen corresponding path program 1 times [2018-06-22 02:32:30,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:30,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:30,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:30,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:30,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:30,537 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:30,590 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:32:30,590 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:30,590 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:32:30,591 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:32:30,591 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:32:30,591 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:32:30,591 INFO ]: Start difference. First operand 103 states and 175 transitions. Second operand 5 states. [2018-06-22 02:32:30,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:30,741 INFO ]: Finished difference Result 175 states and 324 transitions. [2018-06-22 02:32:30,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:32:30,747 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-22 02:32:30,747 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:30,751 INFO ]: With dead ends: 175 [2018-06-22 02:32:30,754 INFO ]: Without dead ends: 167 [2018-06-22 02:32:30,754 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:32:30,755 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 02:32:30,776 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 99. [2018-06-22 02:32:30,776 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 02:32:30,778 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 167 transitions. [2018-06-22 02:32:30,778 INFO ]: Start accepts. Automaton has 99 states and 167 transitions. Word has length 12 [2018-06-22 02:32:30,779 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:30,779 INFO ]: Abstraction has 99 states and 167 transitions. [2018-06-22 02:32:30,779 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:32:30,779 INFO ]: Start isEmpty. Operand 99 states and 167 transitions. [2018-06-22 02:32:30,780 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:32:30,780 INFO ]: Found error trace [2018-06-22 02:32:30,780 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:30,780 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:30,781 INFO ]: Analyzing trace with hash -470957288, now seen corresponding path program 1 times [2018-06-22 02:32:30,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:30,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:30,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:30,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:30,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:30,793 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:30,866 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:32:30,866 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:30,866 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 02:32:30,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:30,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:30,915 INFO ]: Computing forward predicates... [2018-06-22 02:32:30,993 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:32:31,019 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:32:31,019 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-22 02:32:31,020 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:32:31,020 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:32:31,020 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:32:31,020 INFO ]: Start difference. First operand 99 states and 167 transitions. Second operand 9 states. [2018-06-22 02:32:32,002 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:32,003 INFO ]: Finished difference Result 209 states and 481 transitions. [2018-06-22 02:32:32,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:32:32,003 INFO ]: Start accepts. Automaton has 9 states. Word has length 19 [2018-06-22 02:32:32,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:32,008 INFO ]: With dead ends: 209 [2018-06-22 02:32:32,009 INFO ]: Without dead ends: 209 [2018-06-22 02:32:32,009 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:32:32,009 INFO ]: Start minimizeSevpa. Operand 209 states. [2018-06-22 02:32:32,053 INFO ]: Finished minimizeSevpa. Reduced states from 209 to 103. [2018-06-22 02:32:32,053 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 02:32:32,055 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 171 transitions. [2018-06-22 02:32:32,055 INFO ]: Start accepts. Automaton has 103 states and 171 transitions. Word has length 19 [2018-06-22 02:32:32,055 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:32,055 INFO ]: Abstraction has 103 states and 171 transitions. [2018-06-22 02:32:32,055 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:32:32,056 INFO ]: Start isEmpty. Operand 103 states and 171 transitions. [2018-06-22 02:32:32,057 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:32:32,057 INFO ]: Found error trace [2018-06-22 02:32:32,057 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:32,057 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:32,057 INFO ]: Analyzing trace with hash -1716665741, now seen corresponding path program 1 times [2018-06-22 02:32:32,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:32,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:32,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:32,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:32,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:32,075 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:32,269 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 02:32:32,449 WARN ]: Spent 130.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-06-22 02:32:32,506 INFO ]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:32:32,506 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:32,506 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 02:32:32,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:32,545 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:32,547 INFO ]: Computing forward predicates... [2018-06-22 02:32:32,627 INFO ]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:32:32,647 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:32,647 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 02:32:32,647 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:32:32,647 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:32:32,647 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:32:32,648 INFO ]: Start difference. First operand 103 states and 171 transitions. Second operand 7 states. [2018-06-22 02:32:32,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:32,919 INFO ]: Finished difference Result 183 states and 336 transitions. [2018-06-22 02:32:32,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:32:32,920 INFO ]: Start accepts. Automaton has 7 states. Word has length 20 [2018-06-22 02:32:32,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:32,923 INFO ]: With dead ends: 183 [2018-06-22 02:32:32,923 INFO ]: Without dead ends: 183 [2018-06-22 02:32:32,924 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:32:32,924 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-22 02:32:32,937 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 115. [2018-06-22 02:32:32,937 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-22 02:32:32,940 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 187 transitions. [2018-06-22 02:32:32,940 INFO ]: Start accepts. Automaton has 115 states and 187 transitions. Word has length 20 [2018-06-22 02:32:32,940 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:32,940 INFO ]: Abstraction has 115 states and 187 transitions. [2018-06-22 02:32:32,940 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:32:32,940 INFO ]: Start isEmpty. Operand 115 states and 187 transitions. [2018-06-22 02:32:32,943 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 02:32:32,943 INFO ]: Found error trace [2018-06-22 02:32:32,943 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:32,943 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:32,943 INFO ]: Analyzing trace with hash -927904776, now seen corresponding path program 2 times [2018-06-22 02:32:32,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:32,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:32,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:32,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:32,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:32,961 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:33,452 INFO ]: Checked inductivity of 23 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:32:33,452 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:33,452 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 02:32:33,468 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:32:33,524 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:32:33,524 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:33,527 INFO ]: Computing forward predicates... [2018-06-22 02:32:33,558 INFO ]: Checked inductivity of 23 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:32:33,597 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:33,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 02:32:33,598 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:32:33,598 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:32:33,598 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:32:33,598 INFO ]: Start difference. First operand 115 states and 187 transitions. Second operand 7 states. [2018-06-22 02:32:34,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:34,220 INFO ]: Finished difference Result 146 states and 282 transitions. [2018-06-22 02:32:34,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:32:34,221 INFO ]: Start accepts. Automaton has 7 states. Word has length 28 [2018-06-22 02:32:34,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:34,223 INFO ]: With dead ends: 146 [2018-06-22 02:32:34,223 INFO ]: Without dead ends: 144 [2018-06-22 02:32:34,223 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:32:34,223 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-22 02:32:34,234 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 118. [2018-06-22 02:32:34,234 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 02:32:34,235 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 195 transitions. [2018-06-22 02:32:34,236 INFO ]: Start accepts. Automaton has 118 states and 195 transitions. Word has length 28 [2018-06-22 02:32:34,236 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:34,236 INFO ]: Abstraction has 118 states and 195 transitions. [2018-06-22 02:32:34,236 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:32:34,236 INFO ]: Start isEmpty. Operand 118 states and 195 transitions. [2018-06-22 02:32:34,237 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 02:32:34,237 INFO ]: Found error trace [2018-06-22 02:32:34,237 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:34,238 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:34,238 INFO ]: Analyzing trace with hash -147093612, now seen corresponding path program 1 times [2018-06-22 02:32:34,238 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:34,238 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:34,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:34,239 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:34,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:34,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:34,361 INFO ]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:32:34,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:34,361 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 02:32:34,375 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:34,401 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:34,403 INFO ]: Computing forward predicates... [2018-06-22 02:32:34,435 INFO ]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:32:34,460 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:32:34,460 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-06-22 02:32:34,461 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:32:34,461 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:32:34,461 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:32:34,461 INFO ]: Start difference. First operand 118 states and 195 transitions. Second operand 8 states. [2018-06-22 02:32:34,844 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:34,844 INFO ]: Finished difference Result 94 states and 160 transitions. [2018-06-22 02:32:34,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:32:34,844 INFO ]: Start accepts. Automaton has 8 states. Word has length 28 [2018-06-22 02:32:34,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:34,845 INFO ]: With dead ends: 94 [2018-06-22 02:32:34,845 INFO ]: Without dead ends: 90 [2018-06-22 02:32:34,846 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:32:34,846 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 02:32:34,852 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 73. [2018-06-22 02:32:34,852 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 02:32:34,853 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2018-06-22 02:32:34,853 INFO ]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 28 [2018-06-22 02:32:34,853 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:34,853 INFO ]: Abstraction has 73 states and 109 transitions. [2018-06-22 02:32:34,853 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:32:34,853 INFO ]: Start isEmpty. Operand 73 states and 109 transitions. [2018-06-22 02:32:34,854 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 02:32:34,854 INFO ]: Found error trace [2018-06-22 02:32:34,854 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:34,855 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:34,855 INFO ]: Analyzing trace with hash 1887687311, now seen corresponding path program 3 times [2018-06-22 02:32:34,855 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:34,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:34,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:34,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:34,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:34,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:35,096 INFO ]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 02:32:35,096 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:35,097 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 02:32:35,104 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:32:35,167 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:32:35,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:35,170 INFO ]: Computing forward predicates... [2018-06-22 02:32:35,424 INFO ]: Checked inductivity of 27 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:32:35,444 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:35,444 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2018-06-22 02:32:35,445 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:32:35,445 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:32:35,445 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:32:35,445 INFO ]: Start difference. First operand 73 states and 109 transitions. Second operand 14 states. [2018-06-22 02:32:36,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:36,534 INFO ]: Finished difference Result 183 states and 367 transitions. [2018-06-22 02:32:36,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 02:32:36,535 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 02:32:36,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:36,538 INFO ]: With dead ends: 183 [2018-06-22 02:32:36,538 INFO ]: Without dead ends: 181 [2018-06-22 02:32:36,538 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=944, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 02:32:36,539 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-22 02:32:36,550 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 102. [2018-06-22 02:32:36,550 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 02:32:36,551 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 161 transitions. [2018-06-22 02:32:36,551 INFO ]: Start accepts. Automaton has 102 states and 161 transitions. Word has length 29 [2018-06-22 02:32:36,551 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:36,551 INFO ]: Abstraction has 102 states and 161 transitions. [2018-06-22 02:32:36,551 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:32:36,551 INFO ]: Start isEmpty. Operand 102 states and 161 transitions. [2018-06-22 02:32:36,552 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 02:32:36,552 INFO ]: Found error trace [2018-06-22 02:32:36,552 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:36,552 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:36,552 INFO ]: Analyzing trace with hash -1735503723, now seen corresponding path program 1 times [2018-06-22 02:32:36,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:36,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:36,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:36,553 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:36,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:36,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:36,622 INFO ]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 02:32:36,622 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:36,622 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:32:36,623 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:32:36,623 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:32:36,623 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:32:36,623 INFO ]: Start difference. First operand 102 states and 161 transitions. Second operand 3 states. [2018-06-22 02:32:36,661 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:36,661 INFO ]: Finished difference Result 106 states and 165 transitions. [2018-06-22 02:32:36,661 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:32:36,661 INFO ]: Start accepts. Automaton has 3 states. Word has length 29 [2018-06-22 02:32:36,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:36,662 INFO ]: With dead ends: 106 [2018-06-22 02:32:36,662 INFO ]: Without dead ends: 59 [2018-06-22 02:32:36,662 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 02:32:36,662 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 02:32:36,665 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-06-22 02:32:36,665 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 02:32:36,666 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2018-06-22 02:32:36,666 INFO ]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 29 [2018-06-22 02:32:36,666 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:36,666 INFO ]: Abstraction has 59 states and 77 transitions. [2018-06-22 02:32:36,666 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:32:36,666 INFO ]: Start isEmpty. Operand 59 states and 77 transitions. [2018-06-22 02:32:36,667 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 02:32:36,667 INFO ]: Found error trace [2018-06-22 02:32:36,667 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:36,667 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:36,667 INFO ]: Analyzing trace with hash -1613127204, now seen corresponding path program 4 times [2018-06-22 02:32:36,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:36,667 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:36,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:36,668 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:36,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:36,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:36,930 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 02:32:37,077 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 02:32:37,097 INFO ]: Checked inductivity of 32 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 02:32:37,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:37,098 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) [2018-06-22 02:32:37,113 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:37,141 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:32:37,141 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:37,143 INFO ]: Computing forward predicates... [2018-06-22 02:32:37,207 INFO ]: Checked inductivity of 32 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 02:32:37,240 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:37,240 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 02:32:37,240 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:32:37,240 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:32:37,240 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:32:37,241 INFO ]: Start difference. First operand 59 states and 77 transitions. Second operand 10 states. [2018-06-22 02:32:37,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:37,411 INFO ]: Finished difference Result 83 states and 119 transitions. [2018-06-22 02:32:37,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:32:37,411 INFO ]: Start accepts. Automaton has 10 states. Word has length 30 [2018-06-22 02:32:37,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:37,412 INFO ]: With dead ends: 83 [2018-06-22 02:32:37,412 INFO ]: Without dead ends: 83 [2018-06-22 02:32:37,413 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:32:37,413 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 02:32:37,418 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 77. [2018-06-22 02:32:37,418 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 02:32:37,419 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2018-06-22 02:32:37,419 INFO ]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 30 [2018-06-22 02:32:37,419 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:37,419 INFO ]: Abstraction has 77 states and 107 transitions. [2018-06-22 02:32:37,419 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:32:37,419 INFO ]: Start isEmpty. Operand 77 states and 107 transitions. [2018-06-22 02:32:37,421 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 02:32:37,421 INFO ]: Found error trace [2018-06-22 02:32:37,421 INFO ]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:37,421 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:37,421 INFO ]: Analyzing trace with hash 132292956, now seen corresponding path program 5 times [2018-06-22 02:32:37,421 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:37,421 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:37,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:37,422 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:37,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:37,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:37,553 INFO ]: Checked inductivity of 107 backedges. 49 proven. 19 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 02:32:37,553 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:37,553 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 02:32:37,561 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:32:37,604 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 02:32:37,604 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:37,607 INFO ]: Computing forward predicates... [2018-06-22 02:32:37,697 INFO ]: Checked inductivity of 107 backedges. 69 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 02:32:37,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:37,735 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2018-06-22 02:32:37,735 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:32:37,735 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:32:37,735 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:32:37,736 INFO ]: Start difference. First operand 77 states and 107 transitions. Second operand 14 states. [2018-06-22 02:32:38,286 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:38,287 INFO ]: Finished difference Result 82 states and 120 transitions. [2018-06-22 02:32:38,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 02:32:38,287 INFO ]: Start accepts. Automaton has 14 states. Word has length 48 [2018-06-22 02:32:38,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:38,288 INFO ]: With dead ends: 82 [2018-06-22 02:32:38,288 INFO ]: Without dead ends: 82 [2018-06-22 02:32:38,289 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 02:32:38,289 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 02:32:38,294 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-06-22 02:32:38,294 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 02:32:38,297 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2018-06-22 02:32:38,297 INFO ]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 48 [2018-06-22 02:32:38,298 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:38,298 INFO ]: Abstraction has 80 states and 116 transitions. [2018-06-22 02:32:38,298 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:32:38,298 INFO ]: Start isEmpty. Operand 80 states and 116 transitions. [2018-06-22 02:32:38,299 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 02:32:38,299 INFO ]: Found error trace [2018-06-22 02:32:38,299 INFO ]: trace histogram [7, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:38,299 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:38,299 INFO ]: Analyzing trace with hash -183919982, now seen corresponding path program 6 times [2018-06-22 02:32:38,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:38,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:38,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:38,300 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:38,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:38,332 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:38,512 INFO ]: Checked inductivity of 128 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 02:32:38,512 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:38,512 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 02:32:38,519 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:32:38,602 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 02:32:38,602 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:38,607 INFO ]: Computing forward predicates... [2018-06-22 02:32:38,867 INFO ]: Checked inductivity of 128 backedges. 59 proven. 43 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 02:32:38,887 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:38,887 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2018-06-22 02:32:38,887 INFO ]: Interpolant automaton has 24 states [2018-06-22 02:32:38,887 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 02:32:38,888 INFO ]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:32:38,888 INFO ]: Start difference. First operand 80 states and 116 transitions. Second operand 24 states. [2018-06-22 02:32:41,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:41,296 INFO ]: Finished difference Result 103 states and 156 transitions. [2018-06-22 02:32:41,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 02:32:41,296 INFO ]: Start accepts. Automaton has 24 states. Word has length 50 [2018-06-22 02:32:41,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:41,297 INFO ]: With dead ends: 103 [2018-06-22 02:32:41,297 INFO ]: Without dead ends: 103 [2018-06-22 02:32:41,299 INFO ]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=920, Invalid=4630, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 02:32:41,299 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 02:32:41,305 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-06-22 02:32:41,305 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 02:32:41,306 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 108 transitions. [2018-06-22 02:32:41,306 INFO ]: Start accepts. Automaton has 82 states and 108 transitions. Word has length 50 [2018-06-22 02:32:41,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:41,306 INFO ]: Abstraction has 82 states and 108 transitions. [2018-06-22 02:32:41,306 INFO ]: Interpolant automaton has 24 states. [2018-06-22 02:32:41,306 INFO ]: Start isEmpty. Operand 82 states and 108 transitions. [2018-06-22 02:32:41,307 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 02:32:41,307 INFO ]: Found error trace [2018-06-22 02:32:41,307 INFO ]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:41,308 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:41,312 INFO ]: Analyzing trace with hash -798048914, now seen corresponding path program 7 times [2018-06-22 02:32:41,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:41,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:41,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:41,313 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:41,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:41,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:41,465 INFO ]: Checked inductivity of 153 backedges. 49 proven. 27 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-22 02:32:41,465 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:41,465 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 02:32:41,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:41,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:41,519 INFO ]: Computing forward predicates... [2018-06-22 02:32:41,763 INFO ]: Checked inductivity of 153 backedges. 55 proven. 21 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-22 02:32:41,789 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:41,789 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-22 02:32:41,790 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:32:41,790 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:32:41,790 INFO ]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:32:41,790 INFO ]: Start difference. First operand 82 states and 108 transitions. Second operand 16 states. [2018-06-22 02:32:42,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:42,032 INFO ]: Finished difference Result 97 states and 141 transitions. [2018-06-22 02:32:42,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:32:42,032 INFO ]: Start accepts. Automaton has 16 states. Word has length 52 [2018-06-22 02:32:42,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:42,034 INFO ]: With dead ends: 97 [2018-06-22 02:32:42,034 INFO ]: Without dead ends: 97 [2018-06-22 02:32:42,034 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2018-06-22 02:32:42,034 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 02:32:42,038 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 85. [2018-06-22 02:32:42,039 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 02:32:42,039 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-06-22 02:32:42,039 INFO ]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 52 [2018-06-22 02:32:42,040 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:42,040 INFO ]: Abstraction has 85 states and 111 transitions. [2018-06-22 02:32:42,040 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:32:42,040 INFO ]: Start isEmpty. Operand 85 states and 111 transitions. [2018-06-22 02:32:42,041 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 02:32:42,041 INFO ]: Found error trace [2018-06-22 02:32:42,041 INFO ]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:42,042 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:42,042 INFO ]: Analyzing trace with hash 1028395741, now seen corresponding path program 8 times [2018-06-22 02:32:42,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:42,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:42,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:42,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:42,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:42,061 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:42,235 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 02:32:42,387 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 02:32:42,448 INFO ]: Checked inductivity of 167 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 02:32:42,448 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:42,448 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 02:32:42,454 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:32:42,491 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:32:42,491 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:42,495 INFO ]: Computing forward predicates... [2018-06-22 02:32:42,816 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 02:32:43,000 INFO ]: Checked inductivity of 167 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 02:32:43,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:43,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-06-22 02:32:43,021 INFO ]: Interpolant automaton has 18 states [2018-06-22 02:32:43,021 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 02:32:43,021 INFO ]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:32:43,021 INFO ]: Start difference. First operand 85 states and 111 transitions. Second operand 18 states. [2018-06-22 02:32:43,339 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:43,339 INFO ]: Finished difference Result 127 states and 168 transitions. [2018-06-22 02:32:43,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 02:32:43,339 INFO ]: Start accepts. Automaton has 18 states. Word has length 53 [2018-06-22 02:32:43,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:43,341 INFO ]: With dead ends: 127 [2018-06-22 02:32:43,341 INFO ]: Without dead ends: 127 [2018-06-22 02:32:43,342 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2018-06-22 02:32:43,342 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-22 02:32:43,365 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 121. [2018-06-22 02:32:43,365 INFO ]: Start removeUnreachable. Operand 121 states. [2018-06-22 02:32:43,366 INFO ]: Finished removeUnreachable. Reduced from 121 states to 121 states and 159 transitions. [2018-06-22 02:32:43,367 INFO ]: Start accepts. Automaton has 121 states and 159 transitions. Word has length 53 [2018-06-22 02:32:43,367 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:43,367 INFO ]: Abstraction has 121 states and 159 transitions. [2018-06-22 02:32:43,367 INFO ]: Interpolant automaton has 18 states. [2018-06-22 02:32:43,367 INFO ]: Start isEmpty. Operand 121 states and 159 transitions. [2018-06-22 02:32:43,373 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 02:32:43,373 INFO ]: Found error trace [2018-06-22 02:32:43,373 INFO ]: trace histogram [22, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:43,373 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:43,374 INFO ]: Analyzing trace with hash 1634392669, now seen corresponding path program 9 times [2018-06-22 02:32:43,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:43,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:43,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:43,374 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:43,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:43,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:44,312 INFO ]: Checked inductivity of 701 backedges. 245 proven. 152 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2018-06-22 02:32:44,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:44,312 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) [2018-06-22 02:32:44,329 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:44,397 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 02:32:44,397 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:44,404 INFO ]: Computing forward predicates... [2018-06-22 02:32:44,674 INFO ]: Checked inductivity of 701 backedges. 349 proven. 30 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-06-22 02:32:44,695 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:44,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 27 [2018-06-22 02:32:44,695 INFO ]: Interpolant automaton has 27 states [2018-06-22 02:32:44,696 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 02:32:44,696 INFO ]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-06-22 02:32:44,696 INFO ]: Start difference. First operand 121 states and 159 transitions. Second operand 27 states. [2018-06-22 02:32:48,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:48,299 INFO ]: Finished difference Result 571 states and 1133 transitions. [2018-06-22 02:32:48,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-06-22 02:32:48,300 INFO ]: Start accepts. Automaton has 27 states. Word has length 97 [2018-06-22 02:32:48,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:48,313 INFO ]: With dead ends: 571 [2018-06-22 02:32:48,313 INFO ]: Without dead ends: 571 [2018-06-22 02:32:48,317 INFO ]: 0 DeclaredPredicates, 184 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=905, Invalid=7105, Unknown=0, NotChecked=0, Total=8010 [2018-06-22 02:32:48,317 INFO ]: Start minimizeSevpa. Operand 571 states. [2018-06-22 02:32:48,360 INFO ]: Finished minimizeSevpa. Reduced states from 571 to 417. [2018-06-22 02:32:48,360 INFO ]: Start removeUnreachable. Operand 417 states. [2018-06-22 02:32:48,369 INFO ]: Finished removeUnreachable. Reduced from 417 states to 417 states and 743 transitions. [2018-06-22 02:32:48,369 INFO ]: Start accepts. Automaton has 417 states and 743 transitions. Word has length 97 [2018-06-22 02:32:48,370 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:48,370 INFO ]: Abstraction has 417 states and 743 transitions. [2018-06-22 02:32:48,370 INFO ]: Interpolant automaton has 27 states. [2018-06-22 02:32:48,370 INFO ]: Start isEmpty. Operand 417 states and 743 transitions. [2018-06-22 02:32:48,380 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 02:32:48,380 INFO ]: Found error trace [2018-06-22 02:32:48,380 INFO ]: trace histogram [26, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:48,381 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:48,381 INFO ]: Analyzing trace with hash 2130758729, now seen corresponding path program 10 times [2018-06-22 02:32:48,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:48,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:48,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:48,381 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:48,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:48,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:48,708 INFO ]: Checked inductivity of 831 backedges. 343 proven. 121 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-06-22 02:32:48,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:48,708 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 02:32:48,714 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:32:48,801 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:32:48,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:48,807 INFO ]: Computing forward predicates... [2018-06-22 02:32:49,074 INFO ]: Checked inductivity of 831 backedges. 499 proven. 45 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-06-22 02:32:49,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:49,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 25 [2018-06-22 02:32:49,107 INFO ]: Interpolant automaton has 25 states [2018-06-22 02:32:49,107 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 02:32:49,107 INFO ]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:32:49,108 INFO ]: Start difference. First operand 417 states and 743 transitions. Second operand 25 states. [2018-06-22 02:32:50,814 WARN ]: Spent 233.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2018-06-22 02:32:52,254 WARN ]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2018-06-22 02:32:53,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:53,027 INFO ]: Finished difference Result 516 states and 976 transitions. [2018-06-22 02:32:53,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-06-22 02:32:53,027 INFO ]: Start accepts. Automaton has 25 states. Word has length 101 [2018-06-22 02:32:53,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:53,037 INFO ]: With dead ends: 516 [2018-06-22 02:32:53,037 INFO ]: Without dead ends: 516 [2018-06-22 02:32:53,039 INFO ]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1296, Invalid=7076, Unknown=0, NotChecked=0, Total=8372 [2018-06-22 02:32:53,040 INFO ]: Start minimizeSevpa. Operand 516 states. [2018-06-22 02:32:53,074 INFO ]: Finished minimizeSevpa. Reduced states from 516 to 465. [2018-06-22 02:32:53,074 INFO ]: Start removeUnreachable. Operand 465 states. [2018-06-22 02:32:53,084 INFO ]: Finished removeUnreachable. Reduced from 465 states to 465 states and 886 transitions. [2018-06-22 02:32:53,084 INFO ]: Start accepts. Automaton has 465 states and 886 transitions. Word has length 101 [2018-06-22 02:32:53,085 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:53,085 INFO ]: Abstraction has 465 states and 886 transitions. [2018-06-22 02:32:53,085 INFO ]: Interpolant automaton has 25 states. [2018-06-22 02:32:53,085 INFO ]: Start isEmpty. Operand 465 states and 886 transitions. [2018-06-22 02:32:53,098 INFO ]: Finished isEmpty. Found accepting run of length 105 [2018-06-22 02:32:53,098 INFO ]: Found error trace [2018-06-22 02:32:53,099 INFO ]: trace histogram [29, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:53,099 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:53,099 INFO ]: Analyzing trace with hash -1724525732, now seen corresponding path program 11 times [2018-06-22 02:32:53,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:53,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:53,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:53,099 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:53,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:53,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:54,177 INFO ]: Checked inductivity of 939 backedges. 393 proven. 132 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-06-22 02:32:54,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:54,177 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 02:32:54,185 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:32:54,296 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 02:32:54,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:54,302 INFO ]: Computing forward predicates... [2018-06-22 02:32:54,813 INFO ]: Checked inductivity of 939 backedges. 340 proven. 189 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2018-06-22 02:32:54,839 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:54,839 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 30 [2018-06-22 02:32:54,840 INFO ]: Interpolant automaton has 30 states [2018-06-22 02:32:54,840 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 02:32:54,840 INFO ]: CoverageRelationStatistics Valid=67, Invalid=803, Unknown=0, NotChecked=0, Total=870 [2018-06-22 02:32:54,840 INFO ]: Start difference. First operand 465 states and 886 transitions. Second operand 30 states. [2018-06-22 02:32:56,140 WARN ]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 02:32:59,111 WARN ]: Spent 190.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 13 [2018-06-22 02:33:02,043 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:33:02,043 INFO ]: Finished difference Result 1026 states and 3104 transitions. [2018-06-22 02:33:02,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-06-22 02:33:02,046 INFO ]: Start accepts. Automaton has 30 states. Word has length 104 [2018-06-22 02:33:02,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:33:02,086 INFO ]: With dead ends: 1026 [2018-06-22 02:33:02,086 INFO ]: Without dead ends: 1026 [2018-06-22 02:33:02,090 INFO ]: 0 DeclaredPredicates, 228 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4837 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1750, Invalid=13502, Unknown=0, NotChecked=0, Total=15252 [2018-06-22 02:33:02,091 INFO ]: Start minimizeSevpa. Operand 1026 states. [2018-06-22 02:33:02,293 INFO ]: Finished minimizeSevpa. Reduced states from 1026 to 733. [2018-06-22 02:33:02,293 INFO ]: Start removeUnreachable. Operand 733 states. [2018-06-22 02:33:02,308 INFO ]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1514 transitions. [2018-06-22 02:33:02,308 INFO ]: Start accepts. Automaton has 733 states and 1514 transitions. Word has length 104 [2018-06-22 02:33:02,308 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:33:02,308 INFO ]: Abstraction has 733 states and 1514 transitions. [2018-06-22 02:33:02,308 INFO ]: Interpolant automaton has 30 states. [2018-06-22 02:33:02,308 INFO ]: Start isEmpty. Operand 733 states and 1514 transitions. [2018-06-22 02:33:02,324 INFO ]: Finished isEmpty. Found accepting run of length 107 [2018-06-22 02:33:02,324 INFO ]: Found error trace [2018-06-22 02:33:02,324 INFO ]: trace histogram [31, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:33:02,325 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:33:02,325 INFO ]: Analyzing trace with hash 427267090, now seen corresponding path program 12 times [2018-06-22 02:33:02,325 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:33:02,325 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:33:02,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:33:02,326 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:33:02,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:33:02,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:33:03,295 INFO ]: Checked inductivity of 1016 backedges. 218 proven. 154 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2018-06-22 02:33:03,295 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:33:03,295 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 02:33:03,357 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:33:03,496 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 02:33:03,497 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:33:03,502 INFO ]: Computing forward predicates... [2018-06-22 02:33:03,958 INFO ]: Checked inductivity of 1016 backedges. 349 proven. 118 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-06-22 02:33:03,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:33:03,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2018-06-22 02:33:03,980 INFO ]: Interpolant automaton has 32 states [2018-06-22 02:33:03,980 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 02:33:03,980 INFO ]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2018-06-22 02:33:03,980 INFO ]: Start difference. First operand 733 states and 1514 transitions. Second operand 32 states. [2018-06-22 02:33:11,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:33:11,131 INFO ]: Finished difference Result 2178 states and 7477 transitions. [2018-06-22 02:33:11,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-06-22 02:33:11,131 INFO ]: Start accepts. Automaton has 32 states. Word has length 106 [2018-06-22 02:33:11,131 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:33:11,241 INFO ]: With dead ends: 2178 [2018-06-22 02:33:11,241 INFO ]: Without dead ends: 2176 [2018-06-22 02:33:11,244 INFO ]: 0 DeclaredPredicates, 238 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2384, Invalid=13872, Unknown=0, NotChecked=0, Total=16256 [2018-06-22 02:33:11,245 INFO ]: Start minimizeSevpa. Operand 2176 states. [2018-06-22 02:33:11,476 INFO ]: Finished minimizeSevpa. Reduced states from 2176 to 1416. [2018-06-22 02:33:11,476 INFO ]: Start removeUnreachable. Operand 1416 states. [2018-06-22 02:33:11,508 INFO ]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2877 transitions. [2018-06-22 02:33:11,508 INFO ]: Start accepts. Automaton has 1416 states and 2877 transitions. Word has length 106 [2018-06-22 02:33:11,509 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:33:11,509 INFO ]: Abstraction has 1416 states and 2877 transitions. [2018-06-22 02:33:11,509 INFO ]: Interpolant automaton has 32 states. [2018-06-22 02:33:11,509 INFO ]: Start isEmpty. Operand 1416 states and 2877 transitions. [2018-06-22 02:33:11,544 INFO ]: Finished isEmpty. Found accepting run of length 108 [2018-06-22 02:33:11,544 INFO ]: Found error trace [2018-06-22 02:33:11,544 INFO ]: trace histogram [32, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:33:11,544 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:33:11,544 INFO ]: Analyzing trace with hash 358486201, now seen corresponding path program 13 times [2018-06-22 02:33:11,544 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:33:11,544 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:33:11,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:33:11,546 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:33:11,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:33:11,583 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:33:12,538 INFO ]: Checked inductivity of 1056 backedges. 251 proven. 161 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2018-06-22 02:33:12,538 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:33:12,538 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 02:33:12,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:33:12,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:33:12,661 INFO ]: Computing forward predicates... [2018-06-22 02:33:13,198 INFO ]: Checked inductivity of 1056 backedges. 458 proven. 91 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2018-06-22 02:33:13,219 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:33:13,219 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 30 [2018-06-22 02:33:13,219 INFO ]: Interpolant automaton has 30 states [2018-06-22 02:33:13,219 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 02:33:13,219 INFO ]: CoverageRelationStatistics Valid=67, Invalid=803, Unknown=0, NotChecked=0, Total=870 [2018-06-22 02:33:13,220 INFO ]: Start difference. First operand 1416 states and 2877 transitions. Second operand 30 states. [2018-06-22 02:33:18,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:33:18,564 INFO ]: Finished difference Result 1616 states and 3475 transitions. [2018-06-22 02:33:18,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-06-22 02:33:18,564 INFO ]: Start accepts. Automaton has 30 states. Word has length 107 [2018-06-22 02:33:18,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:33:18,611 INFO ]: With dead ends: 1616 [2018-06-22 02:33:18,611 INFO ]: Without dead ends: 1616 [2018-06-22 02:33:18,612 INFO ]: 0 DeclaredPredicates, 216 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2133, Invalid=12147, Unknown=0, NotChecked=0, Total=14280 [2018-06-22 02:33:18,612 INFO ]: Start minimizeSevpa. Operand 1616 states. [2018-06-22 02:33:18,727 INFO ]: Finished minimizeSevpa. Reduced states from 1616 to 1125. [2018-06-22 02:33:18,727 INFO ]: Start removeUnreachable. Operand 1125 states. [2018-06-22 02:33:18,751 INFO ]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2574 transitions. [2018-06-22 02:33:18,751 INFO ]: Start accepts. Automaton has 1125 states and 2574 transitions. Word has length 107 [2018-06-22 02:33:18,751 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:33:18,751 INFO ]: Abstraction has 1125 states and 2574 transitions. [2018-06-22 02:33:18,751 INFO ]: Interpolant automaton has 30 states. [2018-06-22 02:33:18,751 INFO ]: Start isEmpty. Operand 1125 states and 2574 transitions. [2018-06-22 02:33:18,790 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 02:33:18,790 INFO ]: Found error trace [2018-06-22 02:33:18,790 INFO ]: trace histogram [34, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:33:18,790 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:33:18,790 INFO ]: Analyzing trace with hash 256596061, now seen corresponding path program 14 times [2018-06-22 02:33:18,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:33:18,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:33:18,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:33:18,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:33:18,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:33:18,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:33:19,709 INFO ]: Checked inductivity of 1139 backedges. 291 proven. 171 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2018-06-22 02:33:19,709 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:33:19,709 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 02:33:19,715 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:33:19,801 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:33:19,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:33:19,807 INFO ]: Computing forward predicates... [2018-06-22 02:33:20,098 INFO ]: Checked inductivity of 1139 backedges. 283 proven. 98 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2018-06-22 02:33:20,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:33:20,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 29 [2018-06-22 02:33:20,120 INFO ]: Interpolant automaton has 29 states [2018-06-22 02:33:20,120 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 02:33:20,120 INFO ]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2018-06-22 02:33:20,120 INFO ]: Start difference. First operand 1125 states and 2574 transitions. Second operand 29 states. [2018-06-22 02:33:22,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:33:22,596 INFO ]: Finished difference Result 1199 states and 2713 transitions. [2018-06-22 02:33:22,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 02:33:22,598 INFO ]: Start accepts. Automaton has 29 states. Word has length 109 [2018-06-22 02:33:22,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:33:22,641 INFO ]: With dead ends: 1199 [2018-06-22 02:33:22,641 INFO ]: Without dead ends: 1199 [2018-06-22 02:33:22,642 INFO ]: 0 DeclaredPredicates, 178 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1320, Invalid=4686, Unknown=0, NotChecked=0, Total=6006 [2018-06-22 02:33:22,643 INFO ]: Start minimizeSevpa. Operand 1199 states. [2018-06-22 02:33:22,737 INFO ]: Finished minimizeSevpa. Reduced states from 1199 to 1131. [2018-06-22 02:33:22,737 INFO ]: Start removeUnreachable. Operand 1131 states. [2018-06-22 02:33:22,761 INFO ]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 2580 transitions. [2018-06-22 02:33:22,761 INFO ]: Start accepts. Automaton has 1131 states and 2580 transitions. Word has length 109 [2018-06-22 02:33:22,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:33:22,761 INFO ]: Abstraction has 1131 states and 2580 transitions. [2018-06-22 02:33:22,761 INFO ]: Interpolant automaton has 29 states. [2018-06-22 02:33:22,761 INFO ]: Start isEmpty. Operand 1131 states and 2580 transitions. [2018-06-22 02:33:22,800 INFO ]: Finished isEmpty. Found accepting run of length 111 [2018-06-22 02:33:22,801 INFO ]: Found error trace [2018-06-22 02:33:22,801 INFO ]: trace histogram [35, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:33:22,801 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:33:22,801 INFO ]: Analyzing trace with hash -637348402, now seen corresponding path program 15 times [2018-06-22 02:33:22,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:33:22,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:33:22,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:33:22,801 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:33:22,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:33:22,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:33:24,113 INFO ]: Checked inductivity of 1182 backedges. 325 proven. 180 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2018-06-22 02:33:24,113 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:33:24,113 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 02:33:24,119 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:33:24,277 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 02:33:24,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:33:24,286 INFO ]: Computing forward predicates... [2018-06-22 02:33:25,165 INFO ]: Checked inductivity of 1182 backedges. 441 proven. 164 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2018-06-22 02:33:25,187 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:33:25,187 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2018-06-22 02:33:25,187 INFO ]: Interpolant automaton has 38 states [2018-06-22 02:33:25,187 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 02:33:25,188 INFO ]: CoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 02:33:25,188 INFO ]: Start difference. First operand 1131 states and 2580 transitions. Second operand 38 states. Received shutdown request... [2018-06-22 02:33:27,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 02:33:27,914 WARN ]: Verification canceled [2018-06-22 02:33:27,919 WARN ]: Timeout [2018-06-22 02:33:27,919 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:33:27 BoogieIcfgContainer [2018-06-22 02:33:27,919 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:33:27,920 INFO ]: Toolchain (without parser) took 59837.29 ms. Allocated memory was 306.2 MB in the beginning and 921.2 MB in the end (delta: 615.0 MB). Free memory was 261.6 MB in the beginning and 380.7 MB in the end (delta: -119.2 MB). Peak memory consumption was 495.8 MB. Max. memory is 3.6 GB. [2018-06-22 02:33:27,921 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:33:27,921 INFO ]: ChcToBoogie took 80.12 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:33:27,922 INFO ]: Boogie Preprocessor took 40.55 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 257.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 02:33:27,922 INFO ]: RCFGBuilder took 450.48 ms. Allocated memory is still 306.2 MB. Free memory was 257.6 MB in the beginning and 245.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:33:27,922 INFO ]: TraceAbstraction took 59255.74 ms. Allocated memory was 306.2 MB in the beginning and 921.2 MB in the end (delta: 615.0 MB). Free memory was 244.6 MB in the beginning and 380.7 MB in the end (delta: -136.2 MB). Peak memory consumption was 478.8 MB. Max. memory is 3.6 GB. [2018-06-22 02:33:27,926 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 80.12 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 40.55 ms. Allocated memory is still 306.2 MB. Free memory was 258.6 MB in the beginning and 257.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 450.48 ms. Allocated memory is still 306.2 MB. Free memory was 257.6 MB in the beginning and 245.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59255.74 ms. Allocated memory was 306.2 MB in the beginning and 921.2 MB in the end (delta: 615.0 MB). Free memory was 244.6 MB in the beginning and 380.7 MB in the end (delta: -136.2 MB). Peak memory consumption was 478.8 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 constructing difference of abstraction (1131states) and interpolant automaton (currently 54 states, 38 states before enhancement), while ReachableStatesComputation was computing reachable states (254 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. TIMEOUT Result, 59.2s OverallTime, 23 OverallIterations, 35 TraceHistogramMax, 41.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1070 SDtfs, 2096 SDslu, 6509 SDs, 0 SdLazy, 20828 SolverSat, 2169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2043 GetRequests, 1040 SyntacticMatches, 36 SemanticMatches, 967 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21616 ImplicationChecksByTransitivity, 32.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1416occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 2296 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 2260 NumberOfCodeBlocks, 2203 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 2220 ConstructedInterpolants, 10 QuantifiedInterpolants, 489590 SizeOfPredicates, 69 NumberOfNonLiveVariables, 7574 ConjunctsInSsa, 545 ConjunctsInUnsatCore, 40 InterpolantComputations, 8 PerfectInterpolantSequences, 13060/15082 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/rec__triangular.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-33-27-936.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__triangular.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-33-27-936.csv Completed graceful shutdown