java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:12:28,709 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:12:28,711 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:12:28,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:12:28,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:12:28,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:12:28,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:12:28,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:12:28,730 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:12:28,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:12:28,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:12:28,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:12:28,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:12:28,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:12:28,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:12:28,740 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:12:28,742 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:12:28,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:12:28,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:12:28,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:12:28,756 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:12:28,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:12:28,759 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:12:28,759 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:12:28,760 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:12:28,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:12:28,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:12:28,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:12:28,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:12:28,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:12:28,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:12:28,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:12:28,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:12:28,772 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:12:28,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:12:28,773 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:12:28,796 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:12:28,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:12:28,797 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:12:28,797 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:12:28,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:12:28,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:12:28,798 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:12:28,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:12:28,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:12:28,799 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:12:28,799 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:12:28,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:12:28,800 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:12:28,800 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:12:28,800 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:12:28,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:12:28,801 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:12:28,802 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:12:28,802 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:12:28,851 INFO ]: Repository-Root is: /tmp [2018-06-22 01:12:28,867 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:12:28,872 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:12:28,874 INFO ]: Initializing SmtParser... [2018-06-22 01:12:28,874 INFO ]: SmtParser initialized [2018-06-22 01:12:28,874 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 [2018-06-22 01:12:28,876 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:12:28,965 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 unknown [2018-06-22 01:12:29,137 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 [2018-06-22 01:12:29,148 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:12:29,154 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:12:29,154 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:12:29,154 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:12:29,154 INFO ]: ChcToBoogie initialized [2018-06-22 01:12:29,157 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:12:29" (1/1) ... [2018-06-22 01:12:29,208 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:29 Unit [2018-06-22 01:12:29,208 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:12:29,208 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:12:29,208 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:12:29,208 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:12:29,227 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:29" (1/1) ... [2018-06-22 01:12:29,227 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:29" (1/1) ... [2018-06-22 01:12:29,232 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:29" (1/1) ... [2018-06-22 01:12:29,232 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:29" (1/1) ... [2018-06-22 01:12:29,235 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:29" (1/1) ... [2018-06-22 01:12:29,236 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:29" (1/1) ... [2018-06-22 01:12:29,238 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:29" (1/1) ... [2018-06-22 01:12:29,240 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:12:29,240 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:12:29,240 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:12:29,240 INFO ]: RCFGBuilder initialized [2018-06-22 01:12:29,241 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:12:29,257 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:12:29,257 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:12:29,258 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:12:29,258 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:12:29,258 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:12:29,258 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:12:29,511 INFO ]: Using library mode [2018-06-22 01:12:29,511 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:12:29 BoogieIcfgContainer [2018-06-22 01:12:29,511 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:12:29,513 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:12:29,513 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:12:29,517 INFO ]: TraceAbstraction initialized [2018-06-22 01:12:29,517 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:12:29" (1/3) ... [2018-06-22 01:12:29,517 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2255c3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:12:29, skipping insertion in model container [2018-06-22 01:12:29,517 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:29" (2/3) ... [2018-06-22 01:12:29,518 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2255c3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:12:29, skipping insertion in model container [2018-06-22 01:12:29,518 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:12:29" (3/3) ... [2018-06-22 01:12:29,519 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:12:29,528 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:12:29,537 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:12:29,569 INFO ]: Using default assertion order modulation [2018-06-22 01:12:29,570 INFO ]: Interprodecural is true [2018-06-22 01:12:29,570 INFO ]: Hoare is false [2018-06-22 01:12:29,570 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:12:29,570 INFO ]: Backedges is TWOTRACK [2018-06-22 01:12:29,570 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:12:29,570 INFO ]: Difference is false [2018-06-22 01:12:29,570 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:12:29,570 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:12:29,582 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:12:29,590 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:12:29,590 INFO ]: Found error trace [2018-06-22 01:12:29,591 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:29,591 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:29,596 INFO ]: Analyzing trace with hash 934095184, now seen corresponding path program 1 times [2018-06-22 01:12:29,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:29,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:29,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:29,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:29,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:29,672 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:29,751 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:29,752 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:12:29,752 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:12:29,754 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:12:29,764 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:12:29,765 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:12:29,766 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-22 01:12:29,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:29,875 INFO ]: Finished difference Result 18 states and 24 transitions. [2018-06-22 01:12:29,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:12:29,876 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:12:29,876 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:29,885 INFO ]: With dead ends: 18 [2018-06-22 01:12:29,885 INFO ]: Without dead ends: 18 [2018-06-22 01:12:29,887 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:12:29,900 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:12:29,917 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-06-22 01:12:29,918 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:12:29,919 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:12:29,920 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2018-06-22 01:12:29,920 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:29,920 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:12:29,920 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:12:29,920 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:12:29,921 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:12:29,921 INFO ]: Found error trace [2018-06-22 01:12:29,921 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:29,921 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:29,921 INFO ]: Analyzing trace with hash 1056923477, now seen corresponding path program 1 times [2018-06-22 01:12:29,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:29,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:29,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:29,922 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:29,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:29,938 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:29,996 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:29,996 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:12:29,996 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:12:29,998 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:12:29,998 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:12:29,998 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:12:29,998 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 3 states. [2018-06-22 01:12:30,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:30,077 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-22 01:12:30,078 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:12:30,078 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:12:30,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:30,078 INFO ]: With dead ends: 14 [2018-06-22 01:12:30,078 INFO ]: Without dead ends: 14 [2018-06-22 01:12:30,079 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:12:30,079 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:12:30,081 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:12:30,081 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:12:30,081 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:12:30,082 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2018-06-22 01:12:30,083 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:30,083 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:12:30,083 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:12:30,083 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:12:30,084 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:12:30,084 INFO ]: Found error trace [2018-06-22 01:12:30,084 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:30,084 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:30,084 INFO ]: Analyzing trace with hash 1117875863, now seen corresponding path program 1 times [2018-06-22 01:12:30,084 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:30,084 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:30,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:30,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:30,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:30,096 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:30,249 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:30,249 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:12:30,249 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:12:30,250 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:12:30,250 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:12:30,250 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:12:30,250 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2018-06-22 01:12:30,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:30,453 INFO ]: Finished difference Result 15 states and 19 transitions. [2018-06-22 01:12:30,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:12:30,453 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:12:30,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:30,454 INFO ]: With dead ends: 15 [2018-06-22 01:12:30,454 INFO ]: Without dead ends: 15 [2018-06-22 01:12:30,454 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:12:30,454 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:12:30,456 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-22 01:12:30,456 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:12:30,457 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-22 01:12:30,457 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 8 [2018-06-22 01:12:30,457 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:30,457 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-22 01:12:30,457 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:12:30,457 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-22 01:12:30,457 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:12:30,457 INFO ]: Found error trace [2018-06-22 01:12:30,457 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:30,457 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:30,458 INFO ]: Analyzing trace with hash 43581880, now seen corresponding path program 1 times [2018-06-22 01:12:30,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:30,458 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:30,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:30,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:30,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:30,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:30,549 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:30,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:30,549 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:30,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:30,585 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:30,592 INFO ]: Computing forward predicates... [2018-06-22 01:12:30,754 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:30,789 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:30,789 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-22 01:12:30,789 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:12:30,789 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:12:30,789 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:12:30,789 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 6 states. [2018-06-22 01:12:30,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:30,978 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-22 01:12:30,979 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:12:30,979 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 01:12:30,979 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:30,979 INFO ]: With dead ends: 17 [2018-06-22 01:12:30,979 INFO ]: Without dead ends: 13 [2018-06-22 01:12:30,980 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:12:30,980 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:12:30,981 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:12:30,981 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:12:30,982 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-06-22 01:12:30,982 INFO ]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2018-06-22 01:12:30,982 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:30,982 INFO ]: Abstraction has 13 states and 16 transitions. [2018-06-22 01:12:30,982 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:12:30,982 INFO ]: Start isEmpty. Operand 13 states and 16 transitions. [2018-06-22 01:12:30,982 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:12:30,983 INFO ]: Found error trace [2018-06-22 01:12:30,983 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:30,983 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:30,983 INFO ]: Analyzing trace with hash 2117454461, now seen corresponding path program 1 times [2018-06-22 01:12:30,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:30,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:30,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:30,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:30,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:30,999 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:31,160 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:31,160 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:31,160 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:31,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:31,193 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:31,194 INFO ]: Computing forward predicates... [2018-06-22 01:12:31,367 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:12:31,388 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:12:31,388 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2018-06-22 01:12:31,388 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:12:31,388 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:12:31,388 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:12:31,389 INFO ]: Start difference. First operand 13 states and 16 transitions. Second operand 8 states. [2018-06-22 01:12:31,535 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:12:31,962 WARN ]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-22 01:12:32,208 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 01:12:32,493 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:32,493 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-22 01:12:32,493 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:12:32,493 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-22 01:12:32,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:32,494 INFO ]: With dead ends: 22 [2018-06-22 01:12:32,494 INFO ]: Without dead ends: 15 [2018-06-22 01:12:32,494 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:12:32,494 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:12:32,496 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-22 01:12:32,496 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:12:32,496 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-22 01:12:32,496 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2018-06-22 01:12:32,496 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:32,496 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-22 01:12:32,496 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:12:32,497 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-22 01:12:32,497 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:12:32,497 INFO ]: Found error trace [2018-06-22 01:12:32,497 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:32,497 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:32,497 INFO ]: Analyzing trace with hash 563155263, now seen corresponding path program 1 times [2018-06-22 01:12:32,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:32,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:32,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:32,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:32,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:32,507 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:32,595 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:12:32,595 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:32,595 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:32,601 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:32,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:32,617 INFO ]: Computing forward predicates... [2018-06-22 01:12:32,625 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:12:32,644 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:12:32,644 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2018-06-22 01:12:32,645 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:12:32,645 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:12:32,645 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:12:32,645 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2018-06-22 01:12:32,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:32,677 INFO ]: Finished difference Result 16 states and 18 transitions. [2018-06-22 01:12:32,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:12:32,678 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-22 01:12:32,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:32,678 INFO ]: With dead ends: 16 [2018-06-22 01:12:32,678 INFO ]: Without dead ends: 12 [2018-06-22 01:12:32,678 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:12:32,679 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:12:32,680 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:12:32,680 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:12:32,680 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-22 01:12:32,680 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-22 01:12:32,680 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:32,680 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-22 01:12:32,680 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:12:32,680 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-22 01:12:32,680 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:12:32,681 INFO ]: Found error trace [2018-06-22 01:12:32,681 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:32,681 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:32,681 INFO ]: Analyzing trace with hash 1194377505, now seen corresponding path program 1 times [2018-06-22 01:12:32,681 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:32,681 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:32,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:32,681 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:32,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:32,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:32,800 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:32,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:32,800 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:32,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:32,826 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:32,827 INFO ]: Computing forward predicates... [2018-06-22 01:12:32,860 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:32,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:32,886 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 01:12:32,886 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:12:32,886 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:12:32,886 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:12:32,886 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 10 states. [2018-06-22 01:12:33,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:33,040 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-22 01:12:33,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:12:33,040 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-22 01:12:33,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:33,041 INFO ]: With dead ends: 21 [2018-06-22 01:12:33,041 INFO ]: Without dead ends: 21 [2018-06-22 01:12:33,041 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:12:33,041 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:12:33,043 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-06-22 01:12:33,043 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:12:33,043 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-22 01:12:33,043 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2018-06-22 01:12:33,043 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:33,043 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-22 01:12:33,043 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:12:33,043 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-22 01:12:33,044 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:12:33,044 INFO ]: Found error trace [2018-06-22 01:12:33,044 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:33,044 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:33,044 INFO ]: Analyzing trace with hash 890610260, now seen corresponding path program 1 times [2018-06-22 01:12:33,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:33,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:33,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:33,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:33,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:33,056 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:33,134 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:33,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:33,134 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:33,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:33,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:33,156 INFO ]: Computing forward predicates... [2018-06-22 01:12:33,169 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:33,189 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:33,189 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:12:33,189 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:12:33,189 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:12:33,189 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:12:33,189 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2018-06-22 01:12:33,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:33,239 INFO ]: Finished difference Result 23 states and 26 transitions. [2018-06-22 01:12:33,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:12:33,239 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-22 01:12:33,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:33,240 INFO ]: With dead ends: 23 [2018-06-22 01:12:33,240 INFO ]: Without dead ends: 23 [2018-06-22 01:12:33,240 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:12:33,240 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:12:33,242 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-06-22 01:12:33,242 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:12:33,242 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-22 01:12:33,242 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-22 01:12:33,242 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:33,242 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-22 01:12:33,242 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:12:33,242 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-22 01:12:33,243 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:12:33,243 INFO ]: Found error trace [2018-06-22 01:12:33,243 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:33,243 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:33,243 INFO ]: Analyzing trace with hash 1066789193, now seen corresponding path program 2 times [2018-06-22 01:12:33,243 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:33,243 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:33,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:33,244 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:33,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:33,255 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:33,438 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:33,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:33,438 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:33,444 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:12:33,459 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:12:33,459 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:33,460 INFO ]: Computing forward predicates... [2018-06-22 01:12:33,469 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:33,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:33,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:12:33,491 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:12:33,491 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:12:33,491 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:12:33,492 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 8 states. [2018-06-22 01:12:33,604 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:33,604 INFO ]: Finished difference Result 21 states and 23 transitions. [2018-06-22 01:12:33,604 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:12:33,604 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 01:12:33,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:33,605 INFO ]: With dead ends: 21 [2018-06-22 01:12:33,605 INFO ]: Without dead ends: 15 [2018-06-22 01:12:33,605 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:12:33,605 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:12:33,606 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:12:33,606 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:12:33,607 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-22 01:12:33,607 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-22 01:12:33,607 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:33,607 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-22 01:12:33,607 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:12:33,607 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-22 01:12:33,607 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:12:33,607 INFO ]: Found error trace [2018-06-22 01:12:33,607 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:33,607 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:33,608 INFO ]: Analyzing trace with hash 1204242876, now seen corresponding path program 2 times [2018-06-22 01:12:33,608 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:33,608 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:33,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:33,608 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:33,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:33,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:33,711 INFO ]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:33,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:33,712 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:33,730 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:12:33,752 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:12:33,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:33,754 INFO ]: Computing forward predicates... [2018-06-22 01:12:33,787 INFO ]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:33,812 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:33,812 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:12:33,813 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:12:33,813 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:12:33,813 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:12:33,813 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2018-06-22 01:12:34,034 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:34,034 INFO ]: Finished difference Result 26 states and 29 transitions. [2018-06-22 01:12:34,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:12:34,034 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-22 01:12:34,035 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:34,035 INFO ]: With dead ends: 26 [2018-06-22 01:12:34,035 INFO ]: Without dead ends: 26 [2018-06-22 01:12:34,035 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:12:34,036 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:12:34,037 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-06-22 01:12:34,037 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:12:34,038 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-22 01:12:34,038 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-06-22 01:12:34,038 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:34,038 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-22 01:12:34,038 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:12:34,038 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-22 01:12:34,038 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:12:34,038 INFO ]: Found error trace [2018-06-22 01:12:34,038 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:34,038 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:34,039 INFO ]: Analyzing trace with hash 1170339753, now seen corresponding path program 3 times [2018-06-22 01:12:34,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:34,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:34,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:34,039 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:34,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:34,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:34,192 INFO ]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:34,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:34,192 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:34,202 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:12:34,219 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:12:34,219 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:34,221 INFO ]: Computing forward predicates... [2018-06-22 01:12:34,233 INFO ]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:34,254 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:34,254 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:12:34,254 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:12:34,254 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:12:34,254 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:12:34,255 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 9 states. [2018-06-22 01:12:34,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:34,531 INFO ]: Finished difference Result 28 states and 31 transitions. [2018-06-22 01:12:34,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:12:34,531 INFO ]: Start accepts. Automaton has 9 states. Word has length 15 [2018-06-22 01:12:34,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:34,532 INFO ]: With dead ends: 28 [2018-06-22 01:12:34,532 INFO ]: Without dead ends: 28 [2018-06-22 01:12:34,532 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:12:34,532 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:12:34,534 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-06-22 01:12:34,534 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:12:34,534 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-22 01:12:34,534 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-06-22 01:12:34,535 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:34,535 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-22 01:12:34,535 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:12:34,535 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-22 01:12:34,535 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:12:34,535 INFO ]: Found error trace [2018-06-22 01:12:34,535 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:34,535 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:34,535 INFO ]: Analyzing trace with hash 1957476132, now seen corresponding path program 4 times [2018-06-22 01:12:34,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:34,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:34,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:34,536 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:34,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:34,548 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:34,627 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:34,627 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:34,627 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:34,633 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:12:34,668 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:12:34,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:34,671 INFO ]: Computing forward predicates... [2018-06-22 01:12:34,685 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:34,715 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:34,715 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:12:34,715 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:12:34,715 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:12:34,715 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:12:34,715 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2018-06-22 01:12:35,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:35,221 INFO ]: Finished difference Result 26 states and 28 transitions. [2018-06-22 01:12:35,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:12:35,222 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-22 01:12:35,222 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:35,222 INFO ]: With dead ends: 26 [2018-06-22 01:12:35,222 INFO ]: Without dead ends: 18 [2018-06-22 01:12:35,222 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:12:35,222 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:12:35,223 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:12:35,223 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:12:35,224 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-22 01:12:35,224 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-22 01:12:35,224 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:35,224 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-22 01:12:35,224 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:12:35,224 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-22 01:12:35,224 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:12:35,224 INFO ]: Found error trace [2018-06-22 01:12:35,224 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:35,225 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:35,225 INFO ]: Analyzing trace with hash -558653999, now seen corresponding path program 5 times [2018-06-22 01:12:35,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:35,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:35,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:35,225 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:35,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:35,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:35,401 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:35,401 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:35,401 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:35,408 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:12:35,429 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:12:35,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:35,431 INFO ]: Computing forward predicates... [2018-06-22 01:12:35,526 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:35,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:35,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-22 01:12:35,551 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:12:35,551 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:12:35,551 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:12:35,551 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 14 states. [2018-06-22 01:12:35,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:35,944 INFO ]: Finished difference Result 31 states and 34 transitions. [2018-06-22 01:12:35,944 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:12:35,944 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 01:12:35,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:35,944 INFO ]: With dead ends: 31 [2018-06-22 01:12:35,944 INFO ]: Without dead ends: 31 [2018-06-22 01:12:35,945 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:12:35,945 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:12:35,950 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-06-22 01:12:35,950 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:12:35,951 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-22 01:12:35,951 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2018-06-22 01:12:35,951 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:35,951 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-22 01:12:35,951 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:12:35,951 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-22 01:12:35,951 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:12:35,951 INFO ]: Found error trace [2018-06-22 01:12:35,952 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:35,952 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:35,952 INFO ]: Analyzing trace with hash -1249276732, now seen corresponding path program 6 times [2018-06-22 01:12:35,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:35,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:35,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:35,952 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:35,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:35,980 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:36,112 INFO ]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:36,112 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:36,112 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:36,118 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:12:36,140 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:12:36,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:36,143 INFO ]: Computing forward predicates... [2018-06-22 01:12:36,159 INFO ]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:36,179 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:36,179 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 01:12:36,179 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:12:36,179 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:12:36,179 INFO ]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:12:36,180 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 12 states. [2018-06-22 01:12:36,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:36,458 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-22 01:12:36,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:12:36,459 INFO ]: Start accepts. Automaton has 12 states. Word has length 18 [2018-06-22 01:12:36,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:36,459 INFO ]: With dead ends: 33 [2018-06-22 01:12:36,459 INFO ]: Without dead ends: 33 [2018-06-22 01:12:36,460 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:12:36,460 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:12:36,462 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-06-22 01:12:36,462 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:12:36,462 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-22 01:12:36,462 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-22 01:12:36,463 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:36,463 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-22 01:12:36,463 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:12:36,463 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-22 01:12:36,463 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:12:36,463 INFO ]: Found error trace [2018-06-22 01:12:36,463 INFO ]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:36,463 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:36,463 INFO ]: Analyzing trace with hash 30693881, now seen corresponding path program 7 times [2018-06-22 01:12:36,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:36,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:36,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:36,464 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:36,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:36,480 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:37,184 INFO ]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:37,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:37,184 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:37,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:37,212 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:37,214 INFO ]: Computing forward predicates... [2018-06-22 01:12:37,229 INFO ]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:37,248 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:37,248 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 01:12:37,248 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:12:37,249 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:12:37,249 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:12:37,249 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 14 states. [2018-06-22 01:12:37,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:37,411 INFO ]: Finished difference Result 31 states and 33 transitions. [2018-06-22 01:12:37,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:12:37,411 INFO ]: Start accepts. Automaton has 14 states. Word has length 19 [2018-06-22 01:12:37,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:37,411 INFO ]: With dead ends: 31 [2018-06-22 01:12:37,411 INFO ]: Without dead ends: 21 [2018-06-22 01:12:37,412 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:12:37,412 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:12:37,413 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:12:37,413 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:12:37,413 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 01:12:37,414 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-06-22 01:12:37,414 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:37,414 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 01:12:37,414 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:12:37,414 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 01:12:37,414 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:12:37,414 INFO ]: Found error trace [2018-06-22 01:12:37,414 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:37,414 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:37,414 INFO ]: Analyzing trace with hash 2062178348, now seen corresponding path program 8 times [2018-06-22 01:12:37,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:37,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:37,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:37,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:37,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:37,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:37,833 INFO ]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:37,833 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:37,833 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:37,838 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:12:37,873 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:12:37,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:37,876 INFO ]: Computing forward predicates... [2018-06-22 01:12:37,992 INFO ]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:38,010 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:38,011 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-22 01:12:38,011 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:12:38,011 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:12:38,011 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:12:38,011 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 17 states. [2018-06-22 01:12:38,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:38,393 INFO ]: Finished difference Result 36 states and 39 transitions. [2018-06-22 01:12:38,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:12:38,393 INFO ]: Start accepts. Automaton has 17 states. Word has length 20 [2018-06-22 01:12:38,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:38,394 INFO ]: With dead ends: 36 [2018-06-22 01:12:38,394 INFO ]: Without dead ends: 36 [2018-06-22 01:12:38,395 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:12:38,395 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:12:38,397 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 24. [2018-06-22 01:12:38,397 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:12:38,397 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-22 01:12:38,397 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2018-06-22 01:12:38,397 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:38,397 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-22 01:12:38,397 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:12:38,397 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-22 01:12:38,398 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:12:38,398 INFO ]: Found error trace [2018-06-22 01:12:38,398 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:38,398 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:38,398 INFO ]: Analyzing trace with hash 613687385, now seen corresponding path program 9 times [2018-06-22 01:12:38,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:38,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:38,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:38,398 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:38,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:38,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:38,602 INFO ]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:38,602 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:38,602 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:38,608 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:12:38,635 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:12:38,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:38,637 INFO ]: Computing forward predicates... [2018-06-22 01:12:38,658 INFO ]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:38,689 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:38,689 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-22 01:12:38,689 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:12:38,689 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:12:38,690 INFO ]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:12:38,690 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 15 states. [2018-06-22 01:12:39,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:39,285 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-22 01:12:39,286 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:12:39,286 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 01:12:39,286 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:39,286 INFO ]: With dead ends: 38 [2018-06-22 01:12:39,286 INFO ]: Without dead ends: 38 [2018-06-22 01:12:39,287 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=717, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:12:39,287 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:12:39,288 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 23. [2018-06-22 01:12:39,288 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:12:39,289 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-22 01:12:39,289 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2018-06-22 01:12:39,289 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:39,289 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-22 01:12:39,289 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:12:39,289 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-22 01:12:39,289 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:12:39,289 INFO ]: Found error trace [2018-06-22 01:12:39,290 INFO ]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:39,290 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:39,290 INFO ]: Analyzing trace with hash 1799743892, now seen corresponding path program 10 times [2018-06-22 01:12:39,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:39,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:39,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:39,290 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:39,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:39,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:39,455 INFO ]: Checked inductivity of 31 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:39,455 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:39,455 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:39,461 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:12:39,485 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:12:39,485 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:39,488 INFO ]: Computing forward predicates... [2018-06-22 01:12:39,506 INFO ]: Checked inductivity of 31 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:39,533 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:39,533 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-22 01:12:39,533 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:12:39,534 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:12:39,534 INFO ]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:12:39,534 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 17 states. [2018-06-22 01:12:39,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:39,746 INFO ]: Finished difference Result 36 states and 38 transitions. [2018-06-22 01:12:39,746 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:12:39,746 INFO ]: Start accepts. Automaton has 17 states. Word has length 22 [2018-06-22 01:12:39,746 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:39,746 INFO ]: With dead ends: 36 [2018-06-22 01:12:39,746 INFO ]: Without dead ends: 24 [2018-06-22 01:12:39,747 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:12:39,747 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:12:39,748 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 01:12:39,748 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:12:39,748 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-22 01:12:39,748 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-22 01:12:39,748 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:39,748 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-22 01:12:39,748 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:12:39,748 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-22 01:12:39,749 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:12:39,749 INFO ]: Found error trace [2018-06-22 01:12:39,749 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:39,749 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:39,749 INFO ]: Analyzing trace with hash 1369332353, now seen corresponding path program 11 times [2018-06-22 01:12:39,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:39,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:39,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:39,750 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:39,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:39,769 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:40,043 INFO ]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:40,043 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:40,043 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:40,049 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:12:40,077 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:12:40,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:40,080 INFO ]: Computing forward predicates... [2018-06-22 01:12:40,159 INFO ]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:40,178 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:40,178 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-22 01:12:40,178 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:12:40,178 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:12:40,178 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:12:40,178 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 20 states. [2018-06-22 01:12:40,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:40,664 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-22 01:12:40,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:12:40,684 INFO ]: Start accepts. Automaton has 20 states. Word has length 23 [2018-06-22 01:12:40,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:40,685 INFO ]: With dead ends: 41 [2018-06-22 01:12:40,685 INFO ]: Without dead ends: 41 [2018-06-22 01:12:40,685 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:12:40,685 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:12:40,687 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-06-22 01:12:40,687 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:12:40,688 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-22 01:12:40,688 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2018-06-22 01:12:40,688 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:40,688 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-22 01:12:40,688 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:12:40,688 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-22 01:12:40,688 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:12:40,688 INFO ]: Found error trace [2018-06-22 01:12:40,688 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:40,689 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:40,689 INFO ]: Analyzing trace with hash 911476532, now seen corresponding path program 12 times [2018-06-22 01:12:40,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:40,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:40,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:40,689 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:40,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:40,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:40,880 INFO ]: Checked inductivity of 40 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:40,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:40,880 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:40,885 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:12:40,925 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:12:40,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:40,928 INFO ]: Computing forward predicates... [2018-06-22 01:12:40,944 INFO ]: Checked inductivity of 40 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:40,974 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:40,974 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-22 01:12:40,975 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:12:40,975 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:12:40,975 INFO ]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:12:40,975 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 18 states. [2018-06-22 01:12:41,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:41,461 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-22 01:12:41,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:12:41,462 INFO ]: Start accepts. Automaton has 18 states. Word has length 24 [2018-06-22 01:12:41,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:41,462 INFO ]: With dead ends: 43 [2018-06-22 01:12:41,462 INFO ]: Without dead ends: 43 [2018-06-22 01:12:41,463 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=497, Invalid=1063, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:12:41,463 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:12:41,465 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-06-22 01:12:41,465 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:12:41,466 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-22 01:12:41,466 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-22 01:12:41,466 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:41,466 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-22 01:12:41,466 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:12:41,466 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-22 01:12:41,466 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:12:41,466 INFO ]: Found error trace [2018-06-22 01:12:41,466 INFO ]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:41,466 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:41,467 INFO ]: Analyzing trace with hash 1694673577, now seen corresponding path program 13 times [2018-06-22 01:12:41,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:41,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:41,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:41,467 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:41,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:41,479 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:42,011 INFO ]: Checked inductivity of 46 backedges. 25 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:42,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:42,012 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:42,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:42,056 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:42,058 INFO ]: Computing forward predicates... [2018-06-22 01:12:42,073 INFO ]: Checked inductivity of 46 backedges. 25 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:42,104 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:42,104 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-22 01:12:42,104 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:12:42,104 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:12:42,104 INFO ]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:12:42,104 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 20 states. [2018-06-22 01:12:42,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:42,451 INFO ]: Finished difference Result 41 states and 43 transitions. [2018-06-22 01:12:42,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:12:42,451 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 01:12:42,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:42,451 INFO ]: With dead ends: 41 [2018-06-22 01:12:42,451 INFO ]: Without dead ends: 27 [2018-06-22 01:12:42,452 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=280, Invalid=776, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:12:42,452 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:12:42,454 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:12:42,454 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:12:42,454 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-22 01:12:42,454 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-06-22 01:12:42,454 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:42,454 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-22 01:12:42,454 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:12:42,454 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-22 01:12:42,461 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:12:42,461 INFO ]: Found error trace [2018-06-22 01:12:42,461 INFO ]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:42,461 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:42,462 INFO ]: Analyzing trace with hash -218106212, now seen corresponding path program 14 times [2018-06-22 01:12:42,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:42,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:42,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:42,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:42,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:42,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:43,308 INFO ]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:43,308 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:43,308 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:43,314 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:12:43,345 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:12:43,345 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:43,353 INFO ]: Computing forward predicates... [2018-06-22 01:12:43,484 INFO ]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:43,505 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:43,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-22 01:12:43,505 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:12:43,505 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:12:43,505 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:12:43,505 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 23 states. [2018-06-22 01:12:44,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:44,260 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-22 01:12:44,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:12:44,260 INFO ]: Start accepts. Automaton has 23 states. Word has length 26 [2018-06-22 01:12:44,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:44,260 INFO ]: With dead ends: 46 [2018-06-22 01:12:44,260 INFO ]: Without dead ends: 46 [2018-06-22 01:12:44,261 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=1790, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:12:44,261 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 01:12:44,263 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 30. [2018-06-22 01:12:44,263 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:12:44,264 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-22 01:12:44,264 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2018-06-22 01:12:44,264 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:44,264 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-22 01:12:44,264 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:12:44,264 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-22 01:12:44,265 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:12:44,265 INFO ]: Found error trace [2018-06-22 01:12:44,265 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:44,265 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:44,265 INFO ]: Analyzing trace with hash 615262473, now seen corresponding path program 15 times [2018-06-22 01:12:44,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:44,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:44,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:44,265 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:44,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:44,282 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:44,557 INFO ]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:44,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:44,557 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:44,563 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:12:44,600 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:12:44,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:44,603 INFO ]: Computing forward predicates... [2018-06-22 01:12:44,619 INFO ]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:44,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:44,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-22 01:12:44,638 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:12:44,638 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:12:44,638 INFO ]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:12:44,638 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 21 states. [2018-06-22 01:12:45,017 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:45,017 INFO ]: Finished difference Result 48 states and 51 transitions. [2018-06-22 01:12:45,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:12:45,017 INFO ]: Start accepts. Automaton has 21 states. Word has length 27 [2018-06-22 01:12:45,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:45,018 INFO ]: With dead ends: 48 [2018-06-22 01:12:45,018 INFO ]: Without dead ends: 48 [2018-06-22 01:12:45,018 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=686, Invalid=1476, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:12:45,018 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:12:45,020 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 29. [2018-06-22 01:12:45,020 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:12:45,020 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-22 01:12:45,020 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-06-22 01:12:45,020 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:45,020 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-22 01:12:45,020 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:12:45,020 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-22 01:12:45,021 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:12:45,021 INFO ]: Found error trace [2018-06-22 01:12:45,021 INFO ]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:45,021 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:45,021 INFO ]: Analyzing trace with hash 879602692, now seen corresponding path program 16 times [2018-06-22 01:12:45,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:45,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:45,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:45,022 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:45,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:45,032 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:45,333 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:45,333 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:45,333 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:45,340 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:12:45,370 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:12:45,370 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:45,373 INFO ]: Computing forward predicates... [2018-06-22 01:12:45,390 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:45,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:45,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-22 01:12:45,423 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:12:45,423 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:12:45,424 INFO ]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:12:45,424 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 23 states. [2018-06-22 01:12:45,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:45,796 INFO ]: Finished difference Result 46 states and 48 transitions. [2018-06-22 01:12:45,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:12:45,829 INFO ]: Start accepts. Automaton has 23 states. Word has length 28 [2018-06-22 01:12:45,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:45,829 INFO ]: With dead ends: 46 [2018-06-22 01:12:45,829 INFO ]: Without dead ends: 30 [2018-06-22 01:12:45,830 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=364, Invalid=1042, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:12:45,830 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:12:45,831 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 01:12:45,831 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:12:45,831 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-22 01:12:45,831 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-22 01:12:45,832 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:45,832 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-22 01:12:45,832 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:12:45,832 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-22 01:12:45,832 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:12:45,832 INFO ]: Found error trace [2018-06-22 01:12:45,832 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:45,832 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:45,832 INFO ]: Analyzing trace with hash -1411975375, now seen corresponding path program 17 times [2018-06-22 01:12:45,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:45,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:45,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:45,833 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:45,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:45,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:46,225 INFO ]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:46,226 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:46,226 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:46,234 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:12:46,271 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 01:12:46,271 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:46,274 INFO ]: Computing forward predicates... [2018-06-22 01:12:46,369 INFO ]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:46,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:46,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-22 01:12:46,388 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:12:46,388 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:12:46,388 INFO ]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:12:46,388 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 26 states. [2018-06-22 01:12:47,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:47,407 INFO ]: Finished difference Result 51 states and 54 transitions. [2018-06-22 01:12:47,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:12:47,407 INFO ]: Start accepts. Automaton has 26 states. Word has length 29 [2018-06-22 01:12:47,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:47,407 INFO ]: With dead ends: 51 [2018-06-22 01:12:47,407 INFO ]: Without dead ends: 51 [2018-06-22 01:12:47,408 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=216, Invalid=2334, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 01:12:47,408 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:12:47,410 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 33. [2018-06-22 01:12:47,411 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:12:47,411 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-22 01:12:47,411 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2018-06-22 01:12:47,411 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:47,411 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-22 01:12:47,411 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:12:47,411 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-22 01:12:47,412 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:12:47,412 INFO ]: Found error trace [2018-06-22 01:12:47,412 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:47,412 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:47,412 INFO ]: Analyzing trace with hash 563548580, now seen corresponding path program 18 times [2018-06-22 01:12:47,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:47,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:47,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:47,413 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:47,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:47,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:48,264 INFO ]: Checked inductivity of 77 backedges. 28 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:48,264 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:48,264 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:48,274 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:12:48,313 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:12:48,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:48,317 INFO ]: Computing forward predicates... [2018-06-22 01:12:48,344 INFO ]: Checked inductivity of 77 backedges. 28 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:48,370 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:48,370 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-22 01:12:48,370 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:12:48,370 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:12:48,370 INFO ]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:12:48,370 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 24 states. [2018-06-22 01:12:49,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:49,132 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-22 01:12:49,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:12:49,133 INFO ]: Start accepts. Automaton has 24 states. Word has length 30 [2018-06-22 01:12:49,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:49,133 INFO ]: With dead ends: 53 [2018-06-22 01:12:49,133 INFO ]: Without dead ends: 53 [2018-06-22 01:12:49,134 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=906, Invalid=1956, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:12:49,134 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:12:49,136 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-06-22 01:12:49,136 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:12:49,139 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-22 01:12:49,139 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-22 01:12:49,139 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:49,139 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-22 01:12:49,139 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:12:49,139 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-22 01:12:49,139 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:12:49,139 INFO ]: Found error trace [2018-06-22 01:12:49,139 INFO ]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:49,139 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:49,140 INFO ]: Analyzing trace with hash 327605081, now seen corresponding path program 19 times [2018-06-22 01:12:49,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:49,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:49,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:49,140 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:49,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:49,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:49,517 INFO ]: Checked inductivity of 85 backedges. 49 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:49,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:49,517 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:49,524 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:49,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:49,565 INFO ]: Computing forward predicates... [2018-06-22 01:12:49,587 INFO ]: Checked inductivity of 85 backedges. 49 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:49,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:49,610 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-22 01:12:49,610 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:12:49,610 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:12:49,610 INFO ]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:12:49,610 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 26 states. [2018-06-22 01:12:50,039 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:50,039 INFO ]: Finished difference Result 51 states and 53 transitions. [2018-06-22 01:12:50,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:12:50,040 INFO ]: Start accepts. Automaton has 26 states. Word has length 31 [2018-06-22 01:12:50,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:50,040 INFO ]: With dead ends: 51 [2018-06-22 01:12:50,040 INFO ]: Without dead ends: 33 [2018-06-22 01:12:50,041 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=459, Invalid=1347, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:12:50,041 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:12:50,042 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:12:50,042 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:12:50,042 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-22 01:12:50,042 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-06-22 01:12:50,043 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:50,043 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-22 01:12:50,043 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:12:50,043 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-22 01:12:50,043 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:12:50,043 INFO ]: Found error trace [2018-06-22 01:12:50,043 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:50,043 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:50,043 INFO ]: Analyzing trace with hash 430581004, now seen corresponding path program 20 times [2018-06-22 01:12:50,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:50,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:50,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:50,044 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:12:50,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:50,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:50,775 INFO ]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:50,775 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:50,775 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) [2018-06-22 01:12:50,789 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:50,857 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:12:50,857 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:50,863 INFO ]: Computing forward predicates... [2018-06-22 01:12:51,179 INFO ]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:51,200 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:51,200 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-22 01:12:51,200 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:12:51,200 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:12:51,201 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:12:51,201 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 29 states. [2018-06-22 01:12:52,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:52,229 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-22 01:12:52,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:12:52,229 INFO ]: Start accepts. Automaton has 29 states. Word has length 32 [2018-06-22 01:12:52,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:52,229 INFO ]: With dead ends: 56 [2018-06-22 01:12:52,229 INFO ]: Without dead ends: 56 [2018-06-22 01:12:52,230 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=242, Invalid=2950, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 01:12:52,230 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:12:52,232 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 36. [2018-06-22 01:12:52,232 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:12:52,232 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-22 01:12:52,232 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 32 [2018-06-22 01:12:52,232 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:52,232 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-22 01:12:52,232 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:12:52,232 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-22 01:12:52,233 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:12:52,233 INFO ]: Found error trace [2018-06-22 01:12:52,233 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:52,233 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:52,233 INFO ]: Analyzing trace with hash -672132679, now seen corresponding path program 21 times [2018-06-22 01:12:52,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:52,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:52,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:52,234 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:52,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:52,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:52,500 INFO ]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:52,500 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:52,500 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:52,507 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:12:52,562 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:12:52,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:52,565 INFO ]: Computing forward predicates... [2018-06-22 01:12:52,588 INFO ]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:52,617 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:52,618 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-22 01:12:52,618 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:12:52,618 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:12:52,618 INFO ]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:12:52,618 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 27 states. [2018-06-22 01:12:53,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:53,655 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-22 01:12:53,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:12:53,655 INFO ]: Start accepts. Automaton has 27 states. Word has length 33 [2018-06-22 01:12:53,655 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:53,656 INFO ]: With dead ends: 58 [2018-06-22 01:12:53,656 INFO ]: Without dead ends: 58 [2018-06-22 01:12:53,657 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1157, Invalid=2503, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 01:12:53,657 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 01:12:53,658 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 35. [2018-06-22 01:12:53,658 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:12:53,659 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-22 01:12:53,659 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2018-06-22 01:12:53,659 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:53,659 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-22 01:12:53,659 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:12:53,659 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-22 01:12:53,659 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:12:53,659 INFO ]: Found error trace [2018-06-22 01:12:53,659 INFO ]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:53,659 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:53,659 INFO ]: Analyzing trace with hash 1497759348, now seen corresponding path program 22 times [2018-06-22 01:12:53,659 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:53,659 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:53,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:53,660 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:53,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:53,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:54,037 INFO ]: Checked inductivity of 109 backedges. 64 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:54,037 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:54,037 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:54,046 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:12:54,088 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:12:54,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:54,091 INFO ]: Computing forward predicates... [2018-06-22 01:12:54,110 INFO ]: Checked inductivity of 109 backedges. 64 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:54,141 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:54,142 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-22 01:12:54,142 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:12:54,142 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:12:54,142 INFO ]: CoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:12:54,142 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 29 states. [2018-06-22 01:12:55,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:55,208 INFO ]: Finished difference Result 56 states and 58 transitions. [2018-06-22 01:12:55,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:12:55,209 INFO ]: Start accepts. Automaton has 29 states. Word has length 34 [2018-06-22 01:12:55,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:55,209 INFO ]: With dead ends: 56 [2018-06-22 01:12:55,209 INFO ]: Without dead ends: 36 [2018-06-22 01:12:55,210 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=565, Invalid=1691, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:12:55,210 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:12:55,211 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 01:12:55,211 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:12:55,212 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-22 01:12:55,212 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-22 01:12:55,212 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:55,212 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-22 01:12:55,212 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:12:55,212 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-22 01:12:55,212 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:12:55,212 INFO ]: Found error trace [2018-06-22 01:12:55,212 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:55,212 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:55,212 INFO ]: Analyzing trace with hash -1648135199, now seen corresponding path program 23 times [2018-06-22 01:12:55,212 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:55,212 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:55,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:55,213 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:55,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:55,230 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:56,251 INFO ]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:56,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:56,280 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:56,285 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:12:56,334 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 01:12:56,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:56,338 INFO ]: Computing forward predicates... [2018-06-22 01:12:56,477 INFO ]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:56,497 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:56,497 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-22 01:12:56,497 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:12:56,497 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:12:56,497 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:12:56,497 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 32 states. [2018-06-22 01:12:57,626 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:57,626 INFO ]: Finished difference Result 61 states and 64 transitions. [2018-06-22 01:12:57,626 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:12:57,626 INFO ]: Start accepts. Automaton has 32 states. Word has length 35 [2018-06-22 01:12:57,627 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:57,627 INFO ]: With dead ends: 61 [2018-06-22 01:12:57,627 INFO ]: Without dead ends: 61 [2018-06-22 01:12:57,628 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=268, Invalid=3638, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:12:57,628 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 01:12:57,630 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 39. [2018-06-22 01:12:57,630 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:12:57,630 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-22 01:12:57,630 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 35 [2018-06-22 01:12:57,630 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:57,630 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-22 01:12:57,630 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:12:57,630 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-22 01:12:57,630 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:12:57,630 INFO ]: Found error trace [2018-06-22 01:12:57,630 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:57,631 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:57,632 INFO ]: Analyzing trace with hash -386618348, now seen corresponding path program 24 times [2018-06-22 01:12:57,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:57,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:57,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:57,633 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:57,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:57,648 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:57,967 INFO ]: Checked inductivity of 126 backedges. 45 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:57,967 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:12:57,967 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:12:57,973 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:12:58,020 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 01:12:58,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:12:58,023 INFO ]: Computing forward predicates... [2018-06-22 01:12:58,041 INFO ]: Checked inductivity of 126 backedges. 45 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:12:58,072 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:12:58,073 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-22 01:12:58,073 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:12:58,073 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:12:58,073 INFO ]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:12:58,073 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 30 states. [2018-06-22 01:12:58,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:12:58,837 INFO ]: Finished difference Result 63 states and 66 transitions. [2018-06-22 01:12:58,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 01:12:58,837 INFO ]: Start accepts. Automaton has 30 states. Word has length 36 [2018-06-22 01:12:58,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:12:58,837 INFO ]: With dead ends: 63 [2018-06-22 01:12:58,837 INFO ]: Without dead ends: 63 [2018-06-22 01:12:58,838 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1439, Invalid=3117, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 01:12:58,838 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 01:12:58,840 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 38. [2018-06-22 01:12:58,840 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:12:58,840 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-22 01:12:58,840 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-06-22 01:12:58,840 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:12:58,840 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-22 01:12:58,840 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:12:58,840 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-22 01:12:58,840 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:12:58,840 INFO ]: Found error trace [2018-06-22 01:12:58,841 INFO ]: trace histogram [10, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:12:58,841 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:12:58,841 INFO ]: Analyzing trace with hash 1011280905, now seen corresponding path program 25 times [2018-06-22 01:12:58,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:12:58,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:12:58,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:58,841 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:12:58,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:12:58,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:00,658 INFO ]: Checked inductivity of 136 backedges. 81 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:00,658 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:00,658 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 01:13:00,665 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:00,705 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:00,710 INFO ]: Computing forward predicates... [2018-06-22 01:13:00,732 INFO ]: Checked inductivity of 136 backedges. 81 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:00,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:00,765 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-22 01:13:00,765 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:13:00,765 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:13:00,765 INFO ]: CoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:13:00,765 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 32 states. [2018-06-22 01:13:01,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:01,265 INFO ]: Finished difference Result 61 states and 63 transitions. [2018-06-22 01:13:01,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:13:01,296 INFO ]: Start accepts. Automaton has 32 states. Word has length 37 [2018-06-22 01:13:01,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:01,296 INFO ]: With dead ends: 61 [2018-06-22 01:13:01,296 INFO ]: Without dead ends: 39 [2018-06-22 01:13:01,297 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=682, Invalid=2074, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:13:01,297 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:13:01,298 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:13:01,298 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:13:01,299 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-22 01:13:01,299 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2018-06-22 01:13:01,299 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:01,299 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-22 01:13:01,299 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:13:01,299 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-22 01:13:01,299 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:13:01,299 INFO ]: Found error trace [2018-06-22 01:13:01,299 INFO ]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:01,299 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:01,300 INFO ]: Analyzing trace with hash -2146770052, now seen corresponding path program 26 times [2018-06-22 01:13:01,300 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:01,300 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:01,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:01,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:01,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:01,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:01,917 INFO ]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:01,917 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:01,917 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:01,924 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:01,981 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:01,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:01,986 INFO ]: Computing forward predicates... [2018-06-22 01:13:02,109 INFO ]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:02,129 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:02,129 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-22 01:13:02,130 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:13:02,130 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:13:02,130 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:13:02,130 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 35 states. [2018-06-22 01:13:03,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:03,408 INFO ]: Finished difference Result 66 states and 69 transitions. [2018-06-22 01:13:03,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:13:03,408 INFO ]: Start accepts. Automaton has 35 states. Word has length 38 [2018-06-22 01:13:03,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:03,408 INFO ]: With dead ends: 66 [2018-06-22 01:13:03,408 INFO ]: Without dead ends: 66 [2018-06-22 01:13:03,409 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=294, Invalid=4398, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 01:13:03,409 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 01:13:03,412 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 42. [2018-06-22 01:13:03,412 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:13:03,412 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-22 01:13:03,412 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 38 [2018-06-22 01:13:03,412 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:03,412 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-22 01:13:03,412 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:13:03,412 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-22 01:13:03,413 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:13:03,413 INFO ]: Found error trace [2018-06-22 01:13:03,413 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:03,413 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:03,413 INFO ]: Analyzing trace with hash -1262101911, now seen corresponding path program 27 times [2018-06-22 01:13:03,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:03,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:03,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:03,413 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:03,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:03,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:04,500 INFO ]: Checked inductivity of 155 backedges. 55 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:04,500 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:04,500 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:04,506 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:13:04,564 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 01:13:04,564 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:04,568 INFO ]: Computing forward predicates... [2018-06-22 01:13:04,585 INFO ]: Checked inductivity of 155 backedges. 55 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:04,605 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:04,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-22 01:13:04,605 INFO ]: Interpolant automaton has 33 states [2018-06-22 01:13:04,606 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 01:13:04,606 INFO ]: CoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:13:04,606 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 33 states. [2018-06-22 01:13:05,489 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:05,489 INFO ]: Finished difference Result 68 states and 71 transitions. [2018-06-22 01:13:05,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 01:13:05,490 INFO ]: Start accepts. Automaton has 33 states. Word has length 39 [2018-06-22 01:13:05,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:05,490 INFO ]: With dead ends: 68 [2018-06-22 01:13:05,490 INFO ]: Without dead ends: 68 [2018-06-22 01:13:05,490 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1752, Invalid=3798, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 01:13:05,491 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 01:13:05,491 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 41. [2018-06-22 01:13:05,491 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:13:05,492 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-22 01:13:05,492 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-06-22 01:13:05,492 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:05,492 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-22 01:13:05,492 INFO ]: Interpolant automaton has 33 states. [2018-06-22 01:13:05,492 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-22 01:13:05,492 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:13:05,492 INFO ]: Found error trace [2018-06-22 01:13:05,492 INFO ]: trace histogram [11, 11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:05,492 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:05,492 INFO ]: Analyzing trace with hash -1435442972, now seen corresponding path program 28 times [2018-06-22 01:13:05,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:05,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:05,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:05,492 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:05,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:05,507 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:06,062 INFO ]: Checked inductivity of 166 backedges. 100 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:06,063 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:06,063 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:06,068 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:13:06,113 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:13:06,113 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:06,116 INFO ]: Computing forward predicates... [2018-06-22 01:13:06,133 INFO ]: Checked inductivity of 166 backedges. 100 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:06,152 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:06,152 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-22 01:13:06,152 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:13:06,153 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:13:06,153 INFO ]: CoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:13:06,153 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 35 states. [2018-06-22 01:13:06,708 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:06,708 INFO ]: Finished difference Result 66 states and 68 transitions. [2018-06-22 01:13:06,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:13:06,708 INFO ]: Start accepts. Automaton has 35 states. Word has length 40 [2018-06-22 01:13:06,709 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:06,709 INFO ]: With dead ends: 66 [2018-06-22 01:13:06,709 INFO ]: Without dead ends: 42 [2018-06-22 01:13:06,709 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=810, Invalid=2496, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 01:13:06,709 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:13:06,710 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 01:13:06,710 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:13:06,710 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-06-22 01:13:06,710 INFO ]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-06-22 01:13:06,710 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:06,710 INFO ]: Abstraction has 42 states and 43 transitions. [2018-06-22 01:13:06,710 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:13:06,710 INFO ]: Start isEmpty. Operand 42 states and 43 transitions. [2018-06-22 01:13:06,710 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:13:06,710 INFO ]: Found error trace [2018-06-22 01:13:06,710 INFO ]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:06,711 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:06,711 INFO ]: Analyzing trace with hash -1672884079, now seen corresponding path program 29 times [2018-06-22 01:13:06,711 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:06,711 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:06,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:06,711 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:06,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:06,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:07,437 INFO ]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:07,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:07,438 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:07,443 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:13:07,512 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 01:13:07,512 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:07,517 INFO ]: Computing forward predicates... [2018-06-22 01:13:07,657 INFO ]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:07,677 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:07,677 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-22 01:13:07,678 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:13:07,678 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:13:07,678 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:13:07,678 INFO ]: Start difference. First operand 42 states and 43 transitions. Second operand 38 states. [2018-06-22 01:13:09,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:09,102 INFO ]: Finished difference Result 71 states and 74 transitions. [2018-06-22 01:13:09,102 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:13:09,102 INFO ]: Start accepts. Automaton has 38 states. Word has length 41 [2018-06-22 01:13:09,102 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:09,102 INFO ]: With dead ends: 71 [2018-06-22 01:13:09,102 INFO ]: Without dead ends: 71 [2018-06-22 01:13:09,103 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 9 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=320, Invalid=5230, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 01:13:09,103 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 01:13:09,104 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 45. [2018-06-22 01:13:09,104 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:13:09,104 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-06-22 01:13:09,104 INFO ]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 41 [2018-06-22 01:13:09,104 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:09,104 INFO ]: Abstraction has 45 states and 47 transitions. [2018-06-22 01:13:09,104 INFO ]: Interpolant automaton has 38 states. [2018-06-22 01:13:09,104 INFO ]: Start isEmpty. Operand 45 states and 47 transitions. [2018-06-22 01:13:09,105 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:13:09,105 INFO ]: Found error trace [2018-06-22 01:13:09,105 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:09,105 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:09,105 INFO ]: Analyzing trace with hash -443623804, now seen corresponding path program 30 times [2018-06-22 01:13:09,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:09,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:09,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:09,105 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:09,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:09,123 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:09,586 INFO ]: Checked inductivity of 187 backedges. 66 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:09,586 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:09,586 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 01:13:09,595 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:13:09,653 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 01:13:09,653 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:09,657 INFO ]: Computing forward predicates... [2018-06-22 01:13:09,681 INFO ]: Checked inductivity of 187 backedges. 66 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:09,713 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:09,713 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-22 01:13:09,713 INFO ]: Interpolant automaton has 36 states [2018-06-22 01:13:09,714 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 01:13:09,714 INFO ]: CoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:13:09,714 INFO ]: Start difference. First operand 45 states and 47 transitions. Second operand 36 states. [2018-06-22 01:13:10,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:10,772 INFO ]: Finished difference Result 73 states and 76 transitions. [2018-06-22 01:13:10,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 01:13:10,772 INFO ]: Start accepts. Automaton has 36 states. Word has length 42 [2018-06-22 01:13:10,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:10,773 INFO ]: With dead ends: 73 [2018-06-22 01:13:10,773 INFO ]: Without dead ends: 73 [2018-06-22 01:13:10,773 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2096, Invalid=4546, Unknown=0, NotChecked=0, Total=6642 [2018-06-22 01:13:10,773 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 01:13:10,774 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-06-22 01:13:10,774 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:13:10,774 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-06-22 01:13:10,775 INFO ]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-06-22 01:13:10,775 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:10,775 INFO ]: Abstraction has 44 states and 45 transitions. [2018-06-22 01:13:10,775 INFO ]: Interpolant automaton has 36 states. [2018-06-22 01:13:10,775 INFO ]: Start isEmpty. Operand 44 states and 45 transitions. [2018-06-22 01:13:10,775 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:13:10,775 INFO ]: Found error trace [2018-06-22 01:13:10,775 INFO ]: trace histogram [12, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:10,775 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:10,775 INFO ]: Analyzing trace with hash -1297556295, now seen corresponding path program 31 times [2018-06-22 01:13:10,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:10,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:10,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:10,776 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:10,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:10,790 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:11,745 INFO ]: Checked inductivity of 199 backedges. 121 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:11,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:11,835 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 01:13:11,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:11,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:11,893 INFO ]: Computing forward predicates... [2018-06-22 01:13:11,908 INFO ]: Checked inductivity of 199 backedges. 121 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:11,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:11,927 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-06-22 01:13:11,927 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:13:11,927 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:13:11,927 INFO ]: CoverageRelationStatistics Valid=249, Invalid=1157, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:13:11,927 INFO ]: Start difference. First operand 44 states and 45 transitions. Second operand 38 states. [2018-06-22 01:13:12,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:12,657 INFO ]: Finished difference Result 71 states and 73 transitions. [2018-06-22 01:13:12,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:13:12,658 INFO ]: Start accepts. Automaton has 38 states. Word has length 43 [2018-06-22 01:13:12,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:12,658 INFO ]: With dead ends: 71 [2018-06-22 01:13:12,658 INFO ]: Without dead ends: 45 [2018-06-22 01:13:12,658 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=949, Invalid=2957, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:13:12,658 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:13:12,659 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 01:13:12,659 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:13:12,659 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-06-22 01:13:12,659 INFO ]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2018-06-22 01:13:12,659 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:12,659 INFO ]: Abstraction has 45 states and 46 transitions. [2018-06-22 01:13:12,659 INFO ]: Interpolant automaton has 38 states. [2018-06-22 01:13:12,659 INFO ]: Start isEmpty. Operand 45 states and 46 transitions. [2018-06-22 01:13:12,660 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:13:12,660 INFO ]: Found error trace [2018-06-22 01:13:12,660 INFO ]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:12,660 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:12,660 INFO ]: Analyzing trace with hash -1094438420, now seen corresponding path program 32 times [2018-06-22 01:13:12,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:12,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:12,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:12,661 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:12,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:12,676 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:13,552 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:13,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:13,552 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:13,558 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:13,611 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:13,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:13,616 INFO ]: Computing forward predicates... [2018-06-22 01:13:13,741 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:13,773 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:13,773 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-06-22 01:13:13,773 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:13:13,773 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:13:13,773 INFO ]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:13:13,773 INFO ]: Start difference. First operand 45 states and 46 transitions. Second operand 41 states. [2018-06-22 01:13:15,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:15,447 INFO ]: Finished difference Result 76 states and 79 transitions. [2018-06-22 01:13:15,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 01:13:15,447 INFO ]: Start accepts. Automaton has 41 states. Word has length 44 [2018-06-22 01:13:15,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:15,448 INFO ]: With dead ends: 76 [2018-06-22 01:13:15,448 INFO ]: Without dead ends: 76 [2018-06-22 01:13:15,448 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=346, Invalid=6134, Unknown=0, NotChecked=0, Total=6480 [2018-06-22 01:13:15,449 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 01:13:15,449 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 48. [2018-06-22 01:13:15,449 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:13:15,450 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-06-22 01:13:15,450 INFO ]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 44 [2018-06-22 01:13:15,450 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:15,450 INFO ]: Abstraction has 48 states and 50 transitions. [2018-06-22 01:13:15,450 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:13:15,450 INFO ]: Start isEmpty. Operand 48 states and 50 transitions. [2018-06-22 01:13:15,450 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:13:15,450 INFO ]: Found error trace [2018-06-22 01:13:15,450 INFO ]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:15,450 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:15,450 INFO ]: Analyzing trace with hash 907248409, now seen corresponding path program 33 times [2018-06-22 01:13:15,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:15,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:15,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:15,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:15,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:15,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:16,058 INFO ]: Checked inductivity of 222 backedges. 78 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:16,058 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:16,058 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:16,064 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:13:16,131 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-22 01:13:16,131 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:16,136 INFO ]: Computing forward predicates... [2018-06-22 01:13:16,154 INFO ]: Checked inductivity of 222 backedges. 78 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:16,173 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:16,173 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-06-22 01:13:16,174 INFO ]: Interpolant automaton has 39 states [2018-06-22 01:13:16,174 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 01:13:16,174 INFO ]: CoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:13:16,174 INFO ]: Start difference. First operand 48 states and 50 transitions. Second operand 39 states. [2018-06-22 01:13:17,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:17,137 INFO ]: Finished difference Result 78 states and 81 transitions. [2018-06-22 01:13:17,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-06-22 01:13:17,215 INFO ]: Start accepts. Automaton has 39 states. Word has length 45 [2018-06-22 01:13:17,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:17,215 INFO ]: With dead ends: 78 [2018-06-22 01:13:17,215 INFO ]: Without dead ends: 78 [2018-06-22 01:13:17,216 INFO ]: 0 DeclaredPredicates, 134 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2471, Invalid=5361, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 01:13:17,216 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 01:13:17,217 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 47. [2018-06-22 01:13:17,217 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 01:13:17,218 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-06-22 01:13:17,218 INFO ]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 45 [2018-06-22 01:13:17,218 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:17,218 INFO ]: Abstraction has 47 states and 48 transitions. [2018-06-22 01:13:17,218 INFO ]: Interpolant automaton has 39 states. [2018-06-22 01:13:17,218 INFO ]: Start isEmpty. Operand 47 states and 48 transitions. [2018-06-22 01:13:17,218 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 01:13:17,218 INFO ]: Found error trace [2018-06-22 01:13:17,218 INFO ]: trace histogram [13, 13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:17,219 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:17,219 INFO ]: Analyzing trace with hash 537940820, now seen corresponding path program 34 times [2018-06-22 01:13:17,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:17,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:17,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:17,219 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:17,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:17,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:17,761 INFO ]: Checked inductivity of 235 backedges. 144 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:17,761 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:17,761 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:17,768 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:13:17,836 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:13:17,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:17,842 INFO ]: Computing forward predicates... [2018-06-22 01:13:17,868 INFO ]: Checked inductivity of 235 backedges. 144 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:17,894 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:17,894 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-06-22 01:13:17,894 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:13:17,894 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:13:17,895 INFO ]: CoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:13:17,895 INFO ]: Start difference. First operand 47 states and 48 transitions. Second operand 41 states. [2018-06-22 01:13:18,646 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:18,646 INFO ]: Finished difference Result 76 states and 78 transitions. [2018-06-22 01:13:18,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:13:18,646 INFO ]: Start accepts. Automaton has 41 states. Word has length 46 [2018-06-22 01:13:18,646 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:18,647 INFO ]: With dead ends: 76 [2018-06-22 01:13:18,647 INFO ]: Without dead ends: 48 [2018-06-22 01:13:18,647 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1099, Invalid=3457, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 01:13:18,647 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:13:18,648 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 01:13:18,648 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:13:18,648 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-06-22 01:13:18,648 INFO ]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-06-22 01:13:18,648 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:18,648 INFO ]: Abstraction has 48 states and 49 transitions. [2018-06-22 01:13:18,648 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:13:18,648 INFO ]: Start isEmpty. Operand 48 states and 49 transitions. [2018-06-22 01:13:18,648 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-22 01:13:18,649 INFO ]: Found error trace [2018-06-22 01:13:18,649 INFO ]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:18,649 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:18,649 INFO ]: Analyzing trace with hash 13634881, now seen corresponding path program 35 times [2018-06-22 01:13:18,649 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:18,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:18,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:18,649 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:18,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:18,674 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:20,829 INFO ]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:20,829 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:20,829 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:20,836 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:13:20,909 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-06-22 01:13:20,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:20,915 INFO ]: Computing forward predicates... [2018-06-22 01:13:21,120 INFO ]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:21,140 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:21,140 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-06-22 01:13:21,140 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:13:21,140 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:13:21,140 INFO ]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:13:21,141 INFO ]: Start difference. First operand 48 states and 49 transitions. Second operand 44 states. [2018-06-22 01:13:23,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:23,117 INFO ]: Finished difference Result 81 states and 84 transitions. [2018-06-22 01:13:23,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-22 01:13:23,117 INFO ]: Start accepts. Automaton has 44 states. Word has length 47 [2018-06-22 01:13:23,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:23,118 INFO ]: With dead ends: 81 [2018-06-22 01:13:23,118 INFO ]: Without dead ends: 81 [2018-06-22 01:13:23,118 INFO ]: 0 DeclaredPredicates, 132 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=372, Invalid=7110, Unknown=0, NotChecked=0, Total=7482 [2018-06-22 01:13:23,118 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 01:13:23,120 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 51. [2018-06-22 01:13:23,120 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:13:23,120 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-06-22 01:13:23,120 INFO ]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 47 [2018-06-22 01:13:23,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:23,120 INFO ]: Abstraction has 51 states and 53 transitions. [2018-06-22 01:13:23,120 INFO ]: Interpolant automaton has 44 states. [2018-06-22 01:13:23,120 INFO ]: Start isEmpty. Operand 51 states and 53 transitions. [2018-06-22 01:13:23,120 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:13:23,120 INFO ]: Found error trace [2018-06-22 01:13:23,121 INFO ]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:23,121 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:23,121 INFO ]: Analyzing trace with hash 940019956, now seen corresponding path program 36 times [2018-06-22 01:13:23,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:23,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:23,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:23,121 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:23,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:23,141 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:23,724 INFO ]: Checked inductivity of 260 backedges. 91 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:23,724 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:23,724 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:23,729 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:13:23,799 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-22 01:13:23,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:23,803 INFO ]: Computing forward predicates... [2018-06-22 01:13:23,823 INFO ]: Checked inductivity of 260 backedges. 91 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:23,855 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:23,855 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-06-22 01:13:23,855 INFO ]: Interpolant automaton has 42 states [2018-06-22 01:13:23,855 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 01:13:23,855 INFO ]: CoverageRelationStatistics Valid=328, Invalid=1394, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:13:23,855 INFO ]: Start difference. First operand 51 states and 53 transitions. Second operand 42 states. [2018-06-22 01:13:25,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:25,051 INFO ]: Finished difference Result 83 states and 86 transitions. [2018-06-22 01:13:25,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-06-22 01:13:25,052 INFO ]: Start accepts. Automaton has 42 states. Word has length 48 [2018-06-22 01:13:25,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:25,052 INFO ]: With dead ends: 83 [2018-06-22 01:13:25,052 INFO ]: Without dead ends: 83 [2018-06-22 01:13:25,053 INFO ]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2877, Invalid=6243, Unknown=0, NotChecked=0, Total=9120 [2018-06-22 01:13:25,053 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 01:13:25,055 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 50. [2018-06-22 01:13:25,055 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 01:13:25,055 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-06-22 01:13:25,055 INFO ]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2018-06-22 01:13:25,055 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:25,055 INFO ]: Abstraction has 50 states and 51 transitions. [2018-06-22 01:13:25,055 INFO ]: Interpolant automaton has 42 states. [2018-06-22 01:13:25,055 INFO ]: Start isEmpty. Operand 50 states and 51 transitions. [2018-06-22 01:13:25,056 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 01:13:25,056 INFO ]: Found error trace [2018-06-22 01:13:25,056 INFO ]: trace histogram [14, 14, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:25,056 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:25,056 INFO ]: Analyzing trace with hash 244493673, now seen corresponding path program 37 times [2018-06-22 01:13:25,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:25,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:25,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:25,056 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:25,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:25,074 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:26,186 INFO ]: Checked inductivity of 274 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:26,186 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:26,186 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:26,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:26,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:26,255 INFO ]: Computing forward predicates... [2018-06-22 01:13:26,282 INFO ]: Checked inductivity of 274 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:26,314 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:26,314 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-06-22 01:13:26,314 INFO ]: Interpolant automaton has 44 states [2018-06-22 01:13:26,314 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 01:13:26,314 INFO ]: CoverageRelationStatistics Valid=332, Invalid=1560, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 01:13:26,314 INFO ]: Start difference. First operand 50 states and 51 transitions. Second operand 44 states. Received shutdown request... [2018-06-22 01:13:26,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:13:26,750 WARN ]: Verification canceled [2018-06-22 01:13:26,896 WARN ]: Timeout [2018-06-22 01:13:26,896 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:13:26 BoogieIcfgContainer [2018-06-22 01:13:26,896 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:13:26,899 INFO ]: Toolchain (without parser) took 57750.32 ms. Allocated memory was 308.8 MB in the beginning and 761.8 MB in the end (delta: 453.0 MB). Free memory was 264.3 MB in the beginning and 736.0 MB in the end (delta: -471.6 MB). Peak memory consumption was 260.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:13:26,900 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:13:26,900 INFO ]: ChcToBoogie took 53.99 ms. Allocated memory is still 308.8 MB. Free memory was 264.3 MB in the beginning and 262.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:13:26,900 INFO ]: Boogie Preprocessor took 31.32 ms. Allocated memory is still 308.8 MB. Free memory was 262.3 MB in the beginning and 261.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:13:26,901 INFO ]: RCFGBuilder took 271.18 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 251.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:13:26,901 INFO ]: TraceAbstraction took 57383.74 ms. Allocated memory was 308.8 MB in the beginning and 761.8 MB in the end (delta: 453.0 MB). Free memory was 251.3 MB in the beginning and 738.7 MB in the end (delta: -487.4 MB). Peak memory consumption was 247.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:13:26,907 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 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.99 ms. Allocated memory is still 308.8 MB. Free memory was 264.3 MB in the beginning and 262.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 31.32 ms. Allocated memory is still 308.8 MB. Free memory was 262.3 MB in the beginning and 261.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 271.18 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 251.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57383.74 ms. Allocated memory was 308.8 MB in the beginning and 761.8 MB in the end (delta: 453.0 MB). Free memory was 251.3 MB in the beginning and 738.7 MB in the end (delta: -487.4 MB). Peak memory consumption was 247.9 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 (50states) and interpolant automaton (currently 15 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 57.3s OverallTime, 45 OverallIterations, 14 TraceHistogramMax, 28.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 486 SDtfs, 1005 SDslu, 5795 SDs, 0 SdLazy, 13901 SolverSat, 2322 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3090 GetRequests, 1160 SyntacticMatches, 85 SemanticMatches, 1844 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18919 ImplicationChecksByTransitivity, 39.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=43, 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.1s AutomataMinimizationTime, 44 MinimizatonAttempts, 519 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 2424 NumberOfCodeBlocks, 2424 NumberOfCodeBlocksAsserted, 232 NumberOfCheckSat, 2337 ConstructedInterpolants, 0 QuantifiedInterpolants, 383754 SizeOfPredicates, 1403 NumberOfNonLiveVariables, 13704 ConjunctsInSsa, 3351 ConjunctsInUnsatCore, 87 InterpolantComputations, 5 PerfectInterpolantSequences, 2552/7678 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/loop2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-13-26-919.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-13-26-919.csv Completed graceful shutdown