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/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:24:26,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:24:26,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:24:26,328 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:24:26,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:24:26,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:24:26,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:24:26,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:24:26,336 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:24:26,337 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:24:26,338 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:24:26,339 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:24:26,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:24:26,340 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:24:26,341 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:24:26,343 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:24:26,345 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:24:26,358 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:24:26,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:24:26,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:24:26,362 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:24:26,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:24:26,364 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:24:26,364 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:24:26,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:24:26,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:24:26,366 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:24:26,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:24:26,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:24:26,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:24:26,370 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:24:26,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:24:26,370 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:24:26,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:24:26,372 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:24:26,372 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:24:26,385 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:24:26,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:24:26,386 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:24:26,386 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:24:26,387 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:24:26,387 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:24:26,388 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:24:26,388 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:24:26,388 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:24:26,388 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:24:26,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:24:26,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:24:26,389 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:24:26,389 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:24:26,389 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:24:26,389 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:24:26,389 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:24:26,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:24:26,390 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:24:26,391 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:24:26,391 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:24:26,449 INFO ]: Repository-Root is: /tmp [2018-06-22 11:24:26,463 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:24:26,468 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:24:26,469 INFO ]: Initializing SmtParser... [2018-06-22 11:24:26,469 INFO ]: SmtParser initialized [2018-06-22 11:24:26,473 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 [2018-06-22 11:24:26,474 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:24:26,561 INFO ]: Executing SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 unknown [2018-06-22 11:24:26,813 INFO ]: Succesfully executed SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_reverse_once1_abstracted.smt2 [2018-06-22 11:24:26,818 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:24:26,824 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:24:26,825 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:24:26,825 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:24:26,825 INFO ]: ChcToBoogie initialized [2018-06-22 11:24:26,830 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:24:26" (1/1) ... [2018-06-22 11:24:26,873 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:24:26 Unit [2018-06-22 11:24:26,873 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:24:26,874 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:24:26,874 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:24:26,874 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:24:26,899 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:24:26" (1/1) ... [2018-06-22 11:24:26,899 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:24:26" (1/1) ... [2018-06-22 11:24:26,907 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:24:26" (1/1) ... [2018-06-22 11:24:26,907 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:24:26" (1/1) ... [2018-06-22 11:24:26,911 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:24:26" (1/1) ... [2018-06-22 11:24:26,912 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:24:26" (1/1) ... [2018-06-22 11:24:26,913 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:24:26" (1/1) ... [2018-06-22 11:24:26,915 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:24:26,917 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:24:26,917 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:24:26,917 INFO ]: RCFGBuilder initialized [2018-06-22 11:24:26,918 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:24:26" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:24:26,931 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:24:26,931 INFO ]: Found specification of procedure False [2018-06-22 11:24:26,931 INFO ]: Found implementation of procedure False [2018-06-22 11:24:26,931 INFO ]: Specification and implementation of procedure end given in one single declaration [2018-06-22 11:24:26,931 INFO ]: Found specification of procedure end [2018-06-22 11:24:26,931 INFO ]: Found implementation of procedure end [2018-06-22 11:24:26,931 INFO ]: Specification and implementation of procedure loop given in one single declaration [2018-06-22 11:24:26,931 INFO ]: Found specification of procedure loop [2018-06-22 11:24:26,931 INFO ]: Found implementation of procedure loop [2018-06-22 11:24:26,931 INFO ]: Specification and implementation of procedure init given in one single declaration [2018-06-22 11:24:26,931 INFO ]: Found specification of procedure init [2018-06-22 11:24:26,931 INFO ]: Found implementation of procedure init [2018-06-22 11:24:26,931 INFO ]: Specification and implementation of procedure incr given in one single declaration [2018-06-22 11:24:26,931 INFO ]: Found specification of procedure incr [2018-06-22 11:24:26,931 INFO ]: Found implementation of procedure incr [2018-06-22 11:24:26,932 INFO ]: Specification and implementation of procedure write2 given in one single declaration [2018-06-22 11:24:26,932 INFO ]: Found specification of procedure write2 [2018-06-22 11:24:26,932 INFO ]: Found implementation of procedure write2 [2018-06-22 11:24:26,932 INFO ]: Specification and implementation of procedure write1 given in one single declaration [2018-06-22 11:24:26,932 INFO ]: Found specification of procedure write1 [2018-06-22 11:24:26,932 INFO ]: Found implementation of procedure write1 [2018-06-22 11:24:26,932 INFO ]: Specification and implementation of procedure read2 given in one single declaration [2018-06-22 11:24:26,932 INFO ]: Found specification of procedure read2 [2018-06-22 11:24:26,932 INFO ]: Found implementation of procedure read2 [2018-06-22 11:24:26,932 INFO ]: Specification and implementation of procedure read1 given in one single declaration [2018-06-22 11:24:26,932 INFO ]: Found specification of procedure read1 [2018-06-22 11:24:26,932 INFO ]: Found implementation of procedure read1 [2018-06-22 11:24:26,932 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:24:26,932 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:24:26,932 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:24:27,273 INFO ]: Using library mode [2018-06-22 11:24:27,273 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:24:27 BoogieIcfgContainer [2018-06-22 11:24:27,273 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:24:27,275 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:24:27,275 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:24:27,278 INFO ]: TraceAbstraction initialized [2018-06-22 11:24:27,278 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:24:26" (1/3) ... [2018-06-22 11:24:27,279 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62efdb33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:24:27, skipping insertion in model container [2018-06-22 11:24:27,279 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:24:26" (2/3) ... [2018-06-22 11:24:27,280 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62efdb33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:24:27, skipping insertion in model container [2018-06-22 11:24:27,280 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:24:27" (3/3) ... [2018-06-22 11:24:27,281 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:24:27,291 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:24:27,298 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:24:27,342 INFO ]: Using default assertion order modulation [2018-06-22 11:24:27,343 INFO ]: Interprodecural is true [2018-06-22 11:24:27,343 INFO ]: Hoare is false [2018-06-22 11:24:27,343 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:24:27,343 INFO ]: Backedges is TWOTRACK [2018-06-22 11:24:27,343 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:24:27,343 INFO ]: Difference is false [2018-06-22 11:24:27,343 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:24:27,343 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:24:27,357 INFO ]: Start isEmpty. Operand 47 states. [2018-06-22 11:24:27,370 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:24:27,370 INFO ]: Found error trace [2018-06-22 11:24:27,371 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:27,371 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:27,374 INFO ]: Analyzing trace with hash -567552966, now seen corresponding path program 1 times [2018-06-22 11:24:27,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:27,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:27,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:27,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:27,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:27,448 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:27,555 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:24:27,558 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:24:27,558 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:24:27,559 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:24:27,569 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:24:27,570 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:24:27,571 INFO ]: Start difference. First operand 47 states. Second operand 6 states. [2018-06-22 11:24:27,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:27,675 INFO ]: Finished difference Result 51 states and 63 transitions. [2018-06-22 11:24:27,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:24:27,676 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:24:27,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:27,686 INFO ]: With dead ends: 51 [2018-06-22 11:24:27,686 INFO ]: Without dead ends: 49 [2018-06-22 11:24:27,687 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:24:27,701 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:24:27,726 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-22 11:24:27,727 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:24:27,729 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-06-22 11:24:27,730 INFO ]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 17 [2018-06-22 11:24:27,730 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:27,730 INFO ]: Abstraction has 49 states and 61 transitions. [2018-06-22 11:24:27,730 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:24:27,731 INFO ]: Start isEmpty. Operand 49 states and 61 transitions. [2018-06-22 11:24:27,732 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:24:27,732 INFO ]: Found error trace [2018-06-22 11:24:27,732 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:27,733 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:27,733 INFO ]: Analyzing trace with hash -960579976, now seen corresponding path program 1 times [2018-06-22 11:24:27,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:27,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:27,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:27,734 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:27,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:27,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:28,247 WARN ]: Spent 328.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-06-22 11:24:28,337 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:24:28,337 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:24:28,337 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:24:28,339 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:24:28,339 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:24:28,339 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:24:28,339 INFO ]: Start difference. First operand 49 states and 61 transitions. Second operand 8 states. [2018-06-22 11:24:28,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:28,677 INFO ]: Finished difference Result 53 states and 65 transitions. [2018-06-22 11:24:28,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:24:28,677 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:24:28,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:28,679 INFO ]: With dead ends: 53 [2018-06-22 11:24:28,679 INFO ]: Without dead ends: 51 [2018-06-22 11:24:28,680 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:24:28,680 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:24:28,689 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-06-22 11:24:28,689 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:24:28,691 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-06-22 11:24:28,691 INFO ]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 17 [2018-06-22 11:24:28,691 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:28,691 INFO ]: Abstraction has 47 states and 59 transitions. [2018-06-22 11:24:28,691 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:24:28,691 INFO ]: Start isEmpty. Operand 47 states and 59 transitions. [2018-06-22 11:24:28,693 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:24:28,693 INFO ]: Found error trace [2018-06-22 11:24:28,693 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:28,693 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:28,693 INFO ]: Analyzing trace with hash 862470252, now seen corresponding path program 1 times [2018-06-22 11:24:28,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:28,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:28,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:28,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:28,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:28,718 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:29,115 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:24:29,115 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:24:29,115 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 11:24:29,115 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:24:29,115 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:24:29,115 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:24:29,116 INFO ]: Start difference. First operand 47 states and 59 transitions. Second operand 13 states. [2018-06-22 11:24:29,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:29,705 INFO ]: Finished difference Result 74 states and 100 transitions. [2018-06-22 11:24:29,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:24:29,705 INFO ]: Start accepts. Automaton has 13 states. Word has length 41 [2018-06-22 11:24:29,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:29,708 INFO ]: With dead ends: 74 [2018-06-22 11:24:29,708 INFO ]: Without dead ends: 72 [2018-06-22 11:24:29,708 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:24:29,708 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:24:29,721 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-06-22 11:24:29,721 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:24:29,723 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2018-06-22 11:24:29,723 INFO ]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 41 [2018-06-22 11:24:29,724 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:29,724 INFO ]: Abstraction has 64 states and 85 transitions. [2018-06-22 11:24:29,724 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:24:29,724 INFO ]: Start isEmpty. Operand 64 states and 85 transitions. [2018-06-22 11:24:29,727 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:24:29,727 INFO ]: Found error trace [2018-06-22 11:24:29,727 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:29,727 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:29,727 INFO ]: Analyzing trace with hash 1081324970, now seen corresponding path program 1 times [2018-06-22 11:24:29,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:29,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:29,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:29,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:29,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:29,745 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:29,802 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:24:29,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:24:29,803 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:24:29,803 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:24:29,803 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:24:29,803 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:24:29,803 INFO ]: Start difference. First operand 64 states and 85 transitions. Second operand 5 states. [2018-06-22 11:24:30,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:30,003 INFO ]: Finished difference Result 68 states and 89 transitions. [2018-06-22 11:24:30,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:24:30,004 INFO ]: Start accepts. Automaton has 5 states. Word has length 41 [2018-06-22 11:24:30,004 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:30,005 INFO ]: With dead ends: 68 [2018-06-22 11:24:30,006 INFO ]: Without dead ends: 68 [2018-06-22 11:24:30,006 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:24:30,006 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 11:24:30,015 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-06-22 11:24:30,015 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:24:30,017 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2018-06-22 11:24:30,017 INFO ]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 41 [2018-06-22 11:24:30,017 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:30,017 INFO ]: Abstraction has 68 states and 89 transitions. [2018-06-22 11:24:30,017 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:24:30,017 INFO ]: Start isEmpty. Operand 68 states and 89 transitions. [2018-06-22 11:24:30,019 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:24:30,019 INFO ]: Found error trace [2018-06-22 11:24:30,019 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:30,020 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:30,020 INFO ]: Analyzing trace with hash 291747513, now seen corresponding path program 1 times [2018-06-22 11:24:30,020 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:30,020 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:30,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:30,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:30,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:30,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:30,247 INFO ]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:24:30,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:24:30,247 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 11:24:30,247 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:24:30,247 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:24:30,247 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:24:30,248 INFO ]: Start difference. First operand 68 states and 89 transitions. Second operand 11 states. [2018-06-22 11:24:30,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:30,558 INFO ]: Finished difference Result 125 states and 201 transitions. [2018-06-22 11:24:30,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:24:30,558 INFO ]: Start accepts. Automaton has 11 states. Word has length 53 [2018-06-22 11:24:30,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:30,562 INFO ]: With dead ends: 125 [2018-06-22 11:24:30,562 INFO ]: Without dead ends: 123 [2018-06-22 11:24:30,562 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:24:30,562 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-22 11:24:30,580 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-06-22 11:24:30,580 INFO ]: Start removeUnreachable. Operand 123 states. [2018-06-22 11:24:30,583 INFO ]: Finished removeUnreachable. Reduced from 123 states to 123 states and 199 transitions. [2018-06-22 11:24:30,583 INFO ]: Start accepts. Automaton has 123 states and 199 transitions. Word has length 53 [2018-06-22 11:24:30,584 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:30,584 INFO ]: Abstraction has 123 states and 199 transitions. [2018-06-22 11:24:30,584 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:24:30,584 INFO ]: Start isEmpty. Operand 123 states and 199 transitions. [2018-06-22 11:24:30,588 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:24:30,588 INFO ]: Found error trace [2018-06-22 11:24:30,588 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:30,588 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:30,588 INFO ]: Analyzing trace with hash 510602231, now seen corresponding path program 1 times [2018-06-22 11:24:30,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:30,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:30,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:30,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:30,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:30,607 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:30,680 INFO ]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:24:30,680 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:30,680 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:30,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:30,745 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:30,755 INFO ]: Computing forward predicates... [2018-06-22 11:24:31,250 INFO ]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:24:31,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:31,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-06-22 11:24:31,284 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:24:31,285 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:24:31,285 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:24:31,285 INFO ]: Start difference. First operand 123 states and 199 transitions. Second operand 9 states. [2018-06-22 11:24:31,572 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:31,572 INFO ]: Finished difference Result 139 states and 231 transitions. [2018-06-22 11:24:31,574 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:24:31,574 INFO ]: Start accepts. Automaton has 9 states. Word has length 53 [2018-06-22 11:24:31,574 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:31,576 INFO ]: With dead ends: 139 [2018-06-22 11:24:31,576 INFO ]: Without dead ends: 135 [2018-06-22 11:24:31,577 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:24:31,577 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 11:24:31,599 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-06-22 11:24:31,599 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-22 11:24:31,602 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2018-06-22 11:24:31,602 INFO ]: Start accepts. Automaton has 130 states and 202 transitions. Word has length 53 [2018-06-22 11:24:31,602 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:31,602 INFO ]: Abstraction has 130 states and 202 transitions. [2018-06-22 11:24:31,602 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:24:31,602 INFO ]: Start isEmpty. Operand 130 states and 202 transitions. [2018-06-22 11:24:31,605 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:24:31,605 INFO ]: Found error trace [2018-06-22 11:24:31,606 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:31,606 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:31,606 INFO ]: Analyzing trace with hash 1092259924, now seen corresponding path program 1 times [2018-06-22 11:24:31,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:31,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:31,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:31,607 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:31,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:31,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:31,873 INFO ]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:24:31,873 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:31,873 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:31,891 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:31,933 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:31,938 INFO ]: Computing forward predicates... [2018-06-22 11:24:32,113 INFO ]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:24:32,135 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:32,135 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-06-22 11:24:32,135 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:24:32,135 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:24:32,135 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:24:32,135 INFO ]: Start difference. First operand 130 states and 202 transitions. Second operand 18 states. [2018-06-22 11:24:32,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:32,599 INFO ]: Finished difference Result 192 states and 320 transitions. [2018-06-22 11:24:32,604 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:24:32,604 INFO ]: Start accepts. Automaton has 18 states. Word has length 53 [2018-06-22 11:24:32,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:32,607 INFO ]: With dead ends: 192 [2018-06-22 11:24:32,607 INFO ]: Without dead ends: 190 [2018-06-22 11:24:32,607 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:24:32,607 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-22 11:24:32,635 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 152. [2018-06-22 11:24:32,635 INFO ]: Start removeUnreachable. Operand 152 states. [2018-06-22 11:24:32,637 INFO ]: Finished removeUnreachable. Reduced from 152 states to 152 states and 247 transitions. [2018-06-22 11:24:32,637 INFO ]: Start accepts. Automaton has 152 states and 247 transitions. Word has length 53 [2018-06-22 11:24:32,638 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:32,638 INFO ]: Abstraction has 152 states and 247 transitions. [2018-06-22 11:24:32,638 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:24:32,638 INFO ]: Start isEmpty. Operand 152 states and 247 transitions. [2018-06-22 11:24:32,641 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:24:32,641 INFO ]: Found error trace [2018-06-22 11:24:32,641 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:32,641 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:32,641 INFO ]: Analyzing trace with hash 1679004471, now seen corresponding path program 1 times [2018-06-22 11:24:32,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:32,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:32,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:32,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:32,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:32,659 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:32,726 INFO ]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:24:32,726 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:24:32,726 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:24:32,726 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:24:32,726 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:24:32,726 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:24:32,727 INFO ]: Start difference. First operand 152 states and 247 transitions. Second operand 5 states. [2018-06-22 11:24:32,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:32,910 INFO ]: Finished difference Result 169 states and 264 transitions. [2018-06-22 11:24:32,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:24:32,910 INFO ]: Start accepts. Automaton has 5 states. Word has length 53 [2018-06-22 11:24:32,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:32,912 INFO ]: With dead ends: 169 [2018-06-22 11:24:32,912 INFO ]: Without dead ends: 166 [2018-06-22 11:24:32,912 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:24:32,913 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 11:24:32,933 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 137. [2018-06-22 11:24:32,934 INFO ]: Start removeUnreachable. Operand 137 states. [2018-06-22 11:24:32,936 INFO ]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2018-06-22 11:24:32,936 INFO ]: Start accepts. Automaton has 137 states and 201 transitions. Word has length 53 [2018-06-22 11:24:32,936 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:32,936 INFO ]: Abstraction has 137 states and 201 transitions. [2018-06-22 11:24:32,936 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:24:32,936 INFO ]: Start isEmpty. Operand 137 states and 201 transitions. [2018-06-22 11:24:32,938 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:24:32,938 INFO ]: Found error trace [2018-06-22 11:24:32,938 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:32,938 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:32,938 INFO ]: Analyzing trace with hash -1151723374, now seen corresponding path program 1 times [2018-06-22 11:24:32,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:32,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:32,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:32,939 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:32,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:32,955 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:33,387 INFO ]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:24:33,387 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:33,387 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:33,393 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:33,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:33,427 INFO ]: Computing forward predicates... [2018-06-22 11:24:34,071 INFO ]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:24:34,099 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:34,100 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 30 [2018-06-22 11:24:34,100 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:24:34,100 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:24:34,100 INFO ]: CoverageRelationStatistics Valid=65, Invalid=805, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:24:34,100 INFO ]: Start difference. First operand 137 states and 201 transitions. Second operand 30 states. [2018-06-22 11:24:36,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:36,120 INFO ]: Finished difference Result 380 states and 592 transitions. [2018-06-22 11:24:36,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 11:24:36,120 INFO ]: Start accepts. Automaton has 30 states. Word has length 53 [2018-06-22 11:24:36,120 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:36,124 INFO ]: With dead ends: 380 [2018-06-22 11:24:36,124 INFO ]: Without dead ends: 376 [2018-06-22 11:24:36,125 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=203, Invalid=2347, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:24:36,125 INFO ]: Start minimizeSevpa. Operand 376 states. [2018-06-22 11:24:36,166 INFO ]: Finished minimizeSevpa. Reduced states from 376 to 283. [2018-06-22 11:24:36,166 INFO ]: Start removeUnreachable. Operand 283 states. [2018-06-22 11:24:36,173 INFO ]: Finished removeUnreachable. Reduced from 283 states to 283 states and 451 transitions. [2018-06-22 11:24:36,173 INFO ]: Start accepts. Automaton has 283 states and 451 transitions. Word has length 53 [2018-06-22 11:24:36,174 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:36,174 INFO ]: Abstraction has 283 states and 451 transitions. [2018-06-22 11:24:36,174 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:24:36,176 INFO ]: Start isEmpty. Operand 283 states and 451 transitions. [2018-06-22 11:24:36,179 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:24:36,179 INFO ]: Found error trace [2018-06-22 11:24:36,179 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:36,179 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:36,179 INFO ]: Analyzing trace with hash 1027981922, now seen corresponding path program 1 times [2018-06-22 11:24:36,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:36,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:36,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:36,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:36,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:36,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:36,311 INFO ]: Checked inductivity of 45 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:24:36,311 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:36,311 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:36,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:36,347 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:36,352 INFO ]: Computing forward predicates... [2018-06-22 11:24:37,140 INFO ]: Checked inductivity of 45 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:24:37,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:37,159 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2018-06-22 11:24:37,160 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:24:37,160 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:24:37,160 INFO ]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:24:37,160 INFO ]: Start difference. First operand 283 states and 451 transitions. Second operand 24 states. [2018-06-22 11:24:39,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:39,390 INFO ]: Finished difference Result 516 states and 922 transitions. [2018-06-22 11:24:39,445 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:24:39,445 INFO ]: Start accepts. Automaton has 24 states. Word has length 69 [2018-06-22 11:24:39,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:39,450 INFO ]: With dead ends: 516 [2018-06-22 11:24:39,450 INFO ]: Without dead ends: 510 [2018-06-22 11:24:39,451 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:24:39,451 INFO ]: Start minimizeSevpa. Operand 510 states. [2018-06-22 11:24:39,492 INFO ]: Finished minimizeSevpa. Reduced states from 510 to 387. [2018-06-22 11:24:39,492 INFO ]: Start removeUnreachable. Operand 387 states. [2018-06-22 11:24:39,497 INFO ]: Finished removeUnreachable. Reduced from 387 states to 387 states and 733 transitions. [2018-06-22 11:24:39,497 INFO ]: Start accepts. Automaton has 387 states and 733 transitions. Word has length 69 [2018-06-22 11:24:39,498 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:39,498 INFO ]: Abstraction has 387 states and 733 transitions. [2018-06-22 11:24:39,498 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:24:39,498 INFO ]: Start isEmpty. Operand 387 states and 733 transitions. [2018-06-22 11:24:39,502 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:24:39,502 INFO ]: Found error trace [2018-06-22 11:24:39,502 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:39,502 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:39,502 INFO ]: Analyzing trace with hash -1378250499, now seen corresponding path program 1 times [2018-06-22 11:24:39,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:39,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:39,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:39,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:39,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:39,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:39,677 INFO ]: Checked inductivity of 45 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:24:39,677 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:39,677 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:39,683 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:39,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:39,738 INFO ]: Computing forward predicates... [2018-06-22 11:24:40,366 INFO ]: Checked inductivity of 45 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:24:40,385 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:40,385 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2018-06-22 11:24:40,385 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:24:40,385 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:24:40,386 INFO ]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:24:40,386 INFO ]: Start difference. First operand 387 states and 733 transitions. Second operand 26 states. [2018-06-22 11:24:42,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:42,542 INFO ]: Finished difference Result 771 states and 1710 transitions. [2018-06-22 11:24:42,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 11:24:42,542 INFO ]: Start accepts. Automaton has 26 states. Word has length 69 [2018-06-22 11:24:42,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:42,554 INFO ]: With dead ends: 771 [2018-06-22 11:24:42,554 INFO ]: Without dead ends: 750 [2018-06-22 11:24:42,555 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=2072, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:24:42,556 INFO ]: Start minimizeSevpa. Operand 750 states. [2018-06-22 11:24:42,613 INFO ]: Finished minimizeSevpa. Reduced states from 750 to 612. [2018-06-22 11:24:42,613 INFO ]: Start removeUnreachable. Operand 612 states. [2018-06-22 11:24:42,621 INFO ]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1415 transitions. [2018-06-22 11:24:42,621 INFO ]: Start accepts. Automaton has 612 states and 1415 transitions. Word has length 69 [2018-06-22 11:24:42,621 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:42,621 INFO ]: Abstraction has 612 states and 1415 transitions. [2018-06-22 11:24:42,621 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:24:42,621 INFO ]: Start isEmpty. Operand 612 states and 1415 transitions. [2018-06-22 11:24:42,629 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:24:42,629 INFO ]: Found error trace [2018-06-22 11:24:42,629 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:42,629 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:42,630 INFO ]: Analyzing trace with hash -1926529539, now seen corresponding path program 2 times [2018-06-22 11:24:42,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:42,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:42,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:42,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:42,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:42,655 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:42,852 WARN ]: Spent 122.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 4 [2018-06-22 11:24:42,911 INFO ]: Checked inductivity of 45 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:24:42,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:42,911 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:42,920 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:24:42,962 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:24:42,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:42,967 INFO ]: Computing forward predicates... [2018-06-22 11:24:43,153 INFO ]: Checked inductivity of 45 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:24:43,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:43,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2018-06-22 11:24:43,177 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:24:43,178 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:24:43,178 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:24:43,178 INFO ]: Start difference. First operand 612 states and 1415 transitions. Second operand 19 states. [2018-06-22 11:24:44,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:44,390 INFO ]: Finished difference Result 1004 states and 2449 transitions. [2018-06-22 11:24:44,418 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:24:44,418 INFO ]: Start accepts. Automaton has 19 states. Word has length 69 [2018-06-22 11:24:44,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:44,432 INFO ]: With dead ends: 1004 [2018-06-22 11:24:44,432 INFO ]: Without dead ends: 975 [2018-06-22 11:24:44,432 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:24:44,433 INFO ]: Start minimizeSevpa. Operand 975 states. [2018-06-22 11:24:44,511 INFO ]: Finished minimizeSevpa. Reduced states from 975 to 673. [2018-06-22 11:24:44,511 INFO ]: Start removeUnreachable. Operand 673 states. [2018-06-22 11:24:44,518 INFO ]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1515 transitions. [2018-06-22 11:24:44,518 INFO ]: Start accepts. Automaton has 673 states and 1515 transitions. Word has length 69 [2018-06-22 11:24:44,518 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:44,518 INFO ]: Abstraction has 673 states and 1515 transitions. [2018-06-22 11:24:44,518 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:24:44,518 INFO ]: Start isEmpty. Operand 673 states and 1515 transitions. [2018-06-22 11:24:44,523 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:24:44,523 INFO ]: Found error trace [2018-06-22 11:24:44,523 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:44,523 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:44,523 INFO ]: Analyzing trace with hash 765756382, now seen corresponding path program 1 times [2018-06-22 11:24:44,523 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:44,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:44,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:44,524 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:24:44,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:44,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:45,009 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 4 [2018-06-22 11:24:45,859 INFO ]: Checked inductivity of 45 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:24:45,859 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:45,859 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:45,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:45,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:45,895 INFO ]: Computing forward predicates... [2018-06-22 11:24:46,082 INFO ]: Checked inductivity of 45 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:24:46,103 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:46,103 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2018-06-22 11:24:46,103 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:24:46,103 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:24:46,104 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:24:46,104 INFO ]: Start difference. First operand 673 states and 1515 transitions. Second operand 23 states. [2018-06-22 11:24:46,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:46,717 INFO ]: Finished difference Result 807 states and 1852 transitions. [2018-06-22 11:24:46,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:24:46,718 INFO ]: Start accepts. Automaton has 23 states. Word has length 69 [2018-06-22 11:24:46,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:46,727 INFO ]: With dead ends: 807 [2018-06-22 11:24:46,728 INFO ]: Without dead ends: 805 [2018-06-22 11:24:46,728 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:24:46,729 INFO ]: Start minimizeSevpa. Operand 805 states. [2018-06-22 11:24:46,789 INFO ]: Finished minimizeSevpa. Reduced states from 805 to 686. [2018-06-22 11:24:46,789 INFO ]: Start removeUnreachable. Operand 686 states. [2018-06-22 11:24:46,795 INFO ]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1567 transitions. [2018-06-22 11:24:46,795 INFO ]: Start accepts. Automaton has 686 states and 1567 transitions. Word has length 69 [2018-06-22 11:24:46,796 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:46,796 INFO ]: Abstraction has 686 states and 1567 transitions. [2018-06-22 11:24:46,796 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:24:46,796 INFO ]: Start isEmpty. Operand 686 states and 1567 transitions. [2018-06-22 11:24:46,803 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:24:46,803 INFO ]: Found error trace [2018-06-22 11:24:46,803 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:46,803 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:46,803 INFO ]: Analyzing trace with hash 1562311848, now seen corresponding path program 1 times [2018-06-22 11:24:46,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:46,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:46,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:46,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:46,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:46,818 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:47,581 INFO ]: Checked inductivity of 189 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-06-22 11:24:47,581 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:47,581 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:47,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:47,636 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:47,642 INFO ]: Computing forward predicates... [2018-06-22 11:24:47,963 INFO ]: Checked inductivity of 189 backedges. 35 proven. 36 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-22 11:24:47,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:47,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2018-06-22 11:24:47,989 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:24:47,989 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:24:47,989 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:24:47,989 INFO ]: Start difference. First operand 686 states and 1567 transitions. Second operand 29 states. [2018-06-22 11:24:50,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:50,608 INFO ]: Finished difference Result 1431 states and 4056 transitions. [2018-06-22 11:24:50,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 11:24:50,608 INFO ]: Start accepts. Automaton has 29 states. Word has length 117 [2018-06-22 11:24:50,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:50,628 INFO ]: With dead ends: 1431 [2018-06-22 11:24:50,628 INFO ]: Without dead ends: 1398 [2018-06-22 11:24:50,629 INFO ]: 0 DeclaredPredicates, 185 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=242, Invalid=3418, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 11:24:50,630 INFO ]: Start minimizeSevpa. Operand 1398 states. [2018-06-22 11:24:50,753 INFO ]: Finished minimizeSevpa. Reduced states from 1398 to 1082. [2018-06-22 11:24:50,753 INFO ]: Start removeUnreachable. Operand 1082 states. [2018-06-22 11:24:50,764 INFO ]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 3195 transitions. [2018-06-22 11:24:50,764 INFO ]: Start accepts. Automaton has 1082 states and 3195 transitions. Word has length 117 [2018-06-22 11:24:50,765 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:50,765 INFO ]: Abstraction has 1082 states and 3195 transitions. [2018-06-22 11:24:50,765 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:24:50,765 INFO ]: Start isEmpty. Operand 1082 states and 3195 transitions. [2018-06-22 11:24:50,774 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:24:50,775 INFO ]: Found error trace [2018-06-22 11:24:50,775 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:50,775 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:50,775 INFO ]: Analyzing trace with hash -854203382, now seen corresponding path program 1 times [2018-06-22 11:24:50,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:50,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:50,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:50,776 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:50,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:50,793 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:50,975 WARN ]: Spent 120.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-06-22 11:24:51,283 INFO ]: Checked inductivity of 83 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 11:24:51,283 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:51,283 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:51,289 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:51,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:51,323 INFO ]: Computing forward predicates... [2018-06-22 11:24:51,415 INFO ]: Checked inductivity of 83 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 11:24:51,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:51,442 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 11:24:51,443 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:24:51,443 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:24:51,443 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:24:51,443 INFO ]: Start difference. First operand 1082 states and 3195 transitions. Second operand 15 states. [2018-06-22 11:24:51,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:51,811 INFO ]: Finished difference Result 1238 states and 3445 transitions. [2018-06-22 11:24:51,811 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:24:51,812 INFO ]: Start accepts. Automaton has 15 states. Word has length 81 [2018-06-22 11:24:51,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:51,829 INFO ]: With dead ends: 1238 [2018-06-22 11:24:51,829 INFO ]: Without dead ends: 1236 [2018-06-22 11:24:51,830 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:24:51,830 INFO ]: Start minimizeSevpa. Operand 1236 states. [2018-06-22 11:24:51,941 INFO ]: Finished minimizeSevpa. Reduced states from 1236 to 1077. [2018-06-22 11:24:51,941 INFO ]: Start removeUnreachable. Operand 1077 states. [2018-06-22 11:24:51,952 INFO ]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 3164 transitions. [2018-06-22 11:24:51,952 INFO ]: Start accepts. Automaton has 1077 states and 3164 transitions. Word has length 81 [2018-06-22 11:24:51,952 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:51,952 INFO ]: Abstraction has 1077 states and 3164 transitions. [2018-06-22 11:24:51,952 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:24:51,952 INFO ]: Start isEmpty. Operand 1077 states and 3164 transitions. [2018-06-22 11:24:51,961 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:24:51,961 INFO ]: Found error trace [2018-06-22 11:24:51,962 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:51,962 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:51,962 INFO ]: Analyzing trace with hash -2110373728, now seen corresponding path program 1 times [2018-06-22 11:24:51,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:51,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:51,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:51,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:51,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:51,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:52,204 INFO ]: Checked inductivity of 189 backedges. 39 proven. 44 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 11:24:52,204 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:52,204 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:52,210 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:52,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:52,264 INFO ]: Computing forward predicates... [2018-06-22 11:24:52,537 INFO ]: Checked inductivity of 189 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 11:24:52,555 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:52,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2018-06-22 11:24:52,556 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:24:52,556 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:24:52,556 INFO ]: CoverageRelationStatistics Valid=54, Invalid=648, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:24:52,556 INFO ]: Start difference. First operand 1077 states and 3164 transitions. Second operand 27 states. [2018-06-22 11:24:53,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:53,705 INFO ]: Finished difference Result 1353 states and 3465 transitions. [2018-06-22 11:24:53,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 11:24:53,705 INFO ]: Start accepts. Automaton has 27 states. Word has length 117 [2018-06-22 11:24:53,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:53,721 INFO ]: With dead ends: 1353 [2018-06-22 11:24:53,721 INFO ]: Without dead ends: 1349 [2018-06-22 11:24:53,722 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=2260, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:24:53,723 INFO ]: Start minimizeSevpa. Operand 1349 states. [2018-06-22 11:24:53,818 INFO ]: Finished minimizeSevpa. Reduced states from 1349 to 1097. [2018-06-22 11:24:53,818 INFO ]: Start removeUnreachable. Operand 1097 states. [2018-06-22 11:24:53,837 INFO ]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 3029 transitions. [2018-06-22 11:24:53,837 INFO ]: Start accepts. Automaton has 1097 states and 3029 transitions. Word has length 117 [2018-06-22 11:24:53,837 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:53,837 INFO ]: Abstraction has 1097 states and 3029 transitions. [2018-06-22 11:24:53,837 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:24:53,837 INFO ]: Start isEmpty. Operand 1097 states and 3029 transitions. [2018-06-22 11:24:53,843 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:24:53,843 INFO ]: Found error trace [2018-06-22 11:24:53,843 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:53,843 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:53,843 INFO ]: Analyzing trace with hash -1116428922, now seen corresponding path program 1 times [2018-06-22 11:24:53,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:53,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:53,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:53,845 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:53,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:53,865 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:54,398 INFO ]: Checked inductivity of 83 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 11:24:54,398 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:54,398 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:54,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:54,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:54,439 INFO ]: Computing forward predicates... [2018-06-22 11:24:55,553 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-06-22 11:24:55,612 INFO ]: Checked inductivity of 83 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 11:24:55,630 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:55,631 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 38 [2018-06-22 11:24:55,631 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:24:55,631 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:24:55,631 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1313, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:24:55,631 INFO ]: Start difference. First operand 1097 states and 3029 transitions. Second operand 38 states. [2018-06-22 11:24:57,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:57,194 INFO ]: Finished difference Result 1583 states and 4288 transitions. [2018-06-22 11:24:57,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:24:57,195 INFO ]: Start accepts. Automaton has 38 states. Word has length 81 [2018-06-22 11:24:57,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:57,208 INFO ]: With dead ends: 1583 [2018-06-22 11:24:57,208 INFO ]: Without dead ends: 1577 [2018-06-22 11:24:57,209 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=190, Invalid=2780, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:24:57,210 INFO ]: Start minimizeSevpa. Operand 1577 states. [2018-06-22 11:24:57,325 INFO ]: Finished minimizeSevpa. Reduced states from 1577 to 1228. [2018-06-22 11:24:57,325 INFO ]: Start removeUnreachable. Operand 1228 states. [2018-06-22 11:24:57,335 INFO ]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3624 transitions. [2018-06-22 11:24:57,335 INFO ]: Start accepts. Automaton has 1228 states and 3624 transitions. Word has length 81 [2018-06-22 11:24:57,335 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:57,335 INFO ]: Abstraction has 1228 states and 3624 transitions. [2018-06-22 11:24:57,335 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:24:57,335 INFO ]: Start isEmpty. Operand 1228 states and 3624 transitions. [2018-06-22 11:24:57,348 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:24:57,348 INFO ]: Found error trace [2018-06-22 11:24:57,348 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:57,348 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:57,348 INFO ]: Analyzing trace with hash -504339398, now seen corresponding path program 1 times [2018-06-22 11:24:57,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:57,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:57,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:57,349 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:57,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:57,363 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:57,643 INFO ]: Checked inductivity of 130 backedges. 33 proven. 32 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-06-22 11:24:57,643 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:57,643 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:57,650 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:57,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:57,700 INFO ]: Computing forward predicates... [2018-06-22 11:24:57,779 INFO ]: Checked inductivity of 130 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-06-22 11:24:57,799 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:24:57,799 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2018-06-22 11:24:57,799 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:24:57,799 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:24:57,799 INFO ]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:24:57,800 INFO ]: Start difference. First operand 1228 states and 3624 transitions. Second operand 18 states. [2018-06-22 11:24:58,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:24:58,252 INFO ]: Finished difference Result 971 states and 2124 transitions. [2018-06-22 11:24:58,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:24:58,253 INFO ]: Start accepts. Automaton has 18 states. Word has length 105 [2018-06-22 11:24:58,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:24:58,260 INFO ]: With dead ends: 971 [2018-06-22 11:24:58,260 INFO ]: Without dead ends: 929 [2018-06-22 11:24:58,261 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:24:58,262 INFO ]: Start minimizeSevpa. Operand 929 states. [2018-06-22 11:24:58,312 INFO ]: Finished minimizeSevpa. Reduced states from 929 to 748. [2018-06-22 11:24:58,312 INFO ]: Start removeUnreachable. Operand 748 states. [2018-06-22 11:24:58,316 INFO ]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1596 transitions. [2018-06-22 11:24:58,316 INFO ]: Start accepts. Automaton has 748 states and 1596 transitions. Word has length 105 [2018-06-22 11:24:58,317 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:24:58,317 INFO ]: Abstraction has 748 states and 1596 transitions. [2018-06-22 11:24:58,317 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:24:58,317 INFO ]: Start isEmpty. Operand 748 states and 1596 transitions. [2018-06-22 11:24:58,324 INFO ]: Finished isEmpty. Found accepting run of length 134 [2018-06-22 11:24:58,324 INFO ]: Found error trace [2018-06-22 11:24:58,324 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:24:58,324 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:24:58,324 INFO ]: Analyzing trace with hash -1172744398, now seen corresponding path program 1 times [2018-06-22 11:24:58,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:24:58,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:24:58,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:58,324 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:58,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:24:58,339 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:59,208 INFO ]: Checked inductivity of 265 backedges. 47 proven. 26 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-06-22 11:24:59,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:24:59,208 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:24:59,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:24:59,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:24:59,273 INFO ]: Computing forward predicates... [2018-06-22 11:24:59,527 INFO ]: Checked inductivity of 265 backedges. 34 proven. 50 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-06-22 11:24:59,546 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:24:59,546 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 28 [2018-06-22 11:24:59,547 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:24:59,547 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:24:59,547 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:24:59,547 INFO ]: Start difference. First operand 748 states and 1596 transitions. Second operand 28 states. [2018-06-22 11:25:01,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:01,264 INFO ]: Finished difference Result 1335 states and 3345 transitions. [2018-06-22 11:25:01,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 11:25:01,264 INFO ]: Start accepts. Automaton has 28 states. Word has length 133 [2018-06-22 11:25:01,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:01,272 INFO ]: With dead ends: 1335 [2018-06-22 11:25:01,272 INFO ]: Without dead ends: 1329 [2018-06-22 11:25:01,273 INFO ]: 0 DeclaredPredicates, 196 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=258, Invalid=3524, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 11:25:01,273 INFO ]: Start minimizeSevpa. Operand 1329 states. [2018-06-22 11:25:01,350 INFO ]: Finished minimizeSevpa. Reduced states from 1329 to 927. [2018-06-22 11:25:01,350 INFO ]: Start removeUnreachable. Operand 927 states. [2018-06-22 11:25:01,355 INFO ]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2190 transitions. [2018-06-22 11:25:01,355 INFO ]: Start accepts. Automaton has 927 states and 2190 transitions. Word has length 133 [2018-06-22 11:25:01,356 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:01,356 INFO ]: Abstraction has 927 states and 2190 transitions. [2018-06-22 11:25:01,356 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:25:01,356 INFO ]: Start isEmpty. Operand 927 states and 2190 transitions. [2018-06-22 11:25:01,368 INFO ]: Finished isEmpty. Found accepting run of length 210 [2018-06-22 11:25:01,368 INFO ]: Found error trace [2018-06-22 11:25:01,368 INFO ]: trace histogram [13, 12, 12, 12, 12, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:01,368 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:01,369 INFO ]: Analyzing trace with hash 277384230, now seen corresponding path program 2 times [2018-06-22 11:25:01,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:01,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:01,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:01,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:01,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:01,397 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:01,917 INFO ]: Checked inductivity of 795 backedges. 85 proven. 134 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-06-22 11:25:01,917 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:01,917 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:01,923 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:25:02,010 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:25:02,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:02,017 INFO ]: Computing forward predicates... [2018-06-22 11:25:02,061 INFO ]: Checked inductivity of 795 backedges. 72 proven. 148 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2018-06-22 11:25:02,080 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:02,080 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-22 11:25:02,080 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:25:02,080 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:25:02,080 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:25:02,080 INFO ]: Start difference. First operand 927 states and 2190 transitions. Second operand 16 states. [2018-06-22 11:25:02,384 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:02,384 INFO ]: Finished difference Result 714 states and 1606 transitions. [2018-06-22 11:25:02,384 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:25:02,384 INFO ]: Start accepts. Automaton has 16 states. Word has length 209 [2018-06-22 11:25:02,384 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:02,387 INFO ]: With dead ends: 714 [2018-06-22 11:25:02,387 INFO ]: Without dead ends: 663 [2018-06-22 11:25:02,387 INFO ]: 0 DeclaredPredicates, 234 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:25:02,388 INFO ]: Start minimizeSevpa. Operand 663 states. [2018-06-22 11:25:02,423 INFO ]: Finished minimizeSevpa. Reduced states from 663 to 609. [2018-06-22 11:25:02,423 INFO ]: Start removeUnreachable. Operand 609 states. [2018-06-22 11:25:02,427 INFO ]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1303 transitions. [2018-06-22 11:25:02,427 INFO ]: Start accepts. Automaton has 609 states and 1303 transitions. Word has length 209 [2018-06-22 11:25:02,427 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:02,427 INFO ]: Abstraction has 609 states and 1303 transitions. [2018-06-22 11:25:02,427 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:25:02,427 INFO ]: Start isEmpty. Operand 609 states and 1303 transitions. [2018-06-22 11:25:02,431 INFO ]: Finished isEmpty. Found accepting run of length 170 [2018-06-22 11:25:02,431 INFO ]: Found error trace [2018-06-22 11:25:02,431 INFO ]: trace histogram [10, 9, 9, 9, 9, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:02,431 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:02,431 INFO ]: Analyzing trace with hash 898848076, now seen corresponding path program 2 times [2018-06-22 11:25:02,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:02,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:02,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:02,432 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:02,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:02,456 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:03,082 INFO ]: Checked inductivity of 439 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-06-22 11:25:03,082 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:03,082 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:03,088 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:25:03,153 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:25:03,153 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:03,157 INFO ]: Computing forward predicates... [2018-06-22 11:25:03,200 INFO ]: Checked inductivity of 439 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-06-22 11:25:03,218 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:03,218 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 11:25:03,218 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:25:03,218 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:25:03,218 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:25:03,219 INFO ]: Start difference. First operand 609 states and 1303 transitions. Second operand 11 states. [2018-06-22 11:25:03,373 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:03,373 INFO ]: Finished difference Result 649 states and 1369 transitions. [2018-06-22 11:25:03,373 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:25:03,373 INFO ]: Start accepts. Automaton has 11 states. Word has length 169 [2018-06-22 11:25:03,373 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:03,376 INFO ]: With dead ends: 649 [2018-06-22 11:25:03,376 INFO ]: Without dead ends: 649 [2018-06-22 11:25:03,376 INFO ]: 0 DeclaredPredicates, 178 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:25:03,376 INFO ]: Start minimizeSevpa. Operand 649 states. [2018-06-22 11:25:03,406 INFO ]: Finished minimizeSevpa. Reduced states from 649 to 603. [2018-06-22 11:25:03,407 INFO ]: Start removeUnreachable. Operand 603 states. [2018-06-22 11:25:03,410 INFO ]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1257 transitions. [2018-06-22 11:25:03,410 INFO ]: Start accepts. Automaton has 603 states and 1257 transitions. Word has length 169 [2018-06-22 11:25:03,410 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:03,410 INFO ]: Abstraction has 603 states and 1257 transitions. [2018-06-22 11:25:03,410 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:25:03,410 INFO ]: Start isEmpty. Operand 603 states and 1257 transitions. [2018-06-22 11:25:03,413 INFO ]: Finished isEmpty. Found accepting run of length 182 [2018-06-22 11:25:03,413 INFO ]: Found error trace [2018-06-22 11:25:03,413 INFO ]: trace histogram [11, 10, 10, 10, 10, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:03,414 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:03,414 INFO ]: Analyzing trace with hash 335991990, now seen corresponding path program 2 times [2018-06-22 11:25:03,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:03,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:03,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:03,414 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:03,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:03,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:03,789 INFO ]: Checked inductivity of 543 backedges. 42 proven. 111 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2018-06-22 11:25:03,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:03,790 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:03,795 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:25:03,905 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:25:03,905 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:03,913 INFO ]: Computing forward predicates... [2018-06-22 11:25:04,109 INFO ]: Checked inductivity of 543 backedges. 42 proven. 111 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2018-06-22 11:25:04,141 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:04,141 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 23 [2018-06-22 11:25:04,141 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:25:04,141 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:25:04,141 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:25:04,141 INFO ]: Start difference. First operand 603 states and 1257 transitions. Second operand 23 states. [2018-06-22 11:25:05,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:05,032 INFO ]: Finished difference Result 1219 states and 2919 transitions. [2018-06-22 11:25:05,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:25:05,034 INFO ]: Start accepts. Automaton has 23 states. Word has length 181 [2018-06-22 11:25:05,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:05,044 INFO ]: With dead ends: 1219 [2018-06-22 11:25:05,044 INFO ]: Without dead ends: 1191 [2018-06-22 11:25:05,044 INFO ]: 0 DeclaredPredicates, 222 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=1289, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:25:05,044 INFO ]: Start minimizeSevpa. Operand 1191 states. [2018-06-22 11:25:05,106 INFO ]: Finished minimizeSevpa. Reduced states from 1191 to 1055. [2018-06-22 11:25:05,106 INFO ]: Start removeUnreachable. Operand 1055 states. [2018-06-22 11:25:05,113 INFO ]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2540 transitions. [2018-06-22 11:25:05,114 INFO ]: Start accepts. Automaton has 1055 states and 2540 transitions. Word has length 181 [2018-06-22 11:25:05,114 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:05,114 INFO ]: Abstraction has 1055 states and 2540 transitions. [2018-06-22 11:25:05,114 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:25:05,114 INFO ]: Start isEmpty. Operand 1055 states and 2540 transitions. [2018-06-22 11:25:05,119 INFO ]: Finished isEmpty. Found accepting run of length 182 [2018-06-22 11:25:05,119 INFO ]: Found error trace [2018-06-22 11:25:05,119 INFO ]: trace histogram [11, 10, 10, 10, 10, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:05,119 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:05,120 INFO ]: Analyzing trace with hash 219105586, now seen corresponding path program 3 times [2018-06-22 11:25:05,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:05,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:05,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:05,120 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:05,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:05,147 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:05,867 INFO ]: Checked inductivity of 543 backedges. 56 proven. 92 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2018-06-22 11:25:05,867 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:05,867 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:05,873 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:25:05,972 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:25:05,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:05,979 INFO ]: Computing forward predicates... [2018-06-22 11:25:06,361 INFO ]: Checked inductivity of 543 backedges. 126 proven. 10 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-06-22 11:25:06,382 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:06,382 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-22 11:25:06,383 INFO ]: Interpolant automaton has 36 states [2018-06-22 11:25:06,383 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 11:25:06,383 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1188, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:25:06,383 INFO ]: Start difference. First operand 1055 states and 2540 transitions. Second operand 36 states. [2018-06-22 11:25:08,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:08,909 INFO ]: Finished difference Result 2342 states and 5962 transitions. [2018-06-22 11:25:08,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-22 11:25:08,910 INFO ]: Start accepts. Automaton has 36 states. Word has length 181 [2018-06-22 11:25:08,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:08,921 INFO ]: With dead ends: 2342 [2018-06-22 11:25:08,921 INFO ]: Without dead ends: 2172 [2018-06-22 11:25:08,922 INFO ]: 0 DeclaredPredicates, 243 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=289, Invalid=4681, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 11:25:08,923 INFO ]: Start minimizeSevpa. Operand 2172 states. [2018-06-22 11:25:09,023 INFO ]: Finished minimizeSevpa. Reduced states from 2172 to 1904. [2018-06-22 11:25:09,023 INFO ]: Start removeUnreachable. Operand 1904 states. [2018-06-22 11:25:09,037 INFO ]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 4842 transitions. [2018-06-22 11:25:09,037 INFO ]: Start accepts. Automaton has 1904 states and 4842 transitions. Word has length 181 [2018-06-22 11:25:09,037 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:09,037 INFO ]: Abstraction has 1904 states and 4842 transitions. [2018-06-22 11:25:09,037 INFO ]: Interpolant automaton has 36 states. [2018-06-22 11:25:09,037 INFO ]: Start isEmpty. Operand 1904 states and 4842 transitions. [2018-06-22 11:25:09,044 INFO ]: Finished isEmpty. Found accepting run of length 182 [2018-06-22 11:25:09,044 INFO ]: Found error trace [2018-06-22 11:25:09,044 INFO ]: trace histogram [11, 10, 10, 10, 10, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:09,044 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:09,045 INFO ]: Analyzing trace with hash 219680686, now seen corresponding path program 2 times [2018-06-22 11:25:09,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:09,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:09,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:09,045 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:09,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:09,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:09,574 INFO ]: Checked inductivity of 543 backedges. 116 proven. 18 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2018-06-22 11:25:09,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:09,574 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:09,580 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:25:09,647 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:25:09,647 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:09,653 INFO ]: Computing forward predicates... [2018-06-22 11:25:09,717 INFO ]: Checked inductivity of 543 backedges. 116 proven. 18 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2018-06-22 11:25:09,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:09,735 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 19 [2018-06-22 11:25:09,735 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:25:09,736 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:25:09,736 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:25:09,736 INFO ]: Start difference. First operand 1904 states and 4842 transitions. Second operand 19 states. [2018-06-22 11:25:10,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:10,930 INFO ]: Finished difference Result 4639 states and 18582 transitions. [2018-06-22 11:25:10,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:25:10,930 INFO ]: Start accepts. Automaton has 19 states. Word has length 181 [2018-06-22 11:25:10,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:10,975 INFO ]: With dead ends: 4639 [2018-06-22 11:25:10,975 INFO ]: Without dead ends: 4631 [2018-06-22 11:25:10,975 INFO ]: 0 DeclaredPredicates, 220 GetRequests, 188 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:25:10,977 INFO ]: Start minimizeSevpa. Operand 4631 states. [2018-06-22 11:25:11,234 INFO ]: Finished minimizeSevpa. Reduced states from 4631 to 4047. [2018-06-22 11:25:11,234 INFO ]: Start removeUnreachable. Operand 4047 states. [2018-06-22 11:25:11,279 INFO ]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 16696 transitions. [2018-06-22 11:25:11,279 INFO ]: Start accepts. Automaton has 4047 states and 16696 transitions. Word has length 181 [2018-06-22 11:25:11,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:11,279 INFO ]: Abstraction has 4047 states and 16696 transitions. [2018-06-22 11:25:11,279 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:25:11,279 INFO ]: Start isEmpty. Operand 4047 states and 16696 transitions. [2018-06-22 11:25:11,295 INFO ]: Finished isEmpty. Found accepting run of length 198 [2018-06-22 11:25:11,295 INFO ]: Found error trace [2018-06-22 11:25:11,295 INFO ]: trace histogram [12, 11, 11, 11, 11, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:11,295 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:11,295 INFO ]: Analyzing trace with hash -1605782790, now seen corresponding path program 1 times [2018-06-22 11:25:11,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:11,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:11,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:11,296 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:11,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:11,319 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:11,695 INFO ]: Checked inductivity of 667 backedges. 121 proven. 77 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-06-22 11:25:11,695 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:11,695 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:11,702 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:11,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:11,812 INFO ]: Computing forward predicates... [2018-06-22 11:25:11,949 INFO ]: Checked inductivity of 667 backedges. 108 proven. 91 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-06-22 11:25:11,978 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:11,978 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-22 11:25:11,978 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:25:11,978 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:25:11,978 INFO ]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:25:11,978 INFO ]: Start difference. First operand 4047 states and 16696 transitions. Second operand 16 states. [2018-06-22 11:25:13,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:13,603 INFO ]: Finished difference Result 3826 states and 16156 transitions. [2018-06-22 11:25:13,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:25:13,605 INFO ]: Start accepts. Automaton has 16 states. Word has length 197 [2018-06-22 11:25:13,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:13,660 INFO ]: With dead ends: 3826 [2018-06-22 11:25:13,660 INFO ]: Without dead ends: 3826 [2018-06-22 11:25:13,660 INFO ]: 0 DeclaredPredicates, 217 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:25:13,662 INFO ]: Start minimizeSevpa. Operand 3826 states. [2018-06-22 11:25:14,003 INFO ]: Finished minimizeSevpa. Reduced states from 3826 to 3758. [2018-06-22 11:25:14,003 INFO ]: Start removeUnreachable. Operand 3758 states. [2018-06-22 11:25:14,048 INFO ]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 15950 transitions. [2018-06-22 11:25:14,048 INFO ]: Start accepts. Automaton has 3758 states and 15950 transitions. Word has length 197 [2018-06-22 11:25:14,049 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:14,049 INFO ]: Abstraction has 3758 states and 15950 transitions. [2018-06-22 11:25:14,049 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:25:14,049 INFO ]: Start isEmpty. Operand 3758 states and 15950 transitions. [2018-06-22 11:25:14,060 INFO ]: Finished isEmpty. Found accepting run of length 206 [2018-06-22 11:25:14,060 INFO ]: Found error trace [2018-06-22 11:25:14,060 INFO ]: trace histogram [12, 11, 11, 11, 11, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:14,060 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:14,060 INFO ]: Analyzing trace with hash 800910116, now seen corresponding path program 3 times [2018-06-22 11:25:14,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:14,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:14,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:14,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:14,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:14,085 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:14,335 INFO ]: Checked inductivity of 663 backedges. 91 proven. 48 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2018-06-22 11:25:14,335 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:14,335 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:14,341 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:25:14,423 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:25:14,423 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:14,429 INFO ]: Computing forward predicates... [2018-06-22 11:25:14,611 INFO ]: Checked inductivity of 663 backedges. 106 proven. 2 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-06-22 11:25:14,631 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:14,632 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-06-22 11:25:14,632 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:25:14,632 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:25:14,632 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:25:14,632 INFO ]: Start difference. First operand 3758 states and 15950 transitions. Second operand 9 states. [2018-06-22 11:25:14,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:14,768 INFO ]: Finished difference Result 2701 states and 9337 transitions. [2018-06-22 11:25:14,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:25:14,769 INFO ]: Start accepts. Automaton has 9 states. Word has length 205 [2018-06-22 11:25:14,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:14,792 INFO ]: With dead ends: 2701 [2018-06-22 11:25:14,792 INFO ]: Without dead ends: 2537 [2018-06-22 11:25:14,792 INFO ]: 0 DeclaredPredicates, 215 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:25:14,793 INFO ]: Start minimizeSevpa. Operand 2537 states. [2018-06-22 11:25:15,055 INFO ]: Finished minimizeSevpa. Reduced states from 2537 to 2472. [2018-06-22 11:25:15,055 INFO ]: Start removeUnreachable. Operand 2472 states. [2018-06-22 11:25:15,078 INFO ]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 8571 transitions. [2018-06-22 11:25:15,078 INFO ]: Start accepts. Automaton has 2472 states and 8571 transitions. Word has length 205 [2018-06-22 11:25:15,078 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:15,078 INFO ]: Abstraction has 2472 states and 8571 transitions. [2018-06-22 11:25:15,078 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:25:15,078 INFO ]: Start isEmpty. Operand 2472 states and 8571 transitions. [2018-06-22 11:25:15,096 INFO ]: Finished isEmpty. Found accepting run of length 310 [2018-06-22 11:25:15,096 INFO ]: Found error trace [2018-06-22 11:25:15,096 INFO ]: trace histogram [19, 18, 18, 18, 18, 14, 14, 14, 14, 11, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:15,096 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:15,097 INFO ]: Analyzing trace with hash -35898096, now seen corresponding path program 4 times [2018-06-22 11:25:15,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:15,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:15,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:15,097 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:15,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:15,144 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:16,250 INFO ]: Checked inductivity of 1797 backedges. 159 proven. 398 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-06-22 11:25:16,250 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:16,250 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:16,255 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:25:16,376 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:25:16,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:16,385 INFO ]: Computing forward predicates... [2018-06-22 11:25:16,928 INFO ]: Checked inductivity of 1797 backedges. 1021 proven. 116 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-06-22 11:25:17,027 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:17,027 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 23] total 48 [2018-06-22 11:25:17,028 INFO ]: Interpolant automaton has 48 states [2018-06-22 11:25:17,028 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 11:25:17,028 INFO ]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:25:17,028 INFO ]: Start difference. First operand 2472 states and 8571 transitions. Second operand 48 states. Received shutdown request... [2018-06-22 11:25:21,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 11:25:21,772 WARN ]: Verification canceled [2018-06-22 11:25:21,776 WARN ]: Timeout [2018-06-22 11:25:21,776 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:25:21 BoogieIcfgContainer [2018-06-22 11:25:21,776 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:25:21,777 INFO ]: Toolchain (without parser) took 54958.76 ms. Allocated memory was 309.3 MB in the beginning and 883.9 MB in the end (delta: 574.6 MB). Free memory was 261.7 MB in the beginning and 367.5 MB in the end (delta: -105.8 MB). Peak memory consumption was 468.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:25:21,777 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:25:21,778 INFO ]: ChcToBoogie took 48.63 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:25:21,778 INFO ]: Boogie Preprocessor took 40.77 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 257.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:25:21,778 INFO ]: RCFGBuilder took 356.45 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 245.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:25:21,779 INFO ]: TraceAbstraction took 54500.99 ms. Allocated memory was 309.3 MB in the beginning and 883.9 MB in the end (delta: 574.6 MB). Free memory was 245.7 MB in the beginning and 367.5 MB in the end (delta: -121.7 MB). Peak memory consumption was 452.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:25:21,780 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 48.63 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 40.77 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 257.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 356.45 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 245.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54500.99 ms. Allocated memory was 309.3 MB in the beginning and 883.9 MB in the end (delta: 574.6 MB). Free memory was 245.7 MB in the beginning and 367.5 MB in the end (delta: -121.7 MB). Peak memory consumption was 452.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (2472states) and interpolant automaton (currently 88 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (1205 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 47 locations, 1 error locations. TIMEOUT Result, 54.4s OverallTime, 27 OverallIterations, 19 TraceHistogramMax, 30.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1808 SDtfs, 341 SDslu, 30636 SDs, 0 SdLazy, 28809 SolverSat, 761 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3524 GetRequests, 2683 SyntacticMatches, 18 SemanticMatches, 823 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5840 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4047occurred in iteration=24, 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: 2.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 3739 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 5624 NumberOfCodeBlocks, 5460 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 5576 ConstructedInterpolants, 42 QuantifiedInterpolants, 1654316 SizeOfPredicates, 60 NumberOfNonLiveVariables, 11446 ConjunctsInSsa, 732 ConjunctsInUnsatCore, 48 InterpolantComputations, 7 PerfectInterpolantSequences, 12415/14360 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_reverse_once1_abstracted.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-25-21-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_reverse_once1_abstracted.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-25-21-788.csv Completed graceful shutdown