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_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:59:57,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:59:57,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:59:57,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:59:57,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:59:57,795 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:59:57,796 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:59:57,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:59:57,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:59:57,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:59:57,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:59:57,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:59:57,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:59:57,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:59:57,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:59:57,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:59:57,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:59:57,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:59:57,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:59:57,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:59:57,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:59:57,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:59:57,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:59:57,829 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:59:57,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:59:57,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:59:57,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:59:57,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:59:57,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:59:57,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:59:57,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:59:57,839 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:59:57,840 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:59:57,840 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:59:57,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:59:57,841 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:59:57,860 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:59:57,861 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:59:57,861 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:59:57,861 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:59:57,863 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:59:57,863 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:59:57,863 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:59:57,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:59:57,864 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:59:57,864 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:59:57,864 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:59:57,864 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:59:57,865 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:59:57,865 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:59:57,865 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:59:57,865 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:59:57,865 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:59:57,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:59:57,868 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:59:57,870 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:59:57,870 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:59:57,916 INFO ]: Repository-Root is: /tmp [2018-06-22 11:59:57,932 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:59:57,938 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:59:57,939 INFO ]: Initializing SmtParser... [2018-06-22 11:59:57,940 INFO ]: SmtParser initialized [2018-06-22 11:59:57,941 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 [2018-06-22 11:59:57,942 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 11:59:58,032 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@7b425343 [2018-06-22 11:59:58,252 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 [2018-06-22 11:59:58,257 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:59:58,263 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:59:58,263 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:59:58,263 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:59:58,263 INFO ]: ChcToBoogie initialized [2018-06-22 11:59:58,266 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:59:58" (1/1) ... [2018-06-22 11:59:58,322 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:58 Unit [2018-06-22 11:59:58,323 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:59:58,323 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:59:58,323 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:59:58,323 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:59:58,338 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:58" (1/1) ... [2018-06-22 11:59:58,338 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:58" (1/1) ... [2018-06-22 11:59:58,345 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:58" (1/1) ... [2018-06-22 11:59:58,345 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:58" (1/1) ... [2018-06-22 11:59:58,348 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:58" (1/1) ... [2018-06-22 11:59:58,350 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:58" (1/1) ... [2018-06-22 11:59:58,351 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:58" (1/1) ... [2018-06-22 11:59:58,353 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:59:58,353 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:59:58,353 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:59:58,353 INFO ]: RCFGBuilder initialized [2018-06-22 11:59:58,354 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:58" (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 11:59:58,370 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:59:58,371 INFO ]: Found specification of procedure False [2018-06-22 11:59:58,371 INFO ]: Found implementation of procedure False [2018-06-22 11:59:58,371 INFO ]: Specification and implementation of procedure INV_MAIN_13 given in one single declaration [2018-06-22 11:59:58,371 INFO ]: Found specification of procedure INV_MAIN_13 [2018-06-22 11:59:58,371 INFO ]: Found implementation of procedure INV_MAIN_13 [2018-06-22 11:59:58,371 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:59:58,371 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:59:58,371 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:59:58,371 INFO ]: Specification and implementation of procedure INV_MAIN_23 given in one single declaration [2018-06-22 11:59:58,371 INFO ]: Found specification of procedure INV_MAIN_23 [2018-06-22 11:59:58,371 INFO ]: Found implementation of procedure INV_MAIN_23 [2018-06-22 11:59:58,371 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:59:58,372 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:59:58,372 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:59:58,794 INFO ]: Using library mode [2018-06-22 11:59:58,795 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:59:58 BoogieIcfgContainer [2018-06-22 11:59:58,795 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:59:58,796 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:59:58,796 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:59:58,799 INFO ]: TraceAbstraction initialized [2018-06-22 11:59:58,799 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:59:58" (1/3) ... [2018-06-22 11:59:58,800 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f505f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:59:58, skipping insertion in model container [2018-06-22 11:59:58,800 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:58" (2/3) ... [2018-06-22 11:59:58,800 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f505f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:59:58, skipping insertion in model container [2018-06-22 11:59:58,800 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:59:58" (3/3) ... [2018-06-22 11:59:58,802 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:59:58,811 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:59:58,821 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:59:58,870 INFO ]: Using default assertion order modulation [2018-06-22 11:59:58,871 INFO ]: Interprodecural is true [2018-06-22 11:59:58,871 INFO ]: Hoare is false [2018-06-22 11:59:58,871 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:59:58,871 INFO ]: Backedges is TWOTRACK [2018-06-22 11:59:58,871 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:59:58,871 INFO ]: Difference is false [2018-06-22 11:59:58,871 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:59:58,871 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:59:58,897 INFO ]: Start isEmpty. Operand 27 states. [2018-06-22 11:59:58,919 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:58,920 INFO ]: Found error trace [2018-06-22 11:59:58,921 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:58,921 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:58,926 INFO ]: Analyzing trace with hash -1062758742, now seen corresponding path program 1 times [2018-06-22 11:59:58,928 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:58,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:58,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:58,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:58,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:59,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:59,132 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:59:59,134 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:59,134 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:59:59,135 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:59:59,145 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:59:59,146 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:59:59,147 INFO ]: Start difference. First operand 27 states. Second operand 6 states. [2018-06-22 11:59:59,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:59,473 INFO ]: Finished difference Result 31 states and 51 transitions. [2018-06-22 11:59:59,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:59:59,474 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:59:59,475 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:59,491 INFO ]: With dead ends: 31 [2018-06-22 11:59:59,491 INFO ]: Without dead ends: 31 [2018-06-22 11:59:59,493 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:59:59,508 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:59:59,545 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:59:59,547 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:59:59,548 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. [2018-06-22 11:59:59,549 INFO ]: Start accepts. Automaton has 29 states and 46 transitions. Word has length 13 [2018-06-22 11:59:59,549 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:59,549 INFO ]: Abstraction has 29 states and 46 transitions. [2018-06-22 11:59:59,549 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:59:59,549 INFO ]: Start isEmpty. Operand 29 states and 46 transitions. [2018-06-22 11:59:59,552 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:59,552 INFO ]: Found error trace [2018-06-22 11:59:59,552 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:59,552 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:59,552 INFO ]: Analyzing trace with hash -290638279, now seen corresponding path program 1 times [2018-06-22 11:59:59,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:59,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:59,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:59,553 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:59,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:59,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:59,698 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:59:59,698 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:59,698 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:59,699 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:59,699 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:59,699 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:59,700 INFO ]: Start difference. First operand 29 states and 46 transitions. Second operand 5 states. [2018-06-22 11:59:59,901 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:59,901 INFO ]: Finished difference Result 33 states and 55 transitions. [2018-06-22 11:59:59,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:59:59,901 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:59:59,901 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:59,903 INFO ]: With dead ends: 33 [2018-06-22 11:59:59,903 INFO ]: Without dead ends: 33 [2018-06-22 11:59:59,904 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:59,904 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:59:59,911 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 11:59:59,911 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:59:59,913 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2018-06-22 11:59:59,913 INFO ]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 13 [2018-06-22 11:59:59,913 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:59,913 INFO ]: Abstraction has 31 states and 51 transitions. [2018-06-22 11:59:59,913 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:59,913 INFO ]: Start isEmpty. Operand 31 states and 51 transitions. [2018-06-22 11:59:59,915 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:59,915 INFO ]: Found error trace [2018-06-22 11:59:59,915 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:59,915 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:59,915 INFO ]: Analyzing trace with hash -1574812876, now seen corresponding path program 1 times [2018-06-22 11:59:59,915 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:59,915 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:59,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:59,916 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:59,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:59,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:00,072 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:00:00,072 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:00,072 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:00:00,072 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:00:00,073 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:00:00,073 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:00,073 INFO ]: Start difference. First operand 31 states and 51 transitions. Second operand 5 states. [2018-06-22 12:00:00,141 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:00,141 INFO ]: Finished difference Result 37 states and 63 transitions. [2018-06-22 12:00:00,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:00:00,141 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 12:00:00,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:00,143 INFO ]: With dead ends: 37 [2018-06-22 12:00:00,143 INFO ]: Without dead ends: 37 [2018-06-22 12:00:00,143 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:00,143 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 12:00:00,153 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 12:00:00,153 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 12:00:00,155 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2018-06-22 12:00:00,155 INFO ]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2018-06-22 12:00:00,155 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:00,155 INFO ]: Abstraction has 35 states and 58 transitions. [2018-06-22 12:00:00,155 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:00:00,155 INFO ]: Start isEmpty. Operand 35 states and 58 transitions. [2018-06-22 12:00:00,157 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:00:00,157 INFO ]: Found error trace [2018-06-22 12:00:00,157 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:00,157 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:00,157 INFO ]: Analyzing trace with hash 1911557292, now seen corresponding path program 1 times [2018-06-22 12:00:00,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:00,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:00,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:00,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:00,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:00,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:00,234 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:00:00,234 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:00,234 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:00:00,234 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:00:00,235 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:00:00,235 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:00,235 INFO ]: Start difference. First operand 35 states and 58 transitions. Second operand 5 states. [2018-06-22 12:00:00,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:00,336 INFO ]: Finished difference Result 39 states and 64 transitions. [2018-06-22 12:00:00,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:00:00,337 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 12:00:00,337 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:00,338 INFO ]: With dead ends: 39 [2018-06-22 12:00:00,338 INFO ]: Without dead ends: 39 [2018-06-22 12:00:00,338 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:00,339 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 12:00:00,348 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 12:00:00,348 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 12:00:00,349 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 64 transitions. [2018-06-22 12:00:00,349 INFO ]: Start accepts. Automaton has 39 states and 64 transitions. Word has length 17 [2018-06-22 12:00:00,349 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:00,349 INFO ]: Abstraction has 39 states and 64 transitions. [2018-06-22 12:00:00,349 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:00:00,349 INFO ]: Start isEmpty. Operand 39 states and 64 transitions. [2018-06-22 12:00:00,351 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:00:00,351 INFO ]: Found error trace [2018-06-22 12:00:00,351 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:00,351 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:00,351 INFO ]: Analyzing trace with hash 1482527961, now seen corresponding path program 1 times [2018-06-22 12:00:00,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:00,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:00,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:00,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:00,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:00,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:00,624 WARN ]: Spent 191.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-22 12:00:00,784 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:00:00,784 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:00,784 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:00:00,785 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:00:00,785 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:00:00,785 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:00:00,786 INFO ]: Start difference. First operand 39 states and 64 transitions. Second operand 7 states. [2018-06-22 12:00:00,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:00,946 INFO ]: Finished difference Result 43 states and 73 transitions. [2018-06-22 12:00:00,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 12:00:00,946 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 12:00:00,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:00,947 INFO ]: With dead ends: 43 [2018-06-22 12:00:00,947 INFO ]: Without dead ends: 43 [2018-06-22 12:00:00,948 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:00:00,948 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 12:00:00,959 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-06-22 12:00:00,959 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 12:00:00,960 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 68 transitions. [2018-06-22 12:00:00,960 INFO ]: Start accepts. Automaton has 41 states and 68 transitions. Word has length 17 [2018-06-22 12:00:00,960 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:00,960 INFO ]: Abstraction has 41 states and 68 transitions. [2018-06-22 12:00:00,960 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:00:00,960 INFO ]: Start isEmpty. Operand 41 states and 68 transitions. [2018-06-22 12:00:00,962 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:00:00,962 INFO ]: Found error trace [2018-06-22 12:00:00,962 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:00,962 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:00,962 INFO ]: Analyzing trace with hash 1698577155, now seen corresponding path program 1 times [2018-06-22 12:00:00,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:00,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:00,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:00,963 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:00,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:00,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:01,018 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:00:01,018 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:01,018 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:00:01,018 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:00:01,019 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:00:01,019 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:01,019 INFO ]: Start difference. First operand 41 states and 68 transitions. Second operand 5 states. [2018-06-22 12:00:01,169 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:01,169 INFO ]: Finished difference Result 43 states and 71 transitions. [2018-06-22 12:00:01,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:00:01,170 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 12:00:01,170 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:01,171 INFO ]: With dead ends: 43 [2018-06-22 12:00:01,171 INFO ]: Without dead ends: 43 [2018-06-22 12:00:01,171 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:01,171 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 12:00:01,183 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-06-22 12:00:01,183 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 12:00:01,186 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 67 transitions. [2018-06-22 12:00:01,186 INFO ]: Start accepts. Automaton has 41 states and 67 transitions. Word has length 17 [2018-06-22 12:00:01,186 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:01,186 INFO ]: Abstraction has 41 states and 67 transitions. [2018-06-22 12:00:01,186 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:00:01,186 INFO ]: Start isEmpty. Operand 41 states and 67 transitions. [2018-06-22 12:00:01,188 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:00:01,188 INFO ]: Found error trace [2018-06-22 12:00:01,188 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:01,188 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:01,188 INFO ]: Analyzing trace with hash 889980027, now seen corresponding path program 1 times [2018-06-22 12:00:01,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:01,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:01,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:01,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:01,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:01,206 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:01,250 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:00:01,250 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:01,250 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:00:01,251 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:00:01,251 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:00:01,251 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:01,251 INFO ]: Start difference. First operand 41 states and 67 transitions. Second operand 5 states. [2018-06-22 12:00:01,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:01,330 INFO ]: Finished difference Result 43 states and 69 transitions. [2018-06-22 12:00:01,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:00:01,330 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 12:00:01,330 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:01,331 INFO ]: With dead ends: 43 [2018-06-22 12:00:01,331 INFO ]: Without dead ends: 43 [2018-06-22 12:00:01,332 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:01,332 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 12:00:01,339 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-06-22 12:00:01,339 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 12:00:01,340 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2018-06-22 12:00:01,340 INFO ]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 17 [2018-06-22 12:00:01,340 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:01,340 INFO ]: Abstraction has 41 states and 66 transitions. [2018-06-22 12:00:01,340 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:00:01,340 INFO ]: Start isEmpty. Operand 41 states and 66 transitions. [2018-06-22 12:00:01,341 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:00:01,341 INFO ]: Found error trace [2018-06-22 12:00:01,341 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:01,341 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:01,341 INFO ]: Analyzing trace with hash 460950696, now seen corresponding path program 1 times [2018-06-22 12:00:01,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:01,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:01,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:01,342 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:01,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:01,351 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:01,451 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:00:01,451 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:01,451 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:00:01,451 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:00:01,451 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:00:01,451 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:00:01,451 INFO ]: Start difference. First operand 41 states and 66 transitions. Second operand 6 states. [2018-06-22 12:00:01,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:01,682 INFO ]: Finished difference Result 43 states and 70 transitions. [2018-06-22 12:00:01,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 12:00:01,683 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 12:00:01,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:01,684 INFO ]: With dead ends: 43 [2018-06-22 12:00:01,684 INFO ]: Without dead ends: 43 [2018-06-22 12:00:01,684 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:00:01,684 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 12:00:01,690 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 12:00:01,691 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 12:00:01,691 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 64 transitions. [2018-06-22 12:00:01,691 INFO ]: Start accepts. Automaton has 39 states and 64 transitions. Word has length 17 [2018-06-22 12:00:01,692 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:01,692 INFO ]: Abstraction has 39 states and 64 transitions. [2018-06-22 12:00:01,692 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:00:01,692 INFO ]: Start isEmpty. Operand 39 states and 64 transitions. [2018-06-22 12:00:01,693 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:00:01,693 INFO ]: Found error trace [2018-06-22 12:00:01,693 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:01,693 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:01,693 INFO ]: Analyzing trace with hash 1854920108, now seen corresponding path program 1 times [2018-06-22 12:00:01,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:01,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:01,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:01,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:01,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:01,702 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:01,798 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:00:01,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:00:01,798 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 12:00:01,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:01,822 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:01,828 INFO ]: Computing forward predicates... [2018-06-22 12:00:02,107 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:00:02,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:00:02,137 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 12:00:02,137 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:00:02,137 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:00:02,138 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:00:02,138 INFO ]: Start difference. First operand 39 states and 64 transitions. Second operand 10 states. [2018-06-22 12:00:02,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:02,243 INFO ]: Finished difference Result 43 states and 68 transitions. [2018-06-22 12:00:02,244 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 12:00:02,244 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 12:00:02,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:02,245 INFO ]: With dead ends: 43 [2018-06-22 12:00:02,245 INFO ]: Without dead ends: 43 [2018-06-22 12:00:02,245 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:00:02,245 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 12:00:02,254 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-06-22 12:00:02,254 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 12:00:02,255 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2018-06-22 12:00:02,255 INFO ]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 17 [2018-06-22 12:00:02,255 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:02,255 INFO ]: Abstraction has 41 states and 66 transitions. [2018-06-22 12:00:02,255 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:00:02,255 INFO ]: Start isEmpty. Operand 41 states and 66 transitions. [2018-06-22 12:00:02,257 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:00:02,257 INFO ]: Found error trace [2018-06-22 12:00:02,257 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:02,257 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:02,258 INFO ]: Analyzing trace with hash 217130971, now seen corresponding path program 1 times [2018-06-22 12:00:02,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:02,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:02,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:02,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:02,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:02,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:02,474 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:00:02,474 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:00:02,474 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 12:00:02,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:02,511 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:02,513 INFO ]: Computing forward predicates... [2018-06-22 12:00:02,656 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:00:02,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:00:02,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 12:00:02,680 INFO ]: Interpolant automaton has 10 states [2018-06-22 12:00:02,680 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 12:00:02,680 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:00:02,680 INFO ]: Start difference. First operand 41 states and 66 transitions. Second operand 10 states. [2018-06-22 12:00:02,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:02,831 INFO ]: Finished difference Result 51 states and 85 transitions. [2018-06-22 12:00:02,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 12:00:02,831 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 12:00:02,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:02,832 INFO ]: With dead ends: 51 [2018-06-22 12:00:02,832 INFO ]: Without dead ends: 51 [2018-06-22 12:00:02,832 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:00:02,832 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 12:00:02,840 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-06-22 12:00:02,840 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 12:00:02,841 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 71 transitions. [2018-06-22 12:00:02,841 INFO ]: Start accepts. Automaton has 43 states and 71 transitions. Word has length 17 [2018-06-22 12:00:02,842 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:02,842 INFO ]: Abstraction has 43 states and 71 transitions. [2018-06-22 12:00:02,842 INFO ]: Interpolant automaton has 10 states. [2018-06-22 12:00:02,842 INFO ]: Start isEmpty. Operand 43 states and 71 transitions. [2018-06-22 12:00:02,843 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:00:02,843 INFO ]: Found error trace [2018-06-22 12:00:02,843 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:02,843 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:02,843 INFO ]: Analyzing trace with hash -1115297561, now seen corresponding path program 1 times [2018-06-22 12:00:02,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:02,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:02,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:02,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:02,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:02,850 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:02,991 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:00:02,992 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:02,992 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:00:02,992 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:00:02,992 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:00:02,992 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:00:02,992 INFO ]: Start difference. First operand 43 states and 71 transitions. Second operand 4 states. [2018-06-22 12:00:03,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:03,276 INFO ]: Finished difference Result 54 states and 94 transitions. [2018-06-22 12:00:03,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:00:03,278 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 12:00:03,278 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:03,279 INFO ]: With dead ends: 54 [2018-06-22 12:00:03,279 INFO ]: Without dead ends: 54 [2018-06-22 12:00:03,279 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:03,280 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 12:00:03,287 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-06-22 12:00:03,287 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 12:00:03,288 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 86 transitions. [2018-06-22 12:00:03,288 INFO ]: Start accepts. Automaton has 50 states and 86 transitions. Word has length 17 [2018-06-22 12:00:03,288 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:03,288 INFO ]: Abstraction has 50 states and 86 transitions. [2018-06-22 12:00:03,288 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:00:03,288 INFO ]: Start isEmpty. Operand 50 states and 86 transitions. [2018-06-22 12:00:03,289 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:00:03,289 INFO ]: Found error trace [2018-06-22 12:00:03,289 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:03,289 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:03,290 INFO ]: Analyzing trace with hash -578166014, now seen corresponding path program 1 times [2018-06-22 12:00:03,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:03,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:03,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:03,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:03,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:03,299 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:03,326 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:00:03,326 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:03,326 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:00:03,326 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:00:03,327 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:00:03,327 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:00:03,327 INFO ]: Start difference. First operand 50 states and 86 transitions. Second operand 4 states. [2018-06-22 12:00:03,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:03,412 INFO ]: Finished difference Result 59 states and 104 transitions. [2018-06-22 12:00:03,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 12:00:03,414 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 12:00:03,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:03,415 INFO ]: With dead ends: 59 [2018-06-22 12:00:03,415 INFO ]: Without dead ends: 55 [2018-06-22 12:00:03,415 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 12:00:03,415 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 12:00:03,423 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-22 12:00:03,423 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 12:00:03,424 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 95 transitions. [2018-06-22 12:00:03,424 INFO ]: Start accepts. Automaton has 55 states and 95 transitions. Word has length 17 [2018-06-22 12:00:03,424 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:03,424 INFO ]: Abstraction has 55 states and 95 transitions. [2018-06-22 12:00:03,424 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:00:03,424 INFO ]: Start isEmpty. Operand 55 states and 95 transitions. [2018-06-22 12:00:03,425 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:00:03,425 INFO ]: Found error trace [2018-06-22 12:00:03,425 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:03,426 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:03,426 INFO ]: Analyzing trace with hash 2064986011, now seen corresponding path program 1 times [2018-06-22 12:00:03,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:03,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:03,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:03,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:03,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:03,433 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:03,486 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:00:03,486 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:03,486 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:00:03,486 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:00:03,486 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:00:03,486 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:00:03,486 INFO ]: Start difference. First operand 55 states and 95 transitions. Second operand 6 states. [2018-06-22 12:00:03,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:03,676 INFO ]: Finished difference Result 63 states and 106 transitions. [2018-06-22 12:00:03,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:00:03,676 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 12:00:03,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:03,677 INFO ]: With dead ends: 63 [2018-06-22 12:00:03,677 INFO ]: Without dead ends: 63 [2018-06-22 12:00:03,677 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:00:03,677 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 12:00:03,684 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-06-22 12:00:03,684 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 12:00:03,685 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 102 transitions. [2018-06-22 12:00:03,685 INFO ]: Start accepts. Automaton has 61 states and 102 transitions. Word has length 21 [2018-06-22 12:00:03,685 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:03,686 INFO ]: Abstraction has 61 states and 102 transitions. [2018-06-22 12:00:03,686 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:00:03,686 INFO ]: Start isEmpty. Operand 61 states and 102 transitions. [2018-06-22 12:00:03,687 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:00:03,687 INFO ]: Found error trace [2018-06-22 12:00:03,687 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:03,687 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:03,687 INFO ]: Analyzing trace with hash 218842147, now seen corresponding path program 1 times [2018-06-22 12:00:03,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:03,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:03,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:03,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:03,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:03,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:03,728 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:00:03,728 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:03,728 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:00:03,729 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:00:03,729 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:00:03,729 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:00:03,729 INFO ]: Start difference. First operand 61 states and 102 transitions. Second operand 6 states. [2018-06-22 12:00:03,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:03,826 INFO ]: Finished difference Result 67 states and 112 transitions. [2018-06-22 12:00:03,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:00:03,826 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 12:00:03,826 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:03,827 INFO ]: With dead ends: 67 [2018-06-22 12:00:03,827 INFO ]: Without dead ends: 63 [2018-06-22 12:00:03,827 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:00:03,827 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 12:00:03,834 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-06-22 12:00:03,834 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 12:00:03,835 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 99 transitions. [2018-06-22 12:00:03,835 INFO ]: Start accepts. Automaton has 59 states and 99 transitions. Word has length 21 [2018-06-22 12:00:03,835 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:03,835 INFO ]: Abstraction has 59 states and 99 transitions. [2018-06-22 12:00:03,835 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:00:03,835 INFO ]: Start isEmpty. Operand 59 states and 99 transitions. [2018-06-22 12:00:03,836 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:00:03,836 INFO ]: Found error trace [2018-06-22 12:00:03,836 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:03,837 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:03,837 INFO ]: Analyzing trace with hash 2030601266, now seen corresponding path program 1 times [2018-06-22 12:00:03,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:03,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:03,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:03,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:03,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:03,843 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:03,879 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:00:03,880 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:03,880 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:00:03,880 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:00:03,880 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:00:03,880 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:00:03,880 INFO ]: Start difference. First operand 59 states and 99 transitions. Second operand 6 states. [2018-06-22 12:00:03,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:03,973 INFO ]: Finished difference Result 59 states and 97 transitions. [2018-06-22 12:00:03,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:00:03,973 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 12:00:03,973 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:03,974 INFO ]: With dead ends: 59 [2018-06-22 12:00:03,974 INFO ]: Without dead ends: 58 [2018-06-22 12:00:03,974 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:00:03,974 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 12:00:03,980 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-06-22 12:00:03,980 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 12:00:03,981 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 87 transitions. [2018-06-22 12:00:03,982 INFO ]: Start accepts. Automaton has 54 states and 87 transitions. Word has length 21 [2018-06-22 12:00:03,982 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:03,982 INFO ]: Abstraction has 54 states and 87 transitions. [2018-06-22 12:00:03,982 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:00:03,982 INFO ]: Start isEmpty. Operand 54 states and 87 transitions. [2018-06-22 12:00:03,983 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:00:03,983 INFO ]: Found error trace [2018-06-22 12:00:03,983 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:03,983 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:03,983 INFO ]: Analyzing trace with hash -418222166, now seen corresponding path program 1 times [2018-06-22 12:00:03,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:03,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:03,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:03,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:03,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:03,992 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:04,023 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:00:04,023 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:04,024 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:00:04,024 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:00:04,024 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:00:04,024 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:00:04,024 INFO ]: Start difference. First operand 54 states and 87 transitions. Second operand 6 states. [2018-06-22 12:00:04,088 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:04,088 INFO ]: Finished difference Result 54 states and 85 transitions. [2018-06-22 12:00:04,091 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:00:04,091 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 12:00:04,091 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:04,091 INFO ]: With dead ends: 54 [2018-06-22 12:00:04,091 INFO ]: Without dead ends: 49 [2018-06-22 12:00:04,092 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:00:04,092 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 12:00:04,100 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-06-22 12:00:04,100 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 12:00:04,100 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-06-22 12:00:04,101 INFO ]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 21 [2018-06-22 12:00:04,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:04,101 INFO ]: Abstraction has 43 states and 70 transitions. [2018-06-22 12:00:04,101 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:00:04,101 INFO ]: Start isEmpty. Operand 43 states and 70 transitions. [2018-06-22 12:00:04,101 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:00:04,102 INFO ]: Found error trace [2018-06-22 12:00:04,102 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:04,103 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:04,103 INFO ]: Analyzing trace with hash -468073381, now seen corresponding path program 1 times [2018-06-22 12:00:04,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:04,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:04,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:04,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:04,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:04,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:04,250 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:00:04,250 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:00:04,250 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 12:00:04,256 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:04,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:04,271 INFO ]: Computing forward predicates... [2018-06-22 12:00:04,373 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 12:00:04,406 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:00:04,406 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-06-22 12:00:04,407 INFO ]: Interpolant automaton has 13 states [2018-06-22 12:00:04,407 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 12:00:04,407 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:00:04,407 INFO ]: Start difference. First operand 43 states and 70 transitions. Second operand 13 states. [2018-06-22 12:00:04,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:04,522 INFO ]: Finished difference Result 51 states and 79 transitions. [2018-06-22 12:00:04,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 12:00:04,522 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 12:00:04,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:04,522 INFO ]: With dead ends: 51 [2018-06-22 12:00:04,522 INFO ]: Without dead ends: 38 [2018-06-22 12:00:04,523 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-22 12:00:04,523 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 12:00:04,526 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 12:00:04,526 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 12:00:04,526 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-06-22 12:00:04,526 INFO ]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 21 [2018-06-22 12:00:04,526 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:04,526 INFO ]: Abstraction has 36 states and 60 transitions. [2018-06-22 12:00:04,526 INFO ]: Interpolant automaton has 13 states. [2018-06-22 12:00:04,526 INFO ]: Start isEmpty. Operand 36 states and 60 transitions. [2018-06-22 12:00:04,527 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:00:04,527 INFO ]: Found error trace [2018-06-22 12:00:04,527 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:04,527 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:04,527 INFO ]: Analyzing trace with hash -1592320771, now seen corresponding path program 2 times [2018-06-22 12:00:04,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:04,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:04,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:04,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:04,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:04,538 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:04,685 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:00:04,685 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:00:04,685 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 12:00:04,695 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:00:04,738 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:00:04,738 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:04,741 INFO ]: Computing forward predicates... [2018-06-22 12:00:05,021 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 12:00:05,124 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:00:05,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:00:05,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-06-22 12:00:05,145 INFO ]: Interpolant automaton has 13 states [2018-06-22 12:00:05,145 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 12:00:05,145 INFO ]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:00:05,146 INFO ]: Start difference. First operand 36 states and 60 transitions. Second operand 13 states. [2018-06-22 12:00:05,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:05,486 INFO ]: Finished difference Result 60 states and 98 transitions. [2018-06-22 12:00:05,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 12:00:05,488 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 12:00:05,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:05,489 INFO ]: With dead ends: 60 [2018-06-22 12:00:05,489 INFO ]: Without dead ends: 60 [2018-06-22 12:00:05,489 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-06-22 12:00:05,489 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 12:00:05,493 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 36. [2018-06-22 12:00:05,493 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 12:00:05,494 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-06-22 12:00:05,494 INFO ]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 21 [2018-06-22 12:00:05,494 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:05,494 INFO ]: Abstraction has 36 states and 60 transitions. [2018-06-22 12:00:05,494 INFO ]: Interpolant automaton has 13 states. [2018-06-22 12:00:05,494 INFO ]: Start isEmpty. Operand 36 states and 60 transitions. [2018-06-22 12:00:05,495 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:00:05,495 INFO ]: Found error trace [2018-06-22 12:00:05,495 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:05,495 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:05,495 INFO ]: Analyzing trace with hash 1869563594, now seen corresponding path program 1 times [2018-06-22 12:00:05,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:05,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:05,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:05,496 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:00:05,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:05,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:05,594 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:00:05,594 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:00:05,594 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 12:00:05,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:05,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:05,634 INFO ]: Computing forward predicates... [2018-06-22 12:00:05,863 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 12:00:05,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:00:05,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-06-22 12:00:05,885 INFO ]: Interpolant automaton has 14 states [2018-06-22 12:00:05,885 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 12:00:05,885 INFO ]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 12:00:05,885 INFO ]: Start difference. First operand 36 states and 60 transitions. Second operand 14 states. [2018-06-22 12:00:06,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:06,180 INFO ]: Finished difference Result 54 states and 82 transitions. [2018-06-22 12:00:06,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 12:00:06,181 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 12:00:06,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:06,181 INFO ]: With dead ends: 54 [2018-06-22 12:00:06,181 INFO ]: Without dead ends: 46 [2018-06-22 12:00:06,181 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-06-22 12:00:06,181 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 12:00:06,185 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-06-22 12:00:06,185 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 12:00:06,186 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2018-06-22 12:00:06,186 INFO ]: Start accepts. Automaton has 32 states and 53 transitions. Word has length 21 [2018-06-22 12:00:06,186 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:06,186 INFO ]: Abstraction has 32 states and 53 transitions. [2018-06-22 12:00:06,186 INFO ]: Interpolant automaton has 14 states. [2018-06-22 12:00:06,186 INFO ]: Start isEmpty. Operand 32 states and 53 transitions. [2018-06-22 12:00:06,187 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:00:06,187 INFO ]: Found error trace [2018-06-22 12:00:06,187 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:06,187 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:06,187 INFO ]: Analyzing trace with hash 122575369, now seen corresponding path program 1 times [2018-06-22 12:00:06,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:06,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:06,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:06,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:06,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:06,198 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:06,277 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:00:06,277 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:06,277 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:00:06,277 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:00:06,277 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:00:06,277 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:06,277 INFO ]: Start difference. First operand 32 states and 53 transitions. Second operand 5 states. [2018-06-22 12:00:06,362 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:06,362 INFO ]: Finished difference Result 32 states and 50 transitions. [2018-06-22 12:00:06,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:00:06,362 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 12:00:06,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:06,363 INFO ]: With dead ends: 32 [2018-06-22 12:00:06,363 INFO ]: Without dead ends: 27 [2018-06-22 12:00:06,363 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:00:06,363 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 12:00:06,366 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 12:00:06,366 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 12:00:06,366 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2018-06-22 12:00:06,366 INFO ]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 21 [2018-06-22 12:00:06,367 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:06,367 INFO ]: Abstraction has 25 states and 36 transitions. [2018-06-22 12:00:06,367 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:00:06,367 INFO ]: Start isEmpty. Operand 25 states and 36 transitions. [2018-06-22 12:00:06,367 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:00:06,367 INFO ]: Found error trace [2018-06-22 12:00:06,367 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:00:06,367 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:00:06,367 INFO ]: Analyzing trace with hash -224338524, now seen corresponding path program 1 times [2018-06-22 12:00:06,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:00:06,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:00:06,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:06,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:00:06,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:00:06,373 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:00:06,400 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:00:06,400 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:00:06,400 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 12:00:06,400 INFO ]: Interpolant automaton has 5 states [2018-06-22 12:00:06,400 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 12:00:06,400 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 12:00:06,401 INFO ]: Start difference. First operand 25 states and 36 transitions. Second operand 5 states. [2018-06-22 12:00:06,429 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:00:06,429 INFO ]: Finished difference Result 17 states and 23 transitions. [2018-06-22 12:00:06,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 12:00:06,430 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 12:00:06,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:00:06,430 INFO ]: With dead ends: 17 [2018-06-22 12:00:06,430 INFO ]: Without dead ends: 0 [2018-06-22 12:00:06,430 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:00:06,430 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 12:00:06,430 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 12:00:06,430 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 12:00:06,430 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 12:00:06,431 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 12:00:06,431 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:00:06,431 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 12:00:06,431 INFO ]: Interpolant automaton has 5 states. [2018-06-22 12:00:06,431 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 12:00:06,431 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 12:00:06,434 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:00:06 BoogieIcfgContainer [2018-06-22 12:00:06,434 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 12:00:06,435 INFO ]: Toolchain (without parser) took 8178.04 ms. Allocated memory was 309.3 MB in the beginning and 382.7 MB in the end (delta: 73.4 MB). Free memory was 264.7 MB in the beginning and 293.4 MB in the end (delta: -28.6 MB). Peak memory consumption was 44.8 MB. Max. memory is 3.6 GB. [2018-06-22 12:00:06,436 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 12:00:06,437 INFO ]: ChcToBoogie took 59.80 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:00:06,437 INFO ]: Boogie Preprocessor took 29.35 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 12:00:06,437 INFO ]: RCFGBuilder took 441.80 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 250.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. [2018-06-22 12:00:06,438 INFO ]: TraceAbstraction took 7638.84 ms. Allocated memory was 309.3 MB in the beginning and 382.7 MB in the end (delta: 73.4 MB). Free memory was 250.6 MB in the beginning and 293.4 MB in the end (delta: -42.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 3.6 GB. [2018-06-22 12:00:06,441 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.80 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 29.35 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 441.80 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 250.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7638.84 ms. Allocated memory was 309.3 MB in the beginning and 382.7 MB in the end (delta: 73.4 MB). Free memory was 250.6 MB in the beginning and 293.4 MB in the end (delta: -42.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. SAFE Result, 7.5s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 689 SDtfs, 77 SDslu, 1981 SDs, 0 SdLazy, 1275 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 117 SyntacticMatches, 8 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 88 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 482 NumberOfCodeBlocks, 482 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 28584 SizeOfPredicates, 34 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 101/134 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__while_after_while_if.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_12-00-06-451.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__while_after_while_if.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_12-00-06-451.csv Received shutdown request...