java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:00:26,878 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:00:26,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:00:26,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:00:26,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:00:26,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:00:26,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:00:26,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:00:26,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:00:26,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:00:26,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:00:26,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:00:26,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:00:26,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:00:26,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:00:26,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:00:26,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:00:26,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:00:26,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:00:26,922 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:00:26,923 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:00:26,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:00:26,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:00:26,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:00:26,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:00:26,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:00:26,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:00:26,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:00:26,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:00:26,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:00:26,935 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:00:26,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:00:26,936 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:00:26,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:00:26,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:00:26,937 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:00:26,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:00:26,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:00:26,954 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:00:26,954 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:00:26,955 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:00:26,955 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:00:26,955 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:00:26,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:00:26,956 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:00:26,956 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:00:26,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:00:26,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:00:26,956 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:00:26,957 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:00:26,957 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:00:26,957 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:00:26,957 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:00:26,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:00:26,957 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:00:26,959 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:00:26,959 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:00:26,993 INFO ]: Repository-Root is: /tmp [2018-06-22 11:00:27,006 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:00:27,010 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:00:27,014 INFO ]: Initializing SmtParser... [2018-06-22 11:00:27,014 INFO ]: SmtParser initialized [2018-06-22 11:00:27,015 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 [2018-06-22 11:00:27,016 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:00:27,103 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 unknown [2018-06-22 11:00:27,286 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 [2018-06-22 11:00:27,291 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:00:27,296 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:00:27,297 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:00:27,297 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:00:27,298 INFO ]: ChcToBoogie initialized [2018-06-22 11:00:27,301 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:00:27" (1/1) ... [2018-06-22 11:00:27,345 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:00:27 Unit [2018-06-22 11:00:27,345 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:00:27,346 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:00:27,346 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:00:27,346 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:00:27,370 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:00:27" (1/1) ... [2018-06-22 11:00:27,370 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:00:27" (1/1) ... [2018-06-22 11:00:27,377 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:00:27" (1/1) ... [2018-06-22 11:00:27,377 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:00:27" (1/1) ... [2018-06-22 11:00:27,381 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:00:27" (1/1) ... [2018-06-22 11:00:27,382 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:00:27" (1/1) ... [2018-06-22 11:00:27,383 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:00:27" (1/1) ... [2018-06-22 11:00:27,385 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:00:27,386 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:00:27,386 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:00:27,386 INFO ]: RCFGBuilder initialized [2018-06-22 11:00:27,387 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:00:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:00:27,405 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:00:27,405 INFO ]: Found specification of procedure False [2018-06-22 11:00:27,405 INFO ]: Found implementation of procedure False [2018-06-22 11:00:27,405 INFO ]: Specification and implementation of procedure inv_main12 given in one single declaration [2018-06-22 11:00:27,405 INFO ]: Found specification of procedure inv_main12 [2018-06-22 11:00:27,405 INFO ]: Found implementation of procedure inv_main12 [2018-06-22 11:00:27,405 INFO ]: Specification and implementation of procedure inv_main7 given in one single declaration [2018-06-22 11:00:27,405 INFO ]: Found specification of procedure inv_main7 [2018-06-22 11:00:27,405 INFO ]: Found implementation of procedure inv_main7 [2018-06-22 11:00:27,405 INFO ]: Specification and implementation of procedure inv_main15 given in one single declaration [2018-06-22 11:00:27,405 INFO ]: Found specification of procedure inv_main15 [2018-06-22 11:00:27,405 INFO ]: Found implementation of procedure inv_main15 [2018-06-22 11:00:27,405 INFO ]: Specification and implementation of procedure inv_main10 given in one single declaration [2018-06-22 11:00:27,405 INFO ]: Found specification of procedure inv_main10 [2018-06-22 11:00:27,405 INFO ]: Found implementation of procedure inv_main10 [2018-06-22 11:00:27,405 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:00:27,405 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:00:27,405 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:00:27,784 INFO ]: Using library mode [2018-06-22 11:00:27,784 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:00:27 BoogieIcfgContainer [2018-06-22 11:00:27,784 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:00:27,788 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:00:27,788 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:00:27,793 INFO ]: TraceAbstraction initialized [2018-06-22 11:00:27,793 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:00:27" (1/3) ... [2018-06-22 11:00:27,794 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee1c564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:00:27, skipping insertion in model container [2018-06-22 11:00:27,794 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:00:27" (2/3) ... [2018-06-22 11:00:27,794 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee1c564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:00:27, skipping insertion in model container [2018-06-22 11:00:27,794 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:00:27" (3/3) ... [2018-06-22 11:00:27,797 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:00:27,806 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:00:27,813 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:00:27,848 INFO ]: Using default assertion order modulation [2018-06-22 11:00:27,849 INFO ]: Interprodecural is true [2018-06-22 11:00:27,849 INFO ]: Hoare is false [2018-06-22 11:00:27,849 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:00:27,849 INFO ]: Backedges is TWOTRACK [2018-06-22 11:00:27,849 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:00:27,849 INFO ]: Difference is false [2018-06-22 11:00:27,849 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:00:27,850 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:00:27,864 INFO ]: Start isEmpty. Operand 29 states. [2018-06-22 11:00:27,875 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:00:27,875 INFO ]: Found error trace [2018-06-22 11:00:27,876 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:27,876 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:27,881 INFO ]: Analyzing trace with hash 294266976, now seen corresponding path program 1 times [2018-06-22 11:00:27,883 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:27,883 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:27,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:27,920 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:27,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:27,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:28,115 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:00:28,117 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:00:28,117 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:00:28,118 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:00:28,128 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:00:28,128 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:00:28,130 INFO ]: Start difference. First operand 29 states. Second operand 4 states. [2018-06-22 11:00:28,286 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:28,286 INFO ]: Finished difference Result 31 states and 43 transitions. [2018-06-22 11:00:28,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:00:28,288 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:00:28,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:28,297 INFO ]: With dead ends: 31 [2018-06-22 11:00:28,297 INFO ]: Without dead ends: 31 [2018-06-22 11:00:28,298 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:00:28,311 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:00:28,350 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:00:28,353 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:00:28,355 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-06-22 11:00:28,356 INFO ]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 13 [2018-06-22 11:00:28,356 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:28,356 INFO ]: Abstraction has 29 states and 39 transitions. [2018-06-22 11:00:28,356 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:00:28,356 INFO ]: Start isEmpty. Operand 29 states and 39 transitions. [2018-06-22 11:00:28,359 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:00:28,360 INFO ]: Found error trace [2018-06-22 11:00:28,360 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:28,360 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:28,360 INFO ]: Analyzing trace with hash -199984071, now seen corresponding path program 1 times [2018-06-22 11:00:28,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:28,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:28,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:28,361 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:28,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:28,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:28,562 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-06-22 11:00:28,832 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:00:28,832 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:00:28,832 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:00:28,834 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:00:28,834 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:00:28,834 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:00:28,834 INFO ]: Start difference. First operand 29 states and 39 transitions. Second operand 6 states. [2018-06-22 11:00:28,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:28,975 INFO ]: Finished difference Result 33 states and 43 transitions. [2018-06-22 11:00:28,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:00:28,975 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:00:28,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:28,976 INFO ]: With dead ends: 33 [2018-06-22 11:00:28,976 INFO ]: Without dead ends: 33 [2018-06-22 11:00:28,977 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:00:28,977 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:00:28,983 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 11:00:28,983 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:00:28,984 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2018-06-22 11:00:28,984 INFO ]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 13 [2018-06-22 11:00:28,985 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:28,985 INFO ]: Abstraction has 31 states and 41 transitions. [2018-06-22 11:00:28,985 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:00:28,985 INFO ]: Start isEmpty. Operand 31 states and 41 transitions. [2018-06-22 11:00:28,986 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:00:28,986 INFO ]: Found error trace [2018-06-22 11:00:28,986 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:28,986 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:28,986 INFO ]: Analyzing trace with hash -1190171134, now seen corresponding path program 1 times [2018-06-22 11:00:28,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:28,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:28,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:28,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:28,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:28,993 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:29,077 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:00:29,077 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:00:29,077 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:00:29,077 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:00:29,077 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:00:29,077 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:00:29,078 INFO ]: Start difference. First operand 31 states and 41 transitions. Second operand 5 states. [2018-06-22 11:00:29,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:29,103 INFO ]: Finished difference Result 35 states and 44 transitions. [2018-06-22 11:00:29,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:00:29,104 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:00:29,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:29,105 INFO ]: With dead ends: 35 [2018-06-22 11:00:29,105 INFO ]: Without dead ends: 33 [2018-06-22 11:00:29,105 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:00:29,105 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:00:29,110 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 11:00:29,110 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:00:29,112 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2018-06-22 11:00:29,112 INFO ]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 13 [2018-06-22 11:00:29,112 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:29,112 INFO ]: Abstraction has 31 states and 40 transitions. [2018-06-22 11:00:29,112 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:00:29,112 INFO ]: Start isEmpty. Operand 31 states and 40 transitions. [2018-06-22 11:00:29,113 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:00:29,113 INFO ]: Found error trace [2018-06-22 11:00:29,113 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:29,113 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:29,113 INFO ]: Analyzing trace with hash 1188532348, now seen corresponding path program 1 times [2018-06-22 11:00:29,113 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:29,113 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:29,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:29,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:29,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:29,128 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:29,511 INFO ]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:00:29,511 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:00:29,511 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:00:29,511 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:00:29,511 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:00:29,511 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:00:29,511 INFO ]: Start difference. First operand 31 states and 40 transitions. Second operand 7 states. [2018-06-22 11:00:29,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:29,817 INFO ]: Finished difference Result 33 states and 41 transitions. [2018-06-22 11:00:29,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:00:29,818 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:00:29,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:29,820 INFO ]: With dead ends: 33 [2018-06-22 11:00:29,820 INFO ]: Without dead ends: 32 [2018-06-22 11:00:29,820 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:00:29,820 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:00:29,824 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-06-22 11:00:29,824 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:00:29,825 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-06-22 11:00:29,825 INFO ]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 21 [2018-06-22 11:00:29,825 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:29,825 INFO ]: Abstraction has 28 states and 35 transitions. [2018-06-22 11:00:29,825 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:00:29,825 INFO ]: Start isEmpty. Operand 28 states and 35 transitions. [2018-06-22 11:00:29,826 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:00:29,826 INFO ]: Found error trace [2018-06-22 11:00:29,826 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:29,826 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:29,826 INFO ]: Analyzing trace with hash -335819707, now seen corresponding path program 1 times [2018-06-22 11:00:29,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:29,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:29,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:29,827 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:29,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:29,835 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:30,226 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:00:30,226 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:30,226 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:30,241 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:30,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:30,277 INFO ]: Computing forward predicates... [2018-06-22 11:00:30,492 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:00:30,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:30,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 11:00:30,521 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:00:30,521 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:00:30,521 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:00:30,522 INFO ]: Start difference. First operand 28 states and 35 transitions. Second operand 11 states. [2018-06-22 11:00:30,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:30,658 INFO ]: Finished difference Result 28 states and 34 transitions. [2018-06-22 11:00:30,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:00:30,659 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:00:30,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:30,660 INFO ]: With dead ends: 28 [2018-06-22 11:00:30,660 INFO ]: Without dead ends: 27 [2018-06-22 11:00:30,660 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:00:30,660 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:00:30,663 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 11:00:30,663 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:00:30,664 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-06-22 11:00:30,664 INFO ]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 21 [2018-06-22 11:00:30,664 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:30,664 INFO ]: Abstraction has 27 states and 32 transitions. [2018-06-22 11:00:30,664 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:00:30,664 INFO ]: Start isEmpty. Operand 27 states and 32 transitions. [2018-06-22 11:00:30,665 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:00:30,665 INFO ]: Found error trace [2018-06-22 11:00:30,665 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:30,665 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:30,665 INFO ]: Analyzing trace with hash -403901533, now seen corresponding path program 1 times [2018-06-22 11:00:30,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:30,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:30,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:30,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:30,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:30,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:31,108 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:00:31,108 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:31,108 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:31,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:31,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:31,135 INFO ]: Computing forward predicates... [2018-06-22 11:00:31,326 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:00:31,353 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:31,353 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-06-22 11:00:31,353 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:00:31,353 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:00:31,353 INFO ]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:00:31,354 INFO ]: Start difference. First operand 27 states and 32 transitions. Second operand 15 states. [2018-06-22 11:00:31,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:31,693 INFO ]: Finished difference Result 37 states and 46 transitions. [2018-06-22 11:00:31,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:00:31,693 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 11:00:31,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:31,694 INFO ]: With dead ends: 37 [2018-06-22 11:00:31,694 INFO ]: Without dead ends: 37 [2018-06-22 11:00:31,695 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:00:31,695 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:00:31,700 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-06-22 11:00:31,700 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:00:31,701 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-06-22 11:00:31,701 INFO ]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 21 [2018-06-22 11:00:31,701 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:31,701 INFO ]: Abstraction has 33 states and 40 transitions. [2018-06-22 11:00:31,701 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:00:31,701 INFO ]: Start isEmpty. Operand 33 states and 40 transitions. [2018-06-22 11:00:31,702 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:00:31,702 INFO ]: Found error trace [2018-06-22 11:00:31,702 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:31,702 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:31,702 INFO ]: Analyzing trace with hash 1483567661, now seen corresponding path program 1 times [2018-06-22 11:00:31,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:31,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:31,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:31,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:31,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:31,722 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:31,872 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:00:31,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:31,872 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:31,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:31,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:31,985 INFO ]: Computing forward predicates... [2018-06-22 11:00:32,237 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:00:32,257 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:32,257 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-06-22 11:00:32,257 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:00:32,257 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:00:32,257 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:00:32,257 INFO ]: Start difference. First operand 33 states and 40 transitions. Second operand 17 states. [2018-06-22 11:00:32,601 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:32,601 INFO ]: Finished difference Result 37 states and 43 transitions. [2018-06-22 11:00:32,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:00:32,602 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-22 11:00:32,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:32,603 INFO ]: With dead ends: 37 [2018-06-22 11:00:32,603 INFO ]: Without dead ends: 35 [2018-06-22 11:00:32,603 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:00:32,603 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:00:32,608 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:00:32,608 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:00:32,609 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-06-22 11:00:32,609 INFO ]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 25 [2018-06-22 11:00:32,609 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:32,609 INFO ]: Abstraction has 33 states and 39 transitions. [2018-06-22 11:00:32,609 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:00:32,609 INFO ]: Start isEmpty. Operand 33 states and 39 transitions. [2018-06-22 11:00:32,610 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:00:32,610 INFO ]: Found error trace [2018-06-22 11:00:32,610 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:32,610 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:32,610 INFO ]: Analyzing trace with hash -1801680827, now seen corresponding path program 1 times [2018-06-22 11:00:32,610 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:32,610 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:32,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:32,611 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:32,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:32,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:32,697 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:32,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:32,697 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:32,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:32,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:32,723 INFO ]: Computing forward predicates... [2018-06-22 11:00:32,911 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:00:32,931 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:32,931 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-06-22 11:00:32,932 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:00:32,932 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:00:32,932 INFO ]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:00:32,932 INFO ]: Start difference. First operand 33 states and 39 transitions. Second operand 15 states. [2018-06-22 11:00:33,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:33,109 INFO ]: Finished difference Result 35 states and 42 transitions. [2018-06-22 11:00:33,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:00:33,110 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:00:33,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:33,111 INFO ]: With dead ends: 35 [2018-06-22 11:00:33,111 INFO ]: Without dead ends: 33 [2018-06-22 11:00:33,111 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:00:33,111 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:00:33,115 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-06-22 11:00:33,115 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:00:33,116 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-06-22 11:00:33,116 INFO ]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 25 [2018-06-22 11:00:33,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:33,116 INFO ]: Abstraction has 31 states and 36 transitions. [2018-06-22 11:00:33,116 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:00:33,116 INFO ]: Start isEmpty. Operand 31 states and 36 transitions. [2018-06-22 11:00:33,117 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:00:33,117 INFO ]: Found error trace [2018-06-22 11:00:33,117 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:33,117 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:33,117 INFO ]: Analyzing trace with hash 321599846, now seen corresponding path program 2 times [2018-06-22 11:00:33,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:33,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:33,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:33,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:33,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:33,136 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:33,228 INFO ]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:00:33,228 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:00:33,228 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:00:33,229 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:00:33,229 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:00:33,229 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:00:33,229 INFO ]: Start difference. First operand 31 states and 36 transitions. Second operand 7 states. [2018-06-22 11:00:33,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:33,336 INFO ]: Finished difference Result 31 states and 35 transitions. [2018-06-22 11:00:33,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:00:33,337 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 11:00:33,337 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:33,338 INFO ]: With dead ends: 31 [2018-06-22 11:00:33,338 INFO ]: Without dead ends: 30 [2018-06-22 11:00:33,338 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:00:33,338 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:00:33,342 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:00:33,342 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:00:33,342 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-06-22 11:00:33,342 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 29 [2018-06-22 11:00:33,342 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:33,342 INFO ]: Abstraction has 30 states and 33 transitions. [2018-06-22 11:00:33,342 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:00:33,342 INFO ]: Start isEmpty. Operand 30 states and 33 transitions. [2018-06-22 11:00:33,343 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:00:33,343 INFO ]: Found error trace [2018-06-22 11:00:33,343 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:33,344 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:33,344 INFO ]: Analyzing trace with hash 1016887344, now seen corresponding path program 2 times [2018-06-22 11:00:33,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:33,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:33,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:33,344 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:33,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:33,354 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:33,472 INFO ]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:00:33,473 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:33,473 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:33,479 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:00:33,497 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:00:33,497 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:33,499 INFO ]: Computing forward predicates... [2018-06-22 11:00:33,833 INFO ]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:00:33,852 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:33,852 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-22 11:00:33,853 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:00:33,853 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:00:33,853 INFO ]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:00:33,853 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 19 states. [2018-06-22 11:00:34,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:34,059 INFO ]: Finished difference Result 32 states and 35 transitions. [2018-06-22 11:00:34,060 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:00:34,060 INFO ]: Start accepts. Automaton has 19 states. Word has length 33 [2018-06-22 11:00:34,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:34,061 INFO ]: With dead ends: 32 [2018-06-22 11:00:34,061 INFO ]: Without dead ends: 32 [2018-06-22 11:00:34,061 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:00:34,062 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:00:34,067 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 11:00:34,067 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:00:34,067 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 11:00:34,067 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 33 [2018-06-22 11:00:34,067 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:34,067 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 11:00:34,068 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:00:34,068 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 11:00:34,068 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:00:34,068 INFO ]: Found error trace [2018-06-22 11:00:34,069 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:34,069 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:34,069 INFO ]: Analyzing trace with hash 1097686546, now seen corresponding path program 1 times [2018-06-22 11:00:34,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:34,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:34,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:34,069 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:34,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:34,081 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:34,264 INFO ]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:00:34,264 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:34,264 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:34,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:34,300 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:34,304 INFO ]: Computing forward predicates... [2018-06-22 11:00:34,477 INFO ]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:00:34,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:34,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-06-22 11:00:34,498 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:00:34,498 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:00:34,498 INFO ]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:00:34,498 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 21 states. [2018-06-22 11:00:34,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:34,725 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-22 11:00:34,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:00:34,725 INFO ]: Start accepts. Automaton has 21 states. Word has length 37 [2018-06-22 11:00:34,725 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:34,726 INFO ]: With dead ends: 42 [2018-06-22 11:00:34,726 INFO ]: Without dead ends: 40 [2018-06-22 11:00:34,727 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:00:34,727 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:00:34,731 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-22 11:00:34,731 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:00:34,731 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-22 11:00:34,731 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 37 [2018-06-22 11:00:34,732 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:34,732 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-22 11:00:34,732 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:00:34,732 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-22 11:00:34,733 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:00:34,733 INFO ]: Found error trace [2018-06-22 11:00:34,733 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:34,733 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:34,733 INFO ]: Analyzing trace with hash -1716687500, now seen corresponding path program 2 times [2018-06-22 11:00:34,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:34,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:34,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:34,734 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:34,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:34,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:35,159 INFO ]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:00:35,159 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:35,159 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:35,166 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:00:35,205 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:00:35,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:35,208 INFO ]: Computing forward predicates... [2018-06-22 11:00:35,341 INFO ]: Checked inductivity of 24 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:00:35,359 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:35,359 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2018-06-22 11:00:35,360 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:00:35,360 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:00:35,360 INFO ]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:00:35,360 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 22 states. [2018-06-22 11:00:35,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:35,525 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-22 11:00:35,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:00:35,526 INFO ]: Start accepts. Automaton has 22 states. Word has length 41 [2018-06-22 11:00:35,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:35,526 INFO ]: With dead ends: 40 [2018-06-22 11:00:35,526 INFO ]: Without dead ends: 36 [2018-06-22 11:00:35,527 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:00:35,527 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:00:35,530 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:00:35,530 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:00:35,531 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 11:00:35,531 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 41 [2018-06-22 11:00:35,531 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:35,531 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 11:00:35,531 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:00:35,531 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 11:00:35,532 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:00:35,532 INFO ]: Found error trace [2018-06-22 11:00:35,533 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:35,533 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:35,533 INFO ]: Analyzing trace with hash 1697127893, now seen corresponding path program 3 times [2018-06-22 11:00:35,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:35,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:35,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:35,533 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:35,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:35,551 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:35,771 INFO ]: Checked inductivity of 36 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:00:35,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:35,771 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:35,777 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:00:35,796 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:00:35,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:35,800 INFO ]: Computing forward predicates... [2018-06-22 11:00:36,281 INFO ]: Checked inductivity of 36 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:00:36,301 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:36,301 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2018-06-22 11:00:36,301 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:00:36,302 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:00:36,302 INFO ]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:00:36,302 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 25 states. [2018-06-22 11:00:36,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:36,566 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-22 11:00:36,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:00:36,566 INFO ]: Start accepts. Automaton has 25 states. Word has length 45 [2018-06-22 11:00:36,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:36,567 INFO ]: With dead ends: 38 [2018-06-22 11:00:36,567 INFO ]: Without dead ends: 38 [2018-06-22 11:00:36,568 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:00:36,568 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:00:36,571 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 11:00:36,571 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:00:36,572 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-22 11:00:36,572 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 45 [2018-06-22 11:00:36,572 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:36,572 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-22 11:00:36,572 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:00:36,572 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-22 11:00:36,574 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:00:36,574 INFO ]: Found error trace [2018-06-22 11:00:36,574 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:36,574 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:36,574 INFO ]: Analyzing trace with hash -1845330825, now seen corresponding path program 4 times [2018-06-22 11:00:36,574 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:36,574 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:36,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:36,575 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:36,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:36,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:36,790 INFO ]: Checked inductivity of 43 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:00:36,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:36,790 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:36,795 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:00:36,815 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:00:36,815 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:36,819 INFO ]: Computing forward predicates... [2018-06-22 11:00:37,102 INFO ]: Checked inductivity of 43 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:00:37,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:37,121 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2018-06-22 11:00:37,121 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:00:37,121 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:00:37,121 INFO ]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:00:37,121 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 27 states. [2018-06-22 11:00:37,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:37,347 INFO ]: Finished difference Result 50 states and 54 transitions. [2018-06-22 11:00:37,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:00:37,347 INFO ]: Start accepts. Automaton has 27 states. Word has length 49 [2018-06-22 11:00:37,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:37,348 INFO ]: With dead ends: 50 [2018-06-22 11:00:37,348 INFO ]: Without dead ends: 48 [2018-06-22 11:00:37,348 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:00:37,348 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:00:37,352 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-06-22 11:00:37,352 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:00:37,353 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-06-22 11:00:37,353 INFO ]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 49 [2018-06-22 11:00:37,353 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:37,353 INFO ]: Abstraction has 44 states and 48 transitions. [2018-06-22 11:00:37,353 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:00:37,353 INFO ]: Start isEmpty. Operand 44 states and 48 transitions. [2018-06-22 11:00:37,354 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:00:37,354 INFO ]: Found error trace [2018-06-22 11:00:37,354 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:37,355 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:37,356 INFO ]: Analyzing trace with hash -218508135, now seen corresponding path program 5 times [2018-06-22 11:00:37,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:37,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:37,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:37,356 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:37,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:37,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:37,631 INFO ]: Checked inductivity of 54 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:00:37,631 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:37,631 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:37,638 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:00:37,668 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 11:00:37,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:37,672 INFO ]: Computing forward predicates... [2018-06-22 11:00:37,972 INFO ]: Checked inductivity of 54 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:00:37,991 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:37,991 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-06-22 11:00:37,991 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:00:37,991 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:00:37,992 INFO ]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:00:37,992 INFO ]: Start difference. First operand 44 states and 48 transitions. Second operand 28 states. [2018-06-22 11:00:38,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:38,265 INFO ]: Finished difference Result 48 states and 51 transitions. [2018-06-22 11:00:38,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:00:38,265 INFO ]: Start accepts. Automaton has 28 states. Word has length 53 [2018-06-22 11:00:38,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:38,266 INFO ]: With dead ends: 48 [2018-06-22 11:00:38,266 INFO ]: Without dead ends: 42 [2018-06-22 11:00:38,266 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:00:38,267 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:00:38,270 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:00:38,270 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:00:38,270 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-22 11:00:38,270 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 53 [2018-06-22 11:00:38,271 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:38,271 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-22 11:00:38,271 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:00:38,271 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-22 11:00:38,271 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:00:38,271 INFO ]: Found error trace [2018-06-22 11:00:38,271 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:38,271 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:38,272 INFO ]: Analyzing trace with hash -1597659654, now seen corresponding path program 6 times [2018-06-22 11:00:38,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:38,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:38,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:38,272 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:38,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:38,282 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:38,470 INFO ]: Checked inductivity of 70 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:00:38,471 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:38,471 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:00:38,487 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:38,527 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:00:38,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:38,530 INFO ]: Computing forward predicates... [2018-06-22 11:00:38,866 INFO ]: Checked inductivity of 70 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 11:00:38,886 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:38,886 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 31 [2018-06-22 11:00:38,886 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:00:38,886 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:00:38,886 INFO ]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:00:38,887 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 31 states. [2018-06-22 11:00:39,185 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:39,185 INFO ]: Finished difference Result 44 states and 47 transitions. [2018-06-22 11:00:39,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:00:39,186 INFO ]: Start accepts. Automaton has 31 states. Word has length 57 [2018-06-22 11:00:39,187 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:39,187 INFO ]: With dead ends: 44 [2018-06-22 11:00:39,187 INFO ]: Without dead ends: 44 [2018-06-22 11:00:39,188 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=1503, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:00:39,188 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:00:39,192 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 11:00:39,192 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:00:39,193 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-22 11:00:39,193 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 57 [2018-06-22 11:00:39,193 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:39,193 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-22 11:00:39,193 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:00:39,193 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-22 11:00:39,194 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:00:39,194 INFO ]: Found error trace [2018-06-22 11:00:39,194 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:39,194 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:39,194 INFO ]: Analyzing trace with hash -1162486436, now seen corresponding path program 7 times [2018-06-22 11:00:39,194 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:39,194 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:39,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:39,195 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:39,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:39,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:40,218 INFO ]: Checked inductivity of 81 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:00:40,218 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:40,218 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:40,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:40,270 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:40,276 INFO ]: Computing forward predicates... [2018-06-22 11:00:40,629 INFO ]: Checked inductivity of 81 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:00:40,647 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:40,647 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2018-06-22 11:00:40,648 INFO ]: Interpolant automaton has 33 states [2018-06-22 11:00:40,648 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 11:00:40,648 INFO ]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:00:40,648 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 33 states. [2018-06-22 11:00:40,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:40,985 INFO ]: Finished difference Result 58 states and 62 transitions. [2018-06-22 11:00:40,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:00:40,986 INFO ]: Start accepts. Automaton has 33 states. Word has length 61 [2018-06-22 11:00:40,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:40,987 INFO ]: With dead ends: 58 [2018-06-22 11:00:40,987 INFO ]: Without dead ends: 56 [2018-06-22 11:00:40,988 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:00:40,988 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:00:40,993 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-06-22 11:00:40,993 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:00:40,993 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-06-22 11:00:40,993 INFO ]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 61 [2018-06-22 11:00:40,994 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:40,994 INFO ]: Abstraction has 50 states and 54 transitions. [2018-06-22 11:00:40,994 INFO ]: Interpolant automaton has 33 states. [2018-06-22 11:00:40,994 INFO ]: Start isEmpty. Operand 50 states and 54 transitions. [2018-06-22 11:00:40,994 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:00:40,994 INFO ]: Found error trace [2018-06-22 11:00:40,994 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:40,995 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:40,996 INFO ]: Analyzing trace with hash 1649991230, now seen corresponding path program 8 times [2018-06-22 11:00:40,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:40,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:40,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:40,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:40,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:41,009 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:41,455 INFO ]: Checked inductivity of 96 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:00:41,455 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:41,455 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:41,463 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:00:41,490 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:00:41,490 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:41,493 INFO ]: Computing forward predicates... [2018-06-22 11:00:41,890 INFO ]: Checked inductivity of 96 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 11:00:41,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:41,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2018-06-22 11:00:41,932 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:00:41,932 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:00:41,932 INFO ]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:00:41,932 INFO ]: Start difference. First operand 50 states and 54 transitions. Second operand 34 states. [2018-06-22 11:00:42,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:42,288 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-22 11:00:42,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:00:42,288 INFO ]: Start accepts. Automaton has 34 states. Word has length 65 [2018-06-22 11:00:42,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:42,289 INFO ]: With dead ends: 56 [2018-06-22 11:00:42,289 INFO ]: Without dead ends: 48 [2018-06-22 11:00:42,289 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=1634, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:00:42,290 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:00:42,293 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 11:00:42,293 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:00:42,293 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-06-22 11:00:42,293 INFO ]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 65 [2018-06-22 11:00:42,294 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:42,294 INFO ]: Abstraction has 48 states and 51 transitions. [2018-06-22 11:00:42,294 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:00:42,294 INFO ]: Start isEmpty. Operand 48 states and 51 transitions. [2018-06-22 11:00:42,295 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:00:42,295 INFO ]: Found error trace [2018-06-22 11:00:42,296 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:42,296 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:42,296 INFO ]: Analyzing trace with hash -1820712801, now seen corresponding path program 9 times [2018-06-22 11:00:42,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:42,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:42,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:42,296 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:42,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:42,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:42,908 INFO ]: Checked inductivity of 116 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-06-22 11:00:42,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:42,908 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:42,913 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:00:42,943 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:00:42,943 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:42,947 INFO ]: Computing forward predicates... [2018-06-22 11:00:43,313 INFO ]: Checked inductivity of 116 backedges. 36 proven. 34 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 11:00:43,331 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:43,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 37 [2018-06-22 11:00:43,332 INFO ]: Interpolant automaton has 37 states [2018-06-22 11:00:43,332 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 11:00:43,332 INFO ]: CoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:00:43,333 INFO ]: Start difference. First operand 48 states and 51 transitions. Second operand 37 states. [2018-06-22 11:00:43,679 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:43,679 INFO ]: Finished difference Result 50 states and 53 transitions. [2018-06-22 11:00:43,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:00:43,683 INFO ]: Start accepts. Automaton has 37 states. Word has length 69 [2018-06-22 11:00:43,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:43,684 INFO ]: With dead ends: 50 [2018-06-22 11:00:43,684 INFO ]: Without dead ends: 50 [2018-06-22 11:00:43,684 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=315, Invalid=2235, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:00:43,684 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:00:43,688 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-22 11:00:43,688 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:00:43,688 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-06-22 11:00:43,688 INFO ]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 69 [2018-06-22 11:00:43,689 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:43,689 INFO ]: Abstraction has 50 states and 53 transitions. [2018-06-22 11:00:43,689 INFO ]: Interpolant automaton has 37 states. [2018-06-22 11:00:43,689 INFO ]: Start isEmpty. Operand 50 states and 53 transitions. [2018-06-22 11:00:43,689 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:00:43,689 INFO ]: Found error trace [2018-06-22 11:00:43,690 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:43,690 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:43,690 INFO ]: Analyzing trace with hash 1376293057, now seen corresponding path program 10 times [2018-06-22 11:00:43,690 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:43,690 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:43,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:43,690 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:43,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:43,710 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:43,998 INFO ]: Checked inductivity of 131 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 11:00:43,999 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:43,999 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:44,005 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:00:44,033 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:00:44,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:44,037 INFO ]: Computing forward predicates... [2018-06-22 11:00:44,446 INFO ]: Checked inductivity of 131 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 11:00:44,465 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:44,465 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2018-06-22 11:00:44,466 INFO ]: Interpolant automaton has 39 states [2018-06-22 11:00:44,466 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 11:00:44,466 INFO ]: CoverageRelationStatistics Valid=92, Invalid=1390, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:00:44,466 INFO ]: Start difference. First operand 50 states and 53 transitions. Second operand 39 states. [2018-06-22 11:00:44,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:44,930 INFO ]: Finished difference Result 66 states and 70 transitions. [2018-06-22 11:00:44,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:00:44,930 INFO ]: Start accepts. Automaton has 39 states. Word has length 73 [2018-06-22 11:00:44,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:44,931 INFO ]: With dead ends: 66 [2018-06-22 11:00:44,931 INFO ]: Without dead ends: 64 [2018-06-22 11:00:44,931 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 47 SyntacticMatches, 18 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=2210, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:00:44,932 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:00:44,936 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-06-22 11:00:44,936 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:00:44,936 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-06-22 11:00:44,936 INFO ]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 73 [2018-06-22 11:00:44,937 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:44,937 INFO ]: Abstraction has 56 states and 60 transitions. [2018-06-22 11:00:44,937 INFO ]: Interpolant automaton has 39 states. [2018-06-22 11:00:44,937 INFO ]: Start isEmpty. Operand 56 states and 60 transitions. [2018-06-22 11:00:44,938 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:00:44,938 INFO ]: Found error trace [2018-06-22 11:00:44,938 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:44,938 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:44,938 INFO ]: Analyzing trace with hash 29858403, now seen corresponding path program 11 times [2018-06-22 11:00:44,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:44,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:44,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:44,939 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:44,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:44,951 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:45,210 INFO ]: Checked inductivity of 150 backedges. 30 proven. 58 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-22 11:00:45,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:45,211 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:45,217 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:00:45,254 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:00:45,254 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:45,257 INFO ]: Computing forward predicates... [2018-06-22 11:00:45,909 INFO ]: Checked inductivity of 150 backedges. 30 proven. 54 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:00:45,929 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:45,929 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2018-06-22 11:00:45,929 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:00:45,929 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:00:45,930 INFO ]: CoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:00:45,930 INFO ]: Start difference. First operand 56 states and 60 transitions. Second operand 40 states. [2018-06-22 11:00:46,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:46,484 INFO ]: Finished difference Result 64 states and 67 transitions. [2018-06-22 11:00:46,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:00:46,485 INFO ]: Start accepts. Automaton has 40 states. Word has length 77 [2018-06-22 11:00:46,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:46,485 INFO ]: With dead ends: 64 [2018-06-22 11:00:46,485 INFO ]: Without dead ends: 54 [2018-06-22 11:00:46,486 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=352, Invalid=2300, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 11:00:46,486 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:00:46,488 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-22 11:00:46,488 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:00:46,488 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-06-22 11:00:46,488 INFO ]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 77 [2018-06-22 11:00:46,490 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:46,490 INFO ]: Abstraction has 54 states and 57 transitions. [2018-06-22 11:00:46,490 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:00:46,490 INFO ]: Start isEmpty. Operand 54 states and 57 transitions. [2018-06-22 11:00:46,495 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:00:46,495 INFO ]: Found error trace [2018-06-22 11:00:46,495 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:46,495 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:46,495 INFO ]: Analyzing trace with hash 172137924, now seen corresponding path program 12 times [2018-06-22 11:00:46,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:46,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:46,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:46,496 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:46,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:46,507 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:47,054 INFO ]: Checked inductivity of 174 backedges. 55 proven. 50 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-22 11:00:47,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:47,079 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:47,085 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:00:47,123 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:00:47,123 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:47,127 INFO ]: Computing forward predicates... [2018-06-22 11:00:48,509 INFO ]: Checked inductivity of 174 backedges. 55 proven. 47 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 11:00:48,529 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:48,529 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 43 [2018-06-22 11:00:48,529 INFO ]: Interpolant automaton has 43 states [2018-06-22 11:00:48,529 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 11:00:48,529 INFO ]: CoverageRelationStatistics Valid=207, Invalid=1599, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:00:48,529 INFO ]: Start difference. First operand 54 states and 57 transitions. Second operand 43 states. [2018-06-22 11:00:48,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:48,873 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-22 11:00:48,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:00:48,875 INFO ]: Start accepts. Automaton has 43 states. Word has length 81 [2018-06-22 11:00:48,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:48,876 INFO ]: With dead ends: 56 [2018-06-22 11:00:48,876 INFO ]: Without dead ends: 56 [2018-06-22 11:00:48,877 INFO ]: 0 DeclaredPredicates, 129 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=429, Invalid=3111, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 11:00:48,877 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:00:48,882 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 11:00:48,882 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:00:48,883 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-06-22 11:00:48,883 INFO ]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 81 [2018-06-22 11:00:48,883 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:48,883 INFO ]: Abstraction has 56 states and 59 transitions. [2018-06-22 11:00:48,883 INFO ]: Interpolant automaton has 43 states. [2018-06-22 11:00:48,883 INFO ]: Start isEmpty. Operand 56 states and 59 transitions. [2018-06-22 11:00:48,884 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:00:48,884 INFO ]: Found error trace [2018-06-22 11:00:48,884 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:48,884 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:48,884 INFO ]: Analyzing trace with hash 2037622438, now seen corresponding path program 13 times [2018-06-22 11:00:48,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:48,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:48,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:48,886 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:48,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:48,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:49,460 INFO ]: Checked inductivity of 193 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:00:49,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:49,460 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:49,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:49,500 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:49,504 INFO ]: Computing forward predicates... [2018-06-22 11:00:50,526 INFO ]: Checked inductivity of 193 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:00:50,545 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:50,545 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2018-06-22 11:00:50,546 INFO ]: Interpolant automaton has 45 states [2018-06-22 11:00:50,546 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-22 11:00:50,546 INFO ]: CoverageRelationStatistics Valid=107, Invalid=1873, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:00:50,546 INFO ]: Start difference. First operand 56 states and 59 transitions. Second operand 45 states. [2018-06-22 11:00:51,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:51,135 INFO ]: Finished difference Result 74 states and 78 transitions. [2018-06-22 11:00:51,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:00:51,137 INFO ]: Start accepts. Automaton has 45 states. Word has length 85 [2018-06-22 11:00:51,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:51,138 INFO ]: With dead ends: 74 [2018-06-22 11:00:51,138 INFO ]: Without dead ends: 72 [2018-06-22 11:00:51,139 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 54 SyntacticMatches, 22 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=167, Invalid=3025, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:00:51,139 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:00:51,145 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-06-22 11:00:51,145 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:00:51,146 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-06-22 11:00:51,146 INFO ]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 85 [2018-06-22 11:00:51,146 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:51,146 INFO ]: Abstraction has 62 states and 66 transitions. [2018-06-22 11:00:51,146 INFO ]: Interpolant automaton has 45 states. [2018-06-22 11:00:51,146 INFO ]: Start isEmpty. Operand 62 states and 66 transitions. [2018-06-22 11:00:51,147 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:00:51,147 INFO ]: Found error trace [2018-06-22 11:00:51,147 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:51,147 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:51,147 INFO ]: Analyzing trace with hash 1480268040, now seen corresponding path program 14 times [2018-06-22 11:00:51,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:51,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:51,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:51,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:51,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:51,163 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:51,448 INFO ]: Checked inductivity of 216 backedges. 42 proven. 82 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-22 11:00:51,448 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:51,448 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:51,453 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:00:51,487 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:00:51,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:51,491 INFO ]: Computing forward predicates... [2018-06-22 11:00:51,965 INFO ]: Checked inductivity of 216 backedges. 42 proven. 77 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-22 11:00:51,985 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:51,985 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 46 [2018-06-22 11:00:51,985 INFO ]: Interpolant automaton has 46 states [2018-06-22 11:00:51,985 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 11:00:51,986 INFO ]: CoverageRelationStatistics Valid=264, Invalid=1806, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:00:51,986 INFO ]: Start difference. First operand 62 states and 66 transitions. Second operand 46 states. [2018-06-22 11:00:52,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:52,331 INFO ]: Finished difference Result 72 states and 75 transitions. [2018-06-22 11:00:52,331 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:00:52,331 INFO ]: Start accepts. Automaton has 46 states. Word has length 89 [2018-06-22 11:00:52,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:52,332 INFO ]: With dead ends: 72 [2018-06-22 11:00:52,332 INFO ]: Without dead ends: 60 [2018-06-22 11:00:52,333 INFO ]: 0 DeclaredPredicates, 137 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=461, Invalid=3079, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 11:00:52,333 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:00:52,339 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-22 11:00:52,339 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:00:52,340 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-06-22 11:00:52,340 INFO ]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 89 [2018-06-22 11:00:52,340 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:52,340 INFO ]: Abstraction has 60 states and 63 transitions. [2018-06-22 11:00:52,340 INFO ]: Interpolant automaton has 46 states. [2018-06-22 11:00:52,340 INFO ]: Start isEmpty. Operand 60 states and 63 transitions. [2018-06-22 11:00:52,341 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:00:52,341 INFO ]: Found error trace [2018-06-22 11:00:52,341 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:52,341 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:52,341 INFO ]: Analyzing trace with hash 538193257, now seen corresponding path program 15 times [2018-06-22 11:00:52,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:52,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:52,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:52,342 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:52,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:52,357 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:52,664 INFO ]: Checked inductivity of 244 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-22 11:00:52,664 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:52,664 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:52,670 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:00:52,718 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 11:00:52,718 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:52,721 INFO ]: Computing forward predicates... [2018-06-22 11:00:53,255 INFO ]: Checked inductivity of 244 backedges. 78 proven. 62 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-06-22 11:00:53,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:53,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 49 [2018-06-22 11:00:53,274 INFO ]: Interpolant automaton has 49 states [2018-06-22 11:00:53,274 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 11:00:53,275 INFO ]: CoverageRelationStatistics Valid=270, Invalid=2082, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:00:53,275 INFO ]: Start difference. First operand 60 states and 63 transitions. Second operand 49 states. [2018-06-22 11:00:53,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:53,782 INFO ]: Finished difference Result 62 states and 65 transitions. [2018-06-22 11:00:53,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:00:53,782 INFO ]: Start accepts. Automaton has 49 states. Word has length 93 [2018-06-22 11:00:53,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:53,783 INFO ]: With dead ends: 62 [2018-06-22 11:00:53,783 INFO ]: Without dead ends: 62 [2018-06-22 11:00:53,784 INFO ]: 0 DeclaredPredicates, 149 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=4131, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 11:00:53,784 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:00:53,787 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-06-22 11:00:53,787 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:00:53,788 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-06-22 11:00:53,788 INFO ]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 93 [2018-06-22 11:00:53,788 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:53,788 INFO ]: Abstraction has 62 states and 65 transitions. [2018-06-22 11:00:53,788 INFO ]: Interpolant automaton has 49 states. [2018-06-22 11:00:53,788 INFO ]: Start isEmpty. Operand 62 states and 65 transitions. [2018-06-22 11:00:53,789 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 11:00:53,789 INFO ]: Found error trace [2018-06-22 11:00:53,789 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:53,789 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:53,789 INFO ]: Analyzing trace with hash -1033359605, now seen corresponding path program 16 times [2018-06-22 11:00:53,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:53,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:53,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:53,790 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:53,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:53,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:54,267 INFO ]: Checked inductivity of 267 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-06-22 11:00:54,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:54,267 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:54,276 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:00:54,313 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:00:54,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:54,318 INFO ]: Computing forward predicates... [2018-06-22 11:00:55,078 INFO ]: Checked inductivity of 267 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-06-22 11:00:55,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:55,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 51 [2018-06-22 11:00:55,098 INFO ]: Interpolant automaton has 51 states [2018-06-22 11:00:55,098 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 11:00:55,099 INFO ]: CoverageRelationStatistics Valid=122, Invalid=2428, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:00:55,099 INFO ]: Start difference. First operand 62 states and 65 transitions. Second operand 51 states. [2018-06-22 11:00:55,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:55,913 INFO ]: Finished difference Result 82 states and 86 transitions. [2018-06-22 11:00:55,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:00:55,913 INFO ]: Start accepts. Automaton has 51 states. Word has length 97 [2018-06-22 11:00:55,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:55,913 INFO ]: With dead ends: 82 [2018-06-22 11:00:55,913 INFO ]: Without dead ends: 80 [2018-06-22 11:00:55,914 INFO ]: 0 DeclaredPredicates, 150 GetRequests, 61 SyntacticMatches, 26 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=3968, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 11:00:55,914 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 11:00:55,918 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 68. [2018-06-22 11:00:55,918 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:00:55,919 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-06-22 11:00:55,919 INFO ]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 97 [2018-06-22 11:00:55,919 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:55,919 INFO ]: Abstraction has 68 states and 72 transitions. [2018-06-22 11:00:55,919 INFO ]: Interpolant automaton has 51 states. [2018-06-22 11:00:55,919 INFO ]: Start isEmpty. Operand 68 states and 72 transitions. [2018-06-22 11:00:55,920 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 11:00:55,920 INFO ]: Found error trace [2018-06-22 11:00:55,920 INFO ]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:55,920 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:55,920 INFO ]: Analyzing trace with hash -23041491, now seen corresponding path program 17 times [2018-06-22 11:00:55,920 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:55,920 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:55,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:55,921 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:55,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:55,934 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:56,421 INFO ]: Checked inductivity of 294 backedges. 56 proven. 110 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-06-22 11:00:56,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:56,421 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:56,427 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:00:56,566 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:00:56,566 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:56,572 INFO ]: Computing forward predicates... [2018-06-22 11:00:57,223 INFO ]: Checked inductivity of 294 backedges. 56 proven. 104 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-06-22 11:00:57,242 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:57,242 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 52 [2018-06-22 11:00:57,242 INFO ]: Interpolant automaton has 52 states [2018-06-22 11:00:57,243 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 11:00:57,243 INFO ]: CoverageRelationStatistics Valid=336, Invalid=2316, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 11:00:57,243 INFO ]: Start difference. First operand 68 states and 72 transitions. Second operand 52 states. [2018-06-22 11:00:58,064 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:58,064 INFO ]: Finished difference Result 80 states and 83 transitions. [2018-06-22 11:00:58,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:00:58,065 INFO ]: Start accepts. Automaton has 52 states. Word has length 101 [2018-06-22 11:00:58,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:58,065 INFO ]: With dead ends: 80 [2018-06-22 11:00:58,065 INFO ]: Without dead ends: 66 [2018-06-22 11:00:58,066 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1467 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=585, Invalid=3971, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 11:00:58,066 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:00:58,070 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 11:00:58,070 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:00:58,070 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-06-22 11:00:58,070 INFO ]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 101 [2018-06-22 11:00:58,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:58,071 INFO ]: Abstraction has 66 states and 69 transitions. [2018-06-22 11:00:58,071 INFO ]: Interpolant automaton has 52 states. [2018-06-22 11:00:58,071 INFO ]: Start isEmpty. Operand 66 states and 69 transitions. [2018-06-22 11:00:58,071 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:00:58,071 INFO ]: Found error trace [2018-06-22 11:00:58,071 INFO ]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:58,071 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:58,071 INFO ]: Analyzing trace with hash -488906866, now seen corresponding path program 18 times [2018-06-22 11:00:58,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:58,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:58,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:58,072 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:58,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:58,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:58,454 INFO ]: Checked inductivity of 326 backedges. 105 proven. 84 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-06-22 11:00:58,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:58,454 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:58,462 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:00:58,524 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 11:00:58,524 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:58,528 INFO ]: Computing forward predicates... [2018-06-22 11:00:59,121 INFO ]: Checked inductivity of 326 backedges. 105 proven. 79 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-22 11:00:59,140 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:59,140 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 55 [2018-06-22 11:00:59,140 INFO ]: Interpolant automaton has 55 states [2018-06-22 11:00:59,140 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-22 11:00:59,140 INFO ]: CoverageRelationStatistics Valid=342, Invalid=2628, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:00:59,140 INFO ]: Start difference. First operand 66 states and 69 transitions. Second operand 55 states. [2018-06-22 11:00:59,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:59,652 INFO ]: Finished difference Result 68 states and 71 transitions. [2018-06-22 11:00:59,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:00:59,652 INFO ]: Start accepts. Automaton has 55 states. Word has length 105 [2018-06-22 11:00:59,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:59,653 INFO ]: With dead ends: 68 [2018-06-22 11:00:59,653 INFO ]: Without dead ends: 68 [2018-06-22 11:00:59,654 INFO ]: 0 DeclaredPredicates, 169 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=711, Invalid=5295, Unknown=0, NotChecked=0, Total=6006 [2018-06-22 11:00:59,654 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 11:00:59,658 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-06-22 11:00:59,658 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:00:59,659 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-06-22 11:00:59,659 INFO ]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 105 [2018-06-22 11:00:59,659 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:59,659 INFO ]: Abstraction has 68 states and 71 transitions. [2018-06-22 11:00:59,659 INFO ]: Interpolant automaton has 55 states. [2018-06-22 11:00:59,659 INFO ]: Start isEmpty. Operand 68 states and 71 transitions. [2018-06-22 11:00:59,660 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:00:59,660 INFO ]: Found error trace [2018-06-22 11:00:59,660 INFO ]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:59,660 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:59,660 INFO ]: Analyzing trace with hash -1823524368, now seen corresponding path program 19 times [2018-06-22 11:00:59,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:59,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:59,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:59,660 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:59,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:59,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:00,594 INFO ]: Checked inductivity of 353 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-06-22 11:01:00,594 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:00,594 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:01:00,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:00,640 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:00,646 INFO ]: Computing forward predicates... [2018-06-22 11:01:01,550 INFO ]: Checked inductivity of 353 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-06-22 11:01:01,569 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:01,569 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 57 [2018-06-22 11:01:01,570 INFO ]: Interpolant automaton has 57 states [2018-06-22 11:01:01,570 INFO ]: Constructing interpolant automaton starting with 57 interpolants. [2018-06-22 11:01:01,570 INFO ]: CoverageRelationStatistics Valid=137, Invalid=3055, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:01:01,570 INFO ]: Start difference. First operand 68 states and 71 transitions. Second operand 57 states. [2018-06-22 11:01:02,339 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:02,339 INFO ]: Finished difference Result 90 states and 94 transitions. [2018-06-22 11:01:02,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:01:02,340 INFO ]: Start accepts. Automaton has 57 states. Word has length 109 [2018-06-22 11:01:02,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:02,340 INFO ]: With dead ends: 90 [2018-06-22 11:01:02,340 INFO ]: Without dead ends: 88 [2018-06-22 11:01:02,341 INFO ]: 0 DeclaredPredicates, 169 GetRequests, 68 SyntacticMatches, 30 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=217, Invalid=5039, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 11:01:02,341 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:01:02,345 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 74. [2018-06-22 11:01:02,345 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:01:02,346 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-06-22 11:01:02,346 INFO ]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 109 [2018-06-22 11:01:02,346 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:02,346 INFO ]: Abstraction has 74 states and 78 transitions. [2018-06-22 11:01:02,346 INFO ]: Interpolant automaton has 57 states. [2018-06-22 11:01:02,346 INFO ]: Start isEmpty. Operand 74 states and 78 transitions. [2018-06-22 11:01:02,347 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:01:02,347 INFO ]: Found error trace [2018-06-22 11:01:02,347 INFO ]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:02,347 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:02,347 INFO ]: Analyzing trace with hash -992174638, now seen corresponding path program 20 times [2018-06-22 11:01:02,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:02,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:02,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:02,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:02,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:02,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:02,759 INFO ]: Checked inductivity of 384 backedges. 72 proven. 142 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-06-22 11:01:02,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:02,759 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:01:02,766 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:01:02,814 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:01:02,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:02,821 INFO ]: Computing forward predicates... [2018-06-22 11:01:03,425 INFO ]: Checked inductivity of 384 backedges. 72 proven. 135 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-06-22 11:01:03,444 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:03,444 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 58 [2018-06-22 11:01:03,445 INFO ]: Interpolant automaton has 58 states [2018-06-22 11:01:03,445 INFO ]: Constructing interpolant automaton starting with 58 interpolants. [2018-06-22 11:01:03,445 INFO ]: CoverageRelationStatistics Valid=417, Invalid=2889, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 11:01:03,445 INFO ]: Start difference. First operand 74 states and 78 transitions. Second operand 58 states. [2018-06-22 11:01:04,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:04,095 INFO ]: Finished difference Result 88 states and 91 transitions. [2018-06-22 11:01:04,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:01:04,095 INFO ]: Start accepts. Automaton has 58 states. Word has length 113 [2018-06-22 11:01:04,095 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:04,095 INFO ]: With dead ends: 88 [2018-06-22 11:01:04,095 INFO ]: Without dead ends: 72 [2018-06-22 11:01:04,096 INFO ]: 0 DeclaredPredicates, 175 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=724, Invalid=4976, Unknown=0, NotChecked=0, Total=5700 [2018-06-22 11:01:04,096 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:01:04,099 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 11:01:04,099 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:01:04,100 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-06-22 11:01:04,100 INFO ]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 113 [2018-06-22 11:01:04,100 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:04,100 INFO ]: Abstraction has 72 states and 75 transitions. [2018-06-22 11:01:04,100 INFO ]: Interpolant automaton has 58 states. [2018-06-22 11:01:04,100 INFO ]: Start isEmpty. Operand 72 states and 75 transitions. [2018-06-22 11:01:04,101 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:01:04,101 INFO ]: Found error trace [2018-06-22 11:01:04,101 INFO ]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:04,101 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:04,101 INFO ]: Analyzing trace with hash 2021573683, now seen corresponding path program 21 times [2018-06-22 11:01:04,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:04,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:04,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:04,102 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:04,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:04,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:04,573 INFO ]: Checked inductivity of 420 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-06-22 11:01:04,573 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:04,573 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:01:04,581 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:01:04,634 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:01:04,634 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:04,638 INFO ]: Computing forward predicates... [2018-06-22 11:01:05,421 INFO ]: Checked inductivity of 420 backedges. 136 proven. 98 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-06-22 11:01:05,440 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:05,440 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 61 [2018-06-22 11:01:05,440 INFO ]: Interpolant automaton has 61 states [2018-06-22 11:01:05,440 INFO ]: Constructing interpolant automaton starting with 61 interpolants. [2018-06-22 11:01:05,441 INFO ]: CoverageRelationStatistics Valid=423, Invalid=3237, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 11:01:05,441 INFO ]: Start difference. First operand 72 states and 75 transitions. Second operand 61 states. [2018-06-22 11:01:06,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:06,120 INFO ]: Finished difference Result 74 states and 77 transitions. [2018-06-22 11:01:06,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:01:06,120 INFO ]: Start accepts. Automaton has 61 states. Word has length 117 [2018-06-22 11:01:06,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:06,121 INFO ]: With dead ends: 74 [2018-06-22 11:01:06,121 INFO ]: Without dead ends: 74 [2018-06-22 11:01:06,122 INFO ]: 0 DeclaredPredicates, 189 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=879, Invalid=6603, Unknown=0, NotChecked=0, Total=7482 [2018-06-22 11:01:06,122 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:01:06,125 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-22 11:01:06,125 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:01:06,126 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-06-22 11:01:06,126 INFO ]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 117 [2018-06-22 11:01:06,126 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:06,126 INFO ]: Abstraction has 74 states and 77 transitions. [2018-06-22 11:01:06,126 INFO ]: Interpolant automaton has 61 states. [2018-06-22 11:01:06,126 INFO ]: Start isEmpty. Operand 74 states and 77 transitions. [2018-06-22 11:01:06,126 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 11:01:06,126 INFO ]: Found error trace [2018-06-22 11:01:06,126 INFO ]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:06,127 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:06,127 INFO ]: Analyzing trace with hash 210360149, now seen corresponding path program 22 times [2018-06-22 11:01:06,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:06,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:06,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:06,127 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:06,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:06,151 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:08,144 INFO ]: Checked inductivity of 451 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-06-22 11:01:08,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:08,144 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:01:08,150 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:01:08,216 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:01:08,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:08,223 INFO ]: Computing forward predicates... [2018-06-22 11:01:09,850 INFO ]: Checked inductivity of 451 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-06-22 11:01:09,869 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:09,869 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 63 [2018-06-22 11:01:09,869 INFO ]: Interpolant automaton has 63 states [2018-06-22 11:01:09,869 INFO ]: Constructing interpolant automaton starting with 63 interpolants. [2018-06-22 11:01:09,869 INFO ]: CoverageRelationStatistics Valid=152, Invalid=3754, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 11:01:09,869 INFO ]: Start difference. First operand 74 states and 77 transitions. Second operand 63 states. [2018-06-22 11:01:10,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:10,992 INFO ]: Finished difference Result 98 states and 102 transitions. [2018-06-22 11:01:10,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:01:10,992 INFO ]: Start accepts. Automaton has 63 states. Word has length 121 [2018-06-22 11:01:10,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:10,993 INFO ]: With dead ends: 98 [2018-06-22 11:01:10,993 INFO ]: Without dead ends: 96 [2018-06-22 11:01:10,993 INFO ]: 0 DeclaredPredicates, 188 GetRequests, 75 SyntacticMatches, 34 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=242, Invalid=6238, Unknown=0, NotChecked=0, Total=6480 [2018-06-22 11:01:10,994 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 11:01:10,997 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 80. [2018-06-22 11:01:10,997 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:01:10,998 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-06-22 11:01:10,998 INFO ]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 121 [2018-06-22 11:01:10,998 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:10,998 INFO ]: Abstraction has 80 states and 84 transitions. [2018-06-22 11:01:10,998 INFO ]: Interpolant automaton has 63 states. [2018-06-22 11:01:10,999 INFO ]: Start isEmpty. Operand 80 states and 84 transitions. [2018-06-22 11:01:11,000 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 11:01:11,000 INFO ]: Found error trace [2018-06-22 11:01:11,000 INFO ]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:11,000 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:11,000 INFO ]: Analyzing trace with hash 1456260087, now seen corresponding path program 23 times [2018-06-22 11:01:11,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:11,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:11,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:11,001 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:11,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:11,016 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:11,745 INFO ]: Checked inductivity of 486 backedges. 90 proven. 178 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-06-22 11:01:11,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:11,745 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) [2018-06-22 11:01:11,759 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:01:11,823 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:01:11,823 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:11,827 INFO ]: Computing forward predicates... [2018-06-22 11:01:12,442 INFO ]: Checked inductivity of 486 backedges. 90 proven. 170 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-06-22 11:01:12,461 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:12,461 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 64 [2018-06-22 11:01:12,461 INFO ]: Interpolant automaton has 64 states [2018-06-22 11:01:12,461 INFO ]: Constructing interpolant automaton starting with 64 interpolants. [2018-06-22 11:01:12,462 INFO ]: CoverageRelationStatistics Valid=507, Invalid=3525, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 11:01:12,462 INFO ]: Start difference. First operand 80 states and 84 transitions. Second operand 64 states. [2018-06-22 11:01:13,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:13,047 INFO ]: Finished difference Result 96 states and 99 transitions. [2018-06-22 11:01:13,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:01:13,064 INFO ]: Start accepts. Automaton has 64 states. Word has length 125 [2018-06-22 11:01:13,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:13,065 INFO ]: With dead ends: 96 [2018-06-22 11:01:13,065 INFO ]: Without dead ends: 78 [2018-06-22 11:01:13,066 INFO ]: 0 DeclaredPredicates, 194 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=878, Invalid=6094, Unknown=0, NotChecked=0, Total=6972 [2018-06-22 11:01:13,066 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 11:01:13,069 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-06-22 11:01:13,069 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:01:13,070 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-06-22 11:01:13,070 INFO ]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 125 [2018-06-22 11:01:13,070 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:13,070 INFO ]: Abstraction has 78 states and 81 transitions. [2018-06-22 11:01:13,070 INFO ]: Interpolant automaton has 64 states. [2018-06-22 11:01:13,070 INFO ]: Start isEmpty. Operand 78 states and 81 transitions. [2018-06-22 11:01:13,070 INFO ]: Finished isEmpty. Found accepting run of length 130 [2018-06-22 11:01:13,070 INFO ]: Found error trace [2018-06-22 11:01:13,071 INFO ]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:13,071 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:13,071 INFO ]: Analyzing trace with hash -1009128616, now seen corresponding path program 24 times [2018-06-22 11:01:13,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:13,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:13,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:13,071 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:13,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:13,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:13,601 INFO ]: Checked inductivity of 526 backedges. 171 proven. 126 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-06-22 11:01:13,601 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:13,601 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:01:13,606 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:01:13,685 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-22 11:01:13,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:13,690 INFO ]: Computing forward predicates... [2018-06-22 11:01:14,574 INFO ]: Checked inductivity of 526 backedges. 171 proven. 119 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-06-22 11:01:14,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:14,594 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 67 [2018-06-22 11:01:14,594 INFO ]: Interpolant automaton has 67 states [2018-06-22 11:01:14,594 INFO ]: Constructing interpolant automaton starting with 67 interpolants. [2018-06-22 11:01:14,594 INFO ]: CoverageRelationStatistics Valid=513, Invalid=3909, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 11:01:14,595 INFO ]: Start difference. First operand 78 states and 81 transitions. Second operand 67 states. [2018-06-22 11:01:15,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:15,750 INFO ]: Finished difference Result 80 states and 83 transitions. [2018-06-22 11:01:15,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 11:01:15,750 INFO ]: Start accepts. Automaton has 67 states. Word has length 129 [2018-06-22 11:01:15,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:15,751 INFO ]: With dead ends: 80 [2018-06-22 11:01:15,751 INFO ]: Without dead ends: 80 [2018-06-22 11:01:15,751 INFO ]: 0 DeclaredPredicates, 209 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2763 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1065, Invalid=8055, Unknown=0, NotChecked=0, Total=9120 [2018-06-22 11:01:15,751 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 11:01:15,754 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-06-22 11:01:15,755 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:01:15,755 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-06-22 11:01:15,755 INFO ]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 129 [2018-06-22 11:01:15,756 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:15,756 INFO ]: Abstraction has 80 states and 83 transitions. [2018-06-22 11:01:15,756 INFO ]: Interpolant automaton has 67 states. [2018-06-22 11:01:15,756 INFO ]: Start isEmpty. Operand 80 states and 83 transitions. [2018-06-22 11:01:15,756 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 11:01:15,756 INFO ]: Found error trace [2018-06-22 11:01:15,756 INFO ]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:15,756 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:15,757 INFO ]: Analyzing trace with hash 1836128058, now seen corresponding path program 25 times [2018-06-22 11:01:15,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:15,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:15,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:15,757 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:15,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:15,779 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:16,501 INFO ]: Checked inductivity of 561 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-06-22 11:01:16,501 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:16,501 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:01:16,506 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:16,555 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:16,563 INFO ]: Computing forward predicates... [2018-06-22 11:01:18,993 INFO ]: Checked inductivity of 561 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-06-22 11:01:19,012 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:19,013 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 69 [2018-06-22 11:01:19,013 INFO ]: Interpolant automaton has 69 states [2018-06-22 11:01:19,013 INFO ]: Constructing interpolant automaton starting with 69 interpolants. [2018-06-22 11:01:19,013 INFO ]: CoverageRelationStatistics Valid=167, Invalid=4525, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 11:01:19,013 INFO ]: Start difference. First operand 80 states and 83 transitions. Second operand 69 states. [2018-06-22 11:01:20,076 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:20,076 INFO ]: Finished difference Result 106 states and 110 transitions. [2018-06-22 11:01:20,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 11:01:20,076 INFO ]: Start accepts. Automaton has 69 states. Word has length 133 [2018-06-22 11:01:20,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:20,077 INFO ]: With dead ends: 106 [2018-06-22 11:01:20,077 INFO ]: Without dead ends: 104 [2018-06-22 11:01:20,078 INFO ]: 0 DeclaredPredicates, 207 GetRequests, 82 SyntacticMatches, 38 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=267, Invalid=7565, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 11:01:20,078 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-22 11:01:20,082 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 86. [2018-06-22 11:01:20,082 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:01:20,084 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-06-22 11:01:20,084 INFO ]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 133 [2018-06-22 11:01:20,084 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:20,084 INFO ]: Abstraction has 86 states and 90 transitions. [2018-06-22 11:01:20,084 INFO ]: Interpolant automaton has 69 states. [2018-06-22 11:01:20,084 INFO ]: Start isEmpty. Operand 86 states and 90 transitions. [2018-06-22 11:01:20,085 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 11:01:20,085 INFO ]: Found error trace [2018-06-22 11:01:20,085 INFO ]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:20,085 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:20,085 INFO ]: Analyzing trace with hash 1631972508, now seen corresponding path program 26 times [2018-06-22 11:01:20,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:20,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:20,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:20,086 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:01:20,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:20,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:20,969 INFO ]: Checked inductivity of 600 backedges. 110 proven. 218 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-06-22 11:01:20,969 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:20,969 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:01:20,974 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:01:21,026 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:01:21,026 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:21,032 INFO ]: Computing forward predicates... [2018-06-22 11:01:22,012 INFO ]: Checked inductivity of 600 backedges. 110 proven. 209 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-06-22 11:01:22,031 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:22,031 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 70 [2018-06-22 11:01:22,031 INFO ]: Interpolant automaton has 70 states [2018-06-22 11:01:22,032 INFO ]: Constructing interpolant automaton starting with 70 interpolants. [2018-06-22 11:01:22,032 INFO ]: CoverageRelationStatistics Valid=606, Invalid=4224, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 11:01:22,032 INFO ]: Start difference. First operand 86 states and 90 transitions. Second operand 70 states. [2018-06-22 11:01:22,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:22,812 INFO ]: Finished difference Result 104 states and 107 transitions. [2018-06-22 11:01:22,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 11:01:22,812 INFO ]: Start accepts. Automaton has 70 states. Word has length 137 [2018-06-22 11:01:22,813 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:22,813 INFO ]: With dead ends: 104 [2018-06-22 11:01:22,813 INFO ]: Without dead ends: 84 [2018-06-22 11:01:22,813 INFO ]: 0 DeclaredPredicates, 213 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2919 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1047, Invalid=7325, Unknown=0, NotChecked=0, Total=8372 [2018-06-22 11:01:22,813 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:01:22,816 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-06-22 11:01:22,816 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:01:22,816 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-06-22 11:01:22,816 INFO ]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 137 [2018-06-22 11:01:22,817 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:22,817 INFO ]: Abstraction has 84 states and 87 transitions. [2018-06-22 11:01:22,817 INFO ]: Interpolant automaton has 70 states. [2018-06-22 11:01:22,817 INFO ]: Start isEmpty. Operand 84 states and 87 transitions. [2018-06-22 11:01:22,817 INFO ]: Finished isEmpty. Found accepting run of length 142 [2018-06-22 11:01:22,817 INFO ]: Found error trace [2018-06-22 11:01:22,817 INFO ]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:22,817 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:22,818 INFO ]: Analyzing trace with hash -1983748867, now seen corresponding path program 27 times [2018-06-22 11:01:22,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:22,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:22,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:22,818 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:22,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:22,834 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:23,673 INFO ]: Checked inductivity of 644 backedges. 210 proven. 150 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-06-22 11:01:23,673 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:01:23,673 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:01:23,678 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:01:23,741 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-22 11:01:23,741 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:01:23,746 INFO ]: Computing forward predicates... [2018-06-22 11:01:24,837 INFO ]: Checked inductivity of 644 backedges. 210 proven. 142 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-06-22 11:01:24,857 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:01:24,857 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 73 [2018-06-22 11:01:24,857 INFO ]: Interpolant automaton has 73 states [2018-06-22 11:01:24,857 INFO ]: Constructing interpolant automaton starting with 73 interpolants. [2018-06-22 11:01:24,858 INFO ]: CoverageRelationStatistics Valid=612, Invalid=4644, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 11:01:24,858 INFO ]: Start difference. First operand 84 states and 87 transitions. Second operand 73 states. [2018-06-22 11:01:25,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:01:25,750 INFO ]: Finished difference Result 86 states and 89 transitions. [2018-06-22 11:01:25,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:01:25,750 INFO ]: Start accepts. Automaton has 73 states. Word has length 141 [2018-06-22 11:01:25,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:01:25,751 INFO ]: With dead ends: 86 [2018-06-22 11:01:25,751 INFO ]: Without dead ends: 86 [2018-06-22 11:01:25,751 INFO ]: 0 DeclaredPredicates, 229 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3379 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1269, Invalid=9651, Unknown=0, NotChecked=0, Total=10920 [2018-06-22 11:01:25,751 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 11:01:25,754 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-06-22 11:01:25,754 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:01:25,755 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-06-22 11:01:25,755 INFO ]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 141 [2018-06-22 11:01:25,755 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:01:25,755 INFO ]: Abstraction has 86 states and 89 transitions. [2018-06-22 11:01:25,755 INFO ]: Interpolant automaton has 73 states. [2018-06-22 11:01:25,755 INFO ]: Start isEmpty. Operand 86 states and 89 transitions. [2018-06-22 11:01:25,756 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 11:01:25,756 INFO ]: Found error trace [2018-06-22 11:01:25,756 INFO ]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:01:25,756 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:01:25,756 INFO ]: Analyzing trace with hash -111801953, now seen corresponding path program 28 times [2018-06-22 11:01:25,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:01:25,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:01:25,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:25,757 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:01:25,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:01:25,779 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 11:01:25,926 WARN ]: Removed 1 from assertion stack [2018-06-22 11:01:25,926 WARN ]: Verification canceled [2018-06-22 11:01:26,081 WARN ]: Timeout [2018-06-22 11:01:26,082 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:01:26 BoogieIcfgContainer [2018-06-22 11:01:26,082 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:01:26,083 INFO ]: Toolchain (without parser) took 58792.22 ms. Allocated memory was 308.3 MB in the beginning and 822.1 MB in the end (delta: 513.8 MB). Free memory was 263.7 MB in the beginning and 791.4 MB in the end (delta: -527.7 MB). Peak memory consumption was 150.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:01:26,084 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:01:26,084 INFO ]: ChcToBoogie took 48.00 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:01:26,085 INFO ]: Boogie Preprocessor took 39.66 ms. Allocated memory is still 308.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-22 11:01:26,085 INFO ]: RCFGBuilder took 398.52 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 251.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:01:26,085 INFO ]: TraceAbstraction took 58293.31 ms. Allocated memory was 308.3 MB in the beginning and 822.1 MB in the end (delta: 513.8 MB). Free memory was 250.7 MB in the beginning and 795.0 MB in the end (delta: -544.3 MB). Peak memory consumption was 137.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:01:26,088 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.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 48.00 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.66 ms. Allocated memory is still 308.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 398.52 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 251.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58293.31 ms. Allocated memory was 308.3 MB in the beginning and 822.1 MB in the end (delta: 513.8 MB). Free memory was 250.7 MB in the beginning and 795.0 MB in the end (delta: -544.3 MB). Peak memory consumption was 137.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 5. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. TIMEOUT Result, 58.2s OverallTime, 38 OverallIterations, 12 TraceHistogramMax, 17.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1192 SDtfs, 342 SDslu, 23170 SDs, 0 SdLazy, 15677 SolverSat, 208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3977 GetRequests, 2041 SyntacticMatches, 211 SemanticMatches, 1725 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30196 ImplicationChecksByTransitivity, 41.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 108 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 37.2s InterpolantComputationTime, 5145 NumberOfCodeBlocks, 5145 NumberOfCodeBlocksAsserted, 162 NumberOfCheckSat, 5076 ConstructedInterpolants, 0 QuantifiedInterpolants, 1972304 SizeOfPredicates, 420 NumberOfNonLiveVariables, 10659 ConjunctsInSsa, 2088 ConjunctsInUnsatCore, 69 InterpolantComputations, 5 PerfectInterpolantSequences, 8824/13993 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_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-01-26-100.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop2_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-01-26-100.csv Completed graceful shutdown