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/break_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:58:15,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:58:15,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:58:15,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:58:15,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:58:15,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:58:15,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:58:15,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:58:15,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:58:15,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:58:15,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:58:15,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:58:15,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:58:15,459 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:58:15,463 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:58:15,464 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:58:15,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:58:15,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:58:15,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:58:15,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:58:15,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:58:15,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:58:15,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:58:15,483 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:58:15,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:58:15,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:58:15,489 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:58:15,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:58:15,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:58:15,491 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:58:15,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:58:15,497 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:58:15,498 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:58:15,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:58:15,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:58:15,499 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 10:58:15,525 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:58:15,525 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:58:15,526 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:58:15,527 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:58:15,528 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:58:15,529 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:58:15,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:58:15,529 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:58:15,529 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:58:15,530 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:58:15,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:58:15,530 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:58:15,530 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:58:15,530 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:58:15,530 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:58:15,534 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:58:15,535 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:58:15,535 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:58:15,535 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:58:15,536 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:58:15,537 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:58:15,590 INFO ]: Repository-Root is: /tmp [2018-06-22 10:58:15,607 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:58:15,612 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:58:15,613 INFO ]: Initializing SmtParser... [2018-06-22 10:58:15,613 INFO ]: SmtParser initialized [2018-06-22 10:58:15,614 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 [2018-06-22 10:58:15,616 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 10:58:15,703 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 unknown [2018-06-22 10:58:15,851 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 [2018-06-22 10:58:15,859 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:58:15,864 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:58:15,864 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:58:15,864 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:58:15,864 INFO ]: ChcToBoogie initialized [2018-06-22 10:58:15,868 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:58:15" (1/1) ... [2018-06-22 10:58:15,912 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:15 Unit [2018-06-22 10:58:15,912 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:58:15,913 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:58:15,913 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:58:15,913 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:58:15,937 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:15" (1/1) ... [2018-06-22 10:58:15,937 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:15" (1/1) ... [2018-06-22 10:58:15,944 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:15" (1/1) ... [2018-06-22 10:58:15,944 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:15" (1/1) ... [2018-06-22 10:58:15,946 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:15" (1/1) ... [2018-06-22 10:58:15,948 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:15" (1/1) ... [2018-06-22 10:58:15,948 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:15" (1/1) ... [2018-06-22 10:58:15,949 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:58:15,951 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:58:15,951 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:58:15,951 INFO ]: RCFGBuilder initialized [2018-06-22 10:58:15,951 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:15" (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 10:58:15,964 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:58:15,964 INFO ]: Found specification of procedure False [2018-06-22 10:58:15,965 INFO ]: Found implementation of procedure False [2018-06-22 10:58:15,965 INFO ]: Specification and implementation of procedure inv_main11 given in one single declaration [2018-06-22 10:58:15,965 INFO ]: Found specification of procedure inv_main11 [2018-06-22 10:58:15,965 INFO ]: Found implementation of procedure inv_main11 [2018-06-22 10:58:15,965 INFO ]: Specification and implementation of procedure inv_main6 given in one single declaration [2018-06-22 10:58:15,965 INFO ]: Found specification of procedure inv_main6 [2018-06-22 10:58:15,965 INFO ]: Found implementation of procedure inv_main6 [2018-06-22 10:58:15,965 INFO ]: Specification and implementation of procedure inv_main5 given in one single declaration [2018-06-22 10:58:15,965 INFO ]: Found specification of procedure inv_main5 [2018-06-22 10:58:15,965 INFO ]: Found implementation of procedure inv_main5 [2018-06-22 10:58:15,965 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:58:15,965 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:58:15,965 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 10:58:16,154 INFO ]: Using library mode [2018-06-22 10:58:16,155 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:58:16 BoogieIcfgContainer [2018-06-22 10:58:16,155 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:58:16,156 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:58:16,156 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:58:16,168 INFO ]: TraceAbstraction initialized [2018-06-22 10:58:16,169 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:58:15" (1/3) ... [2018-06-22 10:58:16,169 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434c151e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:58:16, skipping insertion in model container [2018-06-22 10:58:16,170 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:15" (2/3) ... [2018-06-22 10:58:16,170 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434c151e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:58:16, skipping insertion in model container [2018-06-22 10:58:16,170 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:58:16" (3/3) ... [2018-06-22 10:58:16,171 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:58:16,195 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:58:16,207 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:58:16,291 INFO ]: Using default assertion order modulation [2018-06-22 10:58:16,296 INFO ]: Interprodecural is true [2018-06-22 10:58:16,296 INFO ]: Hoare is false [2018-06-22 10:58:16,296 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:58:16,296 INFO ]: Backedges is TWOTRACK [2018-06-22 10:58:16,296 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:58:16,296 INFO ]: Difference is false [2018-06-22 10:58:16,296 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:58:16,296 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:58:16,316 INFO ]: Start isEmpty. Operand 24 states. [2018-06-22 10:58:16,329 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:58:16,329 INFO ]: Found error trace [2018-06-22 10:58:16,330 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:16,331 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:16,341 INFO ]: Analyzing trace with hash -1416373369, now seen corresponding path program 1 times [2018-06-22 10:58:16,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:16,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:16,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:16,375 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:16,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:16,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:16,467 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:58:16,469 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:58:16,469 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 10:58:16,470 INFO ]: Interpolant automaton has 4 states [2018-06-22 10:58:16,480 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 10:58:16,481 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:58:16,482 INFO ]: Start difference. First operand 24 states. Second operand 4 states. [2018-06-22 10:58:16,632 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:16,632 INFO ]: Finished difference Result 26 states and 36 transitions. [2018-06-22 10:58:16,632 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 10:58:16,633 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 10:58:16,633 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:16,645 INFO ]: With dead ends: 26 [2018-06-22 10:58:16,645 INFO ]: Without dead ends: 26 [2018-06-22 10:58:16,647 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:58:16,660 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 10:58:16,682 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 10:58:16,683 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 10:58:16,684 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-06-22 10:58:16,685 INFO ]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 17 [2018-06-22 10:58:16,685 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:16,685 INFO ]: Abstraction has 24 states and 32 transitions. [2018-06-22 10:58:16,685 INFO ]: Interpolant automaton has 4 states. [2018-06-22 10:58:16,686 INFO ]: Start isEmpty. Operand 24 states and 32 transitions. [2018-06-22 10:58:16,687 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:58:16,687 INFO ]: Found error trace [2018-06-22 10:58:16,687 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:16,687 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:16,687 INFO ]: Analyzing trace with hash 1369501887, now seen corresponding path program 1 times [2018-06-22 10:58:16,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:16,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:16,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:16,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:16,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:16,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:16,840 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:58:16,840 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:58:16,840 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:58:16,841 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:58:16,842 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:58:16,842 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:58:16,842 INFO ]: Start difference. First operand 24 states and 32 transitions. Second operand 6 states. [2018-06-22 10:58:17,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:17,205 INFO ]: Finished difference Result 30 states and 39 transitions. [2018-06-22 10:58:17,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:58:17,206 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 10:58:17,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:17,207 INFO ]: With dead ends: 30 [2018-06-22 10:58:17,208 INFO ]: Without dead ends: 28 [2018-06-22 10:58:17,208 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:58:17,208 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 10:58:17,215 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-22 10:58:17,215 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 10:58:17,219 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-06-22 10:58:17,219 INFO ]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 17 [2018-06-22 10:58:17,219 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:17,219 INFO ]: Abstraction has 26 states and 35 transitions. [2018-06-22 10:58:17,219 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:58:17,219 INFO ]: Start isEmpty. Operand 26 states and 35 transitions. [2018-06-22 10:58:17,221 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:58:17,221 INFO ]: Found error trace [2018-06-22 10:58:17,221 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:17,221 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:17,221 INFO ]: Analyzing trace with hash -879241822, now seen corresponding path program 1 times [2018-06-22 10:58:17,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:17,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:17,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:17,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:17,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:17,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:17,423 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:58:17,423 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:58:17,423 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 10:58:17,423 INFO ]: Interpolant automaton has 5 states [2018-06-22 10:58:17,423 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 10:58:17,423 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:58:17,424 INFO ]: Start difference. First operand 26 states and 35 transitions. Second operand 5 states. [2018-06-22 10:58:17,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:17,568 INFO ]: Finished difference Result 32 states and 42 transitions. [2018-06-22 10:58:17,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:58:17,568 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 10:58:17,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:17,569 INFO ]: With dead ends: 32 [2018-06-22 10:58:17,569 INFO ]: Without dead ends: 32 [2018-06-22 10:58:17,570 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 10:58:17,570 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 10:58:17,576 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 10:58:17,576 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 10:58:17,577 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2018-06-22 10:58:17,577 INFO ]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 17 [2018-06-22 10:58:17,578 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:17,578 INFO ]: Abstraction has 30 states and 40 transitions. [2018-06-22 10:58:17,578 INFO ]: Interpolant automaton has 5 states. [2018-06-22 10:58:17,578 INFO ]: Start isEmpty. Operand 30 states and 40 transitions. [2018-06-22 10:58:17,579 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:58:17,579 INFO ]: Found error trace [2018-06-22 10:58:17,579 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 10:58:17,579 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:17,579 INFO ]: Analyzing trace with hash 2013047108, now seen corresponding path program 1 times [2018-06-22 10:58:17,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:17,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:17,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:17,580 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:17,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:17,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:17,851 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:17,851 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:17,851 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 10:58:17,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:17,888 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:17,897 INFO ]: Computing forward predicates... [2018-06-22 10:58:17,988 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:18,021 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:18,021 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 10:58:18,022 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:58:18,022 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:58:18,022 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:58:18,022 INFO ]: Start difference. First operand 30 states and 40 transitions. Second operand 7 states. [2018-06-22 10:58:18,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:18,448 INFO ]: Finished difference Result 36 states and 47 transitions. [2018-06-22 10:58:18,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:58:18,448 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 10:58:18,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:18,450 INFO ]: With dead ends: 36 [2018-06-22 10:58:18,450 INFO ]: Without dead ends: 36 [2018-06-22 10:58:18,450 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:58:18,450 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 10:58:18,457 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-22 10:58:18,458 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 10:58:18,459 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2018-06-22 10:58:18,459 INFO ]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 21 [2018-06-22 10:58:18,459 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:18,459 INFO ]: Abstraction has 34 states and 45 transitions. [2018-06-22 10:58:18,459 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:58:18,459 INFO ]: Start isEmpty. Operand 34 states and 45 transitions. [2018-06-22 10:58:18,460 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:58:18,460 INFO ]: Found error trace [2018-06-22 10:58:18,461 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 10:58:18,461 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:18,461 INFO ]: Analyzing trace with hash 935019464, now seen corresponding path program 1 times [2018-06-22 10:58:18,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:18,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:18,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:18,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:18,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:18,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:18,599 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:18,599 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:18,599 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 10:58:18,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:18,622 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:18,625 INFO ]: Computing forward predicates... [2018-06-22 10:58:18,783 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:18,818 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:18,818 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 10:58:18,818 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:58:18,818 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:58:18,818 INFO ]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:58:18,818 INFO ]: Start difference. First operand 34 states and 45 transitions. Second operand 8 states. [2018-06-22 10:58:19,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:19,098 INFO ]: Finished difference Result 36 states and 48 transitions. [2018-06-22 10:58:19,098 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:58:19,098 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 10:58:19,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:19,100 INFO ]: With dead ends: 36 [2018-06-22 10:58:19,100 INFO ]: Without dead ends: 36 [2018-06-22 10:58:19,100 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:58:19,100 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 10:58:19,106 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 10:58:19,106 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 10:58:19,108 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-06-22 10:58:19,108 INFO ]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 21 [2018-06-22 10:58:19,108 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:19,108 INFO ]: Abstraction has 36 states and 48 transitions. [2018-06-22 10:58:19,108 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:58:19,108 INFO ]: Start isEmpty. Operand 36 states and 48 transitions. [2018-06-22 10:58:19,109 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:58:19,109 INFO ]: Found error trace [2018-06-22 10:58:19,109 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:19,109 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:19,110 INFO ]: Analyzing trace with hash -916463770, now seen corresponding path program 2 times [2018-06-22 10:58:19,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:19,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:19,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:19,110 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:19,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:19,119 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:19,364 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:58:19,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:19,364 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 10:58:19,379 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:19,418 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:19,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:19,420 INFO ]: Computing forward predicates... [2018-06-22 10:58:19,441 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:58:19,462 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:19,462 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 10:58:19,462 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:58:19,463 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:58:19,463 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:58:19,463 INFO ]: Start difference. First operand 36 states and 48 transitions. Second operand 8 states. [2018-06-22 10:58:19,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:19,644 INFO ]: Finished difference Result 42 states and 55 transitions. [2018-06-22 10:58:19,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:58:19,644 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 10:58:19,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:19,645 INFO ]: With dead ends: 42 [2018-06-22 10:58:19,645 INFO ]: Without dead ends: 42 [2018-06-22 10:58:19,646 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:58:19,646 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 10:58:19,652 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 10:58:19,652 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 10:58:19,653 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2018-06-22 10:58:19,653 INFO ]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 25 [2018-06-22 10:58:19,653 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:19,653 INFO ]: Abstraction has 40 states and 53 transitions. [2018-06-22 10:58:19,653 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:58:19,653 INFO ]: Start isEmpty. Operand 40 states and 53 transitions. [2018-06-22 10:58:19,654 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:58:19,654 INFO ]: Found error trace [2018-06-22 10:58:19,654 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:19,654 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:19,654 INFO ]: Analyzing trace with hash 1151428076, now seen corresponding path program 2 times [2018-06-22 10:58:19,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:19,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:19,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:19,655 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:19,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:19,664 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:19,786 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:58:19,787 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:19,787 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 10:58:19,800 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:19,832 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:19,832 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:19,834 INFO ]: Computing forward predicates... [2018-06-22 10:58:20,003 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:58:20,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:20,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-06-22 10:58:20,029 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:58:20,030 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:58:20,030 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:58:20,030 INFO ]: Start difference. First operand 40 states and 53 transitions. Second operand 9 states. [2018-06-22 10:58:20,141 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:20,141 INFO ]: Finished difference Result 42 states and 56 transitions. [2018-06-22 10:58:20,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:58:20,141 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 10:58:20,142 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:20,143 INFO ]: With dead ends: 42 [2018-06-22 10:58:20,143 INFO ]: Without dead ends: 42 [2018-06-22 10:58:20,143 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:58:20,143 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 10:58:20,151 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 10:58:20,151 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 10:58:20,152 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2018-06-22 10:58:20,152 INFO ]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 25 [2018-06-22 10:58:20,153 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:20,153 INFO ]: Abstraction has 42 states and 56 transitions. [2018-06-22 10:58:20,153 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:58:20,153 INFO ]: Start isEmpty. Operand 42 states and 56 transitions. [2018-06-22 10:58:20,154 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:58:20,154 INFO ]: Found error trace [2018-06-22 10:58:20,154 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:20,154 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:20,154 INFO ]: Analyzing trace with hash 597252104, now seen corresponding path program 3 times [2018-06-22 10:58:20,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:20,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:20,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:20,155 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:20,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:20,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:20,273 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 10:58:20,273 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:20,273 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 10:58:20,278 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:20,287 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 10:58:20,287 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:20,290 INFO ]: Computing forward predicates... [2018-06-22 10:58:20,368 INFO ]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 10:58:20,388 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 10:58:20,388 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2018-06-22 10:58:20,388 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:58:20,388 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:58:20,388 INFO ]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:58:20,389 INFO ]: Start difference. First operand 42 states and 56 transitions. Second operand 13 states. [2018-06-22 10:58:20,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:20,724 INFO ]: Finished difference Result 50 states and 64 transitions. [2018-06-22 10:58:20,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 10:58:20,724 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 10:58:20,725 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:20,725 INFO ]: With dead ends: 50 [2018-06-22 10:58:20,725 INFO ]: Without dead ends: 48 [2018-06-22 10:58:20,726 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:58:20,726 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 10:58:20,736 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 10:58:20,736 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 10:58:20,740 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2018-06-22 10:58:20,741 INFO ]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 29 [2018-06-22 10:58:20,741 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:20,741 INFO ]: Abstraction has 46 states and 60 transitions. [2018-06-22 10:58:20,741 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:58:20,741 INFO ]: Start isEmpty. Operand 46 states and 60 transitions. [2018-06-22 10:58:20,742 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:58:20,742 INFO ]: Found error trace [2018-06-22 10:58:20,742 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:20,742 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:20,742 INFO ]: Analyzing trace with hash -1816716016, now seen corresponding path program 3 times [2018-06-22 10:58:20,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:20,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:20,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:20,748 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:20,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:20,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:20,836 INFO ]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:58:20,836 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:20,836 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 10:58:20,850 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:20,875 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 10:58:20,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:20,877 INFO ]: Computing forward predicates... [2018-06-22 10:58:20,895 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 10:58:20,914 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:20,914 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-06-22 10:58:20,915 INFO ]: Interpolant automaton has 10 states [2018-06-22 10:58:20,915 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 10:58:20,915 INFO ]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:58:20,915 INFO ]: Start difference. First operand 46 states and 60 transitions. Second operand 10 states. [2018-06-22 10:58:21,006 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:21,006 INFO ]: Finished difference Result 48 states and 63 transitions. [2018-06-22 10:58:21,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:58:21,006 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 10:58:21,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:21,007 INFO ]: With dead ends: 48 [2018-06-22 10:58:21,007 INFO ]: Without dead ends: 48 [2018-06-22 10:58:21,007 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:58:21,007 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 10:58:21,014 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 10:58:21,015 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 10:58:21,016 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2018-06-22 10:58:21,016 INFO ]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 29 [2018-06-22 10:58:21,016 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:21,016 INFO ]: Abstraction has 48 states and 63 transitions. [2018-06-22 10:58:21,016 INFO ]: Interpolant automaton has 10 states. [2018-06-22 10:58:21,016 INFO ]: Start isEmpty. Operand 48 states and 63 transitions. [2018-06-22 10:58:21,019 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:58:21,019 INFO ]: Found error trace [2018-06-22 10:58:21,019 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:21,019 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:21,019 INFO ]: Analyzing trace with hash -118216396, now seen corresponding path program 4 times [2018-06-22 10:58:21,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:21,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:21,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:21,020 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:21,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:21,027 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:21,107 INFO ]: Checked inductivity of 36 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 10:58:21,107 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:21,107 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 10:58:21,115 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:58:21,135 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:58:21,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:21,137 INFO ]: Computing forward predicates... [2018-06-22 10:58:21,190 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 10:58:21,222 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:21,222 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2018-06-22 10:58:21,222 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:58:21,222 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:58:21,223 INFO ]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:58:21,223 INFO ]: Start difference. First operand 48 states and 63 transitions. Second operand 12 states. [2018-06-22 10:58:21,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:21,435 INFO ]: Finished difference Result 50 states and 66 transitions. [2018-06-22 10:58:21,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:58:21,436 INFO ]: Start accepts. Automaton has 12 states. Word has length 33 [2018-06-22 10:58:21,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:21,437 INFO ]: With dead ends: 50 [2018-06-22 10:58:21,437 INFO ]: Without dead ends: 50 [2018-06-22 10:58:21,437 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:58:21,437 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 10:58:21,444 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-22 10:58:21,444 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 10:58:21,445 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2018-06-22 10:58:21,445 INFO ]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 33 [2018-06-22 10:58:21,446 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:21,446 INFO ]: Abstraction has 50 states and 66 transitions. [2018-06-22 10:58:21,446 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:58:21,446 INFO ]: Start isEmpty. Operand 50 states and 66 transitions. [2018-06-22 10:58:21,447 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 10:58:21,447 INFO ]: Found error trace [2018-06-22 10:58:21,447 INFO ]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:21,447 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:21,447 INFO ]: Analyzing trace with hash 1024129358, now seen corresponding path program 1 times [2018-06-22 10:58:21,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:21,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:21,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:21,448 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:21,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:21,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:21,550 INFO ]: Checked inductivity of 39 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:58:21,550 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:21,550 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 10:58:21,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:21,580 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:21,583 INFO ]: Computing forward predicates... [2018-06-22 10:58:21,690 INFO ]: Checked inductivity of 39 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:58:21,710 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:21,710 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 10:58:21,710 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:58:21,710 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:58:21,711 INFO ]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:58:21,711 INFO ]: Start difference. First operand 50 states and 66 transitions. Second operand 18 states. [2018-06-22 10:58:22,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:22,386 INFO ]: Finished difference Result 60 states and 76 transitions. [2018-06-22 10:58:22,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:58:22,387 INFO ]: Start accepts. Automaton has 18 states. Word has length 37 [2018-06-22 10:58:22,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:22,387 INFO ]: With dead ends: 60 [2018-06-22 10:58:22,387 INFO ]: Without dead ends: 56 [2018-06-22 10:58:22,388 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 10:58:22,388 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 10:58:22,396 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-06-22 10:58:22,396 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 10:58:22,397 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2018-06-22 10:58:22,397 INFO ]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 37 [2018-06-22 10:58:22,397 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:22,397 INFO ]: Abstraction has 54 states and 70 transitions. [2018-06-22 10:58:22,397 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:58:22,397 INFO ]: Start isEmpty. Operand 54 states and 70 transitions. [2018-06-22 10:58:22,398 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 10:58:22,398 INFO ]: Found error trace [2018-06-22 10:58:22,398 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:22,399 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:22,399 INFO ]: Analyzing trace with hash 1021332056, now seen corresponding path program 5 times [2018-06-22 10:58:22,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:22,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:22,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:22,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:22,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:22,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:22,645 INFO ]: Checked inductivity of 55 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 10:58:22,645 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:22,645 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 10:58:22,651 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:58:22,666 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 10:58:22,666 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:22,668 INFO ]: Computing forward predicates... [2018-06-22 10:58:22,700 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:58:22,719 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:22,719 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-06-22 10:58:22,719 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:58:22,720 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:58:22,720 INFO ]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:58:22,720 INFO ]: Start difference. First operand 54 states and 70 transitions. Second operand 12 states. [2018-06-22 10:58:22,849 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:22,849 INFO ]: Finished difference Result 56 states and 73 transitions. [2018-06-22 10:58:22,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:58:22,849 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 10:58:22,850 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:22,850 INFO ]: With dead ends: 56 [2018-06-22 10:58:22,850 INFO ]: Without dead ends: 56 [2018-06-22 10:58:22,851 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:58:22,851 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 10:58:22,859 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 10:58:22,859 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 10:58:22,860 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2018-06-22 10:58:22,860 INFO ]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 37 [2018-06-22 10:58:22,860 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:22,860 INFO ]: Abstraction has 56 states and 73 transitions. [2018-06-22 10:58:22,860 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:58:22,860 INFO ]: Start isEmpty. Operand 56 states and 73 transitions. [2018-06-22 10:58:22,861 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 10:58:22,861 INFO ]: Found error trace [2018-06-22 10:58:22,861 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:22,862 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:22,862 INFO ]: Analyzing trace with hash 2022916220, now seen corresponding path program 6 times [2018-06-22 10:58:22,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:22,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:22,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:22,862 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:22,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:22,871 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:22,966 INFO ]: Checked inductivity of 78 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 10:58:22,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:22,966 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 10:58:22,972 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:58:22,988 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 10:58:22,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:22,991 INFO ]: Computing forward predicates... [2018-06-22 10:58:23,047 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 10:58:23,067 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:23,067 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2018-06-22 10:58:23,067 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:58:23,067 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:58:23,068 INFO ]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:58:23,068 INFO ]: Start difference. First operand 56 states and 73 transitions. Second operand 13 states. [2018-06-22 10:58:23,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:23,183 INFO ]: Finished difference Result 58 states and 76 transitions. [2018-06-22 10:58:23,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:58:23,184 INFO ]: Start accepts. Automaton has 13 states. Word has length 41 [2018-06-22 10:58:23,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:23,185 INFO ]: With dead ends: 58 [2018-06-22 10:58:23,185 INFO ]: Without dead ends: 58 [2018-06-22 10:58:23,185 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:58:23,185 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 10:58:23,193 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-06-22 10:58:23,193 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 10:58:23,194 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2018-06-22 10:58:23,195 INFO ]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 41 [2018-06-22 10:58:23,195 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:23,195 INFO ]: Abstraction has 58 states and 76 transitions. [2018-06-22 10:58:23,195 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:58:23,195 INFO ]: Start isEmpty. Operand 58 states and 76 transitions. [2018-06-22 10:58:23,196 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 10:58:23,196 INFO ]: Found error trace [2018-06-22 10:58:23,196 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:23,196 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:23,196 INFO ]: Analyzing trace with hash 1907674016, now seen corresponding path program 7 times [2018-06-22 10:58:23,196 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:23,196 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:23,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:23,197 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:23,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:23,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:23,712 INFO ]: Checked inductivity of 105 backedges. 5 proven. 62 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 10:58:23,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:23,712 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:23,718 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:23,734 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:23,736 INFO ]: Computing forward predicates... [2018-06-22 10:58:23,785 INFO ]: Checked inductivity of 105 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 10:58:23,816 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:23,816 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-06-22 10:58:23,816 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:58:23,816 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:58:23,816 INFO ]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:58:23,817 INFO ]: Start difference. First operand 58 states and 76 transitions. Second operand 15 states. [2018-06-22 10:58:24,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:24,407 INFO ]: Finished difference Result 60 states and 79 transitions. [2018-06-22 10:58:24,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:58:24,408 INFO ]: Start accepts. Automaton has 15 states. Word has length 45 [2018-06-22 10:58:24,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:24,408 INFO ]: With dead ends: 60 [2018-06-22 10:58:24,408 INFO ]: Without dead ends: 60 [2018-06-22 10:58:24,409 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:58:24,409 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 10:58:24,414 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-22 10:58:24,414 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 10:58:24,415 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2018-06-22 10:58:24,415 INFO ]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 45 [2018-06-22 10:58:24,415 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:24,415 INFO ]: Abstraction has 60 states and 79 transitions. [2018-06-22 10:58:24,415 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:58:24,416 INFO ]: Start isEmpty. Operand 60 states and 79 transitions. [2018-06-22 10:58:24,417 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 10:58:24,417 INFO ]: Found error trace [2018-06-22 10:58:24,417 INFO ]: trace histogram [6, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:24,417 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:24,417 INFO ]: Analyzing trace with hash -1804089836, now seen corresponding path program 2 times [2018-06-22 10:58:24,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:24,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:24,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:24,417 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:24,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:24,428 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:24,581 INFO ]: Checked inductivity of 65 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:58:24,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:24,582 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 10:58:24,589 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:24,618 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:24,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:24,620 INFO ]: Computing forward predicates... [2018-06-22 10:58:24,833 INFO ]: Checked inductivity of 65 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 10:58:24,853 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:24,853 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-06-22 10:58:24,853 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:58:24,853 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:58:24,853 INFO ]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:58:24,853 INFO ]: Start difference. First operand 60 states and 79 transitions. Second operand 22 states. [2018-06-22 10:58:25,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:25,533 INFO ]: Finished difference Result 72 states and 91 transitions. [2018-06-22 10:58:25,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 10:58:25,533 INFO ]: Start accepts. Automaton has 22 states. Word has length 45 [2018-06-22 10:58:25,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:25,534 INFO ]: With dead ends: 72 [2018-06-22 10:58:25,534 INFO ]: Without dead ends: 66 [2018-06-22 10:58:25,535 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=1350, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 10:58:25,535 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 10:58:25,543 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-06-22 10:58:25,543 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 10:58:25,544 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2018-06-22 10:58:25,544 INFO ]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 45 [2018-06-22 10:58:25,545 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:25,545 INFO ]: Abstraction has 64 states and 83 transitions. [2018-06-22 10:58:25,545 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:58:25,545 INFO ]: Start isEmpty. Operand 64 states and 83 transitions. [2018-06-22 10:58:25,546 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 10:58:25,546 INFO ]: Found error trace [2018-06-22 10:58:25,546 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:25,546 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:25,546 INFO ]: Analyzing trace with hash -159601724, now seen corresponding path program 8 times [2018-06-22 10:58:25,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:25,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:25,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:25,549 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:25,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:25,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:25,661 INFO ]: Checked inductivity of 136 backedges. 7 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 10:58:25,661 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:25,661 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 10:58:25,672 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:25,688 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:25,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:25,690 INFO ]: Computing forward predicates... [2018-06-22 10:58:25,730 INFO ]: Checked inductivity of 136 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 10:58:25,762 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:25,762 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2018-06-22 10:58:25,763 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:58:25,763 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:58:25,763 INFO ]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:58:25,763 INFO ]: Start difference. First operand 64 states and 83 transitions. Second operand 15 states. [2018-06-22 10:58:25,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:25,892 INFO ]: Finished difference Result 66 states and 86 transitions. [2018-06-22 10:58:25,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:58:25,892 INFO ]: Start accepts. Automaton has 15 states. Word has length 49 [2018-06-22 10:58:25,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:25,893 INFO ]: With dead ends: 66 [2018-06-22 10:58:25,893 INFO ]: Without dead ends: 66 [2018-06-22 10:58:25,893 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:58:25,893 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 10:58:25,899 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 10:58:25,899 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 10:58:25,900 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2018-06-22 10:58:25,900 INFO ]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 49 [2018-06-22 10:58:25,900 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:25,900 INFO ]: Abstraction has 66 states and 86 transitions. [2018-06-22 10:58:25,901 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:58:25,901 INFO ]: Start isEmpty. Operand 66 states and 86 transitions. [2018-06-22 10:58:25,902 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 10:58:25,902 INFO ]: Found error trace [2018-06-22 10:58:25,902 INFO ]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:25,902 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:25,902 INFO ]: Analyzing trace with hash -139780518, now seen corresponding path program 3 times [2018-06-22 10:58:25,902 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:25,902 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:25,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:25,903 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:25,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:25,914 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:26,160 INFO ]: Checked inductivity of 99 backedges. 32 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 10:58:26,161 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:26,161 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 10:58:26,166 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:26,186 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 10:58:26,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:26,188 INFO ]: Computing forward predicates... [2018-06-22 10:58:26,408 INFO ]: Checked inductivity of 99 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 10:58:26,427 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:26,427 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-22 10:58:26,427 INFO ]: Interpolant automaton has 24 states [2018-06-22 10:58:26,427 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 10:58:26,428 INFO ]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:58:26,428 INFO ]: Start difference. First operand 66 states and 86 transitions. Second operand 24 states. [2018-06-22 10:58:27,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:27,205 INFO ]: Finished difference Result 80 states and 100 transitions. [2018-06-22 10:58:27,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:58:27,206 INFO ]: Start accepts. Automaton has 24 states. Word has length 53 [2018-06-22 10:58:27,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:27,207 INFO ]: With dead ends: 80 [2018-06-22 10:58:27,207 INFO ]: Without dead ends: 72 [2018-06-22 10:58:27,208 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=373, Invalid=1789, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 10:58:27,208 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 10:58:27,213 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-06-22 10:58:27,213 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 10:58:27,214 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2018-06-22 10:58:27,214 INFO ]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 53 [2018-06-22 10:58:27,214 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:27,214 INFO ]: Abstraction has 70 states and 90 transitions. [2018-06-22 10:58:27,214 INFO ]: Interpolant automaton has 24 states. [2018-06-22 10:58:27,214 INFO ]: Start isEmpty. Operand 70 states and 90 transitions. [2018-06-22 10:58:27,216 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 10:58:27,216 INFO ]: Found error trace [2018-06-22 10:58:27,216 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:27,216 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:27,216 INFO ]: Analyzing trace with hash 968007912, now seen corresponding path program 9 times [2018-06-22 10:58:27,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:27,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:27,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:27,217 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:27,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:27,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:27,448 INFO ]: Checked inductivity of 171 backedges. 8 proven. 90 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 10:58:27,448 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:27,482 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 10:58:27,488 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:27,510 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 10:58:27,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:27,513 INFO ]: Computing forward predicates... [2018-06-22 10:58:27,541 INFO ]: Checked inductivity of 171 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 10:58:27,560 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:27,560 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2018-06-22 10:58:27,560 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:58:27,560 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:58:27,561 INFO ]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:58:27,561 INFO ]: Start difference. First operand 70 states and 90 transitions. Second operand 16 states. [2018-06-22 10:58:27,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:27,788 INFO ]: Finished difference Result 72 states and 93 transitions. [2018-06-22 10:58:27,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:58:27,788 INFO ]: Start accepts. Automaton has 16 states. Word has length 53 [2018-06-22 10:58:27,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:27,788 INFO ]: With dead ends: 72 [2018-06-22 10:58:27,788 INFO ]: Without dead ends: 72 [2018-06-22 10:58:27,789 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:58:27,789 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 10:58:27,795 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 10:58:27,795 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 10:58:27,796 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2018-06-22 10:58:27,796 INFO ]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 53 [2018-06-22 10:58:27,796 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:27,796 INFO ]: Abstraction has 72 states and 93 transitions. [2018-06-22 10:58:27,796 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:58:27,796 INFO ]: Start isEmpty. Operand 72 states and 93 transitions. [2018-06-22 10:58:27,797 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:58:27,797 INFO ]: Found error trace [2018-06-22 10:58:27,797 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:27,797 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:27,797 INFO ]: Analyzing trace with hash 783182604, now seen corresponding path program 10 times [2018-06-22 10:58:27,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:27,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:27,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:27,798 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:27,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:27,809 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:28,004 INFO ]: Checked inductivity of 210 backedges. 8 proven. 119 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-22 10:58:28,005 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:28,005 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 10:58:28,010 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:58:28,027 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:58:28,027 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:28,029 INFO ]: Computing forward predicates... [2018-06-22 10:58:28,079 INFO ]: Checked inductivity of 210 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-22 10:58:28,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:28,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2018-06-22 10:58:28,098 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:58:28,098 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:58:28,098 INFO ]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:58:28,099 INFO ]: Start difference. First operand 72 states and 93 transitions. Second operand 18 states. [2018-06-22 10:58:28,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:28,221 INFO ]: Finished difference Result 74 states and 96 transitions. [2018-06-22 10:58:28,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:58:28,221 INFO ]: Start accepts. Automaton has 18 states. Word has length 57 [2018-06-22 10:58:28,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:28,221 INFO ]: With dead ends: 74 [2018-06-22 10:58:28,221 INFO ]: Without dead ends: 74 [2018-06-22 10:58:28,222 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=251, Invalid=505, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:58:28,222 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 10:58:28,230 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-22 10:58:28,230 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 10:58:28,231 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2018-06-22 10:58:28,231 INFO ]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 57 [2018-06-22 10:58:28,231 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:28,231 INFO ]: Abstraction has 74 states and 96 transitions. [2018-06-22 10:58:28,231 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:58:28,231 INFO ]: Start isEmpty. Operand 74 states and 96 transitions. [2018-06-22 10:58:28,232 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 10:58:28,232 INFO ]: Found error trace [2018-06-22 10:58:28,232 INFO ]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:28,232 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:28,232 INFO ]: Analyzing trace with hash -447231440, now seen corresponding path program 11 times [2018-06-22 10:58:28,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:28,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:28,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:28,233 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:28,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:28,245 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:28,315 INFO ]: Checked inductivity of 253 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-22 10:58:28,315 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:28,315 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 10:58:28,322 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:58:28,345 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 10:58:28,345 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:28,348 INFO ]: Computing forward predicates... [2018-06-22 10:58:28,430 INFO ]: Checked inductivity of 253 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-22 10:58:28,448 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:28,449 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 10:58:28,449 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:58:28,449 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:58:28,449 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:58:28,449 INFO ]: Start difference. First operand 74 states and 96 transitions. Second operand 9 states. [2018-06-22 10:58:28,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:28,494 INFO ]: Finished difference Result 76 states and 97 transitions. [2018-06-22 10:58:28,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:58:28,501 INFO ]: Start accepts. Automaton has 9 states. Word has length 61 [2018-06-22 10:58:28,501 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:28,502 INFO ]: With dead ends: 76 [2018-06-22 10:58:28,502 INFO ]: Without dead ends: 76 [2018-06-22 10:58:28,502 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:58:28,502 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 10:58:28,507 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-06-22 10:58:28,507 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 10:58:28,508 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2018-06-22 10:58:28,508 INFO ]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 61 [2018-06-22 10:58:28,508 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:28,508 INFO ]: Abstraction has 74 states and 95 transitions. [2018-06-22 10:58:28,508 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:58:28,508 INFO ]: Start isEmpty. Operand 74 states and 95 transitions. [2018-06-22 10:58:28,509 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 10:58:28,509 INFO ]: Found error trace [2018-06-22 10:58:28,509 INFO ]: trace histogram [8, 7, 7, 7, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:28,509 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:28,509 INFO ]: Analyzing trace with hash -1641520608, now seen corresponding path program 4 times [2018-06-22 10:58:28,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:28,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:28,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:28,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:28,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:28,519 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:29,398 WARN ]: Spent 434.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-06-22 10:58:29,618 INFO ]: Checked inductivity of 141 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-22 10:58:29,618 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:29,618 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) [2018-06-22 10:58:29,636 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:29,656 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:58:29,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:29,658 INFO ]: Computing forward predicates... [2018-06-22 10:58:29,885 INFO ]: Checked inductivity of 141 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 10:58:29,904 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:29,904 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 31 [2018-06-22 10:58:29,905 INFO ]: Interpolant automaton has 31 states [2018-06-22 10:58:29,905 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 10:58:29,905 INFO ]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:58:29,905 INFO ]: Start difference. First operand 74 states and 95 transitions. Second operand 31 states. [2018-06-22 10:58:34,241 WARN ]: Spent 143.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 15 [2018-06-22 10:58:35,573 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:35,573 INFO ]: Finished difference Result 362 states and 913 transitions. [2018-06-22 10:58:35,573 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 10:58:35,573 INFO ]: Start accepts. Automaton has 31 states. Word has length 61 [2018-06-22 10:58:35,574 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:35,579 INFO ]: With dead ends: 362 [2018-06-22 10:58:35,580 INFO ]: Without dead ends: 264 [2018-06-22 10:58:35,583 INFO ]: 0 DeclaredPredicates, 171 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2196 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2170, Invalid=8542, Unknown=0, NotChecked=0, Total=10712 [2018-06-22 10:58:35,583 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-22 10:58:35,612 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 138. [2018-06-22 10:58:35,612 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 10:58:35,614 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 229 transitions. [2018-06-22 10:58:35,614 INFO ]: Start accepts. Automaton has 138 states and 229 transitions. Word has length 61 [2018-06-22 10:58:35,615 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:35,615 INFO ]: Abstraction has 138 states and 229 transitions. [2018-06-22 10:58:35,615 INFO ]: Interpolant automaton has 31 states. [2018-06-22 10:58:35,615 INFO ]: Start isEmpty. Operand 138 states and 229 transitions. [2018-06-22 10:58:35,616 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 10:58:35,616 INFO ]: Found error trace [2018-06-22 10:58:35,616 INFO ]: trace histogram [12, 11, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:35,616 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:35,616 INFO ]: Analyzing trace with hash -1350402286, now seen corresponding path program 1 times [2018-06-22 10:58:35,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:35,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:35,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:35,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:35,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:35,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:36,063 INFO ]: Checked inductivity of 256 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-06-22 10:58:36,063 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:36,063 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 10:58:36,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:36,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:36,106 INFO ]: Computing forward predicates... [2018-06-22 10:58:36,605 INFO ]: Checked inductivity of 256 backedges. 40 proven. 119 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-22 10:58:36,624 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:36,624 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 28 [2018-06-22 10:58:36,624 INFO ]: Interpolant automaton has 28 states [2018-06-22 10:58:36,624 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 10:58:36,624 INFO ]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:58:36,624 INFO ]: Start difference. First operand 138 states and 229 transitions. Second operand 28 states. [2018-06-22 10:58:37,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:37,617 INFO ]: Finished difference Result 180 states and 263 transitions. [2018-06-22 10:58:37,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 10:58:37,649 INFO ]: Start accepts. Automaton has 28 states. Word has length 65 [2018-06-22 10:58:37,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:37,652 INFO ]: With dead ends: 180 [2018-06-22 10:58:37,652 INFO ]: Without dead ends: 178 [2018-06-22 10:58:37,653 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=293, Invalid=1687, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 10:58:37,653 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-22 10:58:37,684 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 138. [2018-06-22 10:58:37,684 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 10:58:37,685 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2018-06-22 10:58:37,685 INFO ]: Start accepts. Automaton has 138 states and 218 transitions. Word has length 65 [2018-06-22 10:58:37,685 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:37,685 INFO ]: Abstraction has 138 states and 218 transitions. [2018-06-22 10:58:37,685 INFO ]: Interpolant automaton has 28 states. [2018-06-22 10:58:37,685 INFO ]: Start isEmpty. Operand 138 states and 218 transitions. [2018-06-22 10:58:37,686 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 10:58:37,686 INFO ]: Found error trace [2018-06-22 10:58:37,686 INFO ]: trace histogram [12, 11, 11, 11, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:37,687 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:37,687 INFO ]: Analyzing trace with hash -327440780, now seen corresponding path program 2 times [2018-06-22 10:58:37,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:37,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:37,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:37,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:37,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:37,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:37,862 INFO ]: Checked inductivity of 263 backedges. 24 proven. 68 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-06-22 10:58:37,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:37,862 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 10:58:37,871 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:37,892 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:37,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:37,896 INFO ]: Computing forward predicates... [2018-06-22 10:58:38,248 INFO ]: Checked inductivity of 263 backedges. 54 proven. 111 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-22 10:58:38,268 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:38,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 29 [2018-06-22 10:58:38,268 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:58:38,268 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:58:38,268 INFO ]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:58:38,269 INFO ]: Start difference. First operand 138 states and 218 transitions. Second operand 29 states. [2018-06-22 10:58:39,036 WARN ]: Spent 347.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2018-06-22 10:58:40,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:40,456 INFO ]: Finished difference Result 199 states and 285 transitions. [2018-06-22 10:58:40,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 10:58:40,456 INFO ]: Start accepts. Automaton has 29 states. Word has length 69 [2018-06-22 10:58:40,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:40,458 INFO ]: With dead ends: 199 [2018-06-22 10:58:40,458 INFO ]: Without dead ends: 186 [2018-06-22 10:58:40,459 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=378, Invalid=2814, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 10:58:40,459 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-22 10:58:40,469 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 138. [2018-06-22 10:58:40,469 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 10:58:40,470 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 207 transitions. [2018-06-22 10:58:40,470 INFO ]: Start accepts. Automaton has 138 states and 207 transitions. Word has length 69 [2018-06-22 10:58:40,471 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:40,471 INFO ]: Abstraction has 138 states and 207 transitions. [2018-06-22 10:58:40,471 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:58:40,471 INFO ]: Start isEmpty. Operand 138 states and 207 transitions. [2018-06-22 10:58:40,473 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 10:58:40,473 INFO ]: Found error trace [2018-06-22 10:58:40,473 INFO ]: trace histogram [12, 11, 11, 11, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:40,473 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:40,473 INFO ]: Analyzing trace with hash 2074550358, now seen corresponding path program 3 times [2018-06-22 10:58:40,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:40,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:40,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:40,474 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:40,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:40,483 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:40,784 INFO ]: Checked inductivity of 274 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-06-22 10:58:40,784 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:40,784 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 10:58:40,789 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:40,821 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-22 10:58:40,821 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:40,824 INFO ]: Computing forward predicates... [2018-06-22 10:58:41,044 INFO ]: Checked inductivity of 274 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-06-22 10:58:41,062 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:41,062 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-22 10:58:41,063 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:58:41,063 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:58:41,063 INFO ]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:58:41,063 INFO ]: Start difference. First operand 138 states and 207 transitions. Second operand 23 states. [2018-06-22 10:58:41,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:41,623 INFO ]: Finished difference Result 205 states and 282 transitions. [2018-06-22 10:58:41,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:58:41,623 INFO ]: Start accepts. Automaton has 23 states. Word has length 73 [2018-06-22 10:58:41,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:41,625 INFO ]: With dead ends: 205 [2018-06-22 10:58:41,625 INFO ]: Without dead ends: 188 [2018-06-22 10:58:41,626 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=1917, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 10:58:41,626 INFO ]: Start minimizeSevpa. Operand 188 states. [2018-06-22 10:58:41,637 INFO ]: Finished minimizeSevpa. Reduced states from 188 to 138. [2018-06-22 10:58:41,638 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 10:58:41,639 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 197 transitions. [2018-06-22 10:58:41,639 INFO ]: Start accepts. Automaton has 138 states and 197 transitions. Word has length 73 [2018-06-22 10:58:41,639 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:41,639 INFO ]: Abstraction has 138 states and 197 transitions. [2018-06-22 10:58:41,639 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:58:41,639 INFO ]: Start isEmpty. Operand 138 states and 197 transitions. [2018-06-22 10:58:41,642 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:58:41,642 INFO ]: Found error trace [2018-06-22 10:58:41,642 INFO ]: trace histogram [12, 11, 11, 11, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:41,642 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:41,642 INFO ]: Analyzing trace with hash 1940966584, now seen corresponding path program 4 times [2018-06-22 10:58:41,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:41,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:41,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:41,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:41,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:41,657 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:42,369 INFO ]: Checked inductivity of 289 backedges. 30 proven. 117 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-22 10:58:42,369 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:42,369 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 10:58:42,374 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:58:42,399 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:58:42,399 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:42,403 INFO ]: Computing forward predicates... [2018-06-22 10:58:42,892 INFO ]: Checked inductivity of 289 backedges. 70 proven. 101 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-22 10:58:42,911 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:42,911 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 34 [2018-06-22 10:58:42,911 INFO ]: Interpolant automaton has 34 states [2018-06-22 10:58:42,912 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 10:58:42,912 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 10:58:42,912 INFO ]: Start difference. First operand 138 states and 197 transitions. Second operand 34 states. [2018-06-22 10:58:45,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:45,121 INFO ]: Finished difference Result 241 states and 310 transitions. [2018-06-22 10:58:45,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 10:58:45,121 INFO ]: Start accepts. Automaton has 34 states. Word has length 77 [2018-06-22 10:58:45,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:45,123 INFO ]: With dead ends: 241 [2018-06-22 10:58:45,123 INFO ]: Without dead ends: 220 [2018-06-22 10:58:45,125 INFO ]: 0 DeclaredPredicates, 150 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=622, Invalid=5540, Unknown=0, NotChecked=0, Total=6162 [2018-06-22 10:58:45,125 INFO ]: Start minimizeSevpa. Operand 220 states. [2018-06-22 10:58:45,135 INFO ]: Finished minimizeSevpa. Reduced states from 220 to 138. [2018-06-22 10:58:45,135 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 10:58:45,136 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2018-06-22 10:58:45,136 INFO ]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 77 [2018-06-22 10:58:45,136 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:45,136 INFO ]: Abstraction has 138 states and 188 transitions. [2018-06-22 10:58:45,136 INFO ]: Interpolant automaton has 34 states. [2018-06-22 10:58:45,136 INFO ]: Start isEmpty. Operand 138 states and 188 transitions. [2018-06-22 10:58:45,137 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:58:45,137 INFO ]: Found error trace [2018-06-22 10:58:45,137 INFO ]: trace histogram [12, 11, 11, 11, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:45,138 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:45,138 INFO ]: Analyzing trace with hash 1867548108, now seen corresponding path program 5 times [2018-06-22 10:58:45,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:45,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:45,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:45,138 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:45,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:45,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:45,614 WARN ]: Spent 235.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-22 10:58:45,856 INFO ]: Checked inductivity of 308 backedges. 72 proven. 113 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-06-22 10:58:45,856 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:45,856 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 10:58:45,862 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:58:45,893 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 10:58:45,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:45,896 INFO ]: Computing forward predicates... [2018-06-22 10:58:46,235 INFO ]: Checked inductivity of 308 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-06-22 10:58:46,253 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:46,253 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 42 [2018-06-22 10:58:46,254 INFO ]: Interpolant automaton has 42 states [2018-06-22 10:58:46,254 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 10:58:46,254 INFO ]: CoverageRelationStatistics Valid=126, Invalid=1596, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 10:58:46,254 INFO ]: Start difference. First operand 138 states and 188 transitions. Second operand 42 states. [2018-06-22 10:58:48,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:48,456 INFO ]: Finished difference Result 224 states and 263 transitions. [2018-06-22 10:58:48,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 10:58:48,456 INFO ]: Start accepts. Automaton has 42 states. Word has length 81 [2018-06-22 10:58:48,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:48,457 INFO ]: With dead ends: 224 [2018-06-22 10:58:48,457 INFO ]: Without dead ends: 179 [2018-06-22 10:58:48,459 INFO ]: 0 DeclaredPredicates, 171 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=848, Invalid=5794, Unknown=0, NotChecked=0, Total=6642 [2018-06-22 10:58:48,459 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-22 10:58:48,467 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 135. [2018-06-22 10:58:48,467 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 10:58:48,468 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 171 transitions. [2018-06-22 10:58:48,468 INFO ]: Start accepts. Automaton has 135 states and 171 transitions. Word has length 81 [2018-06-22 10:58:48,468 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:48,468 INFO ]: Abstraction has 135 states and 171 transitions. [2018-06-22 10:58:48,468 INFO ]: Interpolant automaton has 42 states. [2018-06-22 10:58:48,469 INFO ]: Start isEmpty. Operand 135 states and 171 transitions. [2018-06-22 10:58:48,470 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:58:48,470 INFO ]: Found error trace [2018-06-22 10:58:48,470 INFO ]: trace histogram [12, 11, 11, 11, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:48,470 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:48,470 INFO ]: Analyzing trace with hash 277646234, now seen corresponding path program 5 times [2018-06-22 10:58:48,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:48,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:48,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:48,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:48,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:48,486 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:49,174 INFO ]: Checked inductivity of 308 backedges. 30 proven. 141 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-06-22 10:58:49,174 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:49,174 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 10:58:49,182 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:58:49,217 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 10:58:49,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:49,221 INFO ]: Computing forward predicates... [2018-06-22 10:58:49,695 INFO ]: Checked inductivity of 308 backedges. 30 proven. 137 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-06-22 10:58:49,714 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:49,714 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 32 [2018-06-22 10:58:49,714 INFO ]: Interpolant automaton has 32 states [2018-06-22 10:58:49,714 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 10:58:49,714 INFO ]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:58:49,714 INFO ]: Start difference. First operand 135 states and 171 transitions. Second operand 32 states. [2018-06-22 10:58:50,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:50,718 INFO ]: Finished difference Result 253 states and 300 transitions. [2018-06-22 10:58:50,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 10:58:50,718 INFO ]: Start accepts. Automaton has 32 states. Word has length 81 [2018-06-22 10:58:50,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:50,720 INFO ]: With dead ends: 253 [2018-06-22 10:58:50,720 INFO ]: Without dead ends: 240 [2018-06-22 10:58:50,721 INFO ]: 0 DeclaredPredicates, 148 GetRequests, 69 SyntacticMatches, 13 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=439, Invalid=4117, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 10:58:50,721 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-22 10:58:50,733 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 134. [2018-06-22 10:58:50,733 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-22 10:58:50,734 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 168 transitions. [2018-06-22 10:58:50,734 INFO ]: Start accepts. Automaton has 134 states and 168 transitions. Word has length 81 [2018-06-22 10:58:50,734 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:50,734 INFO ]: Abstraction has 134 states and 168 transitions. [2018-06-22 10:58:50,734 INFO ]: Interpolant automaton has 32 states. [2018-06-22 10:58:50,734 INFO ]: Start isEmpty. Operand 134 states and 168 transitions. [2018-06-22 10:58:50,735 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 10:58:50,735 INFO ]: Found error trace [2018-06-22 10:58:50,735 INFO ]: trace histogram [12, 11, 11, 11, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:50,735 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:50,735 INFO ]: Analyzing trace with hash 415890160, now seen corresponding path program 6 times [2018-06-22 10:58:50,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:50,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:50,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:50,737 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:50,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:50,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:51,266 INFO ]: Checked inductivity of 331 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-06-22 10:58:51,266 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:51,266 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 10:58:51,272 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:58:51,315 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 10:58:51,315 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:51,319 INFO ]: Computing forward predicates... [2018-06-22 10:58:51,697 INFO ]: Checked inductivity of 331 backedges. 98 proven. 90 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-06-22 10:58:51,715 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:51,716 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 37 [2018-06-22 10:58:51,716 INFO ]: Interpolant automaton has 37 states [2018-06-22 10:58:51,716 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 10:58:51,716 INFO ]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 10:58:51,716 INFO ]: Start difference. First operand 134 states and 168 transitions. Second operand 37 states. [2018-06-22 10:58:53,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:53,419 INFO ]: Finished difference Result 206 states and 240 transitions. [2018-06-22 10:58:53,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 10:58:53,486 INFO ]: Start accepts. Automaton has 37 states. Word has length 85 [2018-06-22 10:58:53,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:53,487 INFO ]: With dead ends: 206 [2018-06-22 10:58:53,487 INFO ]: Without dead ends: 150 [2018-06-22 10:58:53,488 INFO ]: 0 DeclaredPredicates, 167 GetRequests, 82 SyntacticMatches, 12 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=805, Invalid=4745, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 10:58:53,488 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 10:58:53,494 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 134. [2018-06-22 10:58:53,494 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-22 10:58:53,495 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2018-06-22 10:58:53,495 INFO ]: Start accepts. Automaton has 134 states and 167 transitions. Word has length 85 [2018-06-22 10:58:53,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:53,495 INFO ]: Abstraction has 134 states and 167 transitions. [2018-06-22 10:58:53,495 INFO ]: Interpolant automaton has 37 states. [2018-06-22 10:58:53,495 INFO ]: Start isEmpty. Operand 134 states and 167 transitions. [2018-06-22 10:58:53,497 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 10:58:53,497 INFO ]: Found error trace [2018-06-22 10:58:53,497 INFO ]: trace histogram [12, 11, 11, 11, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:53,497 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:53,497 INFO ]: Analyzing trace with hash 561396988, now seen corresponding path program 6 times [2018-06-22 10:58:53,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:53,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:53,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:53,497 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:53,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:53,509 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:54,520 INFO ]: Checked inductivity of 331 backedges. 13 proven. 180 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-06-22 10:58:54,520 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:54,520 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 10:58:54,526 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:58:54,557 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 10:58:54,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:54,561 INFO ]: Computing forward predicates... [2018-06-22 10:58:55,077 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-22 10:58:55,365 INFO ]: Checked inductivity of 331 backedges. 28 proven. 160 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-06-22 10:58:55,393 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:55,393 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 42 [2018-06-22 10:58:55,393 INFO ]: Interpolant automaton has 42 states [2018-06-22 10:58:55,393 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 10:58:55,394 INFO ]: CoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 10:58:55,394 INFO ]: Start difference. First operand 134 states and 167 transitions. Second operand 42 states. [2018-06-22 10:58:57,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:57,752 INFO ]: Finished difference Result 294 states and 343 transitions. [2018-06-22 10:58:57,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-06-22 10:58:57,752 INFO ]: Start accepts. Automaton has 42 states. Word has length 85 [2018-06-22 10:58:57,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:57,753 INFO ]: With dead ends: 294 [2018-06-22 10:58:57,753 INFO ]: Without dead ends: 282 [2018-06-22 10:58:57,754 INFO ]: 0 DeclaredPredicates, 188 GetRequests, 69 SyntacticMatches, 15 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3202 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1114, Invalid=10016, Unknown=0, NotChecked=0, Total=11130 [2018-06-22 10:58:57,754 INFO ]: Start minimizeSevpa. Operand 282 states. [2018-06-22 10:58:57,762 INFO ]: Finished minimizeSevpa. Reduced states from 282 to 134. [2018-06-22 10:58:57,762 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-22 10:58:57,763 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2018-06-22 10:58:57,763 INFO ]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 85 [2018-06-22 10:58:57,763 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:57,763 INFO ]: Abstraction has 134 states and 166 transitions. [2018-06-22 10:58:57,764 INFO ]: Interpolant automaton has 42 states. [2018-06-22 10:58:57,764 INFO ]: Start isEmpty. Operand 134 states and 166 transitions. [2018-06-22 10:58:57,765 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:58:57,765 INFO ]: Found error trace [2018-06-22 10:58:57,765 INFO ]: trace histogram [12, 11, 11, 11, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:57,765 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:57,765 INFO ]: Analyzing trace with hash -151928610, now seen corresponding path program 7 times [2018-06-22 10:58:57,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:57,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:57,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:57,767 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:57,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:57,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:58,956 INFO ]: Checked inductivity of 358 backedges. 12 proven. 195 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-06-22 10:58:58,956 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:58,956 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 10:58:58,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:58,993 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:58,997 INFO ]: Computing forward predicates... [2018-06-22 10:58:59,488 INFO ]: Checked inductivity of 358 backedges. 64 proven. 101 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-06-22 10:58:59,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:59,507 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 43 [2018-06-22 10:58:59,507 INFO ]: Interpolant automaton has 43 states [2018-06-22 10:58:59,507 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 10:58:59,508 INFO ]: CoverageRelationStatistics Valid=170, Invalid=1636, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 10:58:59,508 INFO ]: Start difference. First operand 134 states and 166 transitions. Second operand 43 states. [2018-06-22 10:59:01,426 WARN ]: Spent 431.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2018-06-22 10:59:04,170 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:04,170 INFO ]: Finished difference Result 295 states and 386 transitions. [2018-06-22 10:59:04,170 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-06-22 10:59:04,170 INFO ]: Start accepts. Automaton has 43 states. Word has length 89 [2018-06-22 10:59:04,170 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:04,172 INFO ]: With dead ends: 295 [2018-06-22 10:59:04,172 INFO ]: Without dead ends: 278 [2018-06-22 10:59:04,173 INFO ]: 0 DeclaredPredicates, 204 GetRequests, 77 SyntacticMatches, 12 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3770 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1487, Invalid=12085, Unknown=0, NotChecked=0, Total=13572 [2018-06-22 10:59:04,174 INFO ]: Start minimizeSevpa. Operand 278 states. [2018-06-22 10:59:04,185 INFO ]: Finished minimizeSevpa. Reduced states from 278 to 148. [2018-06-22 10:59:04,185 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 10:59:04,187 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 201 transitions. [2018-06-22 10:59:04,187 INFO ]: Start accepts. Automaton has 148 states and 201 transitions. Word has length 89 [2018-06-22 10:59:04,187 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:04,187 INFO ]: Abstraction has 148 states and 201 transitions. [2018-06-22 10:59:04,187 INFO ]: Interpolant automaton has 43 states. [2018-06-22 10:59:04,187 INFO ]: Start isEmpty. Operand 148 states and 201 transitions. [2018-06-22 10:59:04,188 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:59:04,188 INFO ]: Found error trace [2018-06-22 10:59:04,188 INFO ]: trace histogram [12, 11, 11, 11, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:04,188 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:04,189 INFO ]: Analyzing trace with hash 291194132, now seen corresponding path program 7 times [2018-06-22 10:59:04,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:04,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:04,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:04,189 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:04,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:04,202 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:04,547 INFO ]: Checked inductivity of 358 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-06-22 10:59:04,547 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:04,547 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:04,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:04,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:04,584 INFO ]: Computing forward predicates... [2018-06-22 10:59:04,689 INFO ]: Checked inductivity of 358 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-06-22 10:59:04,708 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:04,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 23 [2018-06-22 10:59:04,708 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:59:04,708 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:59:04,708 INFO ]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:59:04,708 INFO ]: Start difference. First operand 148 states and 201 transitions. Second operand 23 states. [2018-06-22 10:59:05,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:05,730 INFO ]: Finished difference Result 192 states and 247 transitions. [2018-06-22 10:59:05,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 10:59:05,737 INFO ]: Start accepts. Automaton has 23 states. Word has length 89 [2018-06-22 10:59:05,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:05,738 INFO ]: With dead ends: 192 [2018-06-22 10:59:05,738 INFO ]: Without dead ends: 166 [2018-06-22 10:59:05,738 INFO ]: 0 DeclaredPredicates, 161 GetRequests, 99 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=2284, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 10:59:05,738 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 10:59:05,744 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 148. [2018-06-22 10:59:05,744 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 10:59:05,745 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 196 transitions. [2018-06-22 10:59:05,745 INFO ]: Start accepts. Automaton has 148 states and 196 transitions. Word has length 89 [2018-06-22 10:59:05,745 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:05,745 INFO ]: Abstraction has 148 states and 196 transitions. [2018-06-22 10:59:05,745 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:59:05,745 INFO ]: Start isEmpty. Operand 148 states and 196 transitions. [2018-06-22 10:59:05,747 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:59:05,747 INFO ]: Found error trace [2018-06-22 10:59:05,747 INFO ]: trace histogram [12, 11, 11, 11, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:05,747 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:05,747 INFO ]: Analyzing trace with hash -211016648, now seen corresponding path program 8 times [2018-06-22 10:59:05,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:05,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:05,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:05,747 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:05,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:05,761 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:06,407 INFO ]: Checked inductivity of 389 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-06-22 10:59:06,407 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:06,407 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 10:59:06,414 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:59:06,441 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:59:06,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:06,444 INFO ]: Computing forward predicates... [2018-06-22 10:59:06,562 INFO ]: Checked inductivity of 389 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-06-22 10:59:06,581 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:06,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 23 [2018-06-22 10:59:06,581 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:59:06,581 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:59:06,581 INFO ]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:59:06,581 INFO ]: Start difference. First operand 148 states and 196 transitions. Second operand 23 states. [2018-06-22 10:59:08,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:08,035 INFO ]: Finished difference Result 192 states and 242 transitions. [2018-06-22 10:59:08,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:59:08,035 INFO ]: Start accepts. Automaton has 23 states. Word has length 93 [2018-06-22 10:59:08,035 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:08,036 INFO ]: With dead ends: 192 [2018-06-22 10:59:08,036 INFO ]: Without dead ends: 166 [2018-06-22 10:59:08,036 INFO ]: 0 DeclaredPredicates, 160 GetRequests, 102 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=282, Invalid=1974, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 10:59:08,036 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 10:59:08,043 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 148. [2018-06-22 10:59:08,043 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 10:59:08,044 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2018-06-22 10:59:08,044 INFO ]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 93 [2018-06-22 10:59:08,044 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:08,044 INFO ]: Abstraction has 148 states and 191 transitions. [2018-06-22 10:59:08,044 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:59:08,044 INFO ]: Start isEmpty. Operand 148 states and 191 transitions. [2018-06-22 10:59:08,045 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:59:08,045 INFO ]: Found error trace [2018-06-22 10:59:08,045 INFO ]: trace histogram [12, 11, 11, 11, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:08,045 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:08,045 INFO ]: Analyzing trace with hash -792004800, now seen corresponding path program 8 times [2018-06-22 10:59:08,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:08,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:08,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:08,046 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:08,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:08,057 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:08,468 INFO ]: Checked inductivity of 389 backedges. 11 proven. 212 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-06-22 10:59:08,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:08,468 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 10:59:08,473 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:59:08,504 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:59:08,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:08,507 INFO ]: Computing forward predicates... [2018-06-22 10:59:09,054 INFO ]: Checked inductivity of 389 backedges. 54 proven. 105 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-06-22 10:59:09,084 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:09,084 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21] total 44 [2018-06-22 10:59:09,084 INFO ]: Interpolant automaton has 44 states [2018-06-22 10:59:09,084 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 10:59:09,084 INFO ]: CoverageRelationStatistics Valid=172, Invalid=1720, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:59:09,084 INFO ]: Start difference. First operand 148 states and 191 transitions. Second operand 44 states. [2018-06-22 10:59:12,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:12,768 INFO ]: Finished difference Result 327 states and 386 transitions. [2018-06-22 10:59:12,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-06-22 10:59:12,768 INFO ]: Start accepts. Automaton has 44 states. Word has length 93 [2018-06-22 10:59:12,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:12,770 INFO ]: With dead ends: 327 [2018-06-22 10:59:12,770 INFO ]: Without dead ends: 308 [2018-06-22 10:59:12,772 INFO ]: 0 DeclaredPredicates, 221 GetRequests, 82 SyntacticMatches, 12 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4822 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1789, Invalid=14723, Unknown=0, NotChecked=0, Total=16512 [2018-06-22 10:59:12,773 INFO ]: Start minimizeSevpa. Operand 308 states. [2018-06-22 10:59:12,783 INFO ]: Finished minimizeSevpa. Reduced states from 308 to 148. [2018-06-22 10:59:12,783 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 10:59:12,784 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 187 transitions. [2018-06-22 10:59:12,784 INFO ]: Start accepts. Automaton has 148 states and 187 transitions. Word has length 93 [2018-06-22 10:59:12,784 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:12,784 INFO ]: Abstraction has 148 states and 187 transitions. [2018-06-22 10:59:12,784 INFO ]: Interpolant automaton has 44 states. [2018-06-22 10:59:12,784 INFO ]: Start isEmpty. Operand 148 states and 187 transitions. [2018-06-22 10:59:12,785 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:59:12,785 INFO ]: Found error trace [2018-06-22 10:59:12,785 INFO ]: trace histogram [12, 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 10:59:12,785 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:12,785 INFO ]: Analyzing trace with hash -1309386660, now seen corresponding path program 9 times [2018-06-22 10:59:12,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:12,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:12,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:12,787 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:12,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:12,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:13,575 WARN ]: Spent 506.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-06-22 10:59:13,744 INFO ]: Checked inductivity of 424 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-06-22 10:59:13,744 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:13,744 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 10:59:13,750 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:59:13,922 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-22 10:59:13,922 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:13,927 INFO ]: Computing forward predicates... [2018-06-22 10:59:14,534 INFO ]: Checked inductivity of 424 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-06-22 10:59:14,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:14,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-22 10:59:14,553 INFO ]: Interpolant automaton has 21 states [2018-06-22 10:59:14,553 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 10:59:14,553 INFO ]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:59:14,553 INFO ]: Start difference. First operand 148 states and 187 transitions. Second operand 21 states. Received shutdown request... [2018-06-22 10:59:14,612 WARN ]: Removed 2 from assertion stack [2018-06-22 10:59:14,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 10:59:14,612 WARN ]: Verification canceled [2018-06-22 10:59:14,701 WARN ]: Timeout [2018-06-22 10:59:14,704 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:59:14 BoogieIcfgContainer [2018-06-22 10:59:14,704 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:59:14,705 INFO ]: Toolchain (without parser) took 58845.70 ms. Allocated memory was 303.0 MB in the beginning and 794.8 MB in the end (delta: 491.8 MB). Free memory was 259.4 MB in the beginning and 767.6 MB in the end (delta: -508.2 MB). Peak memory consumption was 150.6 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:14,705 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:59:14,706 INFO ]: ChcToBoogie took 48.57 ms. Allocated memory is still 303.0 MB. Free memory was 259.4 MB in the beginning and 257.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:14,706 INFO ]: Boogie Preprocessor took 36.40 ms. Allocated memory is still 303.0 MB. Free memory was 257.4 MB in the beginning and 256.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 10:59:14,706 INFO ]: RCFGBuilder took 204.58 ms. Allocated memory is still 303.0 MB. Free memory was 256.4 MB in the beginning and 248.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:14,707 INFO ]: TraceAbstraction took 58547.75 ms. Allocated memory was 303.0 MB in the beginning and 794.8 MB in the end (delta: 491.8 MB). Free memory was 248.5 MB in the beginning and 767.6 MB in the end (delta: -519.2 MB). Peak memory consumption was 139.6 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:14,710 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 48.57 ms. Allocated memory is still 303.0 MB. Free memory was 259.4 MB in the beginning and 257.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 36.40 ms. Allocated memory is still 303.0 MB. Free memory was 257.4 MB in the beginning and 256.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 204.58 ms. Allocated memory is still 303.0 MB. Free memory was 256.4 MB in the beginning and 248.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58547.75 ms. Allocated memory was 303.0 MB in the beginning and 794.8 MB in the end (delta: 491.8 MB). Free memory was 248.5 MB in the beginning and 767.6 MB in the end (delta: -519.2 MB). Peak memory consumption was 139.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 constructing difference of abstraction (148states) and interpolant automaton (currently 5 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 23. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. TIMEOUT Result, 58.4s OverallTime, 34 OverallIterations, 12 TraceHistogramMax, 35.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1203 SDtfs, 1263 SDslu, 14156 SDs, 0 SdLazy, 17632 SolverSat, 3578 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3250 GetRequests, 1753 SyntacticMatches, 162 SemanticMatches, 1334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21781 ImplicationChecksByTransitivity, 38.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=30, 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.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 1006 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 19.5s InterpolantComputationTime, 3649 NumberOfCodeBlocks, 3645 NumberOfCodeBlocksAsserted, 180 NumberOfCheckSat, 3584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1112556 SizeOfPredicates, 280 NumberOfNonLiveVariables, 5895 ConjunctsInSsa, 1439 ConjunctsInUnsatCore, 65 InterpolantComputations, 4 PerfectInterpolantSequences, 6731/11468 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/break_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-59-14-728.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-59-14-728.csv Completed graceful shutdown