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/HOLA/37.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:05:12,587 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:05:12,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:05:12,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:05:12,603 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:05:12,604 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:05:12,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:05:12,610 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:05:12,612 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:05:12,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:05:12,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:05:12,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:05:12,616 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:05:12,617 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:05:12,620 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:05:12,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:05:12,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:05:12,636 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:05:12,637 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:05:12,638 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:05:12,639 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:05:12,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:05:12,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:05:12,642 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:05:12,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:05:12,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:05:12,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:05:12,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:05:12,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:05:12,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:05:12,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:05:12,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:05:12,653 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:05:12,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:05:12,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:05:12,655 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:05:12,672 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:05:12,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:05:12,673 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:05:12,673 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:05:12,674 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:05:12,674 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:05:12,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:05:12,675 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:05:12,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:05:12,675 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:05:12,675 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:05:12,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:05:12,676 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:05:12,676 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:05:12,676 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:05:12,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:05:12,676 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:05:12,678 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:05:12,678 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:05:12,729 INFO ]: Repository-Root is: /tmp [2018-06-22 01:05:12,748 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:05:12,757 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:05:12,758 INFO ]: Initializing SmtParser... [2018-06-22 01:05:12,758 INFO ]: SmtParser initialized [2018-06-22 01:05:12,759 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/37.c.smt2 [2018-06-22 01:05:12,760 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:05:12,855 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/37.c.smt2 unknown [2018-06-22 01:05:13,230 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/37.c.smt2 [2018-06-22 01:05:13,235 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:05:13,248 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:05:13,249 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:05:13,249 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:05:13,249 INFO ]: ChcToBoogie initialized [2018-06-22 01:05:13,252 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:05:13" (1/1) ... [2018-06-22 01:05:13,352 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:13 Unit [2018-06-22 01:05:13,352 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:05:13,352 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:05:13,352 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:05:13,352 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:05:13,404 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:13" (1/1) ... [2018-06-22 01:05:13,404 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:13" (1/1) ... [2018-06-22 01:05:13,413 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:13" (1/1) ... [2018-06-22 01:05:13,413 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:13" (1/1) ... [2018-06-22 01:05:13,421 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:13" (1/1) ... [2018-06-22 01:05:13,430 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:13" (1/1) ... [2018-06-22 01:05:13,431 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:13" (1/1) ... [2018-06-22 01:05:13,440 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:05:13,441 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:05:13,441 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:05:13,441 INFO ]: RCFGBuilder initialized [2018-06-22 01:05:13,441 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:13" (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:05:13,467 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:05:13,468 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:05:13,468 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:05:13,468 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:05:13,469 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:05:13,469 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:05:14,015 INFO ]: Using library mode [2018-06-22 01:05:14,016 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:05:14 BoogieIcfgContainer [2018-06-22 01:05:14,016 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:05:14,018 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:05:14,018 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:05:14,021 INFO ]: TraceAbstraction initialized [2018-06-22 01:05:14,021 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:05:13" (1/3) ... [2018-06-22 01:05:14,022 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68542741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:05:14, skipping insertion in model container [2018-06-22 01:05:14,022 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:05:13" (2/3) ... [2018-06-22 01:05:14,022 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68542741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:05:14, skipping insertion in model container [2018-06-22 01:05:14,022 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:05:14" (3/3) ... [2018-06-22 01:05:14,024 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:05:14,038 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:05:14,046 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:05:14,093 INFO ]: Using default assertion order modulation [2018-06-22 01:05:14,094 INFO ]: Interprodecural is true [2018-06-22 01:05:14,094 INFO ]: Hoare is false [2018-06-22 01:05:14,094 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:05:14,094 INFO ]: Backedges is TWOTRACK [2018-06-22 01:05:14,094 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:05:14,094 INFO ]: Difference is false [2018-06-22 01:05:14,094 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:05:14,094 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:05:14,109 INFO ]: Start isEmpty. Operand 34 states. [2018-06-22 01:05:14,121 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:05:14,121 INFO ]: Found error trace [2018-06-22 01:05:14,122 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:05:14,122 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:14,129 INFO ]: Analyzing trace with hash -362189706, now seen corresponding path program 1 times [2018-06-22 01:05:14,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:14,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:14,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:14,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:14,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:14,245 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:14,813 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:05:14,816 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:05:14,816 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:05:14,819 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:05:14,833 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:05:14,833 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:05:14,835 INFO ]: Start difference. First operand 34 states. Second operand 13 states. [2018-06-22 01:05:15,290 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:05:15,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:15,747 INFO ]: Finished difference Result 70 states and 78 transitions. [2018-06-22 01:05:15,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:05:15,749 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:05:15,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:15,760 INFO ]: With dead ends: 70 [2018-06-22 01:05:15,760 INFO ]: Without dead ends: 67 [2018-06-22 01:05:15,763 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:05:15,778 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 01:05:15,800 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 40. [2018-06-22 01:05:15,801 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:05:15,802 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-22 01:05:15,804 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-06-22 01:05:15,804 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:15,804 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-22 01:05:15,804 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:05:15,804 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-22 01:05:15,805 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:05:15,805 INFO ]: Found error trace [2018-06-22 01:05:15,805 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:05:15,805 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:15,805 INFO ]: Analyzing trace with hash 557907711, now seen corresponding path program 1 times [2018-06-22 01:05:15,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:15,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:15,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:15,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:15,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:15,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:16,160 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:05:16,160 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:05:16,160 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:05:16,162 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:05:16,162 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:05:16,162 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:05:16,162 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 15 states. [2018-06-22 01:05:17,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:17,287 INFO ]: Finished difference Result 82 states and 92 transitions. [2018-06-22 01:05:17,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:05:17,306 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 01:05:17,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:17,308 INFO ]: With dead ends: 82 [2018-06-22 01:05:17,308 INFO ]: Without dead ends: 79 [2018-06-22 01:05:17,310 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=373, Invalid=887, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:05:17,310 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 01:05:17,314 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 34. [2018-06-22 01:05:17,314 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:05:17,315 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-22 01:05:17,315 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2018-06-22 01:05:17,315 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:17,315 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-22 01:05:17,315 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:05:17,315 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-22 01:05:17,316 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:05:17,316 INFO ]: Found error trace [2018-06-22 01:05:17,316 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] [2018-06-22 01:05:17,316 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:17,317 INFO ]: Analyzing trace with hash -1849577558, now seen corresponding path program 1 times [2018-06-22 01:05:17,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:17,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:17,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:17,318 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:17,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:17,343 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:17,541 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:05:17,541 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:05:17,541 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:05:17,541 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:05:17,541 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:05:17,542 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:05:17,542 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 19 states. [2018-06-22 01:05:18,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:18,439 INFO ]: Finished difference Result 121 states and 136 transitions. [2018-06-22 01:05:18,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:05:18,442 INFO ]: Start accepts. Automaton has 19 states. Word has length 27 [2018-06-22 01:05:18,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:18,444 INFO ]: With dead ends: 121 [2018-06-22 01:05:18,444 INFO ]: Without dead ends: 118 [2018-06-22 01:05:18,445 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=1245, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:05:18,445 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 01:05:18,452 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 48. [2018-06-22 01:05:18,452 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:05:18,453 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-06-22 01:05:18,453 INFO ]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 27 [2018-06-22 01:05:18,453 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:18,453 INFO ]: Abstraction has 48 states and 52 transitions. [2018-06-22 01:05:18,453 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:05:18,454 INFO ]: Start isEmpty. Operand 48 states and 52 transitions. [2018-06-22 01:05:18,454 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:05:18,454 INFO ]: Found error trace [2018-06-22 01:05:18,454 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] [2018-06-22 01:05:18,455 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:18,455 INFO ]: Analyzing trace with hash -1634869006, now seen corresponding path program 1 times [2018-06-22 01:05:18,455 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:18,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:18,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:18,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:18,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:18,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:18,756 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:18,756 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:05:18,757 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) [2018-06-22 01:05:18,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:05:18,841 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:18,852 INFO ]: Computing forward predicates... [2018-06-22 01:05:19,591 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:19,612 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:05:19,612 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [22] total 32 [2018-06-22 01:05:19,613 INFO ]: Interpolant automaton has 32 states [2018-06-22 01:05:19,613 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 01:05:19,613 INFO ]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:05:19,613 INFO ]: Start difference. First operand 48 states and 52 transitions. Second operand 32 states. [2018-06-22 01:05:20,579 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:20,579 INFO ]: Finished difference Result 76 states and 83 transitions. [2018-06-22 01:05:20,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:05:20,580 INFO ]: Start accepts. Automaton has 32 states. Word has length 28 [2018-06-22 01:05:20,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:20,581 INFO ]: With dead ends: 76 [2018-06-22 01:05:20,581 INFO ]: Without dead ends: 75 [2018-06-22 01:05:20,582 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=292, Invalid=1514, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:05:20,582 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 01:05:20,589 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 51. [2018-06-22 01:05:20,590 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:05:20,591 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-06-22 01:05:20,591 INFO ]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 28 [2018-06-22 01:05:20,591 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:20,591 INFO ]: Abstraction has 51 states and 55 transitions. [2018-06-22 01:05:20,591 INFO ]: Interpolant automaton has 32 states. [2018-06-22 01:05:20,591 INFO ]: Start isEmpty. Operand 51 states and 55 transitions. [2018-06-22 01:05:20,592 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:05:20,592 INFO ]: Found error trace [2018-06-22 01:05:20,592 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] [2018-06-22 01:05:20,592 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:20,592 INFO ]: Analyzing trace with hash 1636215091, now seen corresponding path program 1 times [2018-06-22 01:05:20,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:20,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:20,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:20,593 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:20,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:20,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:20,808 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:05:20,809 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:05:20,809 INFO ]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-06-22 01:05:20,809 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:05:20,809 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:05:20,809 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:05:20,809 INFO ]: Start difference. First operand 51 states and 55 transitions. Second operand 21 states. [2018-06-22 01:05:22,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:22,994 INFO ]: Finished difference Result 165 states and 186 transitions. [2018-06-22 01:05:23,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 01:05:23,028 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 01:05:23,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:23,030 INFO ]: With dead ends: 165 [2018-06-22 01:05:23,030 INFO ]: Without dead ends: 162 [2018-06-22 01:05:23,031 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1265, Invalid=3025, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 01:05:23,032 INFO ]: Start minimizeSevpa. Operand 162 states. [2018-06-22 01:05:23,038 INFO ]: Finished minimizeSevpa. Reduced states from 162 to 49. [2018-06-22 01:05:23,038 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 01:05:23,038 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-06-22 01:05:23,038 INFO ]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2018-06-22 01:05:23,039 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:23,041 INFO ]: Abstraction has 49 states and 53 transitions. [2018-06-22 01:05:23,041 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:05:23,041 INFO ]: Start isEmpty. Operand 49 states and 53 transitions. [2018-06-22 01:05:23,042 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:05:23,042 INFO ]: Found error trace [2018-06-22 01:05:23,042 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] [2018-06-22 01:05:23,042 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:23,042 INFO ]: Analyzing trace with hash -949479287, now seen corresponding path program 1 times [2018-06-22 01:05:23,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:23,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:23,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:23,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:23,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:23,068 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:23,503 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:23,503 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:05:23,503 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 01:05:23,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:23,571 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:23,576 INFO ]: Computing forward predicates... [2018-06-22 01:05:24,008 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:24,028 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:05:24,028 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [24] total 41 [2018-06-22 01:05:24,029 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:05:24,029 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:05:24,029 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1557, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:05:24,029 INFO ]: Start difference. First operand 49 states and 53 transitions. Second operand 41 states. [2018-06-22 01:05:25,838 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:25,838 INFO ]: Finished difference Result 124 states and 136 transitions. [2018-06-22 01:05:25,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:05:25,839 INFO ]: Start accepts. Automaton has 41 states. Word has length 30 [2018-06-22 01:05:25,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:25,840 INFO ]: With dead ends: 124 [2018-06-22 01:05:25,840 INFO ]: Without dead ends: 119 [2018-06-22 01:05:25,841 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=970, Invalid=4142, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 01:05:25,841 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-22 01:05:25,846 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 53. [2018-06-22 01:05:25,846 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 01:05:25,847 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-06-22 01:05:25,847 INFO ]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 30 [2018-06-22 01:05:25,847 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:25,847 INFO ]: Abstraction has 53 states and 58 transitions. [2018-06-22 01:05:25,847 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:05:25,847 INFO ]: Start isEmpty. Operand 53 states and 58 transitions. [2018-06-22 01:05:25,848 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:05:25,848 INFO ]: Found error trace [2018-06-22 01:05:25,848 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] [2018-06-22 01:05:25,848 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:25,848 INFO ]: Analyzing trace with hash 1054507081, now seen corresponding path program 1 times [2018-06-22 01:05:25,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:25,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:25,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:25,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:25,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:25,863 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:26,740 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:26,740 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:05:26,740 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) [2018-06-22 01:05:26,754 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:05:26,810 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:26,813 INFO ]: Computing forward predicates... [2018-06-22 01:05:27,222 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:27,243 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:05:27,243 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [24] total 41 [2018-06-22 01:05:27,244 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:05:27,244 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:05:27,244 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1557, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:05:27,244 INFO ]: Start difference. First operand 53 states and 58 transitions. Second operand 41 states. [2018-06-22 01:05:29,363 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:29,363 INFO ]: Finished difference Result 97 states and 105 transitions. [2018-06-22 01:05:29,364 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:05:29,364 INFO ]: Start accepts. Automaton has 41 states. Word has length 30 [2018-06-22 01:05:29,364 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:29,365 INFO ]: With dead ends: 97 [2018-06-22 01:05:29,365 INFO ]: Without dead ends: 91 [2018-06-22 01:05:29,366 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=841, Invalid=3851, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 01:05:29,366 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 01:05:29,370 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 43. [2018-06-22 01:05:29,370 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:05:29,371 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-06-22 01:05:29,371 INFO ]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 30 [2018-06-22 01:05:29,371 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:29,371 INFO ]: Abstraction has 43 states and 47 transitions. [2018-06-22 01:05:29,371 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:05:29,371 INFO ]: Start isEmpty. Operand 43 states and 47 transitions. [2018-06-22 01:05:29,372 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:05:29,372 INFO ]: Found error trace [2018-06-22 01:05:29,372 INFO ]: trace histogram [3, 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 01:05:29,372 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:29,372 INFO ]: Analyzing trace with hash -1849952194, now seen corresponding path program 1 times [2018-06-22 01:05:29,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:29,372 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:29,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:29,373 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:29,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:29,394 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:29,557 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:29,557 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:05:29,557 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:05:29,558 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:05:29,558 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:05:29,558 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:05:29,558 INFO ]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-06-22 01:05:30,041 WARN ]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:05:30,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:30,146 INFO ]: Finished difference Result 119 states and 131 transitions. [2018-06-22 01:05:30,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:05:30,147 INFO ]: Start accepts. Automaton has 11 states. Word has length 36 [2018-06-22 01:05:30,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:30,148 INFO ]: With dead ends: 119 [2018-06-22 01:05:30,148 INFO ]: Without dead ends: 118 [2018-06-22 01:05:30,148 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=676, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:05:30,149 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 01:05:30,153 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 51. [2018-06-22 01:05:30,153 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:05:30,153 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-06-22 01:05:30,153 INFO ]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 36 [2018-06-22 01:05:30,154 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:30,154 INFO ]: Abstraction has 51 states and 57 transitions. [2018-06-22 01:05:30,154 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:05:30,154 INFO ]: Start isEmpty. Operand 51 states and 57 transitions. [2018-06-22 01:05:30,155 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:05:30,155 INFO ]: Found error trace [2018-06-22 01:05:30,155 INFO ]: trace histogram [3, 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 01:05:30,155 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:05:30,155 INFO ]: Analyzing trace with hash 154034174, now seen corresponding path program 1 times [2018-06-22 01:05:30,155 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:05:30,155 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:05:30,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:30,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:05:30,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:05:30,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:05:30,295 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:05:30,295 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:05:30,295 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:05:30,296 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:05:30,296 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:05:30,296 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:05:30,296 INFO ]: Start difference. First operand 51 states and 57 transitions. Second operand 11 states. [2018-06-22 01:05:30,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:05:30,448 INFO ]: Finished difference Result 33 states and 34 transitions. [2018-06-22 01:05:30,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:05:30,448 INFO ]: Start accepts. Automaton has 11 states. Word has length 36 [2018-06-22 01:05:30,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:05:30,448 INFO ]: With dead ends: 33 [2018-06-22 01:05:30,448 INFO ]: Without dead ends: 0 [2018-06-22 01:05:30,448 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:05:30,449 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:05:30,449 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:05:30,449 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:05:30,449 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:05:30,449 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-06-22 01:05:30,449 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:05:30,449 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:05:30,449 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:05:30,449 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:05:30,449 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:05:30,454 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:05:30 BoogieIcfgContainer [2018-06-22 01:05:30,454 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:05:30,454 INFO ]: Toolchain (without parser) took 17219.15 ms. Allocated memory was 308.8 MB in the beginning and 521.7 MB in the end (delta: 212.9 MB). Free memory was 253.2 MB in the beginning and 330.2 MB in the end (delta: -77.0 MB). Peak memory consumption was 135.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:05:30,455 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:05:30,455 INFO ]: ChcToBoogie took 103.26 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 250.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:05:30,455 INFO ]: Boogie Preprocessor took 87.68 ms. Allocated memory is still 308.8 MB. Free memory was 250.1 MB in the beginning and 249.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:05:30,456 INFO ]: RCFGBuilder took 575.58 ms. Allocated memory is still 308.8 MB. Free memory was 249.1 MB in the beginning and 224.0 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:05:30,456 INFO ]: TraceAbstraction took 16436.06 ms. Allocated memory was 308.8 MB in the beginning and 521.7 MB in the end (delta: 212.9 MB). Free memory was 224.0 MB in the beginning and 330.2 MB in the end (delta: -106.2 MB). Peak memory consumption was 106.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:05:30,458 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 103.26 ms. Allocated memory is still 308.8 MB. Free memory was 253.2 MB in the beginning and 250.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 87.68 ms. Allocated memory is still 308.8 MB. Free memory was 250.1 MB in the beginning and 249.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 575.58 ms. Allocated memory is still 308.8 MB. Free memory was 249.1 MB in the beginning and 224.0 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 16436.06 ms. Allocated memory was 308.8 MB in the beginning and 521.7 MB in the end (delta: 212.9 MB). Free memory was 224.0 MB in the beginning and 330.2 MB in the end (delta: -106.2 MB). Peak memory consumption was 106.7 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, 34 locations, 1 error locations. SAFE Result, 16.3s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 306 SDtfs, 3987 SDslu, 5531 SDs, 0 SdLazy, 3050 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=6, 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, 9 MinimizatonAttempts, 460 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 26396 SizeOfPredicates, 95 NumberOfNonLiveVariables, 1266 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 32/38 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/37.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-05-30-468.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/37.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-05-30-468.csv Received shutdown request...