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/29.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:02:15,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:02:15,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:02:15,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:02:15,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:02:15,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:02:15,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:02:15,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:02:15,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:02:15,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:02:15,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:02:15,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:02:15,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:02:15,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:02:15,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:02:15,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:02:15,918 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:02:15,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:02:15,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:02:15,922 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:02:15,923 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:02:15,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:02:15,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:02:15,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:02:15,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:02:15,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:02:15,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:02:15,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:02:15,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:02:15,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:02:15,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:02:15,932 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:02:15,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:02:15,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:02:15,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:02:15,934 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:02:15,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:02:15,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:02:15,948 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:02:15,948 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:02:15,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:02:15,950 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:02:15,950 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:02:15,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:02:15,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:02:15,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:02:15,951 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:02:15,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:02:15,952 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:02:15,952 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:02:15,952 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:02:15,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:02:15,953 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:02:15,954 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:02:15,954 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:02:15,998 INFO ]: Repository-Root is: /tmp [2018-06-22 01:02:16,015 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:02:16,021 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:02:16,023 INFO ]: Initializing SmtParser... [2018-06-22 01:02:16,023 INFO ]: SmtParser initialized [2018-06-22 01:02:16,024 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/29.c.smt2 [2018-06-22 01:02:16,025 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:02:16,119 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/29.c.smt2 unknown [2018-06-22 01:02:16,783 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/29.c.smt2 [2018-06-22 01:02:16,788 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:02:16,800 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:02:16,800 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:02:16,800 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:02:16,800 INFO ]: ChcToBoogie initialized [2018-06-22 01:02:16,804 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:02:16" (1/1) ... [2018-06-22 01:02:16,878 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:16 Unit [2018-06-22 01:02:16,878 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:02:16,878 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:02:16,878 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:02:16,878 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:02:16,897 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:16" (1/1) ... [2018-06-22 01:02:16,897 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:16" (1/1) ... [2018-06-22 01:02:16,915 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:16" (1/1) ... [2018-06-22 01:02:16,915 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:16" (1/1) ... [2018-06-22 01:02:16,938 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:16" (1/1) ... [2018-06-22 01:02:16,940 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:16" (1/1) ... [2018-06-22 01:02:16,943 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:16" (1/1) ... [2018-06-22 01:02:16,949 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:02:16,949 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:02:16,950 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:02:16,950 INFO ]: RCFGBuilder initialized [2018-06-22 01:02:16,950 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:16" (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:02:16,971 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:02:16,971 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:02:16,971 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:02:16,971 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:02:16,971 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:02:16,971 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:02:18,009 INFO ]: Using library mode [2018-06-22 01:02:18,010 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:02:18 BoogieIcfgContainer [2018-06-22 01:02:18,010 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:02:18,012 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:02:18,012 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:02:18,015 INFO ]: TraceAbstraction initialized [2018-06-22 01:02:18,015 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:02:16" (1/3) ... [2018-06-22 01:02:18,016 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3459be5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:02:18, skipping insertion in model container [2018-06-22 01:02:18,016 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:02:16" (2/3) ... [2018-06-22 01:02:18,016 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3459be5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:02:18, skipping insertion in model container [2018-06-22 01:02:18,016 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:02:18" (3/3) ... [2018-06-22 01:02:18,018 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:02:18,038 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:02:18,056 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:02:18,103 INFO ]: Using default assertion order modulation [2018-06-22 01:02:18,103 INFO ]: Interprodecural is true [2018-06-22 01:02:18,103 INFO ]: Hoare is false [2018-06-22 01:02:18,103 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:02:18,103 INFO ]: Backedges is TWOTRACK [2018-06-22 01:02:18,103 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:02:18,103 INFO ]: Difference is false [2018-06-22 01:02:18,103 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:02:18,104 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:02:18,119 INFO ]: Start isEmpty. Operand 44 states. [2018-06-22 01:02:18,132 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:02:18,133 INFO ]: Found error trace [2018-06-22 01:02:18,137 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:02:18,138 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:18,143 INFO ]: Analyzing trace with hash 1119456632, now seen corresponding path program 1 times [2018-06-22 01:02:18,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:18,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:18,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:18,179 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:18,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:18,309 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:18,895 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:02:18,896 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:18,896 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:02:18,897 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:02:18,907 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:02:18,908 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:02:18,910 INFO ]: Start difference. First operand 44 states. Second operand 13 states. [2018-06-22 01:02:19,580 WARN ]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-06-22 01:02:20,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:20,066 INFO ]: Finished difference Result 73 states and 84 transitions. [2018-06-22 01:02:20,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:02:20,068 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:02:20,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:20,078 INFO ]: With dead ends: 73 [2018-06-22 01:02:20,078 INFO ]: Without dead ends: 70 [2018-06-22 01:02:20,081 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:02:20,098 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 01:02:20,117 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 46. [2018-06-22 01:02:20,118 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 01:02:20,119 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-06-22 01:02:20,120 INFO ]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 19 [2018-06-22 01:02:20,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:20,121 INFO ]: Abstraction has 46 states and 52 transitions. [2018-06-22 01:02:20,121 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:02:20,121 INFO ]: Start isEmpty. Operand 46 states and 52 transitions. [2018-06-22 01:02:20,122 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:02:20,122 INFO ]: Found error trace [2018-06-22 01:02:20,122 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, 1] [2018-06-22 01:02:20,122 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:20,122 INFO ]: Analyzing trace with hash 797497076, now seen corresponding path program 1 times [2018-06-22 01:02:20,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:20,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:20,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:20,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:20,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:20,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:20,550 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:02:20,550 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:20,550 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 01:02:20,551 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:02:20,552 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:02:20,552 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:02:20,552 INFO ]: Start difference. First operand 46 states and 52 transitions. Second operand 20 states. [2018-06-22 01:02:21,714 WARN ]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-22 01:02:22,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:22,639 INFO ]: Finished difference Result 190 states and 221 transitions. [2018-06-22 01:02:22,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-22 01:02:22,644 INFO ]: Start accepts. Automaton has 20 states. Word has length 37 [2018-06-22 01:02:22,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:22,652 INFO ]: With dead ends: 190 [2018-06-22 01:02:22,652 INFO ]: Without dead ends: 189 [2018-06-22 01:02:22,654 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1228, Invalid=4028, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 01:02:22,655 INFO ]: Start minimizeSevpa. Operand 189 states. [2018-06-22 01:02:22,664 INFO ]: Finished minimizeSevpa. Reduced states from 189 to 59. [2018-06-22 01:02:22,664 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 01:02:22,666 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-06-22 01:02:22,666 INFO ]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 37 [2018-06-22 01:02:22,666 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:22,666 INFO ]: Abstraction has 59 states and 67 transitions. [2018-06-22 01:02:22,666 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:02:22,666 INFO ]: Start isEmpty. Operand 59 states and 67 transitions. [2018-06-22 01:02:22,667 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:02:22,667 INFO ]: Found error trace [2018-06-22 01:02:22,667 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, 1] [2018-06-22 01:02:22,667 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:22,667 INFO ]: Analyzing trace with hash 468856500, now seen corresponding path program 1 times [2018-06-22 01:02:22,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:22,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:22,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:22,668 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:22,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:22,712 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:22,981 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:02:22,981 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:22,981 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 01:02:22,982 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:02:22,982 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:02:22,982 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:02:22,983 INFO ]: Start difference. First operand 59 states and 67 transitions. Second operand 20 states. [2018-06-22 01:02:23,993 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:23,993 INFO ]: Finished difference Result 127 states and 146 transitions. [2018-06-22 01:02:23,996 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-22 01:02:23,996 INFO ]: Start accepts. Automaton has 20 states. Word has length 37 [2018-06-22 01:02:23,996 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:23,998 INFO ]: With dead ends: 127 [2018-06-22 01:02:23,998 INFO ]: Without dead ends: 122 [2018-06-22 01:02:23,999 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=805, Invalid=2275, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:02:23,999 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 01:02:24,005 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 55. [2018-06-22 01:02:24,005 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 01:02:24,006 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-06-22 01:02:24,006 INFO ]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 37 [2018-06-22 01:02:24,006 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:24,006 INFO ]: Abstraction has 55 states and 62 transitions. [2018-06-22 01:02:24,006 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:02:24,006 INFO ]: Start isEmpty. Operand 55 states and 62 transitions. [2018-06-22 01:02:24,007 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:02:24,007 INFO ]: Found error trace [2018-06-22 01:02:24,007 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, 1] [2018-06-22 01:02:24,007 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:24,008 INFO ]: Analyzing trace with hash -1304266312, now seen corresponding path program 1 times [2018-06-22 01:02:24,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:24,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:24,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:24,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:24,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:24,034 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:24,323 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:02:24,323 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:24,323 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 01:02:24,323 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:02:24,323 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:02:24,323 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:02:24,323 INFO ]: Start difference. First operand 55 states and 62 transitions. Second operand 20 states. [2018-06-22 01:02:24,650 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:02:25,610 WARN ]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 01:02:26,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:26,129 INFO ]: Finished difference Result 245 states and 285 transitions. [2018-06-22 01:02:26,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-06-22 01:02:26,132 INFO ]: Start accepts. Automaton has 20 states. Word has length 37 [2018-06-22 01:02:26,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:26,135 INFO ]: With dead ends: 245 [2018-06-22 01:02:26,135 INFO ]: Without dead ends: 244 [2018-06-22 01:02:26,136 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1281, Invalid=4269, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 01:02:26,137 INFO ]: Start minimizeSevpa. Operand 244 states. [2018-06-22 01:02:26,146 INFO ]: Finished minimizeSevpa. Reduced states from 244 to 59. [2018-06-22 01:02:26,146 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 01:02:26,147 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-06-22 01:02:26,147 INFO ]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 37 [2018-06-22 01:02:26,148 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:26,148 INFO ]: Abstraction has 59 states and 67 transitions. [2018-06-22 01:02:26,148 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:02:26,148 INFO ]: Start isEmpty. Operand 59 states and 67 transitions. [2018-06-22 01:02:26,149 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:02:26,149 INFO ]: Found error trace [2018-06-22 01:02:26,149 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, 1] [2018-06-22 01:02:26,149 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:26,149 INFO ]: Analyzing trace with hash -1632906888, now seen corresponding path program 1 times [2018-06-22 01:02:26,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:26,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:26,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:26,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:26,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:26,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:26,382 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:02:26,382 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:26,382 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 01:02:26,382 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:02:26,382 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:02:26,382 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:02:26,382 INFO ]: Start difference. First operand 59 states and 67 transitions. Second operand 20 states. [2018-06-22 01:02:27,154 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 01:02:27,691 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:27,691 INFO ]: Finished difference Result 153 states and 176 transitions. [2018-06-22 01:02:27,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:02:27,692 INFO ]: Start accepts. Automaton has 20 states. Word has length 37 [2018-06-22 01:02:27,692 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:27,692 INFO ]: With dead ends: 153 [2018-06-22 01:02:27,692 INFO ]: Without dead ends: 149 [2018-06-22 01:02:27,693 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=825, Invalid=2367, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 01:02:27,693 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-22 01:02:27,699 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 56. [2018-06-22 01:02:27,699 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 01:02:27,700 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-06-22 01:02:27,700 INFO ]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 37 [2018-06-22 01:02:27,700 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:27,700 INFO ]: Abstraction has 56 states and 63 transitions. [2018-06-22 01:02:27,700 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:02:27,700 INFO ]: Start isEmpty. Operand 56 states and 63 transitions. [2018-06-22 01:02:27,701 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:02:27,701 INFO ]: Found error trace [2018-06-22 01:02:27,701 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, 1] [2018-06-22 01:02:27,701 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:27,701 INFO ]: Analyzing trace with hash 689768952, now seen corresponding path program 1 times [2018-06-22 01:02:27,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:27,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:27,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:27,702 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:27,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:27,734 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:28,483 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:02:28,484 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:28,484 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 01:02:28,484 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:02:28,484 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:02:28,484 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:02:28,484 INFO ]: Start difference. First operand 56 states and 63 transitions. Second operand 20 states. [2018-06-22 01:02:29,113 WARN ]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-22 01:02:30,194 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:02:30,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:30,710 INFO ]: Finished difference Result 188 states and 218 transitions. [2018-06-22 01:02:30,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 01:02:30,710 INFO ]: Start accepts. Automaton has 20 states. Word has length 37 [2018-06-22 01:02:30,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:30,711 INFO ]: With dead ends: 188 [2018-06-22 01:02:30,711 INFO ]: Without dead ends: 187 [2018-06-22 01:02:30,711 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=948, Invalid=2958, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:02:30,712 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-22 01:02:30,716 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 59. [2018-06-22 01:02:30,716 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 01:02:30,717 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-06-22 01:02:30,717 INFO ]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 37 [2018-06-22 01:02:30,717 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:30,717 INFO ]: Abstraction has 59 states and 66 transitions. [2018-06-22 01:02:30,717 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:02:30,717 INFO ]: Start isEmpty. Operand 59 states and 66 transitions. [2018-06-22 01:02:30,718 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:02:30,718 INFO ]: Found error trace [2018-06-22 01:02:30,718 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, 1] [2018-06-22 01:02:30,718 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:30,718 INFO ]: Analyzing trace with hash 361128376, now seen corresponding path program 1 times [2018-06-22 01:02:30,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:30,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:30,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:30,720 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:30,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:30,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:31,108 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:02:31,108 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:31,108 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 01:02:31,108 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:02:31,108 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:02:31,108 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:02:31,108 INFO ]: Start difference. First operand 59 states and 66 transitions. Second operand 20 states. [2018-06-22 01:02:32,109 WARN ]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:02:32,335 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:32,336 INFO ]: Finished difference Result 96 states and 109 transitions. [2018-06-22 01:02:32,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:02:32,336 INFO ]: Start accepts. Automaton has 20 states. Word has length 37 [2018-06-22 01:02:32,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:32,336 INFO ]: With dead ends: 96 [2018-06-22 01:02:32,336 INFO ]: Without dead ends: 89 [2018-06-22 01:02:32,337 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:02:32,337 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 01:02:32,339 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 53. [2018-06-22 01:02:32,339 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 01:02:32,340 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-06-22 01:02:32,340 INFO ]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 37 [2018-06-22 01:02:32,340 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:32,340 INFO ]: Abstraction has 53 states and 59 transitions. [2018-06-22 01:02:32,340 INFO ]: Interpolant automaton has 20 states. [2018-06-22 01:02:32,340 INFO ]: Start isEmpty. Operand 53 states and 59 transitions. [2018-06-22 01:02:32,341 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:02:32,341 INFO ]: Found error trace [2018-06-22 01:02:32,342 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] [2018-06-22 01:02:32,342 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:32,342 INFO ]: Analyzing trace with hash 1058812894, now seen corresponding path program 1 times [2018-06-22 01:02:32,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:32,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:32,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:32,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:32,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:32,375 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:32,557 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:02:32,557 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:32,557 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 01:02:32,557 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:02:32,558 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:02:32,558 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:02:32,558 INFO ]: Start difference. First operand 53 states and 59 transitions. Second operand 8 states. [2018-06-22 01:02:32,780 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:32,781 INFO ]: Finished difference Result 146 states and 167 transitions. [2018-06-22 01:02:32,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:02:32,781 INFO ]: Start accepts. Automaton has 8 states. Word has length 43 [2018-06-22 01:02:32,781 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:32,782 INFO ]: With dead ends: 146 [2018-06-22 01:02:32,782 INFO ]: Without dead ends: 145 [2018-06-22 01:02:32,782 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:02:32,782 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-22 01:02:32,785 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 58. [2018-06-22 01:02:32,785 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 01:02:32,786 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-06-22 01:02:32,786 INFO ]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 43 [2018-06-22 01:02:32,786 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:32,786 INFO ]: Abstraction has 58 states and 65 transitions. [2018-06-22 01:02:32,786 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:02:32,786 INFO ]: Start isEmpty. Operand 58 states and 65 transitions. [2018-06-22 01:02:32,787 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:02:32,787 INFO ]: Found error trace [2018-06-22 01:02:32,787 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] [2018-06-22 01:02:32,787 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:02:32,788 INFO ]: Analyzing trace with hash -880638946, now seen corresponding path program 1 times [2018-06-22 01:02:32,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:02:32,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:02:32,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:32,788 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:02:32,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:02:32,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:02:32,910 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:02:32,910 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:02:32,910 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 01:02:32,910 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:02:32,910 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:02:32,910 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:02:32,910 INFO ]: Start difference. First operand 58 states and 65 transitions. Second operand 8 states. [2018-06-22 01:02:32,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:02:32,950 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-22 01:02:32,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:02:32,950 INFO ]: Start accepts. Automaton has 8 states. Word has length 43 [2018-06-22 01:02:32,950 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:02:32,950 INFO ]: With dead ends: 22 [2018-06-22 01:02:32,950 INFO ]: Without dead ends: 0 [2018-06-22 01:02:32,950 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:02:32,950 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:02:32,950 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:02:32,950 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:02:32,950 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:02:32,950 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-06-22 01:02:32,951 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:02:32,951 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:02:32,951 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:02:32,951 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:02:32,951 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:02:32,955 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:02:32 BoogieIcfgContainer [2018-06-22 01:02:32,955 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:02:32,957 INFO ]: Toolchain (without parser) took 16168.67 ms. Allocated memory was 308.3 MB in the beginning and 534.2 MB in the end (delta: 226.0 MB). Free memory was 228.7 MB in the beginning and 247.4 MB in the end (delta: -18.6 MB). Peak memory consumption was 207.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:02:32,957 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:02:32,958 INFO ]: ChcToBoogie took 77.95 ms. Allocated memory is still 308.3 MB. Free memory was 228.7 MB in the beginning and 224.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:02:32,958 INFO ]: Boogie Preprocessor took 70.59 ms. Allocated memory is still 308.3 MB. Free memory was 224.7 MB in the beginning and 222.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:02:32,958 INFO ]: RCFGBuilder took 1060.61 ms. Allocated memory was 308.3 MB in the beginning and 325.1 MB in the end (delta: 16.8 MB). Free memory was 222.7 MB in the beginning and 261.7 MB in the end (delta: -38.9 MB). Peak memory consumption was 41.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:02:32,959 INFO ]: TraceAbstraction took 14943.67 ms. Allocated memory was 325.1 MB in the beginning and 534.2 MB in the end (delta: 209.2 MB). Free memory was 261.7 MB in the beginning and 247.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 223.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:02:32,964 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 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 77.95 ms. Allocated memory is still 308.3 MB. Free memory was 228.7 MB in the beginning and 224.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 70.59 ms. Allocated memory is still 308.3 MB. Free memory was 224.7 MB in the beginning and 222.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1060.61 ms. Allocated memory was 308.3 MB in the beginning and 325.1 MB in the end (delta: 16.8 MB). Free memory was 222.7 MB in the beginning and 261.7 MB in the end (delta: -38.9 MB). Peak memory consumption was 41.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 14943.67 ms. Allocated memory was 325.1 MB in the beginning and 534.2 MB in the end (delta: 209.2 MB). Free memory was 261.7 MB in the beginning and 247.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 223.5 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, 44 locations, 1 error locations. SAFE Result, 14.8s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 455 SDtfs, 5516 SDslu, 6770 SDs, 0 SdLazy, 1534 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 409 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5255 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, 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, 750 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 21996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 40/40 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/29.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-02-32-973.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/29.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-02-32-973.csv Received shutdown request...