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_single_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:59:17,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:59:17,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:59:17,799 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:59:17,799 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:59:17,800 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:59:17,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:59:17,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:59:17,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:59:17,810 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:59:17,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:59:17,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:59:17,812 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:59:17,813 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:59:17,813 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:59:17,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:59:17,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:59:17,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:59:17,824 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:59:17,825 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:59:17,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:59:17,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:59:17,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:59:17,829 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:59:17,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:59:17,830 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:59:17,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:59:17,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:59:17,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:59:17,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:59:17,834 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:59:17,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:59:17,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:59:17,835 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:59:17,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:59:17,836 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:59:17,860 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:59:17,861 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:59:17,861 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:59:17,861 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:59:17,862 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:59:17,862 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:59:17,863 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:59:17,863 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:59:17,863 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:59:17,863 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:59:17,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:59:17,863 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:59:17,865 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:59:17,865 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:59:17,865 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:59:17,865 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:59:17,866 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:59:17,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:59:17,866 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:59:17,867 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:59:17,868 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:59:17,913 INFO ]: Repository-Root is: /tmp [2018-06-22 10:59:17,929 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:59:17,934 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:59:17,935 INFO ]: Initializing SmtParser... [2018-06-22 10:59:17,935 INFO ]: SmtParser initialized [2018-06-22 10:59:17,936 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 [2018-06-22 10:59:17,937 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:59:18,023 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 unknown [2018-06-22 10:59:18,183 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 [2018-06-22 10:59:18,188 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:59:18,195 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:59:18,196 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:59:18,196 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:59:18,197 INFO ]: ChcToBoogie initialized [2018-06-22 10:59:18,200 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:59:18" (1/1) ... [2018-06-22 10:59:18,246 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:18 Unit [2018-06-22 10:59:18,246 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:59:18,246 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:59:18,246 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:59:18,246 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:59:18,268 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:18" (1/1) ... [2018-06-22 10:59:18,269 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:18" (1/1) ... [2018-06-22 10:59:18,275 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:18" (1/1) ... [2018-06-22 10:59:18,276 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:18" (1/1) ... [2018-06-22 10:59:18,278 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:18" (1/1) ... [2018-06-22 10:59:18,279 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:18" (1/1) ... [2018-06-22 10:59:18,280 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:18" (1/1) ... [2018-06-22 10:59:18,282 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:59:18,282 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:59:18,282 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:59:18,282 INFO ]: RCFGBuilder initialized [2018-06-22 10:59:18,283 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:18" (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:59:18,297 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:59:18,297 INFO ]: Found specification of procedure False [2018-06-22 10:59:18,297 INFO ]: Found implementation of procedure False [2018-06-22 10:59:18,297 INFO ]: Specification and implementation of procedure inv_main11 given in one single declaration [2018-06-22 10:59:18,297 INFO ]: Found specification of procedure inv_main11 [2018-06-22 10:59:18,297 INFO ]: Found implementation of procedure inv_main11 [2018-06-22 10:59:18,297 INFO ]: Specification and implementation of procedure inv_main10 given in one single declaration [2018-06-22 10:59:18,297 INFO ]: Found specification of procedure inv_main10 [2018-06-22 10:59:18,297 INFO ]: Found implementation of procedure inv_main10 [2018-06-22 10:59:18,297 INFO ]: Specification and implementation of procedure inv_main4 given in one single declaration [2018-06-22 10:59:18,297 INFO ]: Found specification of procedure inv_main4 [2018-06-22 10:59:18,297 INFO ]: Found implementation of procedure inv_main4 [2018-06-22 10:59:18,297 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:59:18,297 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:59:18,297 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:59:18,453 INFO ]: Using library mode [2018-06-22 10:59:18,454 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:59:18 BoogieIcfgContainer [2018-06-22 10:59:18,454 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:59:18,456 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:59:18,456 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:59:18,459 INFO ]: TraceAbstraction initialized [2018-06-22 10:59:18,461 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:59:18" (1/3) ... [2018-06-22 10:59:18,462 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a3586e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:59:18, skipping insertion in model container [2018-06-22 10:59:18,462 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:18" (2/3) ... [2018-06-22 10:59:18,462 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a3586e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:59:18, skipping insertion in model container [2018-06-22 10:59:18,462 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:59:18" (3/3) ... [2018-06-22 10:59:18,464 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:59:18,474 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:59:18,484 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:59:18,533 INFO ]: Using default assertion order modulation [2018-06-22 10:59:18,534 INFO ]: Interprodecural is true [2018-06-22 10:59:18,534 INFO ]: Hoare is false [2018-06-22 10:59:18,534 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:59:18,534 INFO ]: Backedges is TWOTRACK [2018-06-22 10:59:18,534 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:59:18,534 INFO ]: Difference is false [2018-06-22 10:59:18,534 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:59:18,534 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:59:18,554 INFO ]: Start isEmpty. Operand 23 states. [2018-06-22 10:59:18,573 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 10:59:18,574 INFO ]: Found error trace [2018-06-22 10:59:18,575 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:18,575 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:18,579 INFO ]: Analyzing trace with hash -1063997456, now seen corresponding path program 1 times [2018-06-22 10:59:18,581 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:18,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:18,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:18,618 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:18,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:18,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:18,888 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:59:18,890 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:18,890 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:59:18,891 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:59:18,901 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:59:18,901 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:59:18,902 INFO ]: Start difference. First operand 23 states. Second operand 7 states. [2018-06-22 10:59:19,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:19,109 INFO ]: Finished difference Result 29 states and 37 transitions. [2018-06-22 10:59:19,111 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:59:19,112 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 10:59:19,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:19,125 INFO ]: With dead ends: 29 [2018-06-22 10:59:19,125 INFO ]: Without dead ends: 27 [2018-06-22 10:59:19,127 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:59:19,146 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 10:59:19,188 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 10:59:19,189 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 10:59:19,191 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-06-22 10:59:19,193 INFO ]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-06-22 10:59:19,193 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:19,193 INFO ]: Abstraction has 25 states and 32 transitions. [2018-06-22 10:59:19,193 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:59:19,193 INFO ]: Start isEmpty. Operand 25 states and 32 transitions. [2018-06-22 10:59:19,195 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:59:19,196 INFO ]: Found error trace [2018-06-22 10:59:19,196 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:59:19,196 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:19,196 INFO ]: Analyzing trace with hash -1779865414, now seen corresponding path program 1 times [2018-06-22 10:59:19,196 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:19,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:19,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:19,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:19,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:19,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:19,367 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:59:19,367 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:19,367 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 10:59:19,368 INFO ]: Interpolant automaton has 4 states [2018-06-22 10:59:19,368 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 10:59:19,368 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:59:19,369 INFO ]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2018-06-22 10:59:19,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:19,597 INFO ]: Finished difference Result 27 states and 34 transitions. [2018-06-22 10:59:19,597 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 10:59:19,597 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 10:59:19,597 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:19,598 INFO ]: With dead ends: 27 [2018-06-22 10:59:19,598 INFO ]: Without dead ends: 27 [2018-06-22 10:59:19,599 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 10:59:19,599 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 10:59:19,608 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 10:59:19,608 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 10:59:19,609 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-06-22 10:59:19,609 INFO ]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 21 [2018-06-22 10:59:19,609 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:19,609 INFO ]: Abstraction has 25 states and 31 transitions. [2018-06-22 10:59:19,609 INFO ]: Interpolant automaton has 4 states. [2018-06-22 10:59:19,609 INFO ]: Start isEmpty. Operand 25 states and 31 transitions. [2018-06-22 10:59:19,614 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:59:19,614 INFO ]: Found error trace [2018-06-22 10:59:19,614 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:59:19,614 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:19,614 INFO ]: Analyzing trace with hash 18592983, now seen corresponding path program 1 times [2018-06-22 10:59:19,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:19,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:19,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:19,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:19,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:19,636 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:19,892 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:59:19,892 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:19,892 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 10:59:19,893 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:59:19,893 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:59:19,893 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:59:19,893 INFO ]: Start difference. First operand 25 states and 31 transitions. Second operand 6 states. [2018-06-22 10:59:20,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:20,068 INFO ]: Finished difference Result 29 states and 36 transitions. [2018-06-22 10:59:20,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:59:20,069 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 10:59:20,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:20,070 INFO ]: With dead ends: 29 [2018-06-22 10:59:20,070 INFO ]: Without dead ends: 27 [2018-06-22 10:59:20,070 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:59:20,070 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 10:59:20,075 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 10:59:20,075 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 10:59:20,076 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-06-22 10:59:20,076 INFO ]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 21 [2018-06-22 10:59:20,076 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:20,076 INFO ]: Abstraction has 23 states and 28 transitions. [2018-06-22 10:59:20,076 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:59:20,077 INFO ]: Start isEmpty. Operand 23 states and 28 transitions. [2018-06-22 10:59:20,077 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:59:20,077 INFO ]: Found error trace [2018-06-22 10:59:20,078 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:59:20,078 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:20,078 INFO ]: Analyzing trace with hash -1679338540, now seen corresponding path program 1 times [2018-06-22 10:59:20,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:20,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:20,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:20,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:20,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:20,085 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:20,219 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:59:20,219 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:20,219 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:59:20,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:20,245 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:20,251 INFO ]: Computing forward predicates... [2018-06-22 10:59:20,797 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:59:20,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:20,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-22 10:59:20,834 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:59:20,834 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:59:20,834 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:59:20,835 INFO ]: Start difference. First operand 23 states and 28 transitions. Second operand 12 states. [2018-06-22 10:59:21,337 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:21,337 INFO ]: Finished difference Result 31 states and 38 transitions. [2018-06-22 10:59:21,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:59:21,338 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 10:59:21,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:21,339 INFO ]: With dead ends: 31 [2018-06-22 10:59:21,339 INFO ]: Without dead ends: 31 [2018-06-22 10:59:21,340 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:59:21,340 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 10:59:21,346 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 10:59:21,346 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 10:59:21,347 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-06-22 10:59:21,347 INFO ]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2018-06-22 10:59:21,347 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:21,347 INFO ]: Abstraction has 27 states and 33 transitions. [2018-06-22 10:59:21,347 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:59:21,347 INFO ]: Start isEmpty. Operand 27 states and 33 transitions. [2018-06-22 10:59:21,348 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:59:21,348 INFO ]: Found error trace [2018-06-22 10:59:21,348 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:21,348 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:21,348 INFO ]: Analyzing trace with hash -1234688581, now seen corresponding path program 1 times [2018-06-22 10:59:21,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:21,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:21,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:21,349 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:21,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:21,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:21,469 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:59:21,469 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:21,469 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:59:21,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:21,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:21,506 INFO ]: Computing forward predicates... [2018-06-22 10:59:21,914 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:59:21,943 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:21,943 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 15 [2018-06-22 10:59:21,944 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:59:21,944 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:59:21,944 INFO ]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:59:21,944 INFO ]: Start difference. First operand 27 states and 33 transitions. Second operand 15 states. [2018-06-22 10:59:22,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:22,359 INFO ]: Finished difference Result 39 states and 45 transitions. [2018-06-22 10:59:22,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:59:22,361 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 10:59:22,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:22,362 INFO ]: With dead ends: 39 [2018-06-22 10:59:22,362 INFO ]: Without dead ends: 35 [2018-06-22 10:59:22,363 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:59:22,363 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 10:59:22,368 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-22 10:59:22,368 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 10:59:22,369 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-06-22 10:59:22,369 INFO ]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 25 [2018-06-22 10:59:22,369 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:22,369 INFO ]: Abstraction has 29 states and 35 transitions. [2018-06-22 10:59:22,369 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:59:22,369 INFO ]: Start isEmpty. Operand 29 states and 35 transitions. [2018-06-22 10:59:22,370 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:59:22,370 INFO ]: Found error trace [2018-06-22 10:59:22,370 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:22,370 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:22,370 INFO ]: Analyzing trace with hash 11178370, now seen corresponding path program 1 times [2018-06-22 10:59:22,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:22,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:22,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:22,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:22,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:22,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:22,441 INFO ]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:59:22,441 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:22,441 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:59:22,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:22,464 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:22,466 INFO ]: Computing forward predicates... [2018-06-22 10:59:22,497 INFO ]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:59:22,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:22,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 10:59:22,518 INFO ]: Interpolant automaton has 10 states [2018-06-22 10:59:22,518 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 10:59:22,518 INFO ]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:59:22,518 INFO ]: Start difference. First operand 29 states and 35 transitions. Second operand 10 states. [2018-06-22 10:59:22,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:22,613 INFO ]: Finished difference Result 35 states and 43 transitions. [2018-06-22 10:59:22,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:59:22,616 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 10:59:22,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:22,618 INFO ]: With dead ends: 35 [2018-06-22 10:59:22,618 INFO ]: Without dead ends: 35 [2018-06-22 10:59:22,618 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:59:22,619 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 10:59:22,624 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-06-22 10:59:22,624 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 10:59:22,625 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-06-22 10:59:22,625 INFO ]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2018-06-22 10:59:22,625 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:22,625 INFO ]: Abstraction has 31 states and 38 transitions. [2018-06-22 10:59:22,625 INFO ]: Interpolant automaton has 10 states. [2018-06-22 10:59:22,625 INFO ]: Start isEmpty. Operand 31 states and 38 transitions. [2018-06-22 10:59:22,626 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:59:22,626 INFO ]: Found error trace [2018-06-22 10:59:22,626 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:22,626 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:22,626 INFO ]: Analyzing trace with hash -1171369275, now seen corresponding path program 2 times [2018-06-22 10:59:22,626 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:22,626 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:22,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:22,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:22,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:22,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:22,741 INFO ]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:59:22,741 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:22,741 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:59:22,750 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:59:22,767 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:59:22,767 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:22,770 INFO ]: Computing forward predicates... [2018-06-22 10:59:23,037 INFO ]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:59:23,068 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:23,068 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 17 [2018-06-22 10:59:23,069 INFO ]: Interpolant automaton has 17 states [2018-06-22 10:59:23,069 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 10:59:23,069 INFO ]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:59:23,069 INFO ]: Start difference. First operand 31 states and 38 transitions. Second operand 17 states. [2018-06-22 10:59:23,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:23,562 INFO ]: Finished difference Result 45 states and 52 transitions. [2018-06-22 10:59:23,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:59:23,562 INFO ]: Start accepts. Automaton has 17 states. Word has length 29 [2018-06-22 10:59:23,563 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:23,564 INFO ]: With dead ends: 45 [2018-06-22 10:59:23,564 INFO ]: Without dead ends: 41 [2018-06-22 10:59:23,564 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:59:23,564 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 10:59:23,569 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-06-22 10:59:23,569 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 10:59:23,570 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-06-22 10:59:23,570 INFO ]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 29 [2018-06-22 10:59:23,570 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:23,570 INFO ]: Abstraction has 33 states and 40 transitions. [2018-06-22 10:59:23,570 INFO ]: Interpolant automaton has 17 states. [2018-06-22 10:59:23,570 INFO ]: Start isEmpty. Operand 33 states and 40 transitions. [2018-06-22 10:59:23,571 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:59:23,571 INFO ]: Found error trace [2018-06-22 10:59:23,571 INFO ]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:23,571 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:23,572 INFO ]: Analyzing trace with hash -1324418586, now seen corresponding path program 2 times [2018-06-22 10:59:23,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:23,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:23,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:23,572 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:23,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:23,580 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:23,636 INFO ]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 10:59:23,636 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:23,636 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:59:23,644 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:59:23,654 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:59:23,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:23,656 INFO ]: Computing forward predicates... [2018-06-22 10:59:23,683 INFO ]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 10:59:23,701 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:23,701 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 10:59:23,702 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:59:23,702 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:59:23,702 INFO ]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:59:23,702 INFO ]: Start difference. First operand 33 states and 40 transitions. Second operand 11 states. [2018-06-22 10:59:23,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:23,788 INFO ]: Finished difference Result 39 states and 48 transitions. [2018-06-22 10:59:23,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:59:23,789 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-22 10:59:23,789 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:23,790 INFO ]: With dead ends: 39 [2018-06-22 10:59:23,790 INFO ]: Without dead ends: 39 [2018-06-22 10:59:23,790 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:59:23,790 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 10:59:23,795 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-06-22 10:59:23,795 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 10:59:23,796 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-06-22 10:59:23,796 INFO ]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 33 [2018-06-22 10:59:23,796 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:23,796 INFO ]: Abstraction has 35 states and 43 transitions. [2018-06-22 10:59:23,796 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:59:23,796 INFO ]: Start isEmpty. Operand 35 states and 43 transitions. [2018-06-22 10:59:23,797 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:59:23,797 INFO ]: Found error trace [2018-06-22 10:59:23,797 INFO ]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:23,797 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:23,798 INFO ]: Analyzing trace with hash -1804524849, now seen corresponding path program 3 times [2018-06-22 10:59:23,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:23,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:23,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:23,798 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:23,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:23,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:23,912 INFO ]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 10:59:23,912 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:23,912 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:23,919 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:59:23,937 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 10:59:23,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:23,939 INFO ]: Computing forward predicates... [2018-06-22 10:59:24,148 INFO ]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 10:59:24,166 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:24,166 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-06-22 10:59:24,167 INFO ]: Interpolant automaton has 17 states [2018-06-22 10:59:24,167 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 10:59:24,167 INFO ]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:59:24,167 INFO ]: Start difference. First operand 35 states and 43 transitions. Second operand 17 states. [2018-06-22 10:59:24,545 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:24,545 INFO ]: Finished difference Result 45 states and 52 transitions. [2018-06-22 10:59:24,545 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:59:24,545 INFO ]: Start accepts. Automaton has 17 states. Word has length 33 [2018-06-22 10:59:24,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:24,547 INFO ]: With dead ends: 45 [2018-06-22 10:59:24,547 INFO ]: Without dead ends: 39 [2018-06-22 10:59:24,547 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:59:24,547 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 10:59:24,552 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-06-22 10:59:24,552 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 10:59:24,553 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-06-22 10:59:24,553 INFO ]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 33 [2018-06-22 10:59:24,553 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:24,553 INFO ]: Abstraction has 37 states and 44 transitions. [2018-06-22 10:59:24,553 INFO ]: Interpolant automaton has 17 states. [2018-06-22 10:59:24,553 INFO ]: Start isEmpty. Operand 37 states and 44 transitions. [2018-06-22 10:59:24,554 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 10:59:24,554 INFO ]: Found error trace [2018-06-22 10:59:24,555 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:59:24,555 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:24,555 INFO ]: Analyzing trace with hash -1050502582, now seen corresponding path program 3 times [2018-06-22 10:59:24,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:24,555 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:24,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:24,555 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:24,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:24,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:24,669 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:59:24,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:24,670 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:59:24,676 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:59:24,689 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 10:59:24,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:24,691 INFO ]: Computing forward predicates... [2018-06-22 10:59:24,737 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:59:24,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:24,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-22 10:59:24,757 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:59:24,757 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:59:24,757 INFO ]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:59:24,757 INFO ]: Start difference. First operand 37 states and 44 transitions. Second operand 12 states. [2018-06-22 10:59:24,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:24,948 INFO ]: Finished difference Result 43 states and 52 transitions. [2018-06-22 10:59:24,949 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:59:24,949 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 10:59:24,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:24,950 INFO ]: With dead ends: 43 [2018-06-22 10:59:24,950 INFO ]: Without dead ends: 43 [2018-06-22 10:59:24,950 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:59:24,950 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 10:59:24,956 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 10:59:24,956 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 10:59:24,956 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-06-22 10:59:24,956 INFO ]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 37 [2018-06-22 10:59:24,957 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:24,957 INFO ]: Abstraction has 39 states and 47 transitions. [2018-06-22 10:59:24,957 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:59:24,957 INFO ]: Start isEmpty. Operand 39 states and 47 transitions. [2018-06-22 10:59:24,958 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 10:59:24,958 INFO ]: Found error trace [2018-06-22 10:59:24,958 INFO ]: trace histogram [6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:24,958 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:24,958 INFO ]: Analyzing trace with hash -2031160658, now seen corresponding path program 4 times [2018-06-22 10:59:24,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:24,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:24,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:24,959 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:24,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:24,967 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:25,071 INFO ]: Checked inductivity of 58 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 10:59:25,071 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:25,071 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:59:25,077 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:59:25,101 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:59:25,101 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:25,104 INFO ]: Computing forward predicates... [2018-06-22 10:59:25,144 INFO ]: Checked inductivity of 58 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 10:59:25,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:25,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 10:59:25,163 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:59:25,163 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:59:25,163 INFO ]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:59:25,163 INFO ]: Start difference. First operand 39 states and 47 transitions. Second operand 13 states. [2018-06-22 10:59:25,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:25,293 INFO ]: Finished difference Result 45 states and 55 transitions. [2018-06-22 10:59:25,293 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:59:25,293 INFO ]: Start accepts. Automaton has 13 states. Word has length 41 [2018-06-22 10:59:25,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:25,294 INFO ]: With dead ends: 45 [2018-06-22 10:59:25,294 INFO ]: Without dead ends: 45 [2018-06-22 10:59:25,295 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:59:25,295 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 10:59:25,301 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-06-22 10:59:25,301 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 10:59:25,301 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-06-22 10:59:25,302 INFO ]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 41 [2018-06-22 10:59:25,302 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:25,302 INFO ]: Abstraction has 41 states and 50 transitions. [2018-06-22 10:59:25,302 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:59:25,302 INFO ]: Start isEmpty. Operand 41 states and 50 transitions. [2018-06-22 10:59:25,303 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 10:59:25,303 INFO ]: Found error trace [2018-06-22 10:59:25,303 INFO ]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:25,303 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:25,303 INFO ]: Analyzing trace with hash 987175997, now seen corresponding path program 4 times [2018-06-22 10:59:25,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:25,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:25,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:25,304 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:25,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:25,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:25,434 INFO ]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 10:59:25,434 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:25,434 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:59:25,440 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:59:25,469 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:59:25,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:25,472 INFO ]: Computing forward predicates... [2018-06-22 10:59:25,619 INFO ]: Checked inductivity of 46 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 10:59:25,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:25,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-06-22 10:59:25,638 INFO ]: Interpolant automaton has 19 states [2018-06-22 10:59:25,639 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 10:59:25,639 INFO ]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:59:25,639 INFO ]: Start difference. First operand 41 states and 50 transitions. Second operand 19 states. [2018-06-22 10:59:26,025 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:26,025 INFO ]: Finished difference Result 53 states and 61 transitions. [2018-06-22 10:59:26,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:59:26,026 INFO ]: Start accepts. Automaton has 19 states. Word has length 41 [2018-06-22 10:59:26,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:26,027 INFO ]: With dead ends: 53 [2018-06-22 10:59:26,027 INFO ]: Without dead ends: 45 [2018-06-22 10:59:26,028 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:59:26,028 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 10:59:26,033 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-06-22 10:59:26,033 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 10:59:26,034 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-06-22 10:59:26,034 INFO ]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 41 [2018-06-22 10:59:26,034 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:26,034 INFO ]: Abstraction has 43 states and 51 transitions. [2018-06-22 10:59:26,034 INFO ]: Interpolant automaton has 19 states. [2018-06-22 10:59:26,034 INFO ]: Start isEmpty. Operand 43 states and 51 transitions. [2018-06-22 10:59:26,037 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 10:59:26,037 INFO ]: Found error trace [2018-06-22 10:59:26,037 INFO ]: trace histogram [7, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:26,037 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:26,037 INFO ]: Analyzing trace with hash 1121813266, now seen corresponding path program 5 times [2018-06-22 10:59:26,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:26,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:26,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:26,038 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:26,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:26,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:26,237 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-06-22 10:59:26,279 INFO ]: Checked inductivity of 81 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 10:59:26,279 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:26,279 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:59:26,287 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:59:26,355 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 10:59:26,355 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:26,358 INFO ]: Computing forward predicates... [2018-06-22 10:59:26,400 INFO ]: Checked inductivity of 81 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 10:59:26,427 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:26,427 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-22 10:59:26,428 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:59:26,428 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:59:26,428 INFO ]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:59:26,428 INFO ]: Start difference. First operand 43 states and 51 transitions. Second operand 14 states. [2018-06-22 10:59:26,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:26,532 INFO ]: Finished difference Result 49 states and 59 transitions. [2018-06-22 10:59:26,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:59:26,532 INFO ]: Start accepts. Automaton has 14 states. Word has length 45 [2018-06-22 10:59:26,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:26,533 INFO ]: With dead ends: 49 [2018-06-22 10:59:26,533 INFO ]: Without dead ends: 49 [2018-06-22 10:59:26,534 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:59:26,534 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 10:59:26,541 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-06-22 10:59:26,541 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 10:59:26,541 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-06-22 10:59:26,542 INFO ]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 45 [2018-06-22 10:59:26,542 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:26,542 INFO ]: Abstraction has 45 states and 54 transitions. [2018-06-22 10:59:26,542 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:59:26,542 INFO ]: Start isEmpty. Operand 45 states and 54 transitions. [2018-06-22 10:59:26,545 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 10:59:26,545 INFO ]: Found error trace [2018-06-22 10:59:26,545 INFO ]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:26,545 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:26,546 INFO ]: Analyzing trace with hash 871635371, now seen corresponding path program 5 times [2018-06-22 10:59:26,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:26,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:26,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:26,546 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:26,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:26,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:26,730 INFO ]: Checked inductivity of 76 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 10:59:26,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:26,730 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:59:26,738 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:59:26,763 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 10:59:26,763 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:26,766 INFO ]: Computing forward predicates... [2018-06-22 10:59:27,283 INFO ]: Checked inductivity of 76 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 10:59:27,307 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:27,307 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-06-22 10:59:27,307 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:59:27,307 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:59:27,308 INFO ]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:59:27,308 INFO ]: Start difference. First operand 45 states and 54 transitions. Second operand 22 states. [2018-06-22 10:59:27,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:27,676 INFO ]: Finished difference Result 59 states and 67 transitions. [2018-06-22 10:59:27,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 10:59:27,676 INFO ]: Start accepts. Automaton has 22 states. Word has length 49 [2018-06-22 10:59:27,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:27,677 INFO ]: With dead ends: 59 [2018-06-22 10:59:27,677 INFO ]: Without dead ends: 49 [2018-06-22 10:59:27,677 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 10:59:27,677 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 10:59:27,684 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-22 10:59:27,685 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 10:59:27,685 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-06-22 10:59:27,685 INFO ]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 49 [2018-06-22 10:59:27,686 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:27,686 INFO ]: Abstraction has 47 states and 55 transitions. [2018-06-22 10:59:27,686 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:59:27,686 INFO ]: Start isEmpty. Operand 47 states and 55 transitions. [2018-06-22 10:59:27,686 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 10:59:27,686 INFO ]: Found error trace [2018-06-22 10:59:27,686 INFO ]: trace histogram [8, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:27,687 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:27,687 INFO ]: Analyzing trace with hash -1976054922, now seen corresponding path program 6 times [2018-06-22 10:59:27,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:27,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:27,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:27,687 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:27,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:27,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:27,806 INFO ]: Checked inductivity of 108 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 10:59:27,806 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:27,806 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:59:27,812 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:59:27,828 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 10:59:27,828 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:27,830 INFO ]: Computing forward predicates... [2018-06-22 10:59:27,871 INFO ]: Checked inductivity of 108 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 10:59:27,890 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:27,891 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 10:59:27,891 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:59:27,891 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:59:27,891 INFO ]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:59:27,891 INFO ]: Start difference. First operand 47 states and 55 transitions. Second operand 15 states. [2018-06-22 10:59:28,016 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:28,016 INFO ]: Finished difference Result 53 states and 63 transitions. [2018-06-22 10:59:28,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:59:28,017 INFO ]: Start accepts. Automaton has 15 states. Word has length 49 [2018-06-22 10:59:28,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:28,018 INFO ]: With dead ends: 53 [2018-06-22 10:59:28,018 INFO ]: Without dead ends: 53 [2018-06-22 10:59:28,018 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:59:28,018 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 10:59:28,026 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 10:59:28,026 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 10:59:28,027 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-06-22 10:59:28,027 INFO ]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 49 [2018-06-22 10:59:28,028 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:28,028 INFO ]: Abstraction has 49 states and 58 transitions. [2018-06-22 10:59:28,028 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:59:28,028 INFO ]: Start isEmpty. Operand 49 states and 58 transitions. [2018-06-22 10:59:28,029 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 10:59:28,029 INFO ]: Found error trace [2018-06-22 10:59:28,029 INFO ]: trace histogram [9, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:28,029 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:28,029 INFO ]: Analyzing trace with hash -1377350694, now seen corresponding path program 7 times [2018-06-22 10:59:28,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:28,029 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:28,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:28,030 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:28,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:28,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:28,180 INFO ]: Checked inductivity of 139 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 10:59:28,180 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:28,180 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:59:28,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:28,202 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:28,204 INFO ]: Computing forward predicates... [2018-06-22 10:59:28,243 INFO ]: Checked inductivity of 139 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 10:59:28,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:28,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-22 10:59:28,263 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:59:28,263 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:59:28,263 INFO ]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:59:28,263 INFO ]: Start difference. First operand 49 states and 58 transitions. Second operand 16 states. [2018-06-22 10:59:28,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:28,402 INFO ]: Finished difference Result 55 states and 66 transitions. [2018-06-22 10:59:28,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:59:28,403 INFO ]: Start accepts. Automaton has 16 states. Word has length 53 [2018-06-22 10:59:28,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:28,404 INFO ]: With dead ends: 55 [2018-06-22 10:59:28,404 INFO ]: Without dead ends: 55 [2018-06-22 10:59:28,404 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:59:28,404 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 10:59:28,411 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 10:59:28,412 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 10:59:28,412 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2018-06-22 10:59:28,412 INFO ]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 53 [2018-06-22 10:59:28,412 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:28,412 INFO ]: Abstraction has 51 states and 61 transitions. [2018-06-22 10:59:28,412 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:59:28,412 INFO ]: Start isEmpty. Operand 51 states and 61 transitions. [2018-06-22 10:59:28,413 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:59:28,413 INFO ]: Found error trace [2018-06-22 10:59:28,413 INFO ]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:28,413 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:28,413 INFO ]: Analyzing trace with hash 1711160089, now seen corresponding path program 6 times [2018-06-22 10:59:28,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:28,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:28,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:28,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:28,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:28,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:29,021 WARN ]: Spent 214.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:59:29,248 INFO ]: Checked inductivity of 114 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 10:59:29,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:29,248 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:59:29,254 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:59:29,306 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 10:59:29,306 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:29,309 INFO ]: Computing forward predicates... [2018-06-22 10:59:29,534 INFO ]: Checked inductivity of 114 backedges. 25 proven. 44 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 10:59:29,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:29,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 26 [2018-06-22 10:59:29,554 INFO ]: Interpolant automaton has 26 states [2018-06-22 10:59:29,554 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 10:59:29,554 INFO ]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:59:29,554 INFO ]: Start difference. First operand 51 states and 61 transitions. Second operand 26 states. [2018-06-22 10:59:30,195 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:30,195 INFO ]: Finished difference Result 67 states and 76 transitions. [2018-06-22 10:59:30,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:59:30,196 INFO ]: Start accepts. Automaton has 26 states. Word has length 57 [2018-06-22 10:59:30,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:30,197 INFO ]: With dead ends: 67 [2018-06-22 10:59:30,197 INFO ]: Without dead ends: 55 [2018-06-22 10:59:30,197 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1563, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 10:59:30,197 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 10:59:30,201 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-06-22 10:59:30,201 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 10:59:30,205 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-06-22 10:59:30,205 INFO ]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 57 [2018-06-22 10:59:30,205 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:30,205 INFO ]: Abstraction has 53 states and 62 transitions. [2018-06-22 10:59:30,205 INFO ]: Interpolant automaton has 26 states. [2018-06-22 10:59:30,205 INFO ]: Start isEmpty. Operand 53 states and 62 transitions. [2018-06-22 10:59:30,206 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:59:30,206 INFO ]: Found error trace [2018-06-22 10:59:30,206 INFO ]: trace histogram [10, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:30,206 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:30,206 INFO ]: Analyzing trace with hash 582321214, now seen corresponding path program 8 times [2018-06-22 10:59:30,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:30,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:30,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:30,207 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:30,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:30,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:30,362 INFO ]: Checked inductivity of 174 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 10:59:30,363 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:30,363 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:59:30,368 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:59:30,399 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:59:30,399 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:30,402 INFO ]: Computing forward predicates... [2018-06-22 10:59:30,521 INFO ]: Checked inductivity of 174 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 10:59:30,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:30,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-22 10:59:30,540 INFO ]: Interpolant automaton has 17 states [2018-06-22 10:59:30,540 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 10:59:30,540 INFO ]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:59:30,540 INFO ]: Start difference. First operand 53 states and 62 transitions. Second operand 17 states. [2018-06-22 10:59:30,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:30,678 INFO ]: Finished difference Result 59 states and 70 transitions. [2018-06-22 10:59:30,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:59:30,678 INFO ]: Start accepts. Automaton has 17 states. Word has length 57 [2018-06-22 10:59:30,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:30,679 INFO ]: With dead ends: 59 [2018-06-22 10:59:30,679 INFO ]: Without dead ends: 59 [2018-06-22 10:59:30,679 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:59:30,680 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 10:59:30,684 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-06-22 10:59:30,684 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 10:59:30,685 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-06-22 10:59:30,685 INFO ]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 57 [2018-06-22 10:59:30,685 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:30,685 INFO ]: Abstraction has 55 states and 65 transitions. [2018-06-22 10:59:30,685 INFO ]: Interpolant automaton has 17 states. [2018-06-22 10:59:30,685 INFO ]: Start isEmpty. Operand 55 states and 65 transitions. [2018-06-22 10:59:30,686 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 10:59:30,686 INFO ]: Found error trace [2018-06-22 10:59:30,686 INFO ]: trace histogram [11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:30,686 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:30,686 INFO ]: Analyzing trace with hash -380898142, now seen corresponding path program 9 times [2018-06-22 10:59:30,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:30,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:30,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:30,689 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:30,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:30,696 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:30,821 INFO ]: Checked inductivity of 213 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-22 10:59:30,821 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:30,821 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:59:30,827 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:59:30,847 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 10:59:30,847 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:30,849 INFO ]: Computing forward predicates... [2018-06-22 10:59:30,906 INFO ]: Checked inductivity of 213 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-22 10:59:30,924 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:30,925 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 18 [2018-06-22 10:59:30,925 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:59:30,925 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:59:30,925 INFO ]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:59:30,925 INFO ]: Start difference. First operand 55 states and 65 transitions. Second operand 18 states. [2018-06-22 10:59:31,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:31,166 INFO ]: Finished difference Result 61 states and 73 transitions. [2018-06-22 10:59:31,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:59:31,166 INFO ]: Start accepts. Automaton has 18 states. Word has length 61 [2018-06-22 10:59:31,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:31,167 INFO ]: With dead ends: 61 [2018-06-22 10:59:31,167 INFO ]: Without dead ends: 61 [2018-06-22 10:59:31,167 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:59:31,167 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 10:59:31,173 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-06-22 10:59:31,173 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 10:59:31,174 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-06-22 10:59:31,174 INFO ]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 61 [2018-06-22 10:59:31,174 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:31,174 INFO ]: Abstraction has 57 states and 68 transitions. [2018-06-22 10:59:31,174 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:59:31,174 INFO ]: Start isEmpty. Operand 57 states and 68 transitions. [2018-06-22 10:59:31,175 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 10:59:31,175 INFO ]: Found error trace [2018-06-22 10:59:31,175 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:59:31,175 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:31,175 INFO ]: Analyzing trace with hash -164356858, now seen corresponding path program 10 times [2018-06-22 10:59:31,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:31,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:31,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:31,176 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:31,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:31,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:31,451 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:59:31,451 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:31,451 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:59:31,456 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:59:31,475 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:59:31,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:31,478 INFO ]: Computing forward predicates... [2018-06-22 10:59:31,845 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:59:31,863 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:31,863 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 25 [2018-06-22 10:59:31,864 INFO ]: Interpolant automaton has 25 states [2018-06-22 10:59:31,864 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 10:59:31,864 INFO ]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:59:31,864 INFO ]: Start difference. First operand 57 states and 68 transitions. Second operand 25 states. [2018-06-22 10:59:32,857 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:32,857 INFO ]: Finished difference Result 63 states and 87 transitions. [2018-06-22 10:59:32,857 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:59:32,857 INFO ]: Start accepts. Automaton has 25 states. Word has length 65 [2018-06-22 10:59:32,857 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:32,858 INFO ]: With dead ends: 63 [2018-06-22 10:59:32,858 INFO ]: Without dead ends: 63 [2018-06-22 10:59:32,859 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 10:59:32,859 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 10:59:32,865 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-06-22 10:59:32,865 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 10:59:32,865 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2018-06-22 10:59:32,865 INFO ]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 65 [2018-06-22 10:59:32,867 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:32,867 INFO ]: Abstraction has 59 states and 79 transitions. [2018-06-22 10:59:32,867 INFO ]: Interpolant automaton has 25 states. [2018-06-22 10:59:32,867 INFO ]: Start isEmpty. Operand 59 states and 79 transitions. [2018-06-22 10:59:32,868 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 10:59:32,868 INFO ]: Found error trace [2018-06-22 10:59:32,868 INFO ]: trace histogram [8, 7, 7, 7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:32,868 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:32,868 INFO ]: Analyzing trace with hash -552886137, now seen corresponding path program 7 times [2018-06-22 10:59:32,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:32,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:32,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:32,869 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:32,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:32,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:33,012 INFO ]: Checked inductivity of 160 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-06-22 10:59:33,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:33,012 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:33,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:33,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:33,040 INFO ]: Computing forward predicates... [2018-06-22 10:59:33,257 INFO ]: Checked inductivity of 160 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-06-22 10:59:33,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:33,276 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 28 [2018-06-22 10:59:33,277 INFO ]: Interpolant automaton has 28 states [2018-06-22 10:59:33,277 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 10:59:33,277 INFO ]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:59:33,277 INFO ]: Start difference. First operand 59 states and 79 transitions. Second operand 28 states. [2018-06-22 10:59:34,060 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:34,060 INFO ]: Finished difference Result 79 states and 98 transitions. [2018-06-22 10:59:34,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 10:59:34,061 INFO ]: Start accepts. Automaton has 28 states. Word has length 65 [2018-06-22 10:59:34,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:34,061 INFO ]: With dead ends: 79 [2018-06-22 10:59:34,061 INFO ]: Without dead ends: 65 [2018-06-22 10:59:34,062 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 10:59:34,062 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 10:59:34,067 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-06-22 10:59:34,067 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 10:59:34,068 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2018-06-22 10:59:34,068 INFO ]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 65 [2018-06-22 10:59:34,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:34,068 INFO ]: Abstraction has 61 states and 79 transitions. [2018-06-22 10:59:34,068 INFO ]: Interpolant automaton has 28 states. [2018-06-22 10:59:34,068 INFO ]: Start isEmpty. Operand 61 states and 79 transitions. [2018-06-22 10:59:34,069 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 10:59:34,069 INFO ]: Found error trace [2018-06-22 10:59:34,069 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:59:34,069 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:34,069 INFO ]: Analyzing trace with hash -915715504, now seen corresponding path program 11 times [2018-06-22 10:59:34,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:34,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:34,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:34,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:34,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:34,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:34,278 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:59:34,278 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:34,278 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:59:34,284 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:59:34,313 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 10:59:34,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:34,315 INFO ]: Computing forward predicates... [2018-06-22 10:59:34,456 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:59:34,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:34,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2018-06-22 10:59:34,475 INFO ]: Interpolant automaton has 16 states [2018-06-22 10:59:34,475 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 10:59:34,475 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:59:34,475 INFO ]: Start difference. First operand 61 states and 79 transitions. Second operand 16 states. [2018-06-22 10:59:34,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:34,620 INFO ]: Finished difference Result 67 states and 85 transitions. [2018-06-22 10:59:34,622 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:59:34,622 INFO ]: Start accepts. Automaton has 16 states. Word has length 69 [2018-06-22 10:59:34,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:34,622 INFO ]: With dead ends: 67 [2018-06-22 10:59:34,622 INFO ]: Without dead ends: 67 [2018-06-22 10:59:34,623 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:59:34,623 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 10:59:34,627 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 61. [2018-06-22 10:59:34,627 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 10:59:34,627 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2018-06-22 10:59:34,628 INFO ]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 69 [2018-06-22 10:59:34,628 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:34,628 INFO ]: Abstraction has 61 states and 79 transitions. [2018-06-22 10:59:34,628 INFO ]: Interpolant automaton has 16 states. [2018-06-22 10:59:34,628 INFO ]: Start isEmpty. Operand 61 states and 79 transitions. [2018-06-22 10:59:34,629 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 10:59:34,629 INFO ]: Found error trace [2018-06-22 10:59:34,629 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:59:34,629 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:34,629 INFO ]: Analyzing trace with hash -608925030, now seen corresponding path program 12 times [2018-06-22 10:59:34,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:34,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:34,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:34,630 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:34,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:34,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:35,189 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:59:35,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:35,190 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:59:35,198 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:59:35,225 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 10:59:35,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:35,228 INFO ]: Computing forward predicates... [2018-06-22 10:59:35,749 INFO ]: Checked inductivity of 274 backedges. 64 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-06-22 10:59:35,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:35,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 29 [2018-06-22 10:59:35,769 INFO ]: Interpolant automaton has 29 states [2018-06-22 10:59:35,769 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 10:59:35,769 INFO ]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:59:35,769 INFO ]: Start difference. First operand 61 states and 79 transitions. Second operand 29 states. [2018-06-22 10:59:36,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:36,666 INFO ]: Finished difference Result 69 states and 87 transitions. [2018-06-22 10:59:36,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:59:36,666 INFO ]: Start accepts. Automaton has 29 states. Word has length 73 [2018-06-22 10:59:36,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:36,667 INFO ]: With dead ends: 69 [2018-06-22 10:59:36,667 INFO ]: Without dead ends: 69 [2018-06-22 10:59:36,667 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 63 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=195, Invalid=1527, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 10:59:36,667 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 10:59:36,671 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-06-22 10:59:36,671 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 10:59:36,672 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2018-06-22 10:59:36,672 INFO ]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 73 [2018-06-22 10:59:36,672 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:36,672 INFO ]: Abstraction has 61 states and 79 transitions. [2018-06-22 10:59:36,672 INFO ]: Interpolant automaton has 29 states. [2018-06-22 10:59:36,672 INFO ]: Start isEmpty. Operand 61 states and 79 transitions. [2018-06-22 10:59:36,673 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 10:59:36,673 INFO ]: Found error trace [2018-06-22 10:59:36,673 INFO ]: trace histogram [9, 8, 8, 8, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:36,673 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:36,673 INFO ]: Analyzing trace with hash -1894618635, now seen corresponding path program 8 times [2018-06-22 10:59:36,673 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:36,673 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:36,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:36,674 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:36,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:36,683 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:36,835 INFO ]: Checked inductivity of 214 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-22 10:59:36,835 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:36,835 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:59:36,840 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:59:36,862 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:59:36,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:36,865 INFO ]: Computing forward predicates... [2018-06-22 10:59:37,106 INFO ]: Checked inductivity of 214 backedges. 35 proven. 90 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-06-22 10:59:37,127 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:37,127 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 31 [2018-06-22 10:59:37,127 INFO ]: Interpolant automaton has 31 states [2018-06-22 10:59:37,127 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 10:59:37,127 INFO ]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:59:37,127 INFO ]: Start difference. First operand 61 states and 79 transitions. Second operand 31 states. [2018-06-22 10:59:37,823 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 10:59:38,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:38,216 INFO ]: Finished difference Result 87 states and 104 transitions. [2018-06-22 10:59:38,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:59:38,217 INFO ]: Start accepts. Automaton has 31 states. Word has length 73 [2018-06-22 10:59:38,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:38,218 INFO ]: With dead ends: 87 [2018-06-22 10:59:38,218 INFO ]: Without dead ends: 71 [2018-06-22 10:59:38,218 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=2517, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 10:59:38,219 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 10:59:38,223 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 63. [2018-06-22 10:59:38,223 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 10:59:38,223 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2018-06-22 10:59:38,223 INFO ]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 73 [2018-06-22 10:59:38,223 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:38,223 INFO ]: Abstraction has 63 states and 79 transitions. [2018-06-22 10:59:38,223 INFO ]: Interpolant automaton has 31 states. [2018-06-22 10:59:38,223 INFO ]: Start isEmpty. Operand 63 states and 79 transitions. [2018-06-22 10:59:38,224 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:59:38,224 INFO ]: Found error trace [2018-06-22 10:59:38,224 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:59:38,224 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:38,224 INFO ]: Analyzing trace with hash -1082368540, now seen corresponding path program 13 times [2018-06-22 10:59:38,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:38,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:38,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:38,227 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:38,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:38,238 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:38,584 INFO ]: Checked inductivity of 289 backedges. 30 proven. 114 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-06-22 10:59:38,584 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:38,584 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:59:38,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:38,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:38,613 INFO ]: Computing forward predicates... [2018-06-22 10:59:38,971 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:59:38,990 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:38,990 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2018-06-22 10:59:38,990 INFO ]: Interpolant automaton has 31 states [2018-06-22 10:59:38,990 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 10:59:38,990 INFO ]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:59:38,990 INFO ]: Start difference. First operand 63 states and 79 transitions. Second operand 31 states. [2018-06-22 10:59:40,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:40,077 INFO ]: Finished difference Result 73 states and 89 transitions. [2018-06-22 10:59:40,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:59:40,077 INFO ]: Start accepts. Automaton has 31 states. Word has length 77 [2018-06-22 10:59:40,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:40,078 INFO ]: With dead ends: 73 [2018-06-22 10:59:40,078 INFO ]: Without dead ends: 73 [2018-06-22 10:59:40,078 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=1707, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:59:40,078 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 10:59:40,083 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 63. [2018-06-22 10:59:40,083 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 10:59:40,083 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2018-06-22 10:59:40,084 INFO ]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 77 [2018-06-22 10:59:40,084 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:40,084 INFO ]: Abstraction has 63 states and 79 transitions. [2018-06-22 10:59:40,084 INFO ]: Interpolant automaton has 31 states. [2018-06-22 10:59:40,084 INFO ]: Start isEmpty. Operand 63 states and 79 transitions. [2018-06-22 10:59:40,085 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:59:40,085 INFO ]: Found error trace [2018-06-22 10:59:40,085 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:59:40,085 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:40,085 INFO ]: Analyzing trace with hash -915454930, now seen corresponding path program 14 times [2018-06-22 10:59:40,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:40,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:40,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:40,085 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:40,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:40,095 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:40,578 WARN ]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 10:59:40,874 INFO ]: Checked inductivity of 308 backedges. 5 proven. 167 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-06-22 10:59:40,874 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:40,874 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:59:40,879 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:59:40,900 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:59:40,900 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:40,903 INFO ]: Computing forward predicates... [2018-06-22 10:59:41,167 INFO ]: Checked inductivity of 308 backedges. 72 proven. 99 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-06-22 10:59:41,186 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:41,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 36 [2018-06-22 10:59:41,186 INFO ]: Interpolant automaton has 36 states [2018-06-22 10:59:41,186 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 10:59:41,186 INFO ]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 10:59:41,187 INFO ]: Start difference. First operand 63 states and 79 transitions. Second operand 36 states. [2018-06-22 10:59:43,595 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:43,595 INFO ]: Finished difference Result 205 states and 296 transitions. [2018-06-22 10:59:43,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-06-22 10:59:43,596 INFO ]: Start accepts. Automaton has 36 states. Word has length 81 [2018-06-22 10:59:43,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:43,599 INFO ]: With dead ends: 205 [2018-06-22 10:59:43,599 INFO ]: Without dead ends: 205 [2018-06-22 10:59:43,601 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 75 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=985, Invalid=4417, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 10:59:43,601 INFO ]: Start minimizeSevpa. Operand 205 states. [2018-06-22 10:59:43,615 INFO ]: Finished minimizeSevpa. Reduced states from 205 to 103. [2018-06-22 10:59:43,615 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 10:59:43,616 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 170 transitions. [2018-06-22 10:59:43,616 INFO ]: Start accepts. Automaton has 103 states and 170 transitions. Word has length 81 [2018-06-22 10:59:43,617 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:43,617 INFO ]: Abstraction has 103 states and 170 transitions. [2018-06-22 10:59:43,617 INFO ]: Interpolant automaton has 36 states. [2018-06-22 10:59:43,617 INFO ]: Start isEmpty. Operand 103 states and 170 transitions. [2018-06-22 10:59:43,618 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:59:43,618 INFO ]: Found error trace [2018-06-22 10:59:43,618 INFO ]: trace histogram [10, 9, 9, 9, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:43,618 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:43,618 INFO ]: Analyzing trace with hash 32028515, now seen corresponding path program 9 times [2018-06-22 10:59:43,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:43,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:43,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:43,619 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:43,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:43,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:43,794 INFO ]: Checked inductivity of 276 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-06-22 10:59:43,794 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:43,794 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:59:43,800 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:59:43,833 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 10:59:43,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:43,836 INFO ]: Computing forward predicates... [2018-06-22 10:59:44,112 INFO ]: Checked inductivity of 276 backedges. 40 proven. 119 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-06-22 10:59:44,131 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:44,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 34 [2018-06-22 10:59:44,131 INFO ]: Interpolant automaton has 34 states [2018-06-22 10:59:44,131 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 10:59:44,131 INFO ]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 10:59:44,131 INFO ]: Start difference. First operand 103 states and 170 transitions. Second operand 34 states. [2018-06-22 10:59:45,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:45,118 INFO ]: Finished difference Result 177 states and 249 transitions. [2018-06-22 10:59:45,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 10:59:45,118 INFO ]: Start accepts. Automaton has 34 states. Word has length 81 [2018-06-22 10:59:45,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:45,120 INFO ]: With dead ends: 177 [2018-06-22 10:59:45,120 INFO ]: Without dead ends: 159 [2018-06-22 10:59:45,121 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=411, Invalid=3129, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 10:59:45,121 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-22 10:59:45,134 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 105. [2018-06-22 10:59:45,134 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-22 10:59:45,135 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 164 transitions. [2018-06-22 10:59:45,135 INFO ]: Start accepts. Automaton has 105 states and 164 transitions. Word has length 81 [2018-06-22 10:59:45,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:45,135 INFO ]: Abstraction has 105 states and 164 transitions. [2018-06-22 10:59:45,135 INFO ]: Interpolant automaton has 34 states. [2018-06-22 10:59:45,135 INFO ]: Start isEmpty. Operand 105 states and 164 transitions. [2018-06-22 10:59:45,136 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:59:45,136 INFO ]: Found error trace [2018-06-22 10:59:45,136 INFO ]: trace histogram [11, 10, 10, 10, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:45,136 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:45,136 INFO ]: Analyzing trace with hash 423930065, now seen corresponding path program 10 times [2018-06-22 10:59:45,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:45,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:45,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:45,138 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:45,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:45,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:46,123 INFO ]: Checked inductivity of 346 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-06-22 10:59:46,123 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:46,123 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:59:46,130 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:59:46,155 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:59:46,155 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:46,159 INFO ]: Computing forward predicates... [2018-06-22 10:59:46,515 INFO ]: Checked inductivity of 346 backedges. 45 proven. 152 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-06-22 10:59:46,535 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:46,535 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 37 [2018-06-22 10:59:46,535 INFO ]: Interpolant automaton has 37 states [2018-06-22 10:59:46,535 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 10:59:46,535 INFO ]: CoverageRelationStatistics Valid=126, Invalid=1206, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 10:59:46,536 INFO ]: Start difference. First operand 105 states and 164 transitions. Second operand 37 states. [2018-06-22 10:59:47,894 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:47,894 INFO ]: Finished difference Result 195 states and 260 transitions. [2018-06-22 10:59:47,894 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 10:59:47,894 INFO ]: Start accepts. Automaton has 37 states. Word has length 89 [2018-06-22 10:59:47,895 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:47,896 INFO ]: With dead ends: 195 [2018-06-22 10:59:47,896 INFO ]: Without dead ends: 175 [2018-06-22 10:59:47,898 INFO ]: 0 DeclaredPredicates, 144 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=482, Invalid=3808, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 10:59:47,898 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-22 10:59:47,906 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 107. [2018-06-22 10:59:47,906 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 10:59:47,907 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2018-06-22 10:59:47,908 INFO ]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 89 [2018-06-22 10:59:47,908 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:47,908 INFO ]: Abstraction has 107 states and 157 transitions. [2018-06-22 10:59:47,908 INFO ]: Interpolant automaton has 37 states. [2018-06-22 10:59:47,908 INFO ]: Start isEmpty. Operand 107 states and 157 transitions. [2018-06-22 10:59:47,909 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 10:59:47,909 INFO ]: Found error trace [2018-06-22 10:59:47,909 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:59:47,909 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:47,909 INFO ]: Analyzing trace with hash -797328008, now seen corresponding path program 15 times [2018-06-22 10:59:47,909 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:47,909 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:47,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:47,910 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:47,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:47,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:48,317 INFO ]: Checked inductivity of 331 backedges. 4 proven. 185 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-22 10:59:48,317 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:48,317 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:59:48,325 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:59:48,366 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 10:59:48,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:48,369 INFO ]: Computing forward predicates... [2018-06-22 10:59:48,987 INFO ]: Checked inductivity of 331 backedges. 70 proven. 99 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-06-22 10:59:49,006 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:49,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 38 [2018-06-22 10:59:49,007 INFO ]: Interpolant automaton has 38 states [2018-06-22 10:59:49,007 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 10:59:49,007 INFO ]: CoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 10:59:49,007 INFO ]: Start difference. First operand 107 states and 157 transitions. Second operand 38 states. [2018-06-22 10:59:50,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:50,830 INFO ]: Finished difference Result 133 states and 186 transitions. [2018-06-22 10:59:50,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 10:59:50,830 INFO ]: Start accepts. Automaton has 38 states. Word has length 85 [2018-06-22 10:59:50,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:50,831 INFO ]: With dead ends: 133 [2018-06-22 10:59:50,831 INFO ]: Without dead ends: 133 [2018-06-22 10:59:50,832 INFO ]: 0 DeclaredPredicates, 150 GetRequests, 80 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=531, Invalid=3501, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 10:59:50,833 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-22 10:59:50,838 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 107. [2018-06-22 10:59:50,838 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 10:59:50,839 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2018-06-22 10:59:50,839 INFO ]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 85 [2018-06-22 10:59:50,839 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:50,839 INFO ]: Abstraction has 107 states and 157 transitions. [2018-06-22 10:59:50,839 INFO ]: Interpolant automaton has 38 states. [2018-06-22 10:59:50,839 INFO ]: Start isEmpty. Operand 107 states and 157 transitions. [2018-06-22 10:59:50,840 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 10:59:50,840 INFO ]: Found error trace [2018-06-22 10:59:50,840 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:50,840 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:50,841 INFO ]: Analyzing trace with hash -305641022, now seen corresponding path program 16 times [2018-06-22 10:59:50,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:50,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:50,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:50,842 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:50,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:50,854 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:51,528 INFO ]: Checked inductivity of 358 backedges. 3 proven. 195 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-06-22 10:59:51,528 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:51,528 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:59:51,537 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:59:51,563 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:59:51,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:51,566 INFO ]: Computing forward predicates... [2018-06-22 10:59:51,851 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:59:51,870 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:51,870 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 38 [2018-06-22 10:59:51,870 INFO ]: Interpolant automaton has 38 states [2018-06-22 10:59:51,870 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 10:59:51,870 INFO ]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 10:59:51,870 INFO ]: Start difference. First operand 107 states and 157 transitions. Second operand 38 states. [2018-06-22 10:59:53,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:53,273 INFO ]: Finished difference Result 135 states and 188 transitions. [2018-06-22 10:59:53,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 10:59:53,273 INFO ]: Start accepts. Automaton has 38 states. Word has length 89 [2018-06-22 10:59:53,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:53,274 INFO ]: With dead ends: 135 [2018-06-22 10:59:53,274 INFO ]: Without dead ends: 135 [2018-06-22 10:59:53,276 INFO ]: 0 DeclaredPredicates, 157 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=528, Invalid=3632, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 10:59:53,276 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 10:59:53,283 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 107. [2018-06-22 10:59:53,283 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 10:59:53,284 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2018-06-22 10:59:53,284 INFO ]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 89 [2018-06-22 10:59:53,285 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:53,285 INFO ]: Abstraction has 107 states and 157 transitions. [2018-06-22 10:59:53,285 INFO ]: Interpolant automaton has 38 states. [2018-06-22 10:59:53,285 INFO ]: Start isEmpty. Operand 107 states and 157 transitions. [2018-06-22 10:59:53,286 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 10:59:53,286 INFO ]: Found error trace [2018-06-22 10:59:53,286 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:53,286 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:53,286 INFO ]: Analyzing trace with hash 1019701516, now seen corresponding path program 17 times [2018-06-22 10:59:53,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:53,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:53,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:53,289 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:53,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:53,299 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:53,682 INFO ]: Checked inductivity of 389 backedges. 2 proven. 212 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-22 10:59:53,683 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:53,683 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:53,688 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:59:53,719 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 10:59:53,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:53,723 INFO ]: Computing forward predicates... [2018-06-22 10:59:54,129 INFO ]: Checked inductivity of 389 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-06-22 10:59:54,150 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:54,150 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 43 [2018-06-22 10:59:54,150 INFO ]: Interpolant automaton has 43 states [2018-06-22 10:59:54,150 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 10:59:54,150 INFO ]: CoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 10:59:54,151 INFO ]: Start difference. First operand 107 states and 157 transitions. Second operand 43 states. [2018-06-22 10:59:54,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:54,845 INFO ]: Finished difference Result 237 states and 299 transitions. [2018-06-22 10:59:54,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:59:54,845 INFO ]: Start accepts. Automaton has 43 states. Word has length 93 [2018-06-22 10:59:54,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:54,847 INFO ]: With dead ends: 237 [2018-06-22 10:59:54,847 INFO ]: Without dead ends: 237 [2018-06-22 10:59:54,848 INFO ]: 0 DeclaredPredicates, 157 GetRequests, 80 SyntacticMatches, 15 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=352, Invalid=3680, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 10:59:54,848 INFO ]: Start minimizeSevpa. Operand 237 states. [2018-06-22 10:59:54,857 INFO ]: Finished minimizeSevpa. Reduced states from 237 to 107. [2018-06-22 10:59:54,857 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 10:59:54,858 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2018-06-22 10:59:54,858 INFO ]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 93 [2018-06-22 10:59:54,859 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:54,859 INFO ]: Abstraction has 107 states and 157 transitions. [2018-06-22 10:59:54,859 INFO ]: Interpolant automaton has 43 states. [2018-06-22 10:59:54,859 INFO ]: Start isEmpty. Operand 107 states and 157 transitions. [2018-06-22 10:59:54,860 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:59:54,860 INFO ]: Found error trace [2018-06-22 10:59:54,860 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:54,860 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:54,860 INFO ]: Analyzing trace with hash -960733633, now seen corresponding path program 11 times [2018-06-22 10:59:54,860 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:54,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:54,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:54,860 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:54,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:54,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:55,555 INFO ]: Checked inductivity of 424 backedges. 1 proven. 231 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-06-22 10:59:55,555 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:55,573 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:55,578 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:59:55,611 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 10:59:55,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:55,614 INFO ]: Computing forward predicates... [2018-06-22 10:59:56,329 INFO ]: Checked inductivity of 424 backedges. 50 proven. 189 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-06-22 10:59:56,348 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:56,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26] total 42 [2018-06-22 10:59:56,348 INFO ]: Interpolant automaton has 42 states [2018-06-22 10:59:56,348 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 10:59:56,348 INFO ]: CoverageRelationStatistics Valid=162, Invalid=1560, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 10:59:56,349 INFO ]: Start difference. First operand 107 states and 157 transitions. Second operand 42 states. [2018-06-22 10:59:57,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:57,652 INFO ]: Finished difference Result 217 states and 274 transitions. [2018-06-22 10:59:57,653 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 10:59:57,653 INFO ]: Start accepts. Automaton has 42 states. Word has length 97 [2018-06-22 10:59:57,653 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:57,653 INFO ]: With dead ends: 217 [2018-06-22 10:59:57,654 INFO ]: Without dead ends: 197 [2018-06-22 10:59:57,654 INFO ]: 0 DeclaredPredicates, 172 GetRequests, 91 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=527, Invalid=4303, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 10:59:57,654 INFO ]: Start minimizeSevpa. Operand 197 states. [2018-06-22 10:59:57,662 INFO ]: Finished minimizeSevpa. Reduced states from 197 to 107. [2018-06-22 10:59:57,662 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 10:59:57,663 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2018-06-22 10:59:57,663 INFO ]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 97 [2018-06-22 10:59:57,663 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:57,663 INFO ]: Abstraction has 107 states and 147 transitions. [2018-06-22 10:59:57,663 INFO ]: Interpolant automaton has 42 states. [2018-06-22 10:59:57,663 INFO ]: Start isEmpty. Operand 107 states and 147 transitions. [2018-06-22 10:59:57,664 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 10:59:57,664 INFO ]: Found error trace [2018-06-22 10:59:57,664 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:57,664 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:57,664 INFO ]: Analyzing trace with hash -1692165290, now seen corresponding path program 18 times [2018-06-22 10:59:57,664 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:57,664 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:57,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:57,665 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:57,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:57,675 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:58,119 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-06-22 10:59:58,469 INFO ]: Checked inductivity of 424 backedges. 1 proven. 231 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-06-22 10:59:58,469 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:58,469 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:58,474 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:59:58,522 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 10:59:58,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:58,526 INFO ]: Computing forward predicates... [2018-06-22 10:59:58,810 INFO ]: Checked inductivity of 424 backedges. 40 proven. 111 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-06-22 10:59:58,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:58,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18] total 40 [2018-06-22 10:59:58,829 INFO ]: Interpolant automaton has 40 states [2018-06-22 10:59:58,829 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 10:59:58,829 INFO ]: CoverageRelationStatistics Valid=144, Invalid=1416, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 10:59:58,829 INFO ]: Start difference. First operand 107 states and 147 transitions. Second operand 40 states. [2018-06-22 10:59:59,829 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:59,829 INFO ]: Finished difference Result 139 states and 182 transitions. [2018-06-22 10:59:59,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 10:59:59,829 INFO ]: Start accepts. Automaton has 40 states. Word has length 97 [2018-06-22 10:59:59,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:59,830 INFO ]: With dead ends: 139 [2018-06-22 10:59:59,830 INFO ]: Without dead ends: 139 [2018-06-22 10:59:59,831 INFO ]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=385, Invalid=3397, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 10:59:59,831 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-22 10:59:59,837 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 107. [2018-06-22 10:59:59,837 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 10:59:59,838 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2018-06-22 10:59:59,838 INFO ]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 97 [2018-06-22 10:59:59,838 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:59,838 INFO ]: Abstraction has 107 states and 147 transitions. [2018-06-22 10:59:59,838 INFO ]: Interpolant automaton has 40 states. [2018-06-22 10:59:59,838 INFO ]: Start isEmpty. Operand 107 states and 147 transitions. [2018-06-22 10:59:59,839 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 10:59:59,839 INFO ]: Found error trace [2018-06-22 10:59:59,839 INFO ]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:59,839 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:59,839 INFO ]: Analyzing trace with hash 1715532835, now seen corresponding path program 12 times [2018-06-22 10:59:59,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:59,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:59,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:59,842 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:59,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:59,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:00,389 INFO ]: Checked inductivity of 463 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-06-22 11:00:00,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:00,389 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:00,395 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:00:00,562 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 11:00:00,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:00,568 INFO ]: Computing forward predicates... [2018-06-22 11:00:01,524 INFO ]: Checked inductivity of 463 backedges. 132 proven. 120 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-06-22 11:00:01,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:01,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28] total 46 [2018-06-22 11:00:01,543 INFO ]: Interpolant automaton has 46 states [2018-06-22 11:00:01,543 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 11:00:01,544 INFO ]: CoverageRelationStatistics Valid=231, Invalid=1839, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:00:01,544 INFO ]: Start difference. First operand 107 states and 147 transitions. Second operand 46 states. [2018-06-22 11:00:02,808 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:02,808 INFO ]: Finished difference Result 241 states and 290 transitions. [2018-06-22 11:00:02,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 11:00:02,809 INFO ]: Start accepts. Automaton has 46 states. Word has length 101 [2018-06-22 11:00:02,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:02,810 INFO ]: With dead ends: 241 [2018-06-22 11:00:02,810 INFO ]: Without dead ends: 219 [2018-06-22 11:00:02,811 INFO ]: 0 DeclaredPredicates, 181 GetRequests, 92 SyntacticMatches, 14 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=732, Invalid=5120, Unknown=0, NotChecked=0, Total=5852 [2018-06-22 11:00:02,811 INFO ]: Start minimizeSevpa. Operand 219 states. [2018-06-22 11:00:02,818 INFO ]: Finished minimizeSevpa. Reduced states from 219 to 107. [2018-06-22 11:00:02,818 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 11:00:02,819 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 136 transitions. [2018-06-22 11:00:02,819 INFO ]: Start accepts. Automaton has 107 states and 136 transitions. Word has length 101 [2018-06-22 11:00:02,819 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:02,819 INFO ]: Abstraction has 107 states and 136 transitions. [2018-06-22 11:00:02,819 INFO ]: Interpolant automaton has 46 states. [2018-06-22 11:00:02,819 INFO ]: Start isEmpty. Operand 107 states and 136 transitions. [2018-06-22 11:00:02,820 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 11:00:02,820 INFO ]: Found error trace [2018-06-22 11:00:02,820 INFO ]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:02,820 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:02,820 INFO ]: Analyzing trace with hash 1758027936, now seen corresponding path program 19 times [2018-06-22 11:00:02,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:02,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:02,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:02,821 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:02,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:02,832 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:03,326 INFO ]: Checked inductivity of 463 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-06-22 11:00:03,326 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:03,326 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:03,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:03,369 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:03,372 INFO ]: Computing forward predicates... [2018-06-22 11:00:03,648 INFO ]: Checked inductivity of 463 backedges. 22 proven. 120 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-06-22 11:00:03,666 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:03,666 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 17] total 40 [2018-06-22 11:00:03,667 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:00:03,667 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:00:03,667 INFO ]: CoverageRelationStatistics Valid=144, Invalid=1416, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:00:03,667 INFO ]: Start difference. First operand 107 states and 136 transitions. Second operand 40 states. [2018-06-22 11:00:04,626 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:04,626 INFO ]: Finished difference Result 153 states and 179 transitions. [2018-06-22 11:00:04,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:00:04,627 INFO ]: Start accepts. Automaton has 40 states. Word has length 101 [2018-06-22 11:00:04,627 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:04,628 INFO ]: With dead ends: 153 [2018-06-22 11:00:04,628 INFO ]: Without dead ends: 153 [2018-06-22 11:00:04,628 INFO ]: 0 DeclaredPredicates, 170 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=3431, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 11:00:04,628 INFO ]: Start minimizeSevpa. Operand 153 states. [2018-06-22 11:00:04,633 INFO ]: Finished minimizeSevpa. Reduced states from 153 to 99. [2018-06-22 11:00:04,633 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 11:00:04,634 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2018-06-22 11:00:04,634 INFO ]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 101 [2018-06-22 11:00:04,634 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:04,634 INFO ]: Abstraction has 99 states and 122 transitions. [2018-06-22 11:00:04,634 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:00:04,634 INFO ]: Start isEmpty. Operand 99 states and 122 transitions. [2018-06-22 11:00:04,637 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:00:04,637 INFO ]: Found error trace [2018-06-22 11:00:04,637 INFO ]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:04,637 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:04,637 INFO ]: Analyzing trace with hash -1780514297, now seen corresponding path program 13 times [2018-06-22 11:00:04,637 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:04,637 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:04,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:04,638 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:04,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:04,647 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:04,871 INFO ]: Checked inductivity of 506 backedges. 110 proven. 22 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-06-22 11:00:04,871 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:04,871 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:04,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:04,907 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:04,910 INFO ]: Computing forward predicates... [2018-06-22 11:00:04,963 INFO ]: Checked inductivity of 506 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-06-22 11:00:04,982 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:00:04,982 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [16] total 19 [2018-06-22 11:00:04,982 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:00:04,982 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:00:04,982 INFO ]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:00:04,982 INFO ]: Start difference. First operand 99 states and 122 transitions. Second operand 19 states. [2018-06-22 11:00:05,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:05,101 INFO ]: Finished difference Result 209 states and 240 transitions. [2018-06-22 11:00:05,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:00:05,104 INFO ]: Start accepts. Automaton has 19 states. Word has length 105 [2018-06-22 11:00:05,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:05,105 INFO ]: With dead ends: 209 [2018-06-22 11:00:05,105 INFO ]: Without dead ends: 208 [2018-06-22 11:00:05,106 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:00:05,106 INFO ]: Start minimizeSevpa. Operand 208 states. [2018-06-22 11:00:05,114 INFO ]: Finished minimizeSevpa. Reduced states from 208 to 98. [2018-06-22 11:00:05,114 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-22 11:00:05,115 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-06-22 11:00:05,115 INFO ]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 105 [2018-06-22 11:00:05,115 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:05,115 INFO ]: Abstraction has 98 states and 119 transitions. [2018-06-22 11:00:05,115 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:00:05,115 INFO ]: Start isEmpty. Operand 98 states and 119 transitions. [2018-06-22 11:00:05,116 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:00:05,116 INFO ]: Found error trace [2018-06-22 11:00:05,116 INFO ]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:05,116 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:05,116 INFO ]: Analyzing trace with hash 1206204650, now seen corresponding path program 20 times [2018-06-22 11:00:05,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:05,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:05,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:05,117 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:00:05,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:05,130 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:06,164 INFO ]: Checked inductivity of 506 backedges. 22 proven. 142 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-06-22 11:00:06,164 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:06,164 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:06,170 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:00:06,209 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:00:06,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:06,212 INFO ]: Computing forward predicates... [2018-06-22 11:00:06,535 INFO ]: Checked inductivity of 506 backedges. 22 proven. 142 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-06-22 11:00:06,557 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:06,557 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 32 [2018-06-22 11:00:06,557 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:00:06,557 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:00:06,557 INFO ]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:00:06,558 INFO ]: Start difference. First operand 98 states and 119 transitions. Second operand 32 states. [2018-06-22 11:00:06,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:06,903 INFO ]: Finished difference Result 102 states and 123 transitions. [2018-06-22 11:00:06,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:00:06,903 INFO ]: Start accepts. Automaton has 32 states. Word has length 105 [2018-06-22 11:00:06,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:06,903 INFO ]: With dead ends: 102 [2018-06-22 11:00:06,903 INFO ]: Without dead ends: 100 [2018-06-22 11:00:06,904 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:00:06,904 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 11:00:06,908 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-06-22 11:00:06,908 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 11:00:06,909 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2018-06-22 11:00:06,909 INFO ]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 105 [2018-06-22 11:00:06,909 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:06,909 INFO ]: Abstraction has 100 states and 121 transitions. [2018-06-22 11:00:06,909 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:00:06,909 INFO ]: Start isEmpty. Operand 100 states and 121 transitions. [2018-06-22 11:00:06,910 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:00:06,910 INFO ]: Found error trace [2018-06-22 11:00:06,910 INFO ]: trace histogram [13, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:00:06,910 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:00:06,910 INFO ]: Analyzing trace with hash -589061068, now seen corresponding path program 21 times [2018-06-22 11:00:06,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:00:06,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:00:06,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:06,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:00:06,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:00:06,923 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:07,361 INFO ]: Checked inductivity of 553 backedges. 134 proven. 33 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-06-22 11:00:07,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:00:07,361 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:00:07,367 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:00:07,408 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-22 11:00:07,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:00:07,412 INFO ]: Computing forward predicates... [2018-06-22 11:00:07,855 INFO ]: Checked inductivity of 553 backedges. 156 proven. 11 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-06-22 11:00:07,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:00:07,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2018-06-22 11:00:07,885 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:00:07,885 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:00:07,885 INFO ]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:00:07,886 INFO ]: Start difference. First operand 100 states and 121 transitions. Second operand 18 states. [2018-06-22 11:00:08,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:00:08,260 INFO ]: Finished difference Result 92 states and 112 transitions. [2018-06-22 11:00:08,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:00:08,260 INFO ]: Start accepts. Automaton has 18 states. Word has length 109 [2018-06-22 11:00:08,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:00:08,261 INFO ]: With dead ends: 92 [2018-06-22 11:00:08,261 INFO ]: Without dead ends: 0 [2018-06-22 11:00:08,261 INFO ]: 0 DeclaredPredicates, 146 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:00:08,261 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:00:08,261 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:00:08,261 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:00:08,261 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:00:08,261 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2018-06-22 11:00:08,261 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:00:08,261 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:00:08,261 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:00:08,261 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:00:08,261 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:00:08,354 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:00:08 BoogieIcfgContainer [2018-06-22 11:00:08,354 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:00:08,355 INFO ]: Toolchain (without parser) took 50166.99 ms. Allocated memory was 306.2 MB in the beginning and 785.9 MB in the end (delta: 479.7 MB). Free memory was 263.6 MB in the beginning and 760.1 MB in the end (delta: -496.5 MB). Peak memory consumption was 147.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:00:08,355 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:00:08,356 INFO ]: ChcToBoogie took 50.47 ms. Allocated memory is still 306.2 MB. Free memory was 262.6 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:00:08,356 INFO ]: Boogie Preprocessor took 35.27 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 259.6 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-22 11:00:08,356 INFO ]: RCFGBuilder took 171.77 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 252.5 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:00:08,357 INFO ]: TraceAbstraction took 49898.74 ms. Allocated memory was 306.2 MB in the beginning and 785.9 MB in the end (delta: 479.7 MB). Free memory was 251.5 MB in the beginning and 760.1 MB in the end (delta: -508.6 MB). Peak memory consumption was 135.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:00:08,359 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.47 ms. Allocated memory is still 306.2 MB. Free memory was 262.6 MB in the beginning and 260.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.27 ms. Allocated memory is still 306.2 MB. Free memory was 260.6 MB in the beginning and 259.6 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 171.77 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 252.5 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49898.74 ms. Allocated memory was 306.2 MB in the beginning and 785.9 MB in the end (delta: 479.7 MB). Free memory was 251.5 MB in the beginning and 760.1 MB in the end (delta: -508.6 MB). Peak memory consumption was 135.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. SAFE Result, 49.8s OverallTime, 38 OverallIterations, 13 TraceHistogramMax, 24.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1142 SDtfs, 692 SDslu, 17019 SDs, 0 SdLazy, 19440 SolverSat, 987 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3707 GetRequests, 2204 SyntacticMatches, 168 SemanticMatches, 1335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9915 ImplicationChecksByTransitivity, 31.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=28, 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, 38 MinimizatonAttempts, 916 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 4689 NumberOfCodeBlocks, 4681 NumberOfCodeBlocksAsserted, 216 NumberOfCheckSat, 4616 ConstructedInterpolants, 0 QuantifiedInterpolants, 1230168 SizeOfPredicates, 390 NumberOfNonLiveVariables, 7017 ConjunctsInSsa, 1742 ConjunctsInUnsatCore, 73 InterpolantComputations, 4 PerfectInterpolantSequences, 10188/15874 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-00-08-367.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-00-08-367.csv Received shutdown request...