java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/simple-loop_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:14:57,513 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:14:57,515 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:14:57,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:14:57,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:14:57,528 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:14:57,529 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:14:57,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:14:57,535 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:14:57,535 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:14:57,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:14:57,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:14:57,538 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:14:57,539 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:14:57,542 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:14:57,542 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:14:57,544 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:14:57,553 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:14:57,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:14:57,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:14:57,556 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:14:57,561 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:14:57,561 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:14:57,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:14:57,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:14:57,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:14:57,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:14:57,566 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:14:57,567 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:14:57,568 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:14:57,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:14:57,569 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:14:57,569 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:14:57,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:14:57,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:14:57,571 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:14:57,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:14:57,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:14:57,587 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:14:57,587 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:14:57,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:14:57,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:14:57,591 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:14:57,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:14:57,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:14:57,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:14:57,592 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:14:57,592 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:14:57,592 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:14:57,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:14:57,592 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:14:57,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:14:57,593 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:14:57,595 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:14:57,595 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:14:57,645 INFO ]: Repository-Root is: /tmp [2018-06-22 01:14:57,659 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:14:57,665 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:14:57,666 INFO ]: Initializing SmtParser... [2018-06-22 01:14:57,666 INFO ]: SmtParser initialized [2018-06-22 01:14:57,666 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/simple-loop_merged_safe.c-1.smt2 [2018-06-22 01:14:57,667 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:14:57,757 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/simple-loop_merged_safe.c-1.smt2 unknown [2018-06-22 01:14:57,906 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/simple-loop_merged_safe.c-1.smt2 [2018-06-22 01:14:57,910 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:14:57,916 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:14:57,917 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:14:57,917 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:14:57,917 INFO ]: ChcToBoogie initialized [2018-06-22 01:14:57,920 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:14:57" (1/1) ... [2018-06-22 01:14:57,971 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:57 Unit [2018-06-22 01:14:57,971 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:14:57,971 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:14:57,971 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:14:57,971 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:14:57,985 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:57" (1/1) ... [2018-06-22 01:14:57,985 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:57" (1/1) ... [2018-06-22 01:14:57,989 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:57" (1/1) ... [2018-06-22 01:14:57,990 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:57" (1/1) ... [2018-06-22 01:14:57,992 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:57" (1/1) ... [2018-06-22 01:14:57,993 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:57" (1/1) ... [2018-06-22 01:14:57,993 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:57" (1/1) ... [2018-06-22 01:14:57,995 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:14:57,995 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:14:57,995 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:14:57,995 INFO ]: RCFGBuilder initialized [2018-06-22 01:14:57,996 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:57" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:14:58,012 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:14:58,012 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:14:58,012 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:14:58,012 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:14:58,012 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:14:58,012 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:14:58,230 INFO ]: Using library mode [2018-06-22 01:14:58,230 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:14:58 BoogieIcfgContainer [2018-06-22 01:14:58,230 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:14:58,232 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:14:58,232 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:14:58,239 INFO ]: TraceAbstraction initialized [2018-06-22 01:14:58,239 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:14:57" (1/3) ... [2018-06-22 01:14:58,240 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c3eb0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:14:58, skipping insertion in model container [2018-06-22 01:14:58,240 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:14:57" (2/3) ... [2018-06-22 01:14:58,241 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c3eb0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:14:58, skipping insertion in model container [2018-06-22 01:14:58,241 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:14:58" (3/3) ... [2018-06-22 01:14:58,242 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:14:58,262 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:14:58,279 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:14:58,345 INFO ]: Using default assertion order modulation [2018-06-22 01:14:58,345 INFO ]: Interprodecural is true [2018-06-22 01:14:58,345 INFO ]: Hoare is false [2018-06-22 01:14:58,345 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:14:58,345 INFO ]: Backedges is TWOTRACK [2018-06-22 01:14:58,345 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:14:58,345 INFO ]: Difference is false [2018-06-22 01:14:58,345 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:14:58,345 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:14:58,359 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:14:58,371 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:14:58,371 INFO ]: Found error trace [2018-06-22 01:14:58,372 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:58,372 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:58,380 INFO ]: Analyzing trace with hash 822136012, now seen corresponding path program 1 times [2018-06-22 01:14:58,382 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:58,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:58,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:58,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:58,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:58,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:58,515 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:58,517 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:58,517 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:14:58,518 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:14:58,528 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:14:58,528 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:58,530 INFO ]: Start difference. First operand 13 states. Second operand 3 states. [2018-06-22 01:14:58,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:58,568 INFO ]: Finished difference Result 12 states and 13 transitions. [2018-06-22 01:14:58,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:14:58,569 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-22 01:14:58,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:58,576 INFO ]: With dead ends: 12 [2018-06-22 01:14:58,576 INFO ]: Without dead ends: 12 [2018-06-22 01:14:58,577 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:58,591 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:14:58,606 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:14:58,608 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:14:58,608 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-22 01:14:58,609 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-22 01:14:58,609 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:58,610 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-22 01:14:58,610 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:14:58,610 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-22 01:14:58,610 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:14:58,610 INFO ]: Found error trace [2018-06-22 01:14:58,610 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:58,610 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:58,610 INFO ]: Analyzing trace with hash 2118126430, now seen corresponding path program 1 times [2018-06-22 01:14:58,610 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:58,610 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:58,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:58,611 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:58,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:58,620 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:58,719 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:58,719 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:58,719 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:58,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:58,765 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:58,773 INFO ]: Computing forward predicates... [2018-06-22 01:14:58,800 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:58,820 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:58,821 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:14:58,821 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:14:58,821 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:14:58,821 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:14:58,822 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 5 states. [2018-06-22 01:14:58,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:58,961 INFO ]: Finished difference Result 14 states and 15 transitions. [2018-06-22 01:14:58,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:14:58,962 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 01:14:58,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:58,962 INFO ]: With dead ends: 14 [2018-06-22 01:14:58,962 INFO ]: Without dead ends: 14 [2018-06-22 01:14:58,963 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:14:58,963 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:14:58,965 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:14:58,965 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:14:58,965 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-22 01:14:58,965 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-06-22 01:14:58,965 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:58,965 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-22 01:14:58,965 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:14:58,965 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-22 01:14:58,967 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:14:58,967 INFO ]: Found error trace [2018-06-22 01:14:58,967 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:58,967 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:58,967 INFO ]: Analyzing trace with hash -749567714, now seen corresponding path program 2 times [2018-06-22 01:14:58,967 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:58,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:58,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:58,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:58,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:58,992 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:59,106 INFO ]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:14:59,106 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:14:59,106 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:14:59,106 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:14:59,107 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:14:59,107 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:59,107 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2018-06-22 01:14:59,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:59,151 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-22 01:14:59,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:14:59,153 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-22 01:14:59,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:59,153 INFO ]: With dead ends: 15 [2018-06-22 01:14:59,153 INFO ]: Without dead ends: 15 [2018-06-22 01:14:59,154 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:14:59,154 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:14:59,155 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:14:59,155 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:14:59,155 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-22 01:14:59,156 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-22 01:14:59,156 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:59,156 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-22 01:14:59,156 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:14:59,156 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-22 01:14:59,156 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:14:59,156 INFO ]: Found error trace [2018-06-22 01:14:59,156 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:59,156 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:59,156 INFO ]: Analyzing trace with hash -1708233848, now seen corresponding path program 1 times [2018-06-22 01:14:59,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:59,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:59,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:59,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:59,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:59,178 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:59,339 INFO ]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:14:59,339 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:59,339 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) [2018-06-22 01:14:59,354 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:59,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:59,407 INFO ]: Computing forward predicates... [2018-06-22 01:14:59,470 INFO ]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:14:59,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:59,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 01:14:59,492 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:14:59,492 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:14:59,492 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:14:59,492 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2018-06-22 01:14:59,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:59,554 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-22 01:14:59,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:14:59,555 INFO ]: Start accepts. Automaton has 7 states. Word has length 14 [2018-06-22 01:14:59,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:59,555 INFO ]: With dead ends: 17 [2018-06-22 01:14:59,555 INFO ]: Without dead ends: 17 [2018-06-22 01:14:59,556 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:14:59,556 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:14:59,558 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:14:59,558 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:14:59,558 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-22 01:14:59,558 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-06-22 01:14:59,558 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:59,558 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-22 01:14:59,558 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:14:59,558 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-22 01:14:59,559 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:14:59,559 INFO ]: Found error trace [2018-06-22 01:14:59,559 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:59,559 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:59,559 INFO ]: Analyzing trace with hash -1989993016, now seen corresponding path program 2 times [2018-06-22 01:14:59,559 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:59,559 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:59,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:59,560 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:59,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:59,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:59,634 INFO ]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:14:59,634 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:59,634 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:59,644 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:59,713 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:59,713 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:59,715 INFO ]: Computing forward predicates... [2018-06-22 01:14:59,977 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:00,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:00,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2018-06-22 01:15:00,002 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:15:00,002 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:15:00,002 INFO ]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:15:00,002 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-06-22 01:15:00,169 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:00,169 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-22 01:15:00,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:15:00,169 INFO ]: Start accepts. Automaton has 10 states. Word has length 16 [2018-06-22 01:15:00,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:00,170 INFO ]: With dead ends: 19 [2018-06-22 01:15:00,170 INFO ]: Without dead ends: 19 [2018-06-22 01:15:00,170 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:15:00,170 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:15:00,172 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:15:00,172 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:15:00,173 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 01:15:00,173 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-06-22 01:15:00,173 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:00,173 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 01:15:00,173 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:15:00,173 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 01:15:00,173 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:15:00,174 INFO ]: Found error trace [2018-06-22 01:15:00,174 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:00,174 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:00,174 INFO ]: Analyzing trace with hash -1956905652, now seen corresponding path program 3 times [2018-06-22 01:15:00,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:00,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:00,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:00,175 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:00,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:00,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:00,324 INFO ]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:00,324 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:00,324 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:00,330 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:00,358 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:15:00,358 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:00,360 INFO ]: Computing forward predicates... [2018-06-22 01:15:00,430 INFO ]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 01:15:00,454 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:00,454 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-06-22 01:15:00,454 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:15:00,454 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:15:00,454 INFO ]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:15:00,454 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 12 states. [2018-06-22 01:15:00,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:00,666 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-22 01:15:00,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:15:00,669 INFO ]: Start accepts. Automaton has 12 states. Word has length 18 [2018-06-22 01:15:00,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:00,670 INFO ]: With dead ends: 21 [2018-06-22 01:15:00,670 INFO ]: Without dead ends: 21 [2018-06-22 01:15:00,670 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:15:00,670 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:15:00,672 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:15:00,672 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:15:00,672 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 01:15:00,672 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-06-22 01:15:00,672 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:00,673 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 01:15:00,673 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:15:00,673 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 01:15:00,673 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:15:00,673 INFO ]: Found error trace [2018-06-22 01:15:00,673 INFO ]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:00,673 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:00,673 INFO ]: Analyzing trace with hash 675117768, now seen corresponding path program 4 times [2018-06-22 01:15:00,673 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:00,673 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:00,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:00,674 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:00,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:00,699 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:00,879 INFO ]: Checked inductivity of 34 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:00,879 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:00,879 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:00,888 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:00,925 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:00,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:00,928 INFO ]: Computing forward predicates... [2018-06-22 01:15:00,966 INFO ]: Checked inductivity of 34 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:00,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:00,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:15:00,989 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:15:00,989 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:15:00,989 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:15:00,989 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-06-22 01:15:01,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:01,009 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-22 01:15:01,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:15:01,010 INFO ]: Start accepts. Automaton has 11 states. Word has length 20 [2018-06-22 01:15:01,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:01,010 INFO ]: With dead ends: 23 [2018-06-22 01:15:01,010 INFO ]: Without dead ends: 23 [2018-06-22 01:15:01,011 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:15:01,011 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:15:01,013 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 01:15:01,013 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:15:01,013 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-22 01:15:01,013 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-06-22 01:15:01,013 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:01,013 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-22 01:15:01,013 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:15:01,013 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-22 01:15:01,014 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:15:01,014 INFO ]: Found error trace [2018-06-22 01:15:01,014 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:01,014 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:01,014 INFO ]: Analyzing trace with hash 791903496, now seen corresponding path program 5 times [2018-06-22 01:15:01,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:01,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:01,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:01,015 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:01,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:01,040 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:01,089 INFO ]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:15:01,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:01,089 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:01,098 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:01,141 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:15:01,141 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:01,144 INFO ]: Computing forward predicates... [2018-06-22 01:15:01,338 INFO ]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:15:01,364 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:01,364 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 16 [2018-06-22 01:15:01,364 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:15:01,364 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:15:01,364 INFO ]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:15:01,364 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 16 states. [2018-06-22 01:15:01,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:01,433 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-22 01:15:01,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:15:01,434 INFO ]: Start accepts. Automaton has 16 states. Word has length 22 [2018-06-22 01:15:01,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:01,435 INFO ]: With dead ends: 25 [2018-06-22 01:15:01,435 INFO ]: Without dead ends: 25 [2018-06-22 01:15:01,435 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:15:01,435 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:15:01,437 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 01:15:01,437 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:15:01,438 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-22 01:15:01,438 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-06-22 01:15:01,438 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:01,438 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-22 01:15:01,438 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:15:01,438 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-22 01:15:01,439 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:15:01,439 INFO ]: Found error trace [2018-06-22 01:15:01,439 INFO ]: trace histogram [10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:01,439 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:01,439 INFO ]: Analyzing trace with hash -1293980788, now seen corresponding path program 6 times [2018-06-22 01:15:01,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:01,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:01,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:01,440 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:01,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:01,467 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:01,636 INFO ]: Checked inductivity of 65 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:01,636 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:01,636 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:01,644 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:01,691 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:15:01,691 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:01,693 INFO ]: Computing forward predicates... [2018-06-22 01:15:01,700 INFO ]: Checked inductivity of 65 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:01,724 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:01,724 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:15:01,724 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:15:01,725 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:15:01,725 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:15:01,725 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-06-22 01:15:01,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:01,736 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-22 01:15:01,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:15:01,737 INFO ]: Start accepts. Automaton has 7 states. Word has length 24 [2018-06-22 01:15:01,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:01,738 INFO ]: With dead ends: 26 [2018-06-22 01:15:01,738 INFO ]: Without dead ends: 26 [2018-06-22 01:15:01,738 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:15:01,738 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:15:01,740 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 01:15:01,740 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:15:01,741 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-22 01:15:01,741 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-22 01:15:01,741 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:01,741 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-22 01:15:01,741 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:15:01,741 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-22 01:15:01,742 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:15:01,742 INFO ]: Found error trace [2018-06-22 01:15:01,742 INFO ]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:01,742 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:01,742 INFO ]: Analyzing trace with hash -1405169958, now seen corresponding path program 7 times [2018-06-22 01:15:01,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:01,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:01,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:01,744 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:01,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:01,757 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:02,178 INFO ]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:02,178 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:02,178 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:02,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:02,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:02,228 INFO ]: Computing forward predicates... [2018-06-22 01:15:02,235 INFO ]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:02,267 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:02,267 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:15:02,267 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:15:02,268 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:15:02,268 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:15:02,268 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 8 states. [2018-06-22 01:15:02,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:02,291 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-22 01:15:02,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:15:02,292 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 01:15:02,292 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:02,292 INFO ]: With dead ends: 27 [2018-06-22 01:15:02,292 INFO ]: Without dead ends: 27 [2018-06-22 01:15:02,292 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:15:02,293 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:15:02,295 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:15:02,295 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:15:02,295 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-22 01:15:02,295 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-06-22 01:15:02,295 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:02,295 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-22 01:15:02,296 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:15:02,296 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-22 01:15:02,296 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:15:02,296 INFO ]: Found error trace [2018-06-22 01:15:02,296 INFO ]: trace histogram [10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:02,296 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:02,296 INFO ]: Analyzing trace with hash -557066932, now seen corresponding path program 8 times [2018-06-22 01:15:02,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:02,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:02,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:02,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:02,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:02,310 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:02,426 INFO ]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:02,426 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:02,427 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:02,433 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:02,465 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:02,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:02,468 INFO ]: Computing forward predicates... [2018-06-22 01:15:02,476 INFO ]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:02,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:02,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:15:02,504 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:15:02,504 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:15:02,504 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:15:02,504 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-06-22 01:15:02,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:02,517 INFO ]: Finished difference Result 28 states and 29 transitions. [2018-06-22 01:15:02,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:15:02,517 INFO ]: Start accepts. Automaton has 9 states. Word has length 26 [2018-06-22 01:15:02,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:02,517 INFO ]: With dead ends: 28 [2018-06-22 01:15:02,517 INFO ]: Without dead ends: 28 [2018-06-22 01:15:02,518 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:15:02,518 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:15:02,520 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 01:15:02,520 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:15:02,521 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-22 01:15:02,521 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-22 01:15:02,521 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:02,521 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-22 01:15:02,521 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:15:02,521 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-22 01:15:02,521 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:15:02,521 INFO ]: Found error trace [2018-06-22 01:15:02,522 INFO ]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:02,522 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:02,522 INFO ]: Analyzing trace with hash -35676902, now seen corresponding path program 9 times [2018-06-22 01:15:02,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:02,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:02,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:02,522 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:02,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:02,535 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:02,612 INFO ]: Checked inductivity of 83 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:02,612 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:02,612 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:02,619 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:15:02,703 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:15:02,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:02,704 INFO ]: Computing forward predicates... [2018-06-22 01:15:02,717 INFO ]: Checked inductivity of 83 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:02,749 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:02,749 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 01:15:02,749 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:15:02,749 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:15:02,749 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:15:02,750 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 10 states. [2018-06-22 01:15:02,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:02,903 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-22 01:15:02,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:15:02,903 INFO ]: Start accepts. Automaton has 10 states. Word has length 27 [2018-06-22 01:15:02,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:02,904 INFO ]: With dead ends: 29 [2018-06-22 01:15:02,904 INFO ]: Without dead ends: 29 [2018-06-22 01:15:02,904 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:15:02,904 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:15:02,906 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 01:15:02,906 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:15:02,907 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-22 01:15:02,907 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-06-22 01:15:02,909 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:02,909 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-22 01:15:02,909 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:15:02,909 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-22 01:15:02,909 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:15:02,909 INFO ]: Found error trace [2018-06-22 01:15:02,910 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:02,910 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:02,910 INFO ]: Analyzing trace with hash -1052455156, now seen corresponding path program 10 times [2018-06-22 01:15:02,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:02,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:02,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:02,911 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:02,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:02,924 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:03,028 INFO ]: Checked inductivity of 91 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:03,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:03,028 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:03,035 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:03,063 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:03,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:03,065 INFO ]: Computing forward predicates... [2018-06-22 01:15:03,075 INFO ]: Checked inductivity of 91 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:03,099 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:03,099 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:15:03,099 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:15:03,099 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:15:03,099 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:15:03,099 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2018-06-22 01:15:03,127 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:03,127 INFO ]: Finished difference Result 30 states and 31 transitions. [2018-06-22 01:15:03,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:15:03,127 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 01:15:03,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:03,128 INFO ]: With dead ends: 30 [2018-06-22 01:15:03,128 INFO ]: Without dead ends: 30 [2018-06-22 01:15:03,128 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:15:03,128 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:15:03,130 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 01:15:03,130 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:15:03,131 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-22 01:15:03,131 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-22 01:15:03,131 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:03,131 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-22 01:15:03,131 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:15:03,131 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-22 01:15:03,132 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:15:03,133 INFO ]: Found error trace [2018-06-22 01:15:03,133 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:03,133 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:03,133 INFO ]: Analyzing trace with hash 1787157338, now seen corresponding path program 11 times [2018-06-22 01:15:03,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:03,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:03,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:03,133 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:03,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:03,144 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:03,285 INFO ]: Checked inductivity of 100 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:03,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:03,285 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:03,292 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:15:03,371 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:15:03,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:03,374 INFO ]: Computing forward predicates... [2018-06-22 01:15:03,384 INFO ]: Checked inductivity of 100 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:03,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:03,416 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 01:15:03,416 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:15:03,417 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:15:03,417 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:15:03,417 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 12 states. [2018-06-22 01:15:03,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:03,439 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-22 01:15:03,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:15:03,440 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 01:15:03,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:03,440 INFO ]: With dead ends: 31 [2018-06-22 01:15:03,440 INFO ]: Without dead ends: 31 [2018-06-22 01:15:03,440 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:15:03,440 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:15:03,442 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 01:15:03,442 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:15:03,448 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-22 01:15:03,448 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-06-22 01:15:03,448 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:03,448 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-22 01:15:03,448 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:15:03,448 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-22 01:15:03,449 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:15:03,449 INFO ]: Found error trace [2018-06-22 01:15:03,449 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:03,449 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:03,449 INFO ]: Analyzing trace with hash -379168564, now seen corresponding path program 12 times [2018-06-22 01:15:03,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:03,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:03,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:03,450 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:03,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:03,461 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:04,188 INFO ]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:04,188 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:04,188 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:04,194 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:15:04,230 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:15:04,230 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:04,232 INFO ]: Computing forward predicates... [2018-06-22 01:15:04,252 INFO ]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 01:15:04,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:04,276 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 01:15:04,277 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:15:04,277 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:15:04,277 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:15:04,277 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 13 states. [2018-06-22 01:15:04,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:04,305 INFO ]: Finished difference Result 32 states and 33 transitions. [2018-06-22 01:15:04,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:15:04,305 INFO ]: Start accepts. Automaton has 13 states. Word has length 30 [2018-06-22 01:15:04,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:04,306 INFO ]: With dead ends: 32 [2018-06-22 01:15:04,306 INFO ]: Without dead ends: 32 [2018-06-22 01:15:04,306 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:15:04,306 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:15:04,309 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 01:15:04,309 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:15:04,310 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-22 01:15:04,310 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-22 01:15:04,310 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:04,310 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-22 01:15:04,310 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:15:04,310 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-22 01:15:04,311 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:15:04,311 INFO ]: Found error trace [2018-06-22 01:15:04,311 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:04,311 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:04,311 INFO ]: Analyzing trace with hash 1184205210, now seen corresponding path program 13 times [2018-06-22 01:15:04,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:04,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:04,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:04,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:04,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:04,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:04,803 INFO ]: Checked inductivity of 121 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 01:15:04,803 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:04,803 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:04,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:04,841 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:04,843 INFO ]: Computing forward predicates... [2018-06-22 01:15:04,918 INFO ]: Checked inductivity of 121 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-22 01:15:04,950 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:04,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 17 [2018-06-22 01:15:04,951 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:15:04,951 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:15:04,951 INFO ]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:15:04,951 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2018-06-22 01:15:05,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:05,067 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-22 01:15:05,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:15:05,067 INFO ]: Start accepts. Automaton has 17 states. Word has length 31 [2018-06-22 01:15:05,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:05,068 INFO ]: With dead ends: 16 [2018-06-22 01:15:05,068 INFO ]: Without dead ends: 0 [2018-06-22 01:15:05,068 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 13 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:15:05,068 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:15:05,068 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:15:05,068 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:15:05,068 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:15:05,068 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-06-22 01:15:05,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:05,068 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:15:05,068 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:15:05,068 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:15:05,068 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:15:05,072 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:15:05 BoogieIcfgContainer [2018-06-22 01:15:05,073 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:15:05,073 INFO ]: Toolchain (without parser) took 7162.55 ms. Allocated memory was 305.7 MB in the beginning and 372.2 MB in the end (delta: 66.6 MB). Free memory was 262.0 MB in the beginning and 288.0 MB in the end (delta: -26.0 MB). Peak memory consumption was 40.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:05,075 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:15:05,075 INFO ]: ChcToBoogie took 54.35 ms. Allocated memory is still 305.7 MB. Free memory was 262.0 MB in the beginning and 260.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:05,076 INFO ]: Boogie Preprocessor took 23.73 ms. Allocated memory is still 305.7 MB. Free memory was 260.1 MB in the beginning and 259.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:15:05,076 INFO ]: RCFGBuilder took 235.13 ms. Allocated memory is still 305.7 MB. Free memory was 259.1 MB in the beginning and 251.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:05,077 INFO ]: TraceAbstraction took 6841.02 ms. Allocated memory was 305.7 MB in the beginning and 372.2 MB in the end (delta: 66.6 MB). Free memory was 251.1 MB in the beginning and 288.0 MB in the end (delta: -36.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:05,081 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 305.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 54.35 ms. Allocated memory is still 305.7 MB. Free memory was 262.0 MB in the beginning and 260.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 23.73 ms. Allocated memory is still 305.7 MB. Free memory was 260.1 MB in the beginning and 259.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 235.13 ms. Allocated memory is still 305.7 MB. Free memory was 259.1 MB in the beginning and 251.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6841.02 ms. Allocated memory was 305.7 MB in the beginning and 372.2 MB in the end (delta: 66.6 MB). Free memory was 251.1 MB in the beginning and 288.0 MB in the end (delta: -36.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 16 OverallIterations, 11 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 165 SDtfs, 3 SDslu, 684 SDs, 0 SdLazy, 235 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 313 SyntacticMatches, 15 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 665 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 26257 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2505 ConjunctsInSsa, 226 ConjunctsInUnsatCore, 30 InterpolantComputations, 2 PerfectInterpolantSequences, 1037/1704 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-15-05-098.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-loop_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-15-05-098.csv Received shutdown request...