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/25.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:01:12,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:01:12,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:01:12,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:01:12,121 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:01:12,122 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:01:12,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:01:12,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:01:12,128 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:01:12,128 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:01:12,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:01:12,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:01:12,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:01:12,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:01:12,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:01:12,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:01:12,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:01:12,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:01:12,148 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:01:12,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:01:12,150 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:01:12,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:01:12,156 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:01:12,156 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:01:12,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:01:12,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:01:12,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:01:12,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:01:12,161 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:01:12,161 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:01:12,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:01:12,162 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:01:12,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:01:12,163 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:01:12,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:01:12,167 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:01:12,187 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:01:12,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:01:12,187 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:01:12,187 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:01:12,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:01:12,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:01:12,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:01:12,190 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:01:12,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:01:12,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:01:12,190 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:01:12,190 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:01:12,191 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:01:12,191 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:01:12,191 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:01:12,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:01:12,191 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:01:12,196 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:01:12,196 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:01:12,249 INFO ]: Repository-Root is: /tmp [2018-06-22 01:01:12,260 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:01:12,264 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:01:12,265 INFO ]: Initializing SmtParser... [2018-06-22 01:01:12,265 INFO ]: SmtParser initialized [2018-06-22 01:01:12,266 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/25.c.smt2 [2018-06-22 01:01:12,267 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:01:12,357 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/25.c.smt2 unknown [2018-06-22 01:01:12,866 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/25.c.smt2 [2018-06-22 01:01:12,878 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:01:12,883 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:01:12,884 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:01:12,884 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:01:12,884 INFO ]: ChcToBoogie initialized [2018-06-22 01:01:12,891 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:01:12" (1/1) ... [2018-06-22 01:01:12,966 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:01:12 Unit [2018-06-22 01:01:12,966 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:01:12,967 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:01:12,967 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:01:12,967 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:01:12,988 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:01:12" (1/1) ... [2018-06-22 01:01:12,988 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:01:12" (1/1) ... [2018-06-22 01:01:12,999 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:01:12" (1/1) ... [2018-06-22 01:01:12,999 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:01:12" (1/1) ... [2018-06-22 01:01:13,018 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:01:12" (1/1) ... [2018-06-22 01:01:13,020 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:01:12" (1/1) ... [2018-06-22 01:01:13,022 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:01:12" (1/1) ... [2018-06-22 01:01:13,039 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:01:13,039 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:01:13,039 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:01:13,039 INFO ]: RCFGBuilder initialized [2018-06-22 01:01:13,040 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:01:12" (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:01:13,066 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:01:13,066 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:01:13,066 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:01:13,066 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:01:13,066 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:01:13,066 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:01:14,071 INFO ]: Using library mode [2018-06-22 01:01:14,072 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:01:14 BoogieIcfgContainer [2018-06-22 01:01:14,072 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:01:14,073 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:01:14,073 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:01:14,082 INFO ]: TraceAbstraction initialized [2018-06-22 01:01:14,083 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:01:12" (1/3) ... [2018-06-22 01:01:14,083 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3480fac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:01:14, skipping insertion in model container [2018-06-22 01:01:14,083 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:01:12" (2/3) ... [2018-06-22 01:01:14,084 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3480fac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:01:14, skipping insertion in model container [2018-06-22 01:01:14,084 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:01:14" (3/3) ... [2018-06-22 01:01:14,086 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:01:14,094 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:01:14,104 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:01:14,149 INFO ]: Using default assertion order modulation [2018-06-22 01:01:14,150 INFO ]: Interprodecural is true [2018-06-22 01:01:14,150 INFO ]: Hoare is false [2018-06-22 01:01:14,150 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:01:14,150 INFO ]: Backedges is TWOTRACK [2018-06-22 01:01:14,150 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:01:14,150 INFO ]: Difference is false [2018-06-22 01:01:14,150 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:01:14,150 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:01:14,174 INFO ]: Start isEmpty. Operand 46 states. [2018-06-22 01:01:14,189 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:01:14,189 INFO ]: Found error trace [2018-06-22 01:01:14,190 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:01:14,190 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:14,195 INFO ]: Analyzing trace with hash 1763110588, now seen corresponding path program 1 times [2018-06-22 01:01:14,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:14,198 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:14,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:14,246 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:14,246 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:14,358 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:15,417 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:01:15,419 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:15,419 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:01:15,420 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:01:15,430 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:01:15,431 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:01:15,433 INFO ]: Start difference. First operand 46 states. Second operand 13 states. [2018-06-22 01:01:16,152 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-06-22 01:01:16,526 WARN ]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-22 01:01:16,602 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:16,602 INFO ]: Finished difference Result 78 states and 90 transitions. [2018-06-22 01:01:16,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:01:16,604 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:01:16,604 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:16,613 INFO ]: With dead ends: 78 [2018-06-22 01:01:16,613 INFO ]: Without dead ends: 75 [2018-06-22 01:01:16,616 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:01:16,635 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 01:01:16,655 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 48. [2018-06-22 01:01:16,657 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:01:16,658 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-06-22 01:01:16,659 INFO ]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 19 [2018-06-22 01:01:16,659 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:16,660 INFO ]: Abstraction has 48 states and 55 transitions. [2018-06-22 01:01:16,660 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:01:16,660 INFO ]: Start isEmpty. Operand 48 states and 55 transitions. [2018-06-22 01:01:16,661 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:01:16,661 INFO ]: Found error trace [2018-06-22 01:01:16,661 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:01:16,661 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:16,661 INFO ]: Analyzing trace with hash 92772882, now seen corresponding path program 1 times [2018-06-22 01:01:16,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:16,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:16,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:16,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:16,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:16,708 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:16,969 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:01:16,969 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:16,969 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:01:16,971 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:01:16,971 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:01:16,971 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:01:16,971 INFO ]: Start difference. First operand 48 states and 55 transitions. Second operand 19 states. [2018-06-22 01:01:18,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:18,828 INFO ]: Finished difference Result 221 states and 261 transitions. [2018-06-22 01:01:18,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-06-22 01:01:18,829 INFO ]: Start accepts. Automaton has 19 states. Word has length 36 [2018-06-22 01:01:18,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:18,834 INFO ]: With dead ends: 221 [2018-06-22 01:01:18,834 INFO ]: Without dead ends: 220 [2018-06-22 01:01:18,837 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1287, Invalid=4263, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 01:01:18,837 INFO ]: Start minimizeSevpa. Operand 220 states. [2018-06-22 01:01:18,854 INFO ]: Finished minimizeSevpa. Reduced states from 220 to 60. [2018-06-22 01:01:18,854 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 01:01:18,855 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-06-22 01:01:18,855 INFO ]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 36 [2018-06-22 01:01:18,856 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:18,856 INFO ]: Abstraction has 60 states and 69 transitions. [2018-06-22 01:01:18,856 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:01:18,856 INFO ]: Start isEmpty. Operand 60 states and 69 transitions. [2018-06-22 01:01:18,857 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:01:18,857 INFO ]: Found error trace [2018-06-22 01:01:18,857 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:01:18,857 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:18,857 INFO ]: Analyzing trace with hash -235867694, now seen corresponding path program 1 times [2018-06-22 01:01:18,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:18,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:18,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:18,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:18,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:18,897 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:19,262 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:01:19,263 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:19,263 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:01:19,263 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:01:19,263 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:01:19,263 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:01:19,264 INFO ]: Start difference. First operand 60 states and 69 transitions. Second operand 19 states. [2018-06-22 01:01:20,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:20,353 INFO ]: Finished difference Result 166 states and 195 transitions. [2018-06-22 01:01:20,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:01:20,353 INFO ]: Start accepts. Automaton has 19 states. Word has length 36 [2018-06-22 01:01:20,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:20,356 INFO ]: With dead ends: 166 [2018-06-22 01:01:20,356 INFO ]: Without dead ends: 163 [2018-06-22 01:01:20,357 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=1911, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:01:20,358 INFO ]: Start minimizeSevpa. Operand 163 states. [2018-06-22 01:01:20,365 INFO ]: Finished minimizeSevpa. Reduced states from 163 to 58. [2018-06-22 01:01:20,365 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 01:01:20,366 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-06-22 01:01:20,366 INFO ]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 36 [2018-06-22 01:01:20,366 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:20,366 INFO ]: Abstraction has 58 states and 66 transitions. [2018-06-22 01:01:20,366 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:01:20,367 INFO ]: Start isEmpty. Operand 58 states and 66 transitions. [2018-06-22 01:01:20,367 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:01:20,367 INFO ]: Found error trace [2018-06-22 01:01:20,368 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:01:20,368 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:20,368 INFO ]: Analyzing trace with hash -1559046634, now seen corresponding path program 1 times [2018-06-22 01:01:20,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:20,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:20,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:20,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:20,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:20,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:20,614 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:01:20,614 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:20,640 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:01:20,640 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:01:20,641 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:01:20,641 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:01:20,641 INFO ]: Start difference. First operand 58 states and 66 transitions. Second operand 19 states. [2018-06-22 01:01:22,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:22,184 INFO ]: Finished difference Result 225 states and 266 transitions. [2018-06-22 01:01:22,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-06-22 01:01:22,186 INFO ]: Start accepts. Automaton has 19 states. Word has length 36 [2018-06-22 01:01:22,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:22,188 INFO ]: With dead ends: 225 [2018-06-22 01:01:22,188 INFO ]: Without dead ends: 224 [2018-06-22 01:01:22,193 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1287, Invalid=4263, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 01:01:22,193 INFO ]: Start minimizeSevpa. Operand 224 states. [2018-06-22 01:01:22,204 INFO ]: Finished minimizeSevpa. Reduced states from 224 to 70. [2018-06-22 01:01:22,204 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:01:22,205 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-06-22 01:01:22,205 INFO ]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 36 [2018-06-22 01:01:22,205 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:22,205 INFO ]: Abstraction has 70 states and 80 transitions. [2018-06-22 01:01:22,205 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:01:22,205 INFO ]: Start isEmpty. Operand 70 states and 80 transitions. [2018-06-22 01:01:22,207 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:01:22,207 INFO ]: Found error trace [2018-06-22 01:01:22,208 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:01:22,208 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:22,208 INFO ]: Analyzing trace with hash -1887687210, now seen corresponding path program 1 times [2018-06-22 01:01:22,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:22,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:22,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:22,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:22,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:22,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:22,465 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:01:22,465 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:22,465 INFO ]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-06-22 01:01:22,465 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:01:22,465 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:01:22,466 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:01:22,466 INFO ]: Start difference. First operand 70 states and 80 transitions. Second operand 19 states. [2018-06-22 01:01:23,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:23,274 INFO ]: Finished difference Result 170 states and 200 transitions. [2018-06-22 01:01:23,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:01:23,275 INFO ]: Start accepts. Automaton has 19 states. Word has length 36 [2018-06-22 01:01:23,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:23,276 INFO ]: With dead ends: 170 [2018-06-22 01:01:23,276 INFO ]: Without dead ends: 167 [2018-06-22 01:01:23,276 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=1911, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:01:23,277 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 01:01:23,285 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 60. [2018-06-22 01:01:23,285 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 01:01:23,286 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-06-22 01:01:23,286 INFO ]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 36 [2018-06-22 01:01:23,287 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:23,287 INFO ]: Abstraction has 60 states and 68 transitions. [2018-06-22 01:01:23,287 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:01:23,287 INFO ]: Start isEmpty. Operand 60 states and 68 transitions. [2018-06-22 01:01:23,288 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:01:23,288 INFO ]: Found error trace [2018-06-22 01:01:23,288 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:01:23,288 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:23,288 INFO ]: Analyzing trace with hash 505048096, now seen corresponding path program 1 times [2018-06-22 01:01:23,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:23,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:23,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:23,289 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:23,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:23,310 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:23,426 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:01:23,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:23,427 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:01:23,427 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:01:23,427 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:01:23,427 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:01:23,427 INFO ]: Start difference. First operand 60 states and 68 transitions. Second operand 10 states. [2018-06-22 01:01:24,043 WARN ]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:01:24,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:24,325 INFO ]: Finished difference Result 376 states and 441 transitions. [2018-06-22 01:01:24,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:01:24,328 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-22 01:01:24,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:24,331 INFO ]: With dead ends: 376 [2018-06-22 01:01:24,331 INFO ]: Without dead ends: 375 [2018-06-22 01:01:24,331 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=492, Invalid=1670, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:01:24,332 INFO ]: Start minimizeSevpa. Operand 375 states. [2018-06-22 01:01:24,340 INFO ]: Finished minimizeSevpa. Reduced states from 375 to 67. [2018-06-22 01:01:24,340 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:01:24,341 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-06-22 01:01:24,341 INFO ]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 44 [2018-06-22 01:01:24,341 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:24,341 INFO ]: Abstraction has 67 states and 78 transitions. [2018-06-22 01:01:24,341 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:01:24,341 INFO ]: Start isEmpty. Operand 67 states and 78 transitions. [2018-06-22 01:01:24,343 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:01:24,343 INFO ]: Found error trace [2018-06-22 01:01:24,343 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:01:24,343 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:24,343 INFO ]: Analyzing trace with hash -2001544096, now seen corresponding path program 1 times [2018-06-22 01:01:24,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:24,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:24,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:24,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:24,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:24,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:24,452 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:01:24,452 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:24,452 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:01:24,453 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:01:24,453 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:01:24,453 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:01:24,453 INFO ]: Start difference. First operand 67 states and 78 transitions. Second operand 10 states. [2018-06-22 01:01:24,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:24,645 INFO ]: Finished difference Result 170 states and 196 transitions. [2018-06-22 01:01:24,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:01:24,646 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-22 01:01:24,646 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:24,647 INFO ]: With dead ends: 170 [2018-06-22 01:01:24,647 INFO ]: Without dead ends: 167 [2018-06-22 01:01:24,647 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:01:24,647 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 01:01:24,651 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 65. [2018-06-22 01:01:24,651 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 01:01:24,652 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-06-22 01:01:24,653 INFO ]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2018-06-22 01:01:24,653 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:24,653 INFO ]: Abstraction has 65 states and 75 transitions. [2018-06-22 01:01:24,653 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:01:24,653 INFO ]: Start isEmpty. Operand 65 states and 75 transitions. [2018-06-22 01:01:24,654 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:01:24,654 INFO ]: Found error trace [2018-06-22 01:01:24,654 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:01:24,654 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:24,654 INFO ]: Analyzing trace with hash -1034853526, now seen corresponding path program 1 times [2018-06-22 01:01:24,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:24,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:24,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:24,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:24,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:24,675 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:24,770 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:01:24,770 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:24,770 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:01:24,770 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:01:24,770 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:01:24,770 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:01:24,770 INFO ]: Start difference. First operand 65 states and 75 transitions. Second operand 10 states. [2018-06-22 01:01:25,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:25,552 INFO ]: Finished difference Result 305 states and 355 transitions. [2018-06-22 01:01:25,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:01:25,556 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-22 01:01:25,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:25,558 INFO ]: With dead ends: 305 [2018-06-22 01:01:25,558 INFO ]: Without dead ends: 304 [2018-06-22 01:01:25,558 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=402, Invalid=1238, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:01:25,558 INFO ]: Start minimizeSevpa. Operand 304 states. [2018-06-22 01:01:25,563 INFO ]: Finished minimizeSevpa. Reduced states from 304 to 67. [2018-06-22 01:01:25,563 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:01:25,564 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2018-06-22 01:01:25,564 INFO ]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 44 [2018-06-22 01:01:25,564 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:25,564 INFO ]: Abstraction has 67 states and 77 transitions. [2018-06-22 01:01:25,564 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:01:25,564 INFO ]: Start isEmpty. Operand 67 states and 77 transitions. [2018-06-22 01:01:25,565 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:01:25,565 INFO ]: Found error trace [2018-06-22 01:01:25,565 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:01:25,565 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:25,565 INFO ]: Analyzing trace with hash 753521578, now seen corresponding path program 1 times [2018-06-22 01:01:25,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:25,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:25,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:25,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:25,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:25,583 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:26,393 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:01:26,394 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:26,394 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:01:26,394 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:01:26,394 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:01:26,394 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:01:26,394 INFO ]: Start difference. First operand 67 states and 77 transitions. Second operand 10 states. [2018-06-22 01:01:26,561 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:26,562 INFO ]: Finished difference Result 101 states and 114 transitions. [2018-06-22 01:01:26,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:01:26,562 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-22 01:01:26,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:26,562 INFO ]: With dead ends: 101 [2018-06-22 01:01:26,563 INFO ]: Without dead ends: 97 [2018-06-22 01:01:26,563 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:01:26,563 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 01:01:26,566 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 64. [2018-06-22 01:01:26,566 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 01:01:26,566 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-06-22 01:01:26,566 INFO ]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 44 [2018-06-22 01:01:26,567 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:26,567 INFO ]: Abstraction has 64 states and 72 transitions. [2018-06-22 01:01:26,567 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:01:26,567 INFO ]: Start isEmpty. Operand 64 states and 72 transitions. [2018-06-22 01:01:26,572 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:01:26,572 INFO ]: Found error trace [2018-06-22 01:01:26,572 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:01:26,572 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:26,572 INFO ]: Analyzing trace with hash -5587868, now seen corresponding path program 1 times [2018-06-22 01:01:26,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:26,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:26,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:26,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:26,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:26,593 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:26,750 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:01:26,750 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:26,750 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:01:26,751 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:01:26,751 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:01:26,751 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:01:26,751 INFO ]: Start difference. First operand 64 states and 72 transitions. Second operand 10 states. [2018-06-22 01:01:26,982 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:26,982 INFO ]: Finished difference Result 219 states and 251 transitions. [2018-06-22 01:01:26,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:01:26,983 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-22 01:01:26,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:26,984 INFO ]: With dead ends: 219 [2018-06-22 01:01:26,984 INFO ]: Without dead ends: 218 [2018-06-22 01:01:26,984 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:01:26,984 INFO ]: Start minimizeSevpa. Operand 218 states. [2018-06-22 01:01:26,987 INFO ]: Finished minimizeSevpa. Reduced states from 218 to 67. [2018-06-22 01:01:26,987 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:01:26,987 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-06-22 01:01:26,987 INFO ]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 44 [2018-06-22 01:01:26,987 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:26,988 INFO ]: Abstraction has 67 states and 75 transitions. [2018-06-22 01:01:26,988 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:01:26,988 INFO ]: Start isEmpty. Operand 67 states and 75 transitions. [2018-06-22 01:01:26,988 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:01:26,989 INFO ]: Found error trace [2018-06-22 01:01:26,989 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:01:26,989 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:01:26,989 INFO ]: Analyzing trace with hash 1782787236, now seen corresponding path program 1 times [2018-06-22 01:01:26,989 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:01:26,989 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:01:26,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:26,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:01:26,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:01:27,005 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:01:27,246 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:01:27,246 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:01:27,246 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:01:27,246 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:01:27,246 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:01:27,246 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:01:27,246 INFO ]: Start difference. First operand 67 states and 75 transitions. Second operand 10 states. [2018-06-22 01:01:27,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:01:27,331 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-22 01:01:27,331 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:01:27,331 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-22 01:01:27,331 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:01:27,331 INFO ]: With dead ends: 28 [2018-06-22 01:01:27,331 INFO ]: Without dead ends: 0 [2018-06-22 01:01:27,331 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:01:27,331 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:01:27,332 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:01:27,332 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:01:27,332 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:01:27,332 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-06-22 01:01:27,332 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:01:27,332 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:01:27,332 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:01:27,332 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:01:27,332 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:01:27,337 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:01:27 BoogieIcfgContainer [2018-06-22 01:01:27,337 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:01:27,338 INFO ]: Toolchain (without parser) took 14459.34 ms. Allocated memory was 306.2 MB in the beginning and 519.6 MB in the end (delta: 213.4 MB). Free memory was 237.5 MB in the beginning and 482.7 MB in the end (delta: -245.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:01:27,339 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:01:27,339 INFO ]: ChcToBoogie took 82.80 ms. Allocated memory is still 306.2 MB. Free memory was 237.5 MB in the beginning and 234.5 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:01:27,339 INFO ]: Boogie Preprocessor took 71.94 ms. Allocated memory is still 306.2 MB. Free memory was 234.5 MB in the beginning and 232.5 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:01:27,340 INFO ]: RCFGBuilder took 1032.65 ms. Allocated memory was 306.2 MB in the beginning and 327.7 MB in the end (delta: 21.5 MB). Free memory was 232.5 MB in the beginning and 294.1 MB in the end (delta: -61.7 MB). Peak memory consumption was 53.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:01:27,346 INFO ]: TraceAbstraction took 13264.00 ms. Allocated memory was 327.7 MB in the beginning and 519.6 MB in the end (delta: 191.9 MB). Free memory was 294.1 MB in the beginning and 482.7 MB in the end (delta: -188.6 MB). Peak memory consumption was 3.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:01:27,348 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 82.80 ms. Allocated memory is still 306.2 MB. Free memory was 237.5 MB in the beginning and 234.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 71.94 ms. Allocated memory is still 306.2 MB. Free memory was 234.5 MB in the beginning and 232.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1032.65 ms. Allocated memory was 306.2 MB in the beginning and 327.7 MB in the end (delta: 21.5 MB). Free memory was 232.5 MB in the beginning and 294.1 MB in the end (delta: -61.7 MB). Peak memory consumption was 53.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 13264.00 ms. Allocated memory was 327.7 MB in the beginning and 519.6 MB in the end (delta: 191.9 MB). Free memory was 294.1 MB in the beginning and 482.7 MB in the end (delta: -188.6 MB). Peak memory consumption was 3.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. SAFE Result, 13.1s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 8.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 802 SDtfs, 5999 SDslu, 8913 SDs, 0 SdLazy, 1680 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5676 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=4, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1384 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 416 ConstructedInterpolants, 0 QuantifiedInterpolants, 26790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 64/64 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/25.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-01-27-364.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/25.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-01-27-364.csv Received shutdown request...