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__barthe2-big3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:56:21,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:56:21,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:56:21,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:56:21,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:56:21,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:56:21,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:56:21,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:56:21,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:56:21,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:56:21,815 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:56:21,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:56:21,819 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:56:21,820 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:56:21,821 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:56:21,821 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:56:21,824 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:56:21,826 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:56:21,836 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:56:21,837 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:56:21,838 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:56:21,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:56:21,840 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:56:21,840 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:56:21,843 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:56:21,844 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:56:21,844 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:56:21,845 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:56:21,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:56:21,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:56:21,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:56:21,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:56:21,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:56:21,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:56:21,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:56:21,852 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:56:21,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:56:21,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:56:21,871 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:56:21,871 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:56:21,872 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:56:21,873 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:56:21,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:56:21,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:56:21,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:56:21,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:56:21,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:56:21,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:56:21,875 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:56:21,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:56:21,875 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:56:21,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:56:21,875 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:56:21,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:56:21,876 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:56:21,878 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:56:21,878 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:56:21,925 INFO ]: Repository-Root is: /tmp [2018-06-22 11:56:21,942 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:56:21,947 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:56:21,949 INFO ]: Initializing SmtParser... [2018-06-22 11:56:21,949 INFO ]: SmtParser initialized [2018-06-22 11:56:21,950 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 [2018-06-22 11:56:21,952 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:56:22,049 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@426c52fc [2018-06-22 11:56:22,285 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big3.smt2 [2018-06-22 11:56:22,289 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:56:22,295 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:56:22,295 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:56:22,295 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:56:22,296 INFO ]: ChcToBoogie initialized [2018-06-22 11:56:22,299 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:56:22" (1/1) ... [2018-06-22 11:56:22,347 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:22 Unit [2018-06-22 11:56:22,348 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:56:22,348 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:56:22,348 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:56:22,348 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:56:22,374 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:22" (1/1) ... [2018-06-22 11:56:22,374 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:22" (1/1) ... [2018-06-22 11:56:22,382 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:22" (1/1) ... [2018-06-22 11:56:22,382 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:22" (1/1) ... [2018-06-22 11:56:22,388 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:22" (1/1) ... [2018-06-22 11:56:22,397 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:22" (1/1) ... [2018-06-22 11:56:22,399 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:22" (1/1) ... [2018-06-22 11:56:22,400 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:56:22,401 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:56:22,401 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:56:22,401 INFO ]: RCFGBuilder initialized [2018-06-22 11:56:22,411 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:56:22,429 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:56:22,429 INFO ]: Found specification of procedure False [2018-06-22 11:56:22,429 INFO ]: Found implementation of procedure False [2018-06-22 11:56:22,429 INFO ]: Specification and implementation of procedure INV_MAIN_4 given in one single declaration [2018-06-22 11:56:22,429 INFO ]: Found specification of procedure INV_MAIN_4 [2018-06-22 11:56:22,429 INFO ]: Found implementation of procedure INV_MAIN_4 [2018-06-22 11:56:22,429 INFO ]: Specification and implementation of procedure INV_MAIN_3 given in one single declaration [2018-06-22 11:56:22,429 INFO ]: Found specification of procedure INV_MAIN_3 [2018-06-22 11:56:22,429 INFO ]: Found implementation of procedure INV_MAIN_3 [2018-06-22 11:56:22,429 INFO ]: Specification and implementation of procedure INV_MAIN_2 given in one single declaration [2018-06-22 11:56:22,429 INFO ]: Found specification of procedure INV_MAIN_2 [2018-06-22 11:56:22,429 INFO ]: Found implementation of procedure INV_MAIN_2 [2018-06-22 11:56:22,430 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 11:56:22,430 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 11:56:22,430 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 11:56:22,430 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:56:22,430 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:56:22,430 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:56:22,860 INFO ]: Using library mode [2018-06-22 11:56:22,860 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:56:22 BoogieIcfgContainer [2018-06-22 11:56:22,860 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:56:22,861 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:56:22,861 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:56:22,864 INFO ]: TraceAbstraction initialized [2018-06-22 11:56:22,864 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:56:22" (1/3) ... [2018-06-22 11:56:22,865 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6ddd4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:56:22, skipping insertion in model container [2018-06-22 11:56:22,865 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:56:22" (2/3) ... [2018-06-22 11:56:22,866 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6ddd4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:56:22, skipping insertion in model container [2018-06-22 11:56:22,866 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:56:22" (3/3) ... [2018-06-22 11:56:22,867 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:56:22,875 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:56:22,883 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:56:22,932 INFO ]: Using default assertion order modulation [2018-06-22 11:56:22,932 INFO ]: Interprodecural is true [2018-06-22 11:56:22,932 INFO ]: Hoare is false [2018-06-22 11:56:22,932 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:56:22,932 INFO ]: Backedges is TWOTRACK [2018-06-22 11:56:22,932 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:56:22,932 INFO ]: Difference is false [2018-06-22 11:56:22,932 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:56:22,932 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:56:22,955 INFO ]: Start isEmpty. Operand 36 states. [2018-06-22 11:56:22,972 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:22,972 INFO ]: Found error trace [2018-06-22 11:56:22,973 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:22,974 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:22,981 INFO ]: Analyzing trace with hash 1648056683, now seen corresponding path program 1 times [2018-06-22 11:56:22,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:22,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:23,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:23,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:23,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:23,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:23,237 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:56:23,239 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:23,239 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:56:23,241 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:23,252 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:23,253 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:23,254 INFO ]: Start difference. First operand 36 states. Second operand 7 states. [2018-06-22 11:56:23,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:23,943 INFO ]: Finished difference Result 42 states and 76 transitions. [2018-06-22 11:56:23,944 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:56:23,946 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:56:23,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:23,957 INFO ]: With dead ends: 42 [2018-06-22 11:56:23,957 INFO ]: Without dead ends: 42 [2018-06-22 11:56:23,959 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:23,972 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:56:24,018 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:56:24,019 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:56:24,021 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 76 transitions. [2018-06-22 11:56:24,023 INFO ]: Start accepts. Automaton has 42 states and 76 transitions. Word has length 21 [2018-06-22 11:56:24,024 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:24,024 INFO ]: Abstraction has 42 states and 76 transitions. [2018-06-22 11:56:24,024 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:24,024 INFO ]: Start isEmpty. Operand 42 states and 76 transitions. [2018-06-22 11:56:24,027 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:24,027 INFO ]: Found error trace [2018-06-22 11:56:24,027 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:24,028 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:24,028 INFO ]: Analyzing trace with hash -1352681670, now seen corresponding path program 1 times [2018-06-22 11:56:24,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:24,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:24,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:24,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:24,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:24,050 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:24,486 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:24,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:24,486 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 11:56:24,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:24,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:24,563 INFO ]: Computing forward predicates... [2018-06-22 11:56:24,717 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:24,740 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:24,740 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:56:24,740 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:56:24,740 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:56:24,741 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:56:24,741 INFO ]: Start difference. First operand 42 states and 76 transitions. Second operand 11 states. [2018-06-22 11:56:25,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:25,772 INFO ]: Finished difference Result 58 states and 113 transitions. [2018-06-22 11:56:25,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:56:25,773 INFO ]: Start accepts. Automaton has 11 states. Word has length 25 [2018-06-22 11:56:25,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:25,775 INFO ]: With dead ends: 58 [2018-06-22 11:56:25,775 INFO ]: Without dead ends: 58 [2018-06-22 11:56:25,776 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:56:25,776 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:56:25,791 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-06-22 11:56:25,791 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:56:25,793 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 94 transitions. [2018-06-22 11:56:25,793 INFO ]: Start accepts. Automaton has 50 states and 94 transitions. Word has length 25 [2018-06-22 11:56:25,793 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:25,793 INFO ]: Abstraction has 50 states and 94 transitions. [2018-06-22 11:56:25,793 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:56:25,793 INFO ]: Start isEmpty. Operand 50 states and 94 transitions. [2018-06-22 11:56:25,795 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:25,795 INFO ]: Found error trace [2018-06-22 11:56:25,795 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:25,796 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:25,796 INFO ]: Analyzing trace with hash 1216089485, now seen corresponding path program 1 times [2018-06-22 11:56:25,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:25,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:25,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:25,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:25,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:25,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:25,918 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:25,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:25,918 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 11:56:25,926 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:25,956 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:25,959 INFO ]: Computing forward predicates... [2018-06-22 11:56:25,988 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:26,007 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:26,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:56:26,008 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:56:26,008 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:56:26,008 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:26,008 INFO ]: Start difference. First operand 50 states and 94 transitions. Second operand 8 states. [2018-06-22 11:56:26,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:26,346 INFO ]: Finished difference Result 70 states and 141 transitions. [2018-06-22 11:56:26,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:56:26,347 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:56:26,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:26,350 INFO ]: With dead ends: 70 [2018-06-22 11:56:26,350 INFO ]: Without dead ends: 70 [2018-06-22 11:56:26,350 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:26,350 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:56:26,371 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-06-22 11:56:26,372 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:56:26,374 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 131 transitions. [2018-06-22 11:56:26,375 INFO ]: Start accepts. Automaton has 66 states and 131 transitions. Word has length 25 [2018-06-22 11:56:26,375 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:26,375 INFO ]: Abstraction has 66 states and 131 transitions. [2018-06-22 11:56:26,375 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:56:26,375 INFO ]: Start isEmpty. Operand 66 states and 131 transitions. [2018-06-22 11:56:26,378 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:26,378 INFO ]: Found error trace [2018-06-22 11:56:26,378 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:26,379 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:26,379 INFO ]: Analyzing trace with hash -693177328, now seen corresponding path program 1 times [2018-06-22 11:56:26,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:26,379 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:26,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,379 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:26,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:26,448 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:26,448 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:26,448 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:56:26,448 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:56:26,449 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:56:26,449 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:26,449 INFO ]: Start difference. First operand 66 states and 131 transitions. Second operand 6 states. [2018-06-22 11:56:26,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:26,567 INFO ]: Finished difference Result 90 states and 189 transitions. [2018-06-22 11:56:26,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:26,568 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:56:26,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:26,572 INFO ]: With dead ends: 90 [2018-06-22 11:56:26,572 INFO ]: Without dead ends: 90 [2018-06-22 11:56:26,572 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:26,572 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 11:56:26,609 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-06-22 11:56:26,609 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:56:26,611 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 171 transitions. [2018-06-22 11:56:26,611 INFO ]: Start accepts. Automaton has 82 states and 171 transitions. Word has length 25 [2018-06-22 11:56:26,611 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:26,611 INFO ]: Abstraction has 82 states and 171 transitions. [2018-06-22 11:56:26,612 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:56:26,612 INFO ]: Start isEmpty. Operand 82 states and 171 transitions. [2018-06-22 11:56:26,614 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:26,614 INFO ]: Found error trace [2018-06-22 11:56:26,614 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:26,614 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:26,614 INFO ]: Analyzing trace with hash 1727852240, now seen corresponding path program 1 times [2018-06-22 11:56:26,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:26,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:26,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:26,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:26,685 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:26,685 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:26,685 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 11:56:26,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:26,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:26,721 INFO ]: Computing forward predicates... [2018-06-22 11:56:26,734 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:26,753 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:26,753 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:56:26,753 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:26,753 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:26,753 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:26,753 INFO ]: Start difference. First operand 82 states and 171 transitions. Second operand 7 states. [2018-06-22 11:56:26,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:26,875 INFO ]: Finished difference Result 134 states and 312 transitions. [2018-06-22 11:56:26,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:26,877 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:56:26,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:26,882 INFO ]: With dead ends: 134 [2018-06-22 11:56:26,882 INFO ]: Without dead ends: 134 [2018-06-22 11:56:26,883 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:26,886 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 11:56:26,913 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 86. [2018-06-22 11:56:26,913 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:56:26,915 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 183 transitions. [2018-06-22 11:56:26,915 INFO ]: Start accepts. Automaton has 86 states and 183 transitions. Word has length 25 [2018-06-22 11:56:26,916 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:26,916 INFO ]: Abstraction has 86 states and 183 transitions. [2018-06-22 11:56:26,916 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:26,916 INFO ]: Start isEmpty. Operand 86 states and 183 transitions. [2018-06-22 11:56:26,918 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:26,918 INFO ]: Found error trace [2018-06-22 11:56:26,918 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:26,918 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:26,918 INFO ]: Analyzing trace with hash 427209397, now seen corresponding path program 1 times [2018-06-22 11:56:26,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:26,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:26,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:26,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:26,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:26,995 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:26,995 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:26,995 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:56:26,995 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:26,996 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:26,996 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:26,996 INFO ]: Start difference. First operand 86 states and 183 transitions. Second operand 7 states. [2018-06-22 11:56:27,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:27,254 INFO ]: Finished difference Result 135 states and 334 transitions. [2018-06-22 11:56:27,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:56:27,254 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:56:27,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:27,257 INFO ]: With dead ends: 135 [2018-06-22 11:56:27,257 INFO ]: Without dead ends: 130 [2018-06-22 11:56:27,257 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:27,258 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-22 11:56:27,280 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 104. [2018-06-22 11:56:27,280 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-22 11:56:27,283 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 246 transitions. [2018-06-22 11:56:27,283 INFO ]: Start accepts. Automaton has 104 states and 246 transitions. Word has length 25 [2018-06-22 11:56:27,283 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:27,283 INFO ]: Abstraction has 104 states and 246 transitions. [2018-06-22 11:56:27,283 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:27,283 INFO ]: Start isEmpty. Operand 104 states and 246 transitions. [2018-06-22 11:56:27,286 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:27,286 INFO ]: Found error trace [2018-06-22 11:56:27,286 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:27,286 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:27,286 INFO ]: Analyzing trace with hash -2072226662, now seen corresponding path program 1 times [2018-06-22 11:56:27,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:27,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:27,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:27,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:27,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:27,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:27,470 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:27,470 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:27,470 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 11:56:27,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:27,494 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:27,495 INFO ]: Computing forward predicates... [2018-06-22 11:56:27,516 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:27,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:27,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:56:27,537 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:27,537 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:27,537 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:27,537 INFO ]: Start difference. First operand 104 states and 246 transitions. Second operand 7 states. [2018-06-22 11:56:27,709 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:27,709 INFO ]: Finished difference Result 150 states and 393 transitions. [2018-06-22 11:56:27,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:27,712 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:56:27,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:27,715 INFO ]: With dead ends: 150 [2018-06-22 11:56:27,715 INFO ]: Without dead ends: 150 [2018-06-22 11:56:27,716 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:27,716 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 11:56:27,736 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 102. [2018-06-22 11:56:27,736 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 11:56:27,738 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 237 transitions. [2018-06-22 11:56:27,738 INFO ]: Start accepts. Automaton has 102 states and 237 transitions. Word has length 25 [2018-06-22 11:56:27,738 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:27,738 INFO ]: Abstraction has 102 states and 237 transitions. [2018-06-22 11:56:27,738 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:27,738 INFO ]: Start isEmpty. Operand 102 states and 237 transitions. [2018-06-22 11:56:27,741 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:27,741 INFO ]: Found error trace [2018-06-22 11:56:27,741 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:27,741 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:27,741 INFO ]: Analyzing trace with hash -2032418771, now seen corresponding path program 1 times [2018-06-22 11:56:27,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:27,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:27,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:27,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:27,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:27,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:27,830 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:27,830 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:27,830 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:56:27,830 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:56:27,831 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:56:27,831 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:27,831 INFO ]: Start difference. First operand 102 states and 237 transitions. Second operand 6 states. [2018-06-22 11:56:28,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:28,554 INFO ]: Finished difference Result 112 states and 253 transitions. [2018-06-22 11:56:28,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:56:28,554 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:56:28,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:28,557 INFO ]: With dead ends: 112 [2018-06-22 11:56:28,557 INFO ]: Without dead ends: 103 [2018-06-22 11:56:28,557 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:28,557 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 11:56:28,583 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 97. [2018-06-22 11:56:28,583 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-22 11:56:28,585 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 224 transitions. [2018-06-22 11:56:28,585 INFO ]: Start accepts. Automaton has 97 states and 224 transitions. Word has length 25 [2018-06-22 11:56:28,585 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:28,585 INFO ]: Abstraction has 97 states and 224 transitions. [2018-06-22 11:56:28,585 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:56:28,585 INFO ]: Start isEmpty. Operand 97 states and 224 transitions. [2018-06-22 11:56:28,594 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:28,594 INFO ]: Found error trace [2018-06-22 11:56:28,594 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:28,594 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:28,595 INFO ]: Analyzing trace with hash 1975296437, now seen corresponding path program 1 times [2018-06-22 11:56:28,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:28,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:28,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:28,595 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:28,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:28,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:28,710 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:28,710 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:28,769 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 11:56:28,775 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:28,797 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:28,799 INFO ]: Computing forward predicates... [2018-06-22 11:56:28,879 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:56:28,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:28,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 11:56:28,898 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:56:28,898 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:56:28,898 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:56:28,898 INFO ]: Start difference. First operand 97 states and 224 transitions. Second operand 12 states. [2018-06-22 11:56:29,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:29,226 INFO ]: Finished difference Result 173 states and 429 transitions. [2018-06-22 11:56:29,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:56:29,226 INFO ]: Start accepts. Automaton has 12 states. Word has length 25 [2018-06-22 11:56:29,226 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:29,228 INFO ]: With dead ends: 173 [2018-06-22 11:56:29,228 INFO ]: Without dead ends: 167 [2018-06-22 11:56:29,228 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:56:29,228 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 11:56:29,244 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 97. [2018-06-22 11:56:29,244 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-22 11:56:29,246 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 210 transitions. [2018-06-22 11:56:29,246 INFO ]: Start accepts. Automaton has 97 states and 210 transitions. Word has length 25 [2018-06-22 11:56:29,246 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:29,246 INFO ]: Abstraction has 97 states and 210 transitions. [2018-06-22 11:56:29,246 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:56:29,246 INFO ]: Start isEmpty. Operand 97 states and 210 transitions. [2018-06-22 11:56:29,248 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:29,248 INFO ]: Found error trace [2018-06-22 11:56:29,248 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:29,248 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:29,248 INFO ]: Analyzing trace with hash 1082619533, now seen corresponding path program 1 times [2018-06-22 11:56:29,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:29,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:29,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:29,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:29,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:29,255 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:29,304 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:56:29,304 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:29,304 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:56:29,304 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:56:29,304 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:56:29,304 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:29,304 INFO ]: Start difference. First operand 97 states and 210 transitions. Second operand 8 states. [2018-06-22 11:56:29,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:29,442 INFO ]: Finished difference Result 109 states and 242 transitions. [2018-06-22 11:56:29,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:56:29,442 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:56:29,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:29,444 INFO ]: With dead ends: 109 [2018-06-22 11:56:29,444 INFO ]: Without dead ends: 107 [2018-06-22 11:56:29,444 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:29,444 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:56:29,454 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 97. [2018-06-22 11:56:29,455 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-22 11:56:29,456 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 210 transitions. [2018-06-22 11:56:29,456 INFO ]: Start accepts. Automaton has 97 states and 210 transitions. Word has length 25 [2018-06-22 11:56:29,456 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:29,456 INFO ]: Abstraction has 97 states and 210 transitions. [2018-06-22 11:56:29,456 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:56:29,456 INFO ]: Start isEmpty. Operand 97 states and 210 transitions. [2018-06-22 11:56:29,460 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:29,460 INFO ]: Found error trace [2018-06-22 11:56:29,460 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:29,460 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:29,461 INFO ]: Analyzing trace with hash 662491545, now seen corresponding path program 1 times [2018-06-22 11:56:29,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:29,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:29,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:29,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:29,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:29,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:29,526 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:56:29,527 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:29,527 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:56:29,527 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:56:29,527 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:56:29,527 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:29,527 INFO ]: Start difference. First operand 97 states and 210 transitions. Second operand 8 states. [2018-06-22 11:56:29,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:29,668 INFO ]: Finished difference Result 113 states and 253 transitions. [2018-06-22 11:56:29,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:56:29,673 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:56:29,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:29,675 INFO ]: With dead ends: 113 [2018-06-22 11:56:29,675 INFO ]: Without dead ends: 111 [2018-06-22 11:56:29,675 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:29,675 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 11:56:29,685 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 101. [2018-06-22 11:56:29,685 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 11:56:29,687 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 220 transitions. [2018-06-22 11:56:29,687 INFO ]: Start accepts. Automaton has 101 states and 220 transitions. Word has length 25 [2018-06-22 11:56:29,687 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:29,687 INFO ]: Abstraction has 101 states and 220 transitions. [2018-06-22 11:56:29,687 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:56:29,687 INFO ]: Start isEmpty. Operand 101 states and 220 transitions. [2018-06-22 11:56:29,689 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:56:29,689 INFO ]: Found error trace [2018-06-22 11:56:29,689 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:29,689 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:29,689 INFO ]: Analyzing trace with hash 1383089716, now seen corresponding path program 1 times [2018-06-22 11:56:29,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:29,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:29,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:29,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:29,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:29,696 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:30,284 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:56:30,284 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:30,284 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:56:30,285 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:56:30,285 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:56:30,285 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:30,285 INFO ]: Start difference. First operand 101 states and 220 transitions. Second operand 8 states. [2018-06-22 11:56:30,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:30,569 INFO ]: Finished difference Result 117 states and 263 transitions. [2018-06-22 11:56:30,570 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:56:30,570 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:56:30,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:30,572 INFO ]: With dead ends: 117 [2018-06-22 11:56:30,572 INFO ]: Without dead ends: 115 [2018-06-22 11:56:30,572 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:30,572 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-22 11:56:30,585 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 103. [2018-06-22 11:56:30,585 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 11:56:30,587 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 225 transitions. [2018-06-22 11:56:30,587 INFO ]: Start accepts. Automaton has 103 states and 225 transitions. Word has length 25 [2018-06-22 11:56:30,587 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:30,587 INFO ]: Abstraction has 103 states and 225 transitions. [2018-06-22 11:56:30,587 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:56:30,587 INFO ]: Start isEmpty. Operand 103 states and 225 transitions. [2018-06-22 11:56:30,590 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:30,590 INFO ]: Found error trace [2018-06-22 11:56:30,590 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:30,591 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:30,591 INFO ]: Analyzing trace with hash 367775772, now seen corresponding path program 1 times [2018-06-22 11:56:30,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:30,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:30,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:30,591 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:30,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:30,607 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:30,852 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:30,852 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:30,852 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:56:30,852 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:30,852 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:30,852 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:30,852 INFO ]: Start difference. First operand 103 states and 225 transitions. Second operand 7 states. [2018-06-22 11:56:31,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:31,019 INFO ]: Finished difference Result 144 states and 354 transitions. [2018-06-22 11:56:31,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:31,019 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 11:56:31,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:31,021 INFO ]: With dead ends: 144 [2018-06-22 11:56:31,021 INFO ]: Without dead ends: 128 [2018-06-22 11:56:31,021 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:31,021 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-22 11:56:31,031 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 106. [2018-06-22 11:56:31,031 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 11:56:31,033 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 225 transitions. [2018-06-22 11:56:31,033 INFO ]: Start accepts. Automaton has 106 states and 225 transitions. Word has length 29 [2018-06-22 11:56:31,034 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:31,034 INFO ]: Abstraction has 106 states and 225 transitions. [2018-06-22 11:56:31,034 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:31,034 INFO ]: Start isEmpty. Operand 106 states and 225 transitions. [2018-06-22 11:56:31,035 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:31,035 INFO ]: Found error trace [2018-06-22 11:56:31,035 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:31,036 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:31,036 INFO ]: Analyzing trace with hash 76909439, now seen corresponding path program 1 times [2018-06-22 11:56:31,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:31,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:31,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:31,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:31,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:31,051 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:31,438 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:31,438 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:31,438 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:56:31,439 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:31,439 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:31,439 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:31,439 INFO ]: Start difference. First operand 106 states and 225 transitions. Second operand 7 states. [2018-06-22 11:56:31,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:31,721 INFO ]: Finished difference Result 120 states and 251 transitions. [2018-06-22 11:56:31,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:56:31,721 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 11:56:31,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:31,723 INFO ]: With dead ends: 120 [2018-06-22 11:56:31,723 INFO ]: Without dead ends: 112 [2018-06-22 11:56:31,723 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:31,723 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:56:31,733 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 106. [2018-06-22 11:56:31,733 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 11:56:31,734 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 217 transitions. [2018-06-22 11:56:31,734 INFO ]: Start accepts. Automaton has 106 states and 217 transitions. Word has length 29 [2018-06-22 11:56:31,734 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:31,734 INFO ]: Abstraction has 106 states and 217 transitions. [2018-06-22 11:56:31,734 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:31,734 INFO ]: Start isEmpty. Operand 106 states and 217 transitions. [2018-06-22 11:56:31,736 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:31,736 INFO ]: Found error trace [2018-06-22 11:56:31,736 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:31,736 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:31,736 INFO ]: Analyzing trace with hash -1300109097, now seen corresponding path program 1 times [2018-06-22 11:56:31,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:31,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:31,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:31,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:31,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:31,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:32,069 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:56:32,069 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:32,069 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:32,075 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:32,105 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:32,108 INFO ]: Computing forward predicates... [2018-06-22 11:56:32,731 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:56:32,759 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:32,759 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2018-06-22 11:56:32,759 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:56:32,759 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:56:32,759 INFO ]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:56:32,760 INFO ]: Start difference. First operand 106 states and 217 transitions. Second operand 22 states. [2018-06-22 11:56:34,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:34,042 INFO ]: Finished difference Result 138 states and 276 transitions. [2018-06-22 11:56:34,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:56:34,063 INFO ]: Start accepts. Automaton has 22 states. Word has length 29 [2018-06-22 11:56:34,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:34,065 INFO ]: With dead ends: 138 [2018-06-22 11:56:34,065 INFO ]: Without dead ends: 134 [2018-06-22 11:56:34,065 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:56:34,065 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 11:56:34,078 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 118. [2018-06-22 11:56:34,078 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 11:56:34,079 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 238 transitions. [2018-06-22 11:56:34,079 INFO ]: Start accepts. Automaton has 118 states and 238 transitions. Word has length 29 [2018-06-22 11:56:34,079 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:34,079 INFO ]: Abstraction has 118 states and 238 transitions. [2018-06-22 11:56:34,079 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:56:34,079 INFO ]: Start isEmpty. Operand 118 states and 238 transitions. [2018-06-22 11:56:34,082 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:34,082 INFO ]: Found error trace [2018-06-22 11:56:34,082 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:34,082 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:34,082 INFO ]: Analyzing trace with hash -1477107397, now seen corresponding path program 1 times [2018-06-22 11:56:34,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:34,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:34,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:34,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:34,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:34,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:34,226 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:34,226 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:34,226 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 11:56:34,226 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:56:34,226 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:56:34,226 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:34,226 INFO ]: Start difference. First operand 118 states and 238 transitions. Second operand 9 states. [2018-06-22 11:56:34,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:34,495 INFO ]: Finished difference Result 136 states and 275 transitions. [2018-06-22 11:56:34,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:56:34,495 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 11:56:34,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:34,496 INFO ]: With dead ends: 136 [2018-06-22 11:56:34,496 INFO ]: Without dead ends: 132 [2018-06-22 11:56:34,497 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:56:34,497 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-22 11:56:34,519 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 116. [2018-06-22 11:56:34,519 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 11:56:34,522 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 233 transitions. [2018-06-22 11:56:34,522 INFO ]: Start accepts. Automaton has 116 states and 233 transitions. Word has length 29 [2018-06-22 11:56:34,522 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:34,522 INFO ]: Abstraction has 116 states and 233 transitions. [2018-06-22 11:56:34,522 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:56:34,522 INFO ]: Start isEmpty. Operand 116 states and 233 transitions. [2018-06-22 11:56:34,524 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:34,524 INFO ]: Found error trace [2018-06-22 11:56:34,524 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:34,524 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:34,524 INFO ]: Analyzing trace with hash -657039530, now seen corresponding path program 1 times [2018-06-22 11:56:34,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:34,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:34,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:34,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:34,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:34,532 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:34,633 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:34,633 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:34,633 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 11:56:34,633 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:56:34,633 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:56:34,633 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:34,633 INFO ]: Start difference. First operand 116 states and 233 transitions. Second operand 9 states. [2018-06-22 11:56:34,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:34,751 INFO ]: Finished difference Result 138 states and 280 transitions. [2018-06-22 11:56:34,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:56:34,752 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 11:56:34,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:34,753 INFO ]: With dead ends: 138 [2018-06-22 11:56:34,753 INFO ]: Without dead ends: 134 [2018-06-22 11:56:34,753 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:56:34,753 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 11:56:34,761 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 118. [2018-06-22 11:56:34,761 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 11:56:34,762 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 238 transitions. [2018-06-22 11:56:34,762 INFO ]: Start accepts. Automaton has 118 states and 238 transitions. Word has length 29 [2018-06-22 11:56:34,762 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:34,762 INFO ]: Abstraction has 118 states and 238 transitions. [2018-06-22 11:56:34,762 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:56:34,762 INFO ]: Start isEmpty. Operand 118 states and 238 transitions. [2018-06-22 11:56:34,764 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:34,765 INFO ]: Found error trace [2018-06-22 11:56:34,765 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:34,765 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:34,765 INFO ]: Analyzing trace with hash -673110174, now seen corresponding path program 1 times [2018-06-22 11:56:34,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:34,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:34,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:34,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:34,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:34,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:34,859 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:56:34,859 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:34,859 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 11:56:34,859 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:56:34,860 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:56:34,860 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:34,860 INFO ]: Start difference. First operand 118 states and 238 transitions. Second operand 9 states. [2018-06-22 11:56:34,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:34,955 INFO ]: Finished difference Result 140 states and 285 transitions. [2018-06-22 11:56:34,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:56:34,956 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 11:56:34,956 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:34,957 INFO ]: With dead ends: 140 [2018-06-22 11:56:34,957 INFO ]: Without dead ends: 136 [2018-06-22 11:56:34,957 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:56:34,957 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-22 11:56:34,965 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 124. [2018-06-22 11:56:34,965 INFO ]: Start removeUnreachable. Operand 124 states. [2018-06-22 11:56:34,966 INFO ]: Finished removeUnreachable. Reduced from 124 states to 124 states and 253 transitions. [2018-06-22 11:56:34,966 INFO ]: Start accepts. Automaton has 124 states and 253 transitions. Word has length 29 [2018-06-22 11:56:34,966 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:34,966 INFO ]: Abstraction has 124 states and 253 transitions. [2018-06-22 11:56:34,966 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:56:34,966 INFO ]: Start isEmpty. Operand 124 states and 253 transitions. [2018-06-22 11:56:34,968 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:56:34,968 INFO ]: Found error trace [2018-06-22 11:56:34,968 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:34,968 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:34,968 INFO ]: Analyzing trace with hash -925709589, now seen corresponding path program 1 times [2018-06-22 11:56:34,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:34,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:34,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:34,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:34,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:34,976 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:35,016 INFO ]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:56:35,016 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:35,016 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:56:35,016 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:56:35,016 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:56:35,016 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:35,017 INFO ]: Start difference. First operand 124 states and 253 transitions. Second operand 6 states. [2018-06-22 11:56:35,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:35,115 INFO ]: Finished difference Result 138 states and 274 transitions. [2018-06-22 11:56:35,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:35,117 INFO ]: Start accepts. Automaton has 6 states. Word has length 33 [2018-06-22 11:56:35,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:35,118 INFO ]: With dead ends: 138 [2018-06-22 11:56:35,118 INFO ]: Without dead ends: 138 [2018-06-22 11:56:35,119 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:35,119 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-22 11:56:35,128 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-06-22 11:56:35,128 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 11:56:35,129 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 270 transitions. [2018-06-22 11:56:35,129 INFO ]: Start accepts. Automaton has 136 states and 270 transitions. Word has length 33 [2018-06-22 11:56:35,130 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:35,130 INFO ]: Abstraction has 136 states and 270 transitions. [2018-06-22 11:56:35,130 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:56:35,130 INFO ]: Start isEmpty. Operand 136 states and 270 transitions. [2018-06-22 11:56:35,132 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:56:35,132 INFO ]: Found error trace [2018-06-22 11:56:35,132 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:35,132 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:35,132 INFO ]: Analyzing trace with hash 2001839612, now seen corresponding path program 1 times [2018-06-22 11:56:35,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:35,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:35,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:35,133 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:35,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:35,142 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:36,000 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:56:36,000 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:36,000 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:36,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:36,030 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:36,032 INFO ]: Computing forward predicates... [2018-06-22 11:56:36,055 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:56:36,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:36,074 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:56:36,075 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:56:36,075 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:56:36,075 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:36,075 INFO ]: Start difference. First operand 136 states and 270 transitions. Second operand 9 states. [2018-06-22 11:56:36,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:36,314 INFO ]: Finished difference Result 168 states and 349 transitions. [2018-06-22 11:56:36,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:56:36,315 INFO ]: Start accepts. Automaton has 9 states. Word has length 33 [2018-06-22 11:56:36,315 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:36,316 INFO ]: With dead ends: 168 [2018-06-22 11:56:36,316 INFO ]: Without dead ends: 168 [2018-06-22 11:56:36,316 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:56:36,317 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-22 11:56:36,325 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 136. [2018-06-22 11:56:36,325 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 11:56:36,326 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 270 transitions. [2018-06-22 11:56:36,327 INFO ]: Start accepts. Automaton has 136 states and 270 transitions. Word has length 33 [2018-06-22 11:56:36,327 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:36,327 INFO ]: Abstraction has 136 states and 270 transitions. [2018-06-22 11:56:36,327 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:56:36,327 INFO ]: Start isEmpty. Operand 136 states and 270 transitions. [2018-06-22 11:56:36,329 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:56:36,329 INFO ]: Found error trace [2018-06-22 11:56:36,329 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:36,329 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:36,329 INFO ]: Analyzing trace with hash 1350472452, now seen corresponding path program 1 times [2018-06-22 11:56:36,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:36,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:36,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:36,329 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:36,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:36,336 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:36,461 INFO ]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:36,462 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:36,462 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 11:56:36,462 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:56:36,462 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:56:36,462 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:56:36,462 INFO ]: Start difference. First operand 136 states and 270 transitions. Second operand 10 states. [2018-06-22 11:56:36,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:36,600 INFO ]: Finished difference Result 142 states and 287 transitions. [2018-06-22 11:56:36,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:56:36,600 INFO ]: Start accepts. Automaton has 10 states. Word has length 33 [2018-06-22 11:56:36,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:36,601 INFO ]: With dead ends: 142 [2018-06-22 11:56:36,601 INFO ]: Without dead ends: 138 [2018-06-22 11:56:36,601 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:56:36,601 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-22 11:56:36,612 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 120. [2018-06-22 11:56:36,612 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-22 11:56:36,613 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 230 transitions. [2018-06-22 11:56:36,613 INFO ]: Start accepts. Automaton has 120 states and 230 transitions. Word has length 33 [2018-06-22 11:56:36,613 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:36,613 INFO ]: Abstraction has 120 states and 230 transitions. [2018-06-22 11:56:36,613 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:56:36,613 INFO ]: Start isEmpty. Operand 120 states and 230 transitions. [2018-06-22 11:56:36,615 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:56:36,615 INFO ]: Found error trace [2018-06-22 11:56:36,615 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:36,615 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:36,615 INFO ]: Analyzing trace with hash -2144282503, now seen corresponding path program 1 times [2018-06-22 11:56:36,615 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:36,615 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:36,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:36,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:36,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:36,622 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:37,305 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:56:37,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:37,305 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:37,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:37,341 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:37,345 INFO ]: Computing forward predicates... [2018-06-22 11:56:37,421 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:56:37,450 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:37,450 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-06-22 11:56:37,450 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:56:37,450 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:56:37,450 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:56:37,450 INFO ]: Start difference. First operand 120 states and 230 transitions. Second operand 12 states. [2018-06-22 11:56:37,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:37,738 INFO ]: Finished difference Result 168 states and 353 transitions. [2018-06-22 11:56:37,739 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:56:37,739 INFO ]: Start accepts. Automaton has 12 states. Word has length 33 [2018-06-22 11:56:37,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:37,740 INFO ]: With dead ends: 168 [2018-06-22 11:56:37,740 INFO ]: Without dead ends: 168 [2018-06-22 11:56:37,741 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:56:37,741 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-22 11:56:37,749 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 122. [2018-06-22 11:56:37,749 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-22 11:56:37,751 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 235 transitions. [2018-06-22 11:56:37,751 INFO ]: Start accepts. Automaton has 122 states and 235 transitions. Word has length 33 [2018-06-22 11:56:37,751 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:37,751 INFO ]: Abstraction has 122 states and 235 transitions. [2018-06-22 11:56:37,751 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:56:37,751 INFO ]: Start isEmpty. Operand 122 states and 235 transitions. [2018-06-22 11:56:37,752 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:56:37,752 INFO ]: Found error trace [2018-06-22 11:56:37,752 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:37,752 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:37,752 INFO ]: Analyzing trace with hash -408302203, now seen corresponding path program 1 times [2018-06-22 11:56:37,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:37,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:37,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:37,753 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:37,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:37,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:37,872 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:56:37,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:37,872 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:37,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:37,904 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:37,906 INFO ]: Computing forward predicates... [2018-06-22 11:56:37,966 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:56:37,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:37,986 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-06-22 11:56:37,986 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:56:37,986 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:56:37,986 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:56:37,986 INFO ]: Start difference. First operand 122 states and 235 transitions. Second operand 12 states. [2018-06-22 11:56:38,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:38,275 INFO ]: Finished difference Result 168 states and 351 transitions. [2018-06-22 11:56:38,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:56:38,275 INFO ]: Start accepts. Automaton has 12 states. Word has length 33 [2018-06-22 11:56:38,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:38,276 INFO ]: With dead ends: 168 [2018-06-22 11:56:38,276 INFO ]: Without dead ends: 168 [2018-06-22 11:56:38,276 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:56:38,277 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-22 11:56:38,286 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 120. [2018-06-22 11:56:38,286 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-22 11:56:38,287 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 229 transitions. [2018-06-22 11:56:38,287 INFO ]: Start accepts. Automaton has 120 states and 229 transitions. Word has length 33 [2018-06-22 11:56:38,287 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:38,287 INFO ]: Abstraction has 120 states and 229 transitions. [2018-06-22 11:56:38,287 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:56:38,287 INFO ]: Start isEmpty. Operand 120 states and 229 transitions. [2018-06-22 11:56:38,288 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:56:38,288 INFO ]: Found error trace [2018-06-22 11:56:38,288 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:38,288 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:38,288 INFO ]: Analyzing trace with hash -867468128, now seen corresponding path program 1 times [2018-06-22 11:56:38,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:38,289 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:38,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:38,289 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:38,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:38,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:38,444 INFO ]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:56:38,444 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:38,444 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:38,450 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:38,463 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:38,465 INFO ]: Computing forward predicates... [2018-06-22 11:56:38,598 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:56:38,616 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:38,616 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2018-06-22 11:56:38,617 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:56:38,617 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:56:38,617 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:56:38,617 INFO ]: Start difference. First operand 120 states and 229 transitions. Second operand 14 states. [2018-06-22 11:56:39,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:39,778 INFO ]: Finished difference Result 192 states and 384 transitions. [2018-06-22 11:56:39,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:56:39,779 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 11:56:39,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:39,780 INFO ]: With dead ends: 192 [2018-06-22 11:56:39,780 INFO ]: Without dead ends: 192 [2018-06-22 11:56:39,780 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:56:39,780 INFO ]: Start minimizeSevpa. Operand 192 states. [2018-06-22 11:56:39,790 INFO ]: Finished minimizeSevpa. Reduced states from 192 to 150. [2018-06-22 11:56:39,790 INFO ]: Start removeUnreachable. Operand 150 states. [2018-06-22 11:56:39,792 INFO ]: Finished removeUnreachable. Reduced from 150 states to 150 states and 298 transitions. [2018-06-22 11:56:39,792 INFO ]: Start accepts. Automaton has 150 states and 298 transitions. Word has length 33 [2018-06-22 11:56:39,792 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:39,792 INFO ]: Abstraction has 150 states and 298 transitions. [2018-06-22 11:56:39,792 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:56:39,792 INFO ]: Start isEmpty. Operand 150 states and 298 transitions. [2018-06-22 11:56:39,793 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:39,793 INFO ]: Found error trace [2018-06-22 11:56:39,793 INFO ]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:39,793 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:39,794 INFO ]: Analyzing trace with hash -1766578533, now seen corresponding path program 2 times [2018-06-22 11:56:39,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:39,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:39,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:39,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:39,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:39,806 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:40,191 INFO ]: Checked inductivity of 24 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:40,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:40,191 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:40,198 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:56:40,216 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:40,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:40,217 INFO ]: Computing forward predicates... [2018-06-22 11:56:40,241 INFO ]: Checked inductivity of 24 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:40,265 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:40,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-22 11:56:40,266 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:56:40,266 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:56:40,266 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:56:40,266 INFO ]: Start difference. First operand 150 states and 298 transitions. Second operand 12 states. [2018-06-22 11:56:40,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:40,598 INFO ]: Finished difference Result 190 states and 372 transitions. [2018-06-22 11:56:40,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:56:40,598 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 11:56:40,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:40,599 INFO ]: With dead ends: 190 [2018-06-22 11:56:40,599 INFO ]: Without dead ends: 190 [2018-06-22 11:56:40,600 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:56:40,600 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-22 11:56:40,608 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 148. [2018-06-22 11:56:40,608 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 11:56:40,609 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 296 transitions. [2018-06-22 11:56:40,609 INFO ]: Start accepts. Automaton has 148 states and 296 transitions. Word has length 37 [2018-06-22 11:56:40,611 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:40,611 INFO ]: Abstraction has 148 states and 296 transitions. [2018-06-22 11:56:40,611 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:56:40,611 INFO ]: Start isEmpty. Operand 148 states and 296 transitions. [2018-06-22 11:56:40,612 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:40,612 INFO ]: Found error trace [2018-06-22 11:56:40,612 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:40,612 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:40,612 INFO ]: Analyzing trace with hash -1439349565, now seen corresponding path program 3 times [2018-06-22 11:56:40,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:40,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:40,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:40,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:40,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:40,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:40,663 INFO ]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:56:40,663 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:40,663 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:40,673 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:56:40,690 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:56:40,690 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:40,692 INFO ]: Computing forward predicates... [2018-06-22 11:56:40,708 INFO ]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:56:40,726 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:40,726 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:56:40,727 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:40,727 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:40,727 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:40,727 INFO ]: Start difference. First operand 148 states and 296 transitions. Second operand 7 states. [2018-06-22 11:56:40,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:40,958 INFO ]: Finished difference Result 168 states and 324 transitions. [2018-06-22 11:56:40,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:56:40,958 INFO ]: Start accepts. Automaton has 7 states. Word has length 37 [2018-06-22 11:56:40,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:40,959 INFO ]: With dead ends: 168 [2018-06-22 11:56:40,959 INFO ]: Without dead ends: 164 [2018-06-22 11:56:40,959 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:56:40,960 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 11:56:40,966 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 138. [2018-06-22 11:56:40,966 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 11:56:40,967 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 278 transitions. [2018-06-22 11:56:40,967 INFO ]: Start accepts. Automaton has 138 states and 278 transitions. Word has length 37 [2018-06-22 11:56:40,967 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:40,967 INFO ]: Abstraction has 138 states and 278 transitions. [2018-06-22 11:56:40,967 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:40,967 INFO ]: Start isEmpty. Operand 138 states and 278 transitions. [2018-06-22 11:56:40,969 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:40,969 INFO ]: Found error trace [2018-06-22 11:56:40,969 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:40,969 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:40,969 INFO ]: Analyzing trace with hash 1316054662, now seen corresponding path program 2 times [2018-06-22 11:56:40,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:40,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:40,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:40,970 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:40,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:40,976 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:41,189 INFO ]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:56:41,189 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:41,189 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:56:41,189 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:56:41,190 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:56:41,190 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:41,190 INFO ]: Start difference. First operand 138 states and 278 transitions. Second operand 8 states. [2018-06-22 11:56:41,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:41,348 INFO ]: Finished difference Result 192 states and 421 transitions. [2018-06-22 11:56:41,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:56:41,348 INFO ]: Start accepts. Automaton has 8 states. Word has length 37 [2018-06-22 11:56:41,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:41,350 INFO ]: With dead ends: 192 [2018-06-22 11:56:41,350 INFO ]: Without dead ends: 186 [2018-06-22 11:56:41,350 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:56:41,350 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-22 11:56:41,359 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 158. [2018-06-22 11:56:41,360 INFO ]: Start removeUnreachable. Operand 158 states. [2018-06-22 11:56:41,361 INFO ]: Finished removeUnreachable. Reduced from 158 states to 158 states and 340 transitions. [2018-06-22 11:56:41,361 INFO ]: Start accepts. Automaton has 158 states and 340 transitions. Word has length 37 [2018-06-22 11:56:41,361 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:41,361 INFO ]: Abstraction has 158 states and 340 transitions. [2018-06-22 11:56:41,361 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:56:41,361 INFO ]: Start isEmpty. Operand 158 states and 340 transitions. [2018-06-22 11:56:41,364 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:41,364 INFO ]: Found error trace [2018-06-22 11:56:41,364 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:41,364 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:41,364 INFO ]: Analyzing trace with hash -859187125, now seen corresponding path program 1 times [2018-06-22 11:56:41,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:41,364 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:41,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:41,365 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:41,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:41,372 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:41,435 INFO ]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:56:41,435 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:41,435 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:41,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:41,462 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:41,465 INFO ]: Computing forward predicates... [2018-06-22 11:56:41,485 INFO ]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:56:41,505 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:41,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:56:41,505 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:56:41,505 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:56:41,505 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:41,506 INFO ]: Start difference. First operand 158 states and 340 transitions. Second operand 9 states. [2018-06-22 11:56:41,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:41,697 INFO ]: Finished difference Result 216 states and 480 transitions. [2018-06-22 11:56:41,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:56:41,697 INFO ]: Start accepts. Automaton has 9 states. Word has length 37 [2018-06-22 11:56:41,697 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:41,699 INFO ]: With dead ends: 216 [2018-06-22 11:56:41,699 INFO ]: Without dead ends: 216 [2018-06-22 11:56:41,699 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:56:41,699 INFO ]: Start minimizeSevpa. Operand 216 states. [2018-06-22 11:56:41,711 INFO ]: Finished minimizeSevpa. Reduced states from 216 to 184. [2018-06-22 11:56:41,711 INFO ]: Start removeUnreachable. Operand 184 states. [2018-06-22 11:56:41,712 INFO ]: Finished removeUnreachable. Reduced from 184 states to 184 states and 411 transitions. [2018-06-22 11:56:41,712 INFO ]: Start accepts. Automaton has 184 states and 411 transitions. Word has length 37 [2018-06-22 11:56:41,712 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:41,712 INFO ]: Abstraction has 184 states and 411 transitions. [2018-06-22 11:56:41,712 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:56:41,712 INFO ]: Start isEmpty. Operand 184 states and 411 transitions. [2018-06-22 11:56:41,714 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:41,714 INFO ]: Found error trace [2018-06-22 11:56:41,714 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:41,714 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:41,714 INFO ]: Analyzing trace with hash 1551221839, now seen corresponding path program 1 times [2018-06-22 11:56:41,714 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:41,714 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:41,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:41,715 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:41,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:41,722 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:41,820 INFO ]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:41,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:41,820 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:56:41,820 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:56:41,820 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:56:41,820 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:41,820 INFO ]: Start difference. First operand 184 states and 411 transitions. Second operand 4 states. [2018-06-22 11:56:41,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:41,845 INFO ]: Finished difference Result 156 states and 328 transitions. [2018-06-22 11:56:41,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:56:41,845 INFO ]: Start accepts. Automaton has 4 states. Word has length 37 [2018-06-22 11:56:41,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:41,846 INFO ]: With dead ends: 156 [2018-06-22 11:56:41,846 INFO ]: Without dead ends: 156 [2018-06-22 11:56:41,846 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:41,847 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-22 11:56:41,854 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-06-22 11:56:41,854 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-22 11:56:41,855 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 323 transitions. [2018-06-22 11:56:41,855 INFO ]: Start accepts. Automaton has 154 states and 323 transitions. Word has length 37 [2018-06-22 11:56:41,855 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:41,855 INFO ]: Abstraction has 154 states and 323 transitions. [2018-06-22 11:56:41,855 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:56:41,855 INFO ]: Start isEmpty. Operand 154 states and 323 transitions. [2018-06-22 11:56:41,857 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:56:41,857 INFO ]: Found error trace [2018-06-22 11:56:41,857 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:41,857 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:41,857 INFO ]: Analyzing trace with hash -1863717082, now seen corresponding path program 1 times [2018-06-22 11:56:41,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:41,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:41,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:41,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:41,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:41,864 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:41,959 INFO ]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:41,959 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:41,959 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:41,965 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:41,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:41,989 INFO ]: Computing forward predicates... [2018-06-22 11:56:42,016 INFO ]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:42,034 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:42,034 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:56:42,035 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:56:42,035 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:56:42,035 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:56:42,035 INFO ]: Start difference. First operand 154 states and 323 transitions. Second operand 10 states. [2018-06-22 11:56:42,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:42,191 INFO ]: Finished difference Result 250 states and 522 transitions. [2018-06-22 11:56:42,192 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:56:42,192 INFO ]: Start accepts. Automaton has 10 states. Word has length 41 [2018-06-22 11:56:42,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:42,193 INFO ]: With dead ends: 250 [2018-06-22 11:56:42,193 INFO ]: Without dead ends: 238 [2018-06-22 11:56:42,194 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:56:42,194 INFO ]: Start minimizeSevpa. Operand 238 states. [2018-06-22 11:56:42,205 INFO ]: Finished minimizeSevpa. Reduced states from 238 to 178. [2018-06-22 11:56:42,205 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-22 11:56:42,206 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 377 transitions. [2018-06-22 11:56:42,206 INFO ]: Start accepts. Automaton has 178 states and 377 transitions. Word has length 41 [2018-06-22 11:56:42,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:42,207 INFO ]: Abstraction has 178 states and 377 transitions. [2018-06-22 11:56:42,207 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:56:42,207 INFO ]: Start isEmpty. Operand 178 states and 377 transitions. [2018-06-22 11:56:42,208 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:56:42,208 INFO ]: Found error trace [2018-06-22 11:56:42,208 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:42,208 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:42,208 INFO ]: Analyzing trace with hash -1411546219, now seen corresponding path program 1 times [2018-06-22 11:56:42,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:42,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:42,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:42,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:42,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:42,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:42,842 INFO ]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:56:42,842 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:42,842 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:56:42,857 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:42,894 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:42,896 INFO ]: Computing forward predicates... [2018-06-22 11:56:43,675 INFO ]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:43,694 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:43,694 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 14 [2018-06-22 11:56:43,694 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:56:43,694 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:56:43,694 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:56:43,694 INFO ]: Start difference. First operand 178 states and 377 transitions. Second operand 14 states. [2018-06-22 11:56:44,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:44,265 INFO ]: Finished difference Result 230 states and 464 transitions. [2018-06-22 11:56:44,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:56:44,265 INFO ]: Start accepts. Automaton has 14 states. Word has length 41 [2018-06-22 11:56:44,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:44,266 INFO ]: With dead ends: 230 [2018-06-22 11:56:44,266 INFO ]: Without dead ends: 214 [2018-06-22 11:56:44,267 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:56:44,267 INFO ]: Start minimizeSevpa. Operand 214 states. [2018-06-22 11:56:44,276 INFO ]: Finished minimizeSevpa. Reduced states from 214 to 164. [2018-06-22 11:56:44,276 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 11:56:44,277 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 311 transitions. [2018-06-22 11:56:44,277 INFO ]: Start accepts. Automaton has 164 states and 311 transitions. Word has length 41 [2018-06-22 11:56:44,277 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:44,277 INFO ]: Abstraction has 164 states and 311 transitions. [2018-06-22 11:56:44,277 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:56:44,277 INFO ]: Start isEmpty. Operand 164 states and 311 transitions. [2018-06-22 11:56:44,278 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:56:44,279 INFO ]: Found error trace [2018-06-22 11:56:44,279 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:44,279 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:44,279 INFO ]: Analyzing trace with hash 1026887573, now seen corresponding path program 1 times [2018-06-22 11:56:44,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:44,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:44,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:44,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:44,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:44,288 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:44,339 INFO ]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:56:44,339 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:44,339 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:44,345 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:44,364 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:44,365 INFO ]: Computing forward predicates... [2018-06-22 11:56:44,411 INFO ]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:56:44,430 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:56:44,430 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2018-06-22 11:56:44,430 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:56:44,430 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:56:44,430 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:56:44,430 INFO ]: Start difference. First operand 164 states and 311 transitions. Second operand 8 states. [2018-06-22 11:56:44,771 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:44,771 INFO ]: Finished difference Result 219 states and 415 transitions. [2018-06-22 11:56:44,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:56:44,771 INFO ]: Start accepts. Automaton has 8 states. Word has length 41 [2018-06-22 11:56:44,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:44,772 INFO ]: With dead ends: 219 [2018-06-22 11:56:44,772 INFO ]: Without dead ends: 145 [2018-06-22 11:56:44,772 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:56:44,772 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-22 11:56:44,777 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 134. [2018-06-22 11:56:44,777 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-22 11:56:44,778 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 236 transitions. [2018-06-22 11:56:44,778 INFO ]: Start accepts. Automaton has 134 states and 236 transitions. Word has length 41 [2018-06-22 11:56:44,778 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:44,778 INFO ]: Abstraction has 134 states and 236 transitions. [2018-06-22 11:56:44,778 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:56:44,778 INFO ]: Start isEmpty. Operand 134 states and 236 transitions. [2018-06-22 11:56:44,778 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:56:44,778 INFO ]: Found error trace [2018-06-22 11:56:44,778 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:44,778 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:44,778 INFO ]: Analyzing trace with hash 1066457935, now seen corresponding path program 1 times [2018-06-22 11:56:44,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:44,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:44,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:44,779 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:44,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:44,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:44,915 INFO ]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:56:44,915 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:44,915 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:56:44,915 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:56:44,915 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:56:44,915 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:44,916 INFO ]: Start difference. First operand 134 states and 236 transitions. Second operand 4 states. [2018-06-22 11:56:45,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:45,217 INFO ]: Finished difference Result 124 states and 223 transitions. [2018-06-22 11:56:45,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:56:45,218 INFO ]: Start accepts. Automaton has 4 states. Word has length 41 [2018-06-22 11:56:45,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:45,218 INFO ]: With dead ends: 124 [2018-06-22 11:56:45,218 INFO ]: Without dead ends: 119 [2018-06-22 11:56:45,219 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:45,219 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-22 11:56:45,224 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-06-22 11:56:45,224 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-22 11:56:45,225 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 215 transitions. [2018-06-22 11:56:45,225 INFO ]: Start accepts. Automaton has 119 states and 215 transitions. Word has length 41 [2018-06-22 11:56:45,225 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:45,225 INFO ]: Abstraction has 119 states and 215 transitions. [2018-06-22 11:56:45,225 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:56:45,225 INFO ]: Start isEmpty. Operand 119 states and 215 transitions. [2018-06-22 11:56:45,226 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:56:45,226 INFO ]: Found error trace [2018-06-22 11:56:45,226 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:45,226 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:45,227 INFO ]: Analyzing trace with hash -878379804, now seen corresponding path program 2 times [2018-06-22 11:56:45,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:45,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:45,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:45,227 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:45,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:45,237 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:45,576 INFO ]: Checked inductivity of 25 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:56:45,576 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:45,576 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:45,581 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:56:45,603 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:45,603 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:45,605 INFO ]: Computing forward predicates... [2018-06-22 11:56:45,663 INFO ]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:56:45,682 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:45,682 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-22 11:56:45,682 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:56:45,682 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:56:45,682 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:56:45,682 INFO ]: Start difference. First operand 119 states and 215 transitions. Second operand 17 states. [2018-06-22 11:56:46,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:46,438 INFO ]: Finished difference Result 187 states and 327 transitions. [2018-06-22 11:56:46,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:56:46,438 INFO ]: Start accepts. Automaton has 17 states. Word has length 45 [2018-06-22 11:56:46,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:46,439 INFO ]: With dead ends: 187 [2018-06-22 11:56:46,439 INFO ]: Without dead ends: 187 [2018-06-22 11:56:46,439 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:56:46,439 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-22 11:56:46,444 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 151. [2018-06-22 11:56:46,444 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-22 11:56:46,445 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 265 transitions. [2018-06-22 11:56:46,445 INFO ]: Start accepts. Automaton has 151 states and 265 transitions. Word has length 45 [2018-06-22 11:56:46,446 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:46,446 INFO ]: Abstraction has 151 states and 265 transitions. [2018-06-22 11:56:46,446 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:56:46,446 INFO ]: Start isEmpty. Operand 151 states and 265 transitions. [2018-06-22 11:56:46,447 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:56:46,447 INFO ]: Found error trace [2018-06-22 11:56:46,447 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:46,447 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:46,447 INFO ]: Analyzing trace with hash 2096635895, now seen corresponding path program 1 times [2018-06-22 11:56:46,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:46,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:46,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:46,447 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:46,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:46,462 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:46,829 INFO ]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:56:46,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:46,830 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:46,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:46,859 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:46,863 INFO ]: Computing forward predicates... [2018-06-22 11:56:47,847 WARN ]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-22 11:56:47,862 INFO ]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:47,892 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:47,892 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2018-06-22 11:56:47,893 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:56:47,893 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:56:47,893 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1048, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:56:47,893 INFO ]: Start difference. First operand 151 states and 265 transitions. Second operand 34 states. [2018-06-22 11:56:50,101 WARN ]: Spent 522.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-06-22 11:56:50,723 WARN ]: Spent 554.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2018-06-22 11:56:50,982 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:50,982 INFO ]: Finished difference Result 233 states and 401 transitions. [2018-06-22 11:56:50,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:56:50,982 INFO ]: Start accepts. Automaton has 34 states. Word has length 45 [2018-06-22 11:56:50,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:50,983 INFO ]: With dead ends: 233 [2018-06-22 11:56:50,983 INFO ]: Without dead ends: 213 [2018-06-22 11:56:50,984 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=206, Invalid=2656, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:56:50,984 INFO ]: Start minimizeSevpa. Operand 213 states. [2018-06-22 11:56:50,990 INFO ]: Finished minimizeSevpa. Reduced states from 213 to 173. [2018-06-22 11:56:50,990 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-22 11:56:50,991 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 303 transitions. [2018-06-22 11:56:50,991 INFO ]: Start accepts. Automaton has 173 states and 303 transitions. Word has length 45 [2018-06-22 11:56:50,991 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:50,991 INFO ]: Abstraction has 173 states and 303 transitions. [2018-06-22 11:56:50,991 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:56:50,991 INFO ]: Start isEmpty. Operand 173 states and 303 transitions. [2018-06-22 11:56:50,992 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:56:50,992 INFO ]: Found error trace [2018-06-22 11:56:50,992 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:50,992 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:50,992 INFO ]: Analyzing trace with hash 993914541, now seen corresponding path program 1 times [2018-06-22 11:56:50,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:50,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:50,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:50,993 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:50,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:51,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:51,093 INFO ]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:51,093 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:51,093 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:56:51,093 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:56:51,093 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:56:51,093 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:51,093 INFO ]: Start difference. First operand 173 states and 303 transitions. Second operand 4 states. [2018-06-22 11:56:51,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:51,166 INFO ]: Finished difference Result 195 states and 343 transitions. [2018-06-22 11:56:51,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:56:51,167 INFO ]: Start accepts. Automaton has 4 states. Word has length 45 [2018-06-22 11:56:51,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:51,167 INFO ]: With dead ends: 195 [2018-06-22 11:56:51,167 INFO ]: Without dead ends: 183 [2018-06-22 11:56:51,167 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:56:51,168 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-22 11:56:51,172 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 181. [2018-06-22 11:56:51,172 INFO ]: Start removeUnreachable. Operand 181 states. [2018-06-22 11:56:51,173 INFO ]: Finished removeUnreachable. Reduced from 181 states to 181 states and 321 transitions. [2018-06-22 11:56:51,173 INFO ]: Start accepts. Automaton has 181 states and 321 transitions. Word has length 45 [2018-06-22 11:56:51,173 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:51,173 INFO ]: Abstraction has 181 states and 321 transitions. [2018-06-22 11:56:51,173 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:56:51,173 INFO ]: Start isEmpty. Operand 181 states and 321 transitions. [2018-06-22 11:56:51,174 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:51,174 INFO ]: Found error trace [2018-06-22 11:56:51,174 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:51,174 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:51,174 INFO ]: Analyzing trace with hash 969415897, now seen corresponding path program 2 times [2018-06-22 11:56:51,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:51,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:51,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:51,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:51,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:51,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:51,808 INFO ]: Checked inductivity of 34 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:56:51,808 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:51,808 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:51,814 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:56:51,837 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:51,837 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:51,839 INFO ]: Computing forward predicates... [2018-06-22 11:56:51,933 INFO ]: Checked inductivity of 34 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:56:51,953 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:51,953 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 21 [2018-06-22 11:56:51,953 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:56:51,954 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:56:51,954 INFO ]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:56:51,954 INFO ]: Start difference. First operand 181 states and 321 transitions. Second operand 21 states. [2018-06-22 11:56:52,602 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:52,602 INFO ]: Finished difference Result 315 states and 538 transitions. [2018-06-22 11:56:52,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:56:52,602 INFO ]: Start accepts. Automaton has 21 states. Word has length 49 [2018-06-22 11:56:52,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:52,603 INFO ]: With dead ends: 315 [2018-06-22 11:56:52,603 INFO ]: Without dead ends: 301 [2018-06-22 11:56:52,603 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:56:52,603 INFO ]: Start minimizeSevpa. Operand 301 states. [2018-06-22 11:56:52,614 INFO ]: Finished minimizeSevpa. Reduced states from 301 to 261. [2018-06-22 11:56:52,614 INFO ]: Start removeUnreachable. Operand 261 states. [2018-06-22 11:56:52,616 INFO ]: Finished removeUnreachable. Reduced from 261 states to 261 states and 457 transitions. [2018-06-22 11:56:52,616 INFO ]: Start accepts. Automaton has 261 states and 457 transitions. Word has length 49 [2018-06-22 11:56:52,616 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:52,616 INFO ]: Abstraction has 261 states and 457 transitions. [2018-06-22 11:56:52,616 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:56:52,616 INFO ]: Start isEmpty. Operand 261 states and 457 transitions. [2018-06-22 11:56:52,617 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:52,617 INFO ]: Found error trace [2018-06-22 11:56:52,617 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:52,617 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:52,617 INFO ]: Analyzing trace with hash 1288950081, now seen corresponding path program 1 times [2018-06-22 11:56:52,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:52,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:52,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:52,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:52,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:52,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:52,751 INFO ]: Checked inductivity of 31 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:52,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:52,751 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:52,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:52,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:52,785 INFO ]: Computing forward predicates... [2018-06-22 11:56:52,838 INFO ]: Checked inductivity of 31 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:56:52,858 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:52,858 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2018-06-22 11:56:52,858 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:56:52,858 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:56:52,858 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:56:52,858 INFO ]: Start difference. First operand 261 states and 457 transitions. Second operand 13 states. [2018-06-22 11:56:53,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:53,114 INFO ]: Finished difference Result 357 states and 617 transitions. [2018-06-22 11:56:53,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:56:53,115 INFO ]: Start accepts. Automaton has 13 states. Word has length 49 [2018-06-22 11:56:53,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:53,118 INFO ]: With dead ends: 357 [2018-06-22 11:56:53,118 INFO ]: Without dead ends: 348 [2018-06-22 11:56:53,118 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:56:53,118 INFO ]: Start minimizeSevpa. Operand 348 states. [2018-06-22 11:56:53,138 INFO ]: Finished minimizeSevpa. Reduced states from 348 to 268. [2018-06-22 11:56:53,138 INFO ]: Start removeUnreachable. Operand 268 states. [2018-06-22 11:56:53,140 INFO ]: Finished removeUnreachable. Reduced from 268 states to 268 states and 469 transitions. [2018-06-22 11:56:53,140 INFO ]: Start accepts. Automaton has 268 states and 469 transitions. Word has length 49 [2018-06-22 11:56:53,140 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:53,140 INFO ]: Abstraction has 268 states and 469 transitions. [2018-06-22 11:56:53,140 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:56:53,140 INFO ]: Start isEmpty. Operand 268 states and 469 transitions. [2018-06-22 11:56:53,144 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:53,144 INFO ]: Found error trace [2018-06-22 11:56:53,144 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:53,144 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:53,144 INFO ]: Analyzing trace with hash 1038897061, now seen corresponding path program 1 times [2018-06-22 11:56:53,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:53,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:53,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:53,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:53,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:53,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:53,307 INFO ]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:53,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:53,307 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:53,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:53,354 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:53,357 INFO ]: Computing forward predicates... [2018-06-22 11:56:53,544 INFO ]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:53,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:53,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2018-06-22 11:56:53,563 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:56:53,563 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:56:53,563 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:56:53,564 INFO ]: Start difference. First operand 268 states and 469 transitions. Second operand 18 states. [2018-06-22 11:56:54,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:54,095 INFO ]: Finished difference Result 414 states and 737 transitions. [2018-06-22 11:56:54,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:56:54,095 INFO ]: Start accepts. Automaton has 18 states. Word has length 49 [2018-06-22 11:56:54,095 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:54,097 INFO ]: With dead ends: 414 [2018-06-22 11:56:54,097 INFO ]: Without dead ends: 414 [2018-06-22 11:56:54,097 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:56:54,097 INFO ]: Start minimizeSevpa. Operand 414 states. [2018-06-22 11:56:54,105 INFO ]: Finished minimizeSevpa. Reduced states from 414 to 274. [2018-06-22 11:56:54,105 INFO ]: Start removeUnreachable. Operand 274 states. [2018-06-22 11:56:54,106 INFO ]: Finished removeUnreachable. Reduced from 274 states to 274 states and 484 transitions. [2018-06-22 11:56:54,106 INFO ]: Start accepts. Automaton has 274 states and 484 transitions. Word has length 49 [2018-06-22 11:56:54,107 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:54,107 INFO ]: Abstraction has 274 states and 484 transitions. [2018-06-22 11:56:54,107 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:56:54,107 INFO ]: Start isEmpty. Operand 274 states and 484 transitions. [2018-06-22 11:56:54,108 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:54,108 INFO ]: Found error trace [2018-06-22 11:56:54,108 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:54,108 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:54,108 INFO ]: Analyzing trace with hash -1594431488, now seen corresponding path program 1 times [2018-06-22 11:56:54,108 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:54,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:54,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:54,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:54,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:54,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:54,689 INFO ]: Checked inductivity of 30 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:54,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:54,689 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:54,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:54,717 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:54,719 INFO ]: Computing forward predicates... [2018-06-22 11:56:54,826 INFO ]: Checked inductivity of 30 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:54,844 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:54,844 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-06-22 11:56:54,845 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:56:54,845 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:56:54,845 INFO ]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:56:54,845 INFO ]: Start difference. First operand 274 states and 484 transitions. Second operand 22 states. [2018-06-22 11:56:55,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:55,521 INFO ]: Finished difference Result 508 states and 876 transitions. [2018-06-22 11:56:55,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:56:55,521 INFO ]: Start accepts. Automaton has 22 states. Word has length 49 [2018-06-22 11:56:55,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:55,525 INFO ]: With dead ends: 508 [2018-06-22 11:56:55,525 INFO ]: Without dead ends: 494 [2018-06-22 11:56:55,525 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=1263, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:56:55,526 INFO ]: Start minimizeSevpa. Operand 494 states. [2018-06-22 11:56:55,542 INFO ]: Finished minimizeSevpa. Reduced states from 494 to 300. [2018-06-22 11:56:55,542 INFO ]: Start removeUnreachable. Operand 300 states. [2018-06-22 11:56:55,544 INFO ]: Finished removeUnreachable. Reduced from 300 states to 300 states and 530 transitions. [2018-06-22 11:56:55,544 INFO ]: Start accepts. Automaton has 300 states and 530 transitions. Word has length 49 [2018-06-22 11:56:55,544 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:55,544 INFO ]: Abstraction has 300 states and 530 transitions. [2018-06-22 11:56:55,544 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:56:55,544 INFO ]: Start isEmpty. Operand 300 states and 530 transitions. [2018-06-22 11:56:55,545 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:55,545 INFO ]: Found error trace [2018-06-22 11:56:55,545 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:55,546 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:55,546 INFO ]: Analyzing trace with hash -1547884818, now seen corresponding path program 1 times [2018-06-22 11:56:55,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:55,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:55,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:55,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:55,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:55,555 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:55,637 INFO ]: Checked inductivity of 32 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:56:55,637 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:55,637 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:55,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:55,666 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:55,668 INFO ]: Computing forward predicates... [2018-06-22 11:56:55,736 INFO ]: Checked inductivity of 32 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:56:55,754 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:55,754 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2018-06-22 11:56:55,754 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:56:55,754 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:56:55,754 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:56:55,755 INFO ]: Start difference. First operand 300 states and 530 transitions. Second operand 17 states. [2018-06-22 11:56:56,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:56,123 INFO ]: Finished difference Result 414 states and 704 transitions. [2018-06-22 11:56:56,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:56:56,123 INFO ]: Start accepts. Automaton has 17 states. Word has length 49 [2018-06-22 11:56:56,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:56,125 INFO ]: With dead ends: 414 [2018-06-22 11:56:56,125 INFO ]: Without dead ends: 400 [2018-06-22 11:56:56,125 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:56:56,125 INFO ]: Start minimizeSevpa. Operand 400 states. [2018-06-22 11:56:56,139 INFO ]: Finished minimizeSevpa. Reduced states from 400 to 306. [2018-06-22 11:56:56,139 INFO ]: Start removeUnreachable. Operand 306 states. [2018-06-22 11:56:56,144 INFO ]: Finished removeUnreachable. Reduced from 306 states to 306 states and 536 transitions. [2018-06-22 11:56:56,145 INFO ]: Start accepts. Automaton has 306 states and 536 transitions. Word has length 49 [2018-06-22 11:56:56,145 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:56,145 INFO ]: Abstraction has 306 states and 536 transitions. [2018-06-22 11:56:56,145 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:56:56,145 INFO ]: Start isEmpty. Operand 306 states and 536 transitions. [2018-06-22 11:56:56,146 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:56,146 INFO ]: Found error trace [2018-06-22 11:56:56,146 INFO ]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:56,147 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:56,147 INFO ]: Analyzing trace with hash -317431785, now seen corresponding path program 1 times [2018-06-22 11:56:56,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:56,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:56,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:56,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:56,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:56,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:56,174 INFO ]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:56:56,175 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:56,175 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:56:56,175 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:56:56,175 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:56:56,175 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:56,175 INFO ]: Start difference. First operand 306 states and 536 transitions. Second operand 4 states. [2018-06-22 11:56:56,195 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:56,195 INFO ]: Finished difference Result 316 states and 542 transitions. [2018-06-22 11:56:56,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:56:56,195 INFO ]: Start accepts. Automaton has 4 states. Word has length 49 [2018-06-22 11:56:56,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:56,196 INFO ]: With dead ends: 316 [2018-06-22 11:56:56,196 INFO ]: Without dead ends: 245 [2018-06-22 11:56:56,196 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:56:56,196 INFO ]: Start minimizeSevpa. Operand 245 states. [2018-06-22 11:56:56,202 INFO ]: Finished minimizeSevpa. Reduced states from 245 to 225. [2018-06-22 11:56:56,203 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-22 11:56:56,204 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 379 transitions. [2018-06-22 11:56:56,204 INFO ]: Start accepts. Automaton has 225 states and 379 transitions. Word has length 49 [2018-06-22 11:56:56,204 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:56,204 INFO ]: Abstraction has 225 states and 379 transitions. [2018-06-22 11:56:56,204 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:56:56,204 INFO ]: Start isEmpty. Operand 225 states and 379 transitions. [2018-06-22 11:56:56,205 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:56,205 INFO ]: Found error trace [2018-06-22 11:56:56,205 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:56,205 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:56,205 INFO ]: Analyzing trace with hash 1959974630, now seen corresponding path program 1 times [2018-06-22 11:56:56,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:56,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:56,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:56,206 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:56,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:56,214 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:56,852 INFO ]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:56,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:56,852 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:56,857 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:56,880 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:56,882 INFO ]: Computing forward predicates... [2018-06-22 11:56:56,905 INFO ]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:56,935 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:56,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:56:56,935 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:56:56,935 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:56:56,935 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:56:56,936 INFO ]: Start difference. First operand 225 states and 379 transitions. Second operand 11 states. [2018-06-22 11:56:57,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:57,067 INFO ]: Finished difference Result 243 states and 400 transitions. [2018-06-22 11:56:57,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:56:57,068 INFO ]: Start accepts. Automaton has 11 states. Word has length 49 [2018-06-22 11:56:57,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:57,069 INFO ]: With dead ends: 243 [2018-06-22 11:56:57,069 INFO ]: Without dead ends: 231 [2018-06-22 11:56:57,069 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:56:57,069 INFO ]: Start minimizeSevpa. Operand 231 states. [2018-06-22 11:56:57,079 INFO ]: Finished minimizeSevpa. Reduced states from 231 to 217. [2018-06-22 11:56:57,079 INFO ]: Start removeUnreachable. Operand 217 states. [2018-06-22 11:56:57,079 INFO ]: Finished removeUnreachable. Reduced from 217 states to 217 states and 361 transitions. [2018-06-22 11:56:57,079 INFO ]: Start accepts. Automaton has 217 states and 361 transitions. Word has length 49 [2018-06-22 11:56:57,079 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:57,079 INFO ]: Abstraction has 217 states and 361 transitions. [2018-06-22 11:56:57,079 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:56:57,079 INFO ]: Start isEmpty. Operand 217 states and 361 transitions. [2018-06-22 11:56:57,080 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:57,080 INFO ]: Found error trace [2018-06-22 11:56:57,080 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:57,080 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:57,080 INFO ]: Analyzing trace with hash 516469276, now seen corresponding path program 1 times [2018-06-22 11:56:57,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:57,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:57,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:57,081 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:57,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:57,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:57,269 INFO ]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:57,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:57,270 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:57,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:57,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:57,300 INFO ]: Computing forward predicates... [2018-06-22 11:56:57,407 INFO ]: Checked inductivity of 30 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:56:57,426 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:57,426 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-06-22 11:56:57,426 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:56:57,426 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:56:57,426 INFO ]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:56:57,426 INFO ]: Start difference. First operand 217 states and 361 transitions. Second operand 21 states. [2018-06-22 11:56:57,956 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:57,956 INFO ]: Finished difference Result 293 states and 470 transitions. [2018-06-22 11:56:57,956 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:56:57,956 INFO ]: Start accepts. Automaton has 21 states. Word has length 49 [2018-06-22 11:56:57,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:57,958 INFO ]: With dead ends: 293 [2018-06-22 11:56:57,958 INFO ]: Without dead ends: 281 [2018-06-22 11:56:57,958 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:56:57,959 INFO ]: Start minimizeSevpa. Operand 281 states. [2018-06-22 11:56:57,968 INFO ]: Finished minimizeSevpa. Reduced states from 281 to 215. [2018-06-22 11:56:57,968 INFO ]: Start removeUnreachable. Operand 215 states. [2018-06-22 11:56:57,969 INFO ]: Finished removeUnreachable. Reduced from 215 states to 215 states and 357 transitions. [2018-06-22 11:56:57,969 INFO ]: Start accepts. Automaton has 215 states and 357 transitions. Word has length 49 [2018-06-22 11:56:57,969 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:57,969 INFO ]: Abstraction has 215 states and 357 transitions. [2018-06-22 11:56:57,969 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:56:57,969 INFO ]: Start isEmpty. Operand 215 states and 357 transitions. [2018-06-22 11:56:57,970 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:56:57,970 INFO ]: Found error trace [2018-06-22 11:56:57,970 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:57,971 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:57,971 INFO ]: Analyzing trace with hash 956061980, now seen corresponding path program 1 times [2018-06-22 11:56:57,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:57,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:57,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:57,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:57,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:57,979 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:58,113 INFO ]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:56:58,113 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:58,113 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:56:58,113 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:56:58,113 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:56:58,113 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:56:58,113 INFO ]: Start difference. First operand 215 states and 357 transitions. Second operand 5 states. [2018-06-22 11:56:58,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:58,140 INFO ]: Finished difference Result 157 states and 244 transitions. [2018-06-22 11:56:58,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:56:58,140 INFO ]: Start accepts. Automaton has 5 states. Word has length 53 [2018-06-22 11:56:58,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:58,141 INFO ]: With dead ends: 157 [2018-06-22 11:56:58,141 INFO ]: Without dead ends: 156 [2018-06-22 11:56:58,141 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:58,141 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-22 11:56:58,145 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-06-22 11:56:58,145 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-22 11:56:58,146 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 237 transitions. [2018-06-22 11:56:58,146 INFO ]: Start accepts. Automaton has 154 states and 237 transitions. Word has length 53 [2018-06-22 11:56:58,146 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:58,146 INFO ]: Abstraction has 154 states and 237 transitions. [2018-06-22 11:56:58,146 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:56:58,146 INFO ]: Start isEmpty. Operand 154 states and 237 transitions. [2018-06-22 11:56:58,146 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:56:58,146 INFO ]: Found error trace [2018-06-22 11:56:58,146 INFO ]: trace histogram [5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:58,146 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:58,147 INFO ]: Analyzing trace with hash -1494883701, now seen corresponding path program 3 times [2018-06-22 11:56:58,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:58,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:58,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:58,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:58,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:58,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:58,369 INFO ]: Checked inductivity of 48 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:56:58,369 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:58,369 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:58,375 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:56:58,402 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:56:58,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:58,404 INFO ]: Computing forward predicates... [2018-06-22 11:56:58,485 INFO ]: Checked inductivity of 48 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:56:58,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:58,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-06-22 11:56:58,519 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:56:58,519 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:56:58,519 INFO ]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:56:58,519 INFO ]: Start difference. First operand 154 states and 237 transitions. Second operand 18 states. [2018-06-22 11:56:58,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:58,885 INFO ]: Finished difference Result 184 states and 272 transitions. [2018-06-22 11:56:58,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:56:58,886 INFO ]: Start accepts. Automaton has 18 states. Word has length 53 [2018-06-22 11:56:58,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:58,886 INFO ]: With dead ends: 184 [2018-06-22 11:56:58,886 INFO ]: Without dead ends: 135 [2018-06-22 11:56:58,887 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:56:58,887 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 11:56:58,890 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-06-22 11:56:58,890 INFO ]: Start removeUnreachable. Operand 123 states. [2018-06-22 11:56:58,890 INFO ]: Finished removeUnreachable. Reduced from 123 states to 123 states and 192 transitions. [2018-06-22 11:56:58,890 INFO ]: Start accepts. Automaton has 123 states and 192 transitions. Word has length 53 [2018-06-22 11:56:58,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:58,891 INFO ]: Abstraction has 123 states and 192 transitions. [2018-06-22 11:56:58,891 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:56:58,891 INFO ]: Start isEmpty. Operand 123 states and 192 transitions. [2018-06-22 11:56:58,891 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:56:58,891 INFO ]: Found error trace [2018-06-22 11:56:58,891 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:58,891 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:58,892 INFO ]: Analyzing trace with hash 993227250, now seen corresponding path program 1 times [2018-06-22 11:56:58,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:58,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:58,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:58,892 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:58,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:58,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:59,261 INFO ]: Checked inductivity of 60 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 11:56:59,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:59,261 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:59,267 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:59,297 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:59,299 INFO ]: Computing forward predicates... [2018-06-22 11:56:59,316 INFO ]: Checked inductivity of 60 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 11:56:59,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:59,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 11:56:59,335 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:56:59,335 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:56:59,335 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:56:59,335 INFO ]: Start difference. First operand 123 states and 192 transitions. Second operand 12 states. [2018-06-22 11:56:59,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:59,505 INFO ]: Finished difference Result 139 states and 215 transitions. [2018-06-22 11:56:59,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:56:59,505 INFO ]: Start accepts. Automaton has 12 states. Word has length 61 [2018-06-22 11:56:59,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:59,506 INFO ]: With dead ends: 139 [2018-06-22 11:56:59,506 INFO ]: Without dead ends: 137 [2018-06-22 11:56:59,506 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:56:59,506 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-22 11:56:59,509 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-06-22 11:56:59,509 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-22 11:56:59,509 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 209 transitions. [2018-06-22 11:56:59,509 INFO ]: Start accepts. Automaton has 133 states and 209 transitions. Word has length 61 [2018-06-22 11:56:59,509 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:59,509 INFO ]: Abstraction has 133 states and 209 transitions. [2018-06-22 11:56:59,509 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:56:59,509 INFO ]: Start isEmpty. Operand 133 states and 209 transitions. [2018-06-22 11:56:59,510 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:56:59,510 INFO ]: Found error trace [2018-06-22 11:56:59,510 INFO ]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:59,510 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:59,510 INFO ]: Analyzing trace with hash 738212631, now seen corresponding path program 4 times [2018-06-22 11:56:59,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:59,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:59,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:59,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:59,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:59,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:59,969 INFO ]: Checked inductivity of 58 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:56:59,969 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:59,969 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:59,975 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:00,011 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:00,011 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:00,016 INFO ]: Computing forward predicates... [2018-06-22 11:57:01,237 INFO ]: Checked inductivity of 58 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 11:57:01,268 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:01,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2018-06-22 11:57:01,268 INFO ]: Interpolant automaton has 43 states [2018-06-22 11:57:01,269 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 11:57:01,269 INFO ]: CoverageRelationStatistics Valid=94, Invalid=1712, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:57:01,269 INFO ]: Start difference. First operand 133 states and 209 transitions. Second operand 43 states. [2018-06-22 11:57:02,201 WARN ]: Spent 283.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-06-22 11:57:05,518 WARN ]: Spent 907.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-06-22 11:57:05,808 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:05,808 INFO ]: Finished difference Result 195 states and 293 transitions. [2018-06-22 11:57:05,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:57:05,809 INFO ]: Start accepts. Automaton has 43 states. Word has length 61 [2018-06-22 11:57:05,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:05,810 INFO ]: With dead ends: 195 [2018-06-22 11:57:05,810 INFO ]: Without dead ends: 183 [2018-06-22 11:57:05,811 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=256, Invalid=3776, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 11:57:05,811 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-22 11:57:05,817 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 157. [2018-06-22 11:57:05,817 INFO ]: Start removeUnreachable. Operand 157 states. [2018-06-22 11:57:05,817 INFO ]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2018-06-22 11:57:05,817 INFO ]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 61 [2018-06-22 11:57:05,818 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:05,818 INFO ]: Abstraction has 157 states and 249 transitions. [2018-06-22 11:57:05,818 INFO ]: Interpolant automaton has 43 states. [2018-06-22 11:57:05,818 INFO ]: Start isEmpty. Operand 157 states and 249 transitions. [2018-06-22 11:57:05,818 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:57:05,818 INFO ]: Found error trace [2018-06-22 11:57:05,818 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:05,819 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:05,819 INFO ]: Analyzing trace with hash 213873540, now seen corresponding path program 2 times [2018-06-22 11:57:05,819 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:05,819 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:05,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:05,819 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:05,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:05,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:05,977 INFO ]: Checked inductivity of 61 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 11:57:05,977 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:05,977 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:05,984 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:06,014 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:06,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:06,016 INFO ]: Computing forward predicates... [2018-06-22 11:57:06,041 INFO ]: Checked inductivity of 61 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 11:57:06,073 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:06,073 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 11:57:06,073 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:57:06,073 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:57:06,073 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:57:06,073 INFO ]: Start difference. First operand 157 states and 249 transitions. Second operand 13 states. [2018-06-22 11:57:07,106 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:57:07,242 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:07,242 INFO ]: Finished difference Result 169 states and 261 transitions. [2018-06-22 11:57:07,242 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:57:07,242 INFO ]: Start accepts. Automaton has 13 states. Word has length 61 [2018-06-22 11:57:07,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:07,243 INFO ]: With dead ends: 169 [2018-06-22 11:57:07,243 INFO ]: Without dead ends: 163 [2018-06-22 11:57:07,243 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:57:07,243 INFO ]: Start minimizeSevpa. Operand 163 states. [2018-06-22 11:57:07,246 INFO ]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-06-22 11:57:07,246 INFO ]: Start removeUnreachable. Operand 159 states. [2018-06-22 11:57:07,247 INFO ]: Finished removeUnreachable. Reduced from 159 states to 159 states and 251 transitions. [2018-06-22 11:57:07,247 INFO ]: Start accepts. Automaton has 159 states and 251 transitions. Word has length 61 [2018-06-22 11:57:07,247 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:07,247 INFO ]: Abstraction has 159 states and 251 transitions. [2018-06-22 11:57:07,247 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:57:07,247 INFO ]: Start isEmpty. Operand 159 states and 251 transitions. [2018-06-22 11:57:07,247 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:57:07,247 INFO ]: Found error trace [2018-06-22 11:57:07,247 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:07,247 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:07,248 INFO ]: Analyzing trace with hash 2024489604, now seen corresponding path program 3 times [2018-06-22 11:57:07,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:07,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:07,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:07,248 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:07,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:07,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:07,428 INFO ]: Checked inductivity of 60 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 11:57:07,428 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:07,428 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:07,433 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:07,464 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:57:07,464 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:07,466 INFO ]: Computing forward predicates... [2018-06-22 11:57:07,659 INFO ]: Checked inductivity of 60 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:57:07,678 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:07,678 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-22 11:57:07,678 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:57:07,678 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:57:07,679 INFO ]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:57:07,679 INFO ]: Start difference. First operand 159 states and 251 transitions. Second operand 20 states. [2018-06-22 11:57:08,106 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:08,106 INFO ]: Finished difference Result 227 states and 360 transitions. [2018-06-22 11:57:08,106 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:57:08,106 INFO ]: Start accepts. Automaton has 20 states. Word has length 61 [2018-06-22 11:57:08,107 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:08,107 INFO ]: With dead ends: 227 [2018-06-22 11:57:08,107 INFO ]: Without dead ends: 223 [2018-06-22 11:57:08,108 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:57:08,108 INFO ]: Start minimizeSevpa. Operand 223 states. [2018-06-22 11:57:08,112 INFO ]: Finished minimizeSevpa. Reduced states from 223 to 193. [2018-06-22 11:57:08,112 INFO ]: Start removeUnreachable. Operand 193 states. [2018-06-22 11:57:08,113 INFO ]: Finished removeUnreachable. Reduced from 193 states to 193 states and 310 transitions. [2018-06-22 11:57:08,113 INFO ]: Start accepts. Automaton has 193 states and 310 transitions. Word has length 61 [2018-06-22 11:57:08,113 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:08,113 INFO ]: Abstraction has 193 states and 310 transitions. [2018-06-22 11:57:08,113 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:57:08,113 INFO ]: Start isEmpty. Operand 193 states and 310 transitions. [2018-06-22 11:57:08,114 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:57:08,114 INFO ]: Found error trace [2018-06-22 11:57:08,114 INFO ]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:08,114 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:08,114 INFO ]: Analyzing trace with hash -2137364640, now seen corresponding path program 2 times [2018-06-22 11:57:08,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:08,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:08,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:08,116 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:08,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:08,125 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:08,559 INFO ]: Checked inductivity of 67 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:57:08,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:08,559 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:08,565 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:08,597 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:08,597 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:08,599 INFO ]: Computing forward predicates... [2018-06-22 11:57:08,755 INFO ]: Checked inductivity of 67 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:57:08,774 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:08,774 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 25 [2018-06-22 11:57:08,774 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:57:08,775 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:57:08,775 INFO ]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:57:08,775 INFO ]: Start difference. First operand 193 states and 310 transitions. Second operand 25 states. [2018-06-22 11:57:09,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:09,484 INFO ]: Finished difference Result 365 states and 577 transitions. [2018-06-22 11:57:09,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:57:09,484 INFO ]: Start accepts. Automaton has 25 states. Word has length 65 [2018-06-22 11:57:09,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:09,485 INFO ]: With dead ends: 365 [2018-06-22 11:57:09,485 INFO ]: Without dead ends: 347 [2018-06-22 11:57:09,485 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=1777, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:57:09,486 INFO ]: Start minimizeSevpa. Operand 347 states. [2018-06-22 11:57:09,492 INFO ]: Finished minimizeSevpa. Reduced states from 347 to 263. [2018-06-22 11:57:09,492 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-22 11:57:09,493 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 427 transitions. [2018-06-22 11:57:09,493 INFO ]: Start accepts. Automaton has 263 states and 427 transitions. Word has length 65 [2018-06-22 11:57:09,493 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:09,493 INFO ]: Abstraction has 263 states and 427 transitions. [2018-06-22 11:57:09,493 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:57:09,493 INFO ]: Start isEmpty. Operand 263 states and 427 transitions. [2018-06-22 11:57:09,495 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:57:09,495 INFO ]: Found error trace [2018-06-22 11:57:09,496 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:09,496 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:09,496 INFO ]: Analyzing trace with hash 1819104060, now seen corresponding path program 2 times [2018-06-22 11:57:09,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:09,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:09,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:09,496 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:09,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:09,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:10,716 INFO ]: Checked inductivity of 71 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:57:10,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:10,716 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:10,722 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:10,754 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:10,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:10,756 INFO ]: Computing forward predicates... [2018-06-22 11:57:10,877 INFO ]: Checked inductivity of 71 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:57:10,896 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:10,896 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-06-22 11:57:10,896 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:57:10,896 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:57:10,896 INFO ]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:57:10,897 INFO ]: Start difference. First operand 263 states and 427 transitions. Second operand 24 states. [2018-06-22 11:57:11,547 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:11,547 INFO ]: Finished difference Result 417 states and 649 transitions. [2018-06-22 11:57:11,547 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 11:57:11,547 INFO ]: Start accepts. Automaton has 24 states. Word has length 65 [2018-06-22 11:57:11,547 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:11,548 INFO ]: With dead ends: 417 [2018-06-22 11:57:11,548 INFO ]: Without dead ends: 407 [2018-06-22 11:57:11,549 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=257, Invalid=1905, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:57:11,549 INFO ]: Start minimizeSevpa. Operand 407 states. [2018-06-22 11:57:11,561 INFO ]: Finished minimizeSevpa. Reduced states from 407 to 301. [2018-06-22 11:57:11,561 INFO ]: Start removeUnreachable. Operand 301 states. [2018-06-22 11:57:11,562 INFO ]: Finished removeUnreachable. Reduced from 301 states to 301 states and 489 transitions. [2018-06-22 11:57:11,562 INFO ]: Start accepts. Automaton has 301 states and 489 transitions. Word has length 65 [2018-06-22 11:57:11,562 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:11,562 INFO ]: Abstraction has 301 states and 489 transitions. [2018-06-22 11:57:11,562 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:57:11,562 INFO ]: Start isEmpty. Operand 301 states and 489 transitions. [2018-06-22 11:57:11,564 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:57:11,564 INFO ]: Found error trace [2018-06-22 11:57:11,564 INFO ]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:11,564 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:11,564 INFO ]: Analyzing trace with hash -1492874769, now seen corresponding path program 1 times [2018-06-22 11:57:11,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:11,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:11,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:11,565 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:11,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:11,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:11,670 INFO ]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:57:11,670 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:11,670 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:57:11,670 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:57:11,670 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:57:11,670 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:11,670 INFO ]: Start difference. First operand 301 states and 489 transitions. Second operand 4 states. [2018-06-22 11:57:11,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:11,701 INFO ]: Finished difference Result 285 states and 427 transitions. [2018-06-22 11:57:11,701 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:57:11,701 INFO ]: Start accepts. Automaton has 4 states. Word has length 65 [2018-06-22 11:57:11,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:11,702 INFO ]: With dead ends: 285 [2018-06-22 11:57:11,702 INFO ]: Without dead ends: 254 [2018-06-22 11:57:11,702 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:57:11,702 INFO ]: Start minimizeSevpa. Operand 254 states. [2018-06-22 11:57:11,709 INFO ]: Finished minimizeSevpa. Reduced states from 254 to 240. [2018-06-22 11:57:11,709 INFO ]: Start removeUnreachable. Operand 240 states. [2018-06-22 11:57:11,710 INFO ]: Finished removeUnreachable. Reduced from 240 states to 240 states and 371 transitions. [2018-06-22 11:57:11,710 INFO ]: Start accepts. Automaton has 240 states and 371 transitions. Word has length 65 [2018-06-22 11:57:11,710 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:11,710 INFO ]: Abstraction has 240 states and 371 transitions. [2018-06-22 11:57:11,710 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:57:11,710 INFO ]: Start isEmpty. Operand 240 states and 371 transitions. [2018-06-22 11:57:11,711 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:57:11,711 INFO ]: Found error trace [2018-06-22 11:57:11,711 INFO ]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:11,711 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:11,711 INFO ]: Analyzing trace with hash 589987385, now seen corresponding path program 5 times [2018-06-22 11:57:11,711 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:11,711 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:11,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:11,712 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:11,712 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:11,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:11,952 INFO ]: Checked inductivity of 71 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-06-22 11:57:11,952 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:11,952 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:11,957 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:57:12,053 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:57:12,053 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:12,057 INFO ]: Computing forward predicates... [2018-06-22 11:57:12,272 INFO ]: Checked inductivity of 71 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:57:12,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:12,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 27 [2018-06-22 11:57:12,291 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:57:12,291 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:57:12,291 INFO ]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:57:12,291 INFO ]: Start difference. First operand 240 states and 371 transitions. Second operand 27 states. [2018-06-22 11:57:13,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:13,085 INFO ]: Finished difference Result 268 states and 405 transitions. [2018-06-22 11:57:13,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:57:13,085 INFO ]: Start accepts. Automaton has 27 states. Word has length 65 [2018-06-22 11:57:13,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:13,086 INFO ]: With dead ends: 268 [2018-06-22 11:57:13,086 INFO ]: Without dead ends: 266 [2018-06-22 11:57:13,087 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=1845, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:57:13,087 INFO ]: Start minimizeSevpa. Operand 266 states. [2018-06-22 11:57:13,091 INFO ]: Finished minimizeSevpa. Reduced states from 266 to 212. [2018-06-22 11:57:13,091 INFO ]: Start removeUnreachable. Operand 212 states. [2018-06-22 11:57:13,091 INFO ]: Finished removeUnreachable. Reduced from 212 states to 212 states and 322 transitions. [2018-06-22 11:57:13,092 INFO ]: Start accepts. Automaton has 212 states and 322 transitions. Word has length 65 [2018-06-22 11:57:13,092 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:13,092 INFO ]: Abstraction has 212 states and 322 transitions. [2018-06-22 11:57:13,092 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:57:13,092 INFO ]: Start isEmpty. Operand 212 states and 322 transitions. [2018-06-22 11:57:13,092 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:57:13,092 INFO ]: Found error trace [2018-06-22 11:57:13,092 INFO ]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:13,092 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:13,092 INFO ]: Analyzing trace with hash 1045769724, now seen corresponding path program 2 times [2018-06-22 11:57:13,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:13,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:13,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:13,093 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:13,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:13,100 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:13,188 INFO ]: Checked inductivity of 67 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:57:13,188 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:13,188 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:13,193 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:13,229 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:13,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:13,231 INFO ]: Computing forward predicates... [2018-06-22 11:57:13,245 INFO ]: Checked inductivity of 67 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:57:13,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:13,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 12 [2018-06-22 11:57:13,263 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:57:13,263 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:57:13,263 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:57:13,263 INFO ]: Start difference. First operand 212 states and 322 transitions. Second operand 12 states. [2018-06-22 11:57:13,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:13,434 INFO ]: Finished difference Result 202 states and 272 transitions. [2018-06-22 11:57:13,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:57:13,434 INFO ]: Start accepts. Automaton has 12 states. Word has length 65 [2018-06-22 11:57:13,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:13,434 INFO ]: With dead ends: 202 [2018-06-22 11:57:13,434 INFO ]: Without dead ends: 182 [2018-06-22 11:57:13,435 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:13,435 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-22 11:57:13,437 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 176. [2018-06-22 11:57:13,437 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-22 11:57:13,437 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2018-06-22 11:57:13,437 INFO ]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 65 [2018-06-22 11:57:13,438 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:13,438 INFO ]: Abstraction has 176 states and 238 transitions. [2018-06-22 11:57:13,438 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:57:13,438 INFO ]: Start isEmpty. Operand 176 states and 238 transitions. [2018-06-22 11:57:13,438 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:57:13,438 INFO ]: Found error trace [2018-06-22 11:57:13,438 INFO ]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:13,438 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:13,438 INFO ]: Analyzing trace with hash -1373256826, now seen corresponding path program 2 times [2018-06-22 11:57:13,438 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:13,438 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:13,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:13,439 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:13,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:13,446 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:14,111 INFO ]: Checked inductivity of 67 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:57:14,111 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:14,111 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:14,116 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:14,148 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:14,148 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:14,151 INFO ]: Computing forward predicates... [2018-06-22 11:57:14,179 INFO ]: Checked inductivity of 67 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:57:14,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:14,210 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 11:57:14,210 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:57:14,211 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:57:14,211 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:57:14,211 INFO ]: Start difference. First operand 176 states and 238 transitions. Second operand 13 states. [2018-06-22 11:57:15,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:15,531 INFO ]: Finished difference Result 192 states and 258 transitions. [2018-06-22 11:57:15,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:57:15,531 INFO ]: Start accepts. Automaton has 13 states. Word has length 65 [2018-06-22 11:57:15,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:15,532 INFO ]: With dead ends: 192 [2018-06-22 11:57:15,532 INFO ]: Without dead ends: 192 [2018-06-22 11:57:15,532 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:15,532 INFO ]: Start minimizeSevpa. Operand 192 states. [2018-06-22 11:57:15,535 INFO ]: Finished minimizeSevpa. Reduced states from 192 to 172. [2018-06-22 11:57:15,535 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-22 11:57:15,536 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 233 transitions. [2018-06-22 11:57:15,536 INFO ]: Start accepts. Automaton has 172 states and 233 transitions. Word has length 65 [2018-06-22 11:57:15,536 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:15,536 INFO ]: Abstraction has 172 states and 233 transitions. [2018-06-22 11:57:15,536 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:57:15,536 INFO ]: Start isEmpty. Operand 172 states and 233 transitions. [2018-06-22 11:57:15,537 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:57:15,537 INFO ]: Found error trace [2018-06-22 11:57:15,538 INFO ]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:15,538 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:15,538 INFO ]: Analyzing trace with hash 1872405052, now seen corresponding path program 3 times [2018-06-22 11:57:15,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:15,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:15,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:15,538 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:15,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:15,545 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:15,646 INFO ]: Checked inductivity of 67 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:57:15,647 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:15,647 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:15,652 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:15,683 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:57:15,683 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:15,685 INFO ]: Computing forward predicates... [2018-06-22 11:57:15,822 INFO ]: Checked inductivity of 67 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:57:15,841 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:15,841 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-06-22 11:57:15,842 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:57:15,842 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:57:15,842 INFO ]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:57:15,842 INFO ]: Start difference. First operand 172 states and 233 transitions. Second operand 25 states. Received shutdown request... [2018-06-22 11:57:16,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:57:16,509 WARN ]: Verification canceled [2018-06-22 11:57:16,513 WARN ]: Timeout [2018-06-22 11:57:16,513 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:57:16 BoogieIcfgContainer [2018-06-22 11:57:16,513 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:57:16,514 INFO ]: Toolchain (without parser) took 54224.54 ms. Allocated memory was 306.2 MB in the beginning and 730.9 MB in the end (delta: 424.7 MB). Free memory was 259.6 MB in the beginning and 704.1 MB in the end (delta: -444.5 MB). Peak memory consumption was 361.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:16,515 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:57:16,515 INFO ]: ChcToBoogie took 52.58 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 257.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:16,515 INFO ]: Boogie Preprocessor took 52.11 ms. Allocated memory is still 306.2 MB. Free memory was 257.6 MB in the beginning and 256.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:57:16,515 INFO ]: RCFGBuilder took 459.28 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 242.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:16,516 INFO ]: TraceAbstraction took 53652.18 ms. Allocated memory was 306.2 MB in the beginning and 730.9 MB in the end (delta: 424.7 MB). Free memory was 242.5 MB in the beginning and 704.1 MB in the end (delta: -461.6 MB). Peak memory consumption was 344.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:57:16,518 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 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 52.58 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 257.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.11 ms. Allocated memory is still 306.2 MB. Free memory was 257.6 MB in the beginning and 256.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 459.28 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 242.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53652.18 ms. Allocated memory was 306.2 MB in the beginning and 730.9 MB in the end (delta: 424.7 MB). Free memory was 242.5 MB in the beginning and 704.1 MB in the end (delta: -461.6 MB). Peak memory consumption was 344.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (172states) and interpolant automaton (currently 30 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (195 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. TIMEOUT Result, 53.5s OverallTime, 57 OverallIterations, 5 TraceHistogramMax, 29.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3113 SDtfs, 525 SDslu, 22685 SDs, 0 SdLazy, 21655 SolverSat, 1475 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2594 GetRequests, 1603 SyntacticMatches, 19 SemanticMatches, 972 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=41, 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.7s AutomataMinimizationTime, 56 MinimizatonAttempts, 1865 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 3989 NumberOfCodeBlocks, 3981 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 3896 ConstructedInterpolants, 32 QuantifiedInterpolants, 470484 SizeOfPredicates, 202 NumberOfNonLiveVariables, 8598 ConjunctsInSsa, 703 ConjunctsInUnsatCore, 93 InterpolantComputations, 22 PerfectInterpolantSequences, 2028/2558 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big3.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-57-16-527.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big3.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-57-16-527.csv Completed graceful shutdown