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/08.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:55:55,965 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:55:55,967 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:55:55,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:55:55,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:55:55,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:55:55,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:55:55,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:55:55,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:55:55,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:55:55,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:55:55,992 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:55:55,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:55:55,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:55:55,996 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:55:55,997 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:55:55,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:55:56,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:55:56,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:55:56,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:55:56,013 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:55:56,015 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:55:56,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:55:56,016 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:55:56,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:55:56,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:55:56,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:55:56,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:55:56,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:55:56,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:55:56,025 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:55:56,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:55:56,025 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:55:56,031 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:55:56,031 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:55:56,032 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:55:56,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:55:56,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:55:56,052 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:55:56,052 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:55:56,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:55:56,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:55:56,053 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:55:56,054 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:55:56,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:55:56,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:55:56,055 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:55:56,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:55:56,055 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:55:56,056 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:55:56,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:55:56,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:55:56,056 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:55:56,057 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:55:56,058 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:55:56,103 INFO ]: Repository-Root is: /tmp [2018-06-22 00:55:56,117 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:55:56,123 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:55:56,124 INFO ]: Initializing SmtParser... [2018-06-22 00:55:56,124 INFO ]: SmtParser initialized [2018-06-22 00:55:56,125 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/08.c.smt2 [2018-06-22 00:55:56,126 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 00:55:56,218 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/08.c.smt2 unknown [2018-06-22 00:55:56,796 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/08.c.smt2 [2018-06-22 00:55:56,807 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:55:56,816 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:55:56,817 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:55:56,817 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:55:56,817 INFO ]: ChcToBoogie initialized [2018-06-22 00:55:56,820 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:55:56" (1/1) ... [2018-06-22 00:55:56,898 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:56 Unit [2018-06-22 00:55:56,898 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:55:56,899 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:55:56,899 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:55:56,899 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:55:56,919 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:56" (1/1) ... [2018-06-22 00:55:56,919 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:56" (1/1) ... [2018-06-22 00:55:56,928 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:56" (1/1) ... [2018-06-22 00:55:56,928 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:56" (1/1) ... [2018-06-22 00:55:56,935 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:56" (1/1) ... [2018-06-22 00:55:56,937 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:56" (1/1) ... [2018-06-22 00:55:56,939 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:56" (1/1) ... [2018-06-22 00:55:56,943 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:55:56,944 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:55:56,944 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:55:56,944 INFO ]: RCFGBuilder initialized [2018-06-22 00:55:56,947 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:56" (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 00:55:56,959 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:55:56,959 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:55:56,959 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:55:56,959 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:55:56,959 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:55:56,959 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 00:55:57,743 INFO ]: Using library mode [2018-06-22 00:55:57,744 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:55:57 BoogieIcfgContainer [2018-06-22 00:55:57,744 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:55:57,745 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:55:57,745 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:55:57,748 INFO ]: TraceAbstraction initialized [2018-06-22 00:55:57,748 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:55:56" (1/3) ... [2018-06-22 00:55:57,749 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e58752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:55:57, skipping insertion in model container [2018-06-22 00:55:57,749 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:56" (2/3) ... [2018-06-22 00:55:57,750 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e58752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:55:57, skipping insertion in model container [2018-06-22 00:55:57,750 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:55:57" (3/3) ... [2018-06-22 00:55:57,751 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:55:57,761 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:55:57,769 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:55:57,804 INFO ]: Using default assertion order modulation [2018-06-22 00:55:57,805 INFO ]: Interprodecural is true [2018-06-22 00:55:57,805 INFO ]: Hoare is false [2018-06-22 00:55:57,805 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:55:57,805 INFO ]: Backedges is TWOTRACK [2018-06-22 00:55:57,805 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:55:57,805 INFO ]: Difference is false [2018-06-22 00:55:57,805 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:55:57,805 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:55:57,819 INFO ]: Start isEmpty. Operand 47 states. [2018-06-22 00:55:57,844 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 00:55:57,844 INFO ]: Found error trace [2018-06-22 00:55:57,845 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:57,845 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:57,850 INFO ]: Analyzing trace with hash 1179021184, now seen corresponding path program 1 times [2018-06-22 00:55:57,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:57,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:57,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:57,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:57,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:57,961 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:58,896 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:58,898 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:58,899 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 00:55:58,900 INFO ]: Interpolant automaton has 13 states [2018-06-22 00:55:58,910 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 00:55:58,911 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:55:58,913 INFO ]: Start difference. First operand 47 states. Second operand 13 states. [2018-06-22 00:55:59,505 WARN ]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-22 00:55:59,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:59,742 INFO ]: Finished difference Result 78 states and 92 transitions. [2018-06-22 00:55:59,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 00:55:59,746 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 00:55:59,746 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:59,754 INFO ]: With dead ends: 78 [2018-06-22 00:55:59,754 INFO ]: Without dead ends: 75 [2018-06-22 00:55:59,756 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-22 00:55:59,771 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 00:55:59,791 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 49. [2018-06-22 00:55:59,792 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 00:55:59,793 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2018-06-22 00:55:59,794 INFO ]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 21 [2018-06-22 00:55:59,795 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:59,795 INFO ]: Abstraction has 49 states and 59 transitions. [2018-06-22 00:55:59,795 INFO ]: Interpolant automaton has 13 states. [2018-06-22 00:55:59,795 INFO ]: Start isEmpty. Operand 49 states and 59 transitions. [2018-06-22 00:55:59,796 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:55:59,796 INFO ]: Found error trace [2018-06-22 00:55:59,796 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] [2018-06-22 00:55:59,797 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:59,797 INFO ]: Analyzing trace with hash 642091202, now seen corresponding path program 1 times [2018-06-22 00:55:59,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:59,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:59,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:59,798 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:59,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:59,838 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:00,045 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:00,045 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:00,045 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:56:00,047 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:56:00,047 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:56:00,047 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:56:00,047 INFO ]: Start difference. First operand 49 states and 59 transitions. Second operand 12 states. [2018-06-22 00:56:01,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:01,040 INFO ]: Finished difference Result 214 states and 258 transitions. [2018-06-22 00:56:01,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 00:56:01,040 INFO ]: Start accepts. Automaton has 12 states. Word has length 31 [2018-06-22 00:56:01,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:01,046 INFO ]: With dead ends: 214 [2018-06-22 00:56:01,046 INFO ]: Without dead ends: 213 [2018-06-22 00:56:01,047 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=1053, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 00:56:01,047 INFO ]: Start minimizeSevpa. Operand 213 states. [2018-06-22 00:56:01,057 INFO ]: Finished minimizeSevpa. Reduced states from 213 to 54. [2018-06-22 00:56:01,057 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 00:56:01,059 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-06-22 00:56:01,059 INFO ]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 31 [2018-06-22 00:56:01,059 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:01,059 INFO ]: Abstraction has 54 states and 65 transitions. [2018-06-22 00:56:01,059 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:56:01,059 INFO ]: Start isEmpty. Operand 54 states and 65 transitions. [2018-06-22 00:56:01,060 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:56:01,060 INFO ]: Found error trace [2018-06-22 00:56:01,060 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] [2018-06-22 00:56:01,060 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:01,060 INFO ]: Analyzing trace with hash 313450626, now seen corresponding path program 1 times [2018-06-22 00:56:01,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:01,061 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:01,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:01,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:01,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:01,093 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:01,250 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:01,251 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:01,251 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:56:01,251 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:56:01,251 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:56:01,251 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:56:01,251 INFO ]: Start difference. First operand 54 states and 65 transitions. Second operand 12 states. [2018-06-22 00:56:01,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:01,533 INFO ]: Finished difference Result 117 states and 138 transitions. [2018-06-22 00:56:01,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 00:56:01,572 INFO ]: Start accepts. Automaton has 12 states. Word has length 31 [2018-06-22 00:56:01,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:01,574 INFO ]: With dead ends: 117 [2018-06-22 00:56:01,574 INFO ]: Without dead ends: 112 [2018-06-22 00:56:01,574 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2018-06-22 00:56:01,574 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 00:56:01,585 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 50. [2018-06-22 00:56:01,585 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 00:56:01,587 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-06-22 00:56:01,587 INFO ]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 31 [2018-06-22 00:56:01,587 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:01,587 INFO ]: Abstraction has 50 states and 60 transitions. [2018-06-22 00:56:01,587 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:56:01,587 INFO ]: Start isEmpty. Operand 50 states and 60 transitions. [2018-06-22 00:56:01,588 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:56:01,588 INFO ]: Found error trace [2018-06-22 00:56:01,588 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] [2018-06-22 00:56:01,588 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:01,588 INFO ]: Analyzing trace with hash -1967325054, now seen corresponding path program 1 times [2018-06-22 00:56:01,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:01,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:01,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:01,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:01,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:01,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:01,762 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:01,762 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:01,762 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:56:01,763 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:56:01,763 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:56:01,763 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:56:01,763 INFO ]: Start difference. First operand 50 states and 60 transitions. Second operand 12 states. [2018-06-22 00:56:02,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:02,183 INFO ]: Finished difference Result 175 states and 210 transitions. [2018-06-22 00:56:02,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 00:56:02,184 INFO ]: Start accepts. Automaton has 12 states. Word has length 31 [2018-06-22 00:56:02,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:02,186 INFO ]: With dead ends: 175 [2018-06-22 00:56:02,186 INFO ]: Without dead ends: 174 [2018-06-22 00:56:02,187 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 00:56:02,187 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-22 00:56:02,195 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 54. [2018-06-22 00:56:02,195 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 00:56:02,196 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-06-22 00:56:02,196 INFO ]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 31 [2018-06-22 00:56:02,196 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:02,196 INFO ]: Abstraction has 54 states and 64 transitions. [2018-06-22 00:56:02,196 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:56:02,196 INFO ]: Start isEmpty. Operand 54 states and 64 transitions. [2018-06-22 00:56:02,197 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:56:02,197 INFO ]: Found error trace [2018-06-22 00:56:02,197 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] [2018-06-22 00:56:02,197 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:02,197 INFO ]: Analyzing trace with hash 1999001666, now seen corresponding path program 1 times [2018-06-22 00:56:02,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:02,198 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:02,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:02,198 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:02,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:02,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:02,387 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:02,388 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:02,388 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:56:02,388 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:56:02,388 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:56:02,388 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:56:02,388 INFO ]: Start difference. First operand 54 states and 64 transitions. Second operand 12 states. [2018-06-22 00:56:02,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:02,702 INFO ]: Finished difference Result 78 states and 90 transitions. [2018-06-22 00:56:02,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:56:02,707 INFO ]: Start accepts. Automaton has 12 states. Word has length 31 [2018-06-22 00:56:02,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:02,708 INFO ]: With dead ends: 78 [2018-06-22 00:56:02,708 INFO ]: Without dead ends: 72 [2018-06-22 00:56:02,708 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 00:56:02,709 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 00:56:02,713 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 49. [2018-06-22 00:56:02,713 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 00:56:02,714 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-06-22 00:56:02,714 INFO ]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 31 [2018-06-22 00:56:02,714 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:02,714 INFO ]: Abstraction has 49 states and 58 transitions. [2018-06-22 00:56:02,714 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:56:02,714 INFO ]: Start isEmpty. Operand 49 states and 58 transitions. [2018-06-22 00:56:02,720 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 00:56:02,720 INFO ]: Found error trace [2018-06-22 00:56:02,720 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] [2018-06-22 00:56:02,720 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:02,720 INFO ]: Analyzing trace with hash 79496562, now seen corresponding path program 1 times [2018-06-22 00:56:02,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:02,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:02,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:02,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:02,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:02,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:03,187 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:03,187 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:03,187 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 00:56:03,187 INFO ]: Interpolant automaton has 15 states [2018-06-22 00:56:03,187 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 00:56:03,187 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 00:56:03,187 INFO ]: Start difference. First operand 49 states and 58 transitions. Second operand 15 states. [2018-06-22 00:56:04,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:04,072 INFO ]: Finished difference Result 186 states and 221 transitions. [2018-06-22 00:56:04,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-22 00:56:04,072 INFO ]: Start accepts. Automaton has 15 states. Word has length 34 [2018-06-22 00:56:04,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:04,073 INFO ]: With dead ends: 186 [2018-06-22 00:56:04,073 INFO ]: Without dead ends: 185 [2018-06-22 00:56:04,074 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=673, Invalid=2189, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 00:56:04,074 INFO ]: Start minimizeSevpa. Operand 185 states. [2018-06-22 00:56:04,080 INFO ]: Finished minimizeSevpa. Reduced states from 185 to 57. [2018-06-22 00:56:04,080 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 00:56:04,081 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-06-22 00:56:04,081 INFO ]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 34 [2018-06-22 00:56:04,081 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:04,081 INFO ]: Abstraction has 57 states and 66 transitions. [2018-06-22 00:56:04,081 INFO ]: Interpolant automaton has 15 states. [2018-06-22 00:56:04,081 INFO ]: Start isEmpty. Operand 57 states and 66 transitions. [2018-06-22 00:56:04,082 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 00:56:04,082 INFO ]: Found error trace [2018-06-22 00:56:04,082 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] [2018-06-22 00:56:04,082 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:04,082 INFO ]: Analyzing trace with hash -249144014, now seen corresponding path program 1 times [2018-06-22 00:56:04,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:04,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:04,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:04,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:04,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:04,098 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:04,224 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:04,224 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:04,224 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 00:56:04,224 INFO ]: Interpolant automaton has 15 states [2018-06-22 00:56:04,224 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 00:56:04,224 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 00:56:04,224 INFO ]: Start difference. First operand 57 states and 66 transitions. Second operand 15 states. [2018-06-22 00:56:04,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:04,587 INFO ]: Finished difference Result 80 states and 91 transitions. [2018-06-22 00:56:04,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 00:56:04,587 INFO ]: Start accepts. Automaton has 15 states. Word has length 34 [2018-06-22 00:56:04,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:04,587 INFO ]: With dead ends: 80 [2018-06-22 00:56:04,587 INFO ]: Without dead ends: 71 [2018-06-22 00:56:04,588 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2018-06-22 00:56:04,588 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 00:56:04,591 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 49. [2018-06-22 00:56:04,591 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 00:56:04,592 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-06-22 00:56:04,592 INFO ]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 34 [2018-06-22 00:56:04,592 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:04,592 INFO ]: Abstraction has 49 states and 57 transitions. [2018-06-22 00:56:04,592 INFO ]: Interpolant automaton has 15 states. [2018-06-22 00:56:04,592 INFO ]: Start isEmpty. Operand 49 states and 57 transitions. [2018-06-22 00:56:04,593 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 00:56:04,593 INFO ]: Found error trace [2018-06-22 00:56:04,593 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, 1] [2018-06-22 00:56:04,593 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:04,593 INFO ]: Analyzing trace with hash 1693232936, now seen corresponding path program 1 times [2018-06-22 00:56:04,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:04,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:04,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:04,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:04,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:04,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:04,906 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:04,906 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:04,906 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 00:56:04,906 INFO ]: Interpolant automaton has 13 states [2018-06-22 00:56:04,906 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 00:56:04,906 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:56:04,907 INFO ]: Start difference. First operand 49 states and 57 transitions. Second operand 13 states. [2018-06-22 00:56:05,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:05,245 INFO ]: Finished difference Result 148 states and 175 transitions. [2018-06-22 00:56:05,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 00:56:05,246 INFO ]: Start accepts. Automaton has 13 states. Word has length 38 [2018-06-22 00:56:05,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:05,246 INFO ]: With dead ends: 148 [2018-06-22 00:56:05,246 INFO ]: Without dead ends: 147 [2018-06-22 00:56:05,247 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=688, Unknown=0, NotChecked=0, Total=992 [2018-06-22 00:56:05,247 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-22 00:56:05,251 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 51. [2018-06-22 00:56:05,251 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 00:56:05,252 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-06-22 00:56:05,252 INFO ]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 38 [2018-06-22 00:56:05,252 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:05,252 INFO ]: Abstraction has 51 states and 59 transitions. [2018-06-22 00:56:05,252 INFO ]: Interpolant automaton has 13 states. [2018-06-22 00:56:05,252 INFO ]: Start isEmpty. Operand 51 states and 59 transitions. [2018-06-22 00:56:05,253 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 00:56:05,253 INFO ]: Found error trace [2018-06-22 00:56:05,253 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, 1, 1] [2018-06-22 00:56:05,253 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:05,253 INFO ]: Analyzing trace with hash 357166822, now seen corresponding path program 1 times [2018-06-22 00:56:05,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:05,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:05,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:05,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:05,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:05,270 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:05,410 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:05,411 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:05,411 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:56:05,411 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:56:05,411 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:56:05,411 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:56:05,411 INFO ]: Start difference. First operand 51 states and 59 transitions. Second operand 12 states. [2018-06-22 00:56:05,885 WARN ]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 00:56:06,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:06,129 INFO ]: Finished difference Result 70 states and 79 transitions. [2018-06-22 00:56:06,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:56:06,132 INFO ]: Start accepts. Automaton has 12 states. Word has length 39 [2018-06-22 00:56:06,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:06,133 INFO ]: With dead ends: 70 [2018-06-22 00:56:06,133 INFO ]: Without dead ends: 68 [2018-06-22 00:56:06,133 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2018-06-22 00:56:06,133 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 00:56:06,136 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 51. [2018-06-22 00:56:06,136 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 00:56:06,137 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-06-22 00:56:06,137 INFO ]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 39 [2018-06-22 00:56:06,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:06,137 INFO ]: Abstraction has 51 states and 58 transitions. [2018-06-22 00:56:06,137 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:56:06,137 INFO ]: Start isEmpty. Operand 51 states and 58 transitions. [2018-06-22 00:56:06,138 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 00:56:06,138 INFO ]: Found error trace [2018-06-22 00:56:06,138 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, 1, 1] [2018-06-22 00:56:06,138 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:06,139 INFO ]: Analyzing trace with hash -1141767474, now seen corresponding path program 1 times [2018-06-22 00:56:06,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:06,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:06,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:06,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:06,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:06,155 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:06,480 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:06,480 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:06,480 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 00:56:06,480 INFO ]: Interpolant automaton has 20 states [2018-06-22 00:56:06,480 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 00:56:06,480 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 00:56:06,480 INFO ]: Start difference. First operand 51 states and 58 transitions. Second operand 20 states. [2018-06-22 00:56:06,848 WARN ]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 00:56:09,089 WARN ]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 00:56:10,066 WARN ]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 00:56:12,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:12,008 INFO ]: Finished difference Result 526 states and 630 transitions. [2018-06-22 00:56:12,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-06-22 00:56:12,008 INFO ]: Start accepts. Automaton has 20 states. Word has length 39 [2018-06-22 00:56:12,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:12,011 INFO ]: With dead ends: 526 [2018-06-22 00:56:12,011 INFO ]: Without dead ends: 525 [2018-06-22 00:56:12,016 INFO ]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13397 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5374, Invalid=26488, Unknown=0, NotChecked=0, Total=31862 [2018-06-22 00:56:12,017 INFO ]: Start minimizeSevpa. Operand 525 states. [2018-06-22 00:56:12,029 INFO ]: Finished minimizeSevpa. Reduced states from 525 to 62. [2018-06-22 00:56:12,029 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 00:56:12,029 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-06-22 00:56:12,030 INFO ]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 39 [2018-06-22 00:56:12,030 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:12,030 INFO ]: Abstraction has 62 states and 70 transitions. [2018-06-22 00:56:12,030 INFO ]: Interpolant automaton has 20 states. [2018-06-22 00:56:12,030 INFO ]: Start isEmpty. Operand 62 states and 70 transitions. [2018-06-22 00:56:12,031 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 00:56:12,031 INFO ]: Found error trace [2018-06-22 00:56:12,032 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, 1, 1] [2018-06-22 00:56:12,032 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:12,032 INFO ]: Analyzing trace with hash -1470408050, now seen corresponding path program 1 times [2018-06-22 00:56:12,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:12,032 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:12,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:12,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:12,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:12,050 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:12,836 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:12,836 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:12,855 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 00:56:12,855 INFO ]: Interpolant automaton has 20 states [2018-06-22 00:56:12,855 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 00:56:12,856 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 00:56:12,856 INFO ]: Start difference. First operand 62 states and 70 transitions. Second operand 20 states. [2018-06-22 00:56:13,643 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:13,644 INFO ]: Finished difference Result 205 states and 245 transitions. [2018-06-22 00:56:13,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 00:56:13,644 INFO ]: Start accepts. Automaton has 20 states. Word has length 39 [2018-06-22 00:56:13,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:13,644 INFO ]: With dead ends: 205 [2018-06-22 00:56:13,644 INFO ]: Without dead ends: 196 [2018-06-22 00:56:13,645 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=646, Invalid=1804, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 00:56:13,645 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-22 00:56:13,648 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 54. [2018-06-22 00:56:13,648 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 00:56:13,649 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-06-22 00:56:13,649 INFO ]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 39 [2018-06-22 00:56:13,649 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:13,649 INFO ]: Abstraction has 54 states and 61 transitions. [2018-06-22 00:56:13,649 INFO ]: Interpolant automaton has 20 states. [2018-06-22 00:56:13,649 INFO ]: Start isEmpty. Operand 54 states and 61 transitions. [2018-06-22 00:56:13,653 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 00:56:13,653 INFO ]: Found error trace [2018-06-22 00:56:13,654 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, 1, 1] [2018-06-22 00:56:13,654 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:13,654 INFO ]: Analyzing trace with hash -1940912456, now seen corresponding path program 1 times [2018-06-22 00:56:13,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:13,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:13,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:13,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:13,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:13,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:13,880 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:13,880 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:13,880 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 00:56:13,881 INFO ]: Interpolant automaton has 20 states [2018-06-22 00:56:13,881 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 00:56:13,881 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 00:56:13,881 INFO ]: Start difference. First operand 54 states and 61 transitions. Second operand 20 states. [2018-06-22 00:56:14,832 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-22 00:56:17,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:17,387 INFO ]: Finished difference Result 479 states and 573 transitions. [2018-06-22 00:56:17,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-06-22 00:56:17,387 INFO ]: Start accepts. Automaton has 20 states. Word has length 39 [2018-06-22 00:56:17,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:17,389 INFO ]: With dead ends: 479 [2018-06-22 00:56:17,389 INFO ]: Without dead ends: 478 [2018-06-22 00:56:17,396 INFO ]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4983, Invalid=23409, Unknown=0, NotChecked=0, Total=28392 [2018-06-22 00:56:17,396 INFO ]: Start minimizeSevpa. Operand 478 states. [2018-06-22 00:56:17,403 INFO ]: Finished minimizeSevpa. Reduced states from 478 to 62. [2018-06-22 00:56:17,403 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 00:56:17,404 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-06-22 00:56:17,404 INFO ]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 39 [2018-06-22 00:56:17,404 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:17,404 INFO ]: Abstraction has 62 states and 69 transitions. [2018-06-22 00:56:17,404 INFO ]: Interpolant automaton has 20 states. [2018-06-22 00:56:17,404 INFO ]: Start isEmpty. Operand 62 states and 69 transitions. [2018-06-22 00:56:17,414 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 00:56:17,414 INFO ]: Found error trace [2018-06-22 00:56:17,414 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, 1, 1] [2018-06-22 00:56:17,414 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:56:17,414 INFO ]: Analyzing trace with hash 2025414264, now seen corresponding path program 1 times [2018-06-22 00:56:17,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:56:17,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:56:17,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:17,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:56:17,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:56:17,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:56:17,828 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:56:17,828 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:56:17,828 INFO ]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-06-22 00:56:17,828 INFO ]: Interpolant automaton has 20 states [2018-06-22 00:56:17,828 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 00:56:17,829 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-22 00:56:17,829 INFO ]: Start difference. First operand 62 states and 69 transitions. Second operand 20 states. [2018-06-22 00:56:18,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:56:18,281 INFO ]: Finished difference Result 28 states and 27 transitions. [2018-06-22 00:56:18,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 00:56:18,305 INFO ]: Start accepts. Automaton has 20 states. Word has length 39 [2018-06-22 00:56:18,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:56:18,306 INFO ]: With dead ends: 28 [2018-06-22 00:56:18,306 INFO ]: Without dead ends: 0 [2018-06-22 00:56:18,306 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 00:56:18,306 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 00:56:18,306 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 00:56:18,306 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 00:56:18,306 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 00:56:18,306 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-06-22 00:56:18,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:56:18,306 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 00:56:18,306 INFO ]: Interpolant automaton has 20 states. [2018-06-22 00:56:18,306 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 00:56:18,306 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 00:56:18,310 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:56:18 BoogieIcfgContainer [2018-06-22 00:56:18,310 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:56:18,310 INFO ]: Toolchain (without parser) took 21502.87 ms. Allocated memory was 303.6 MB in the beginning and 585.1 MB in the end (delta: 281.5 MB). Free memory was 238.1 MB in the beginning and 420.6 MB in the end (delta: -182.5 MB). Peak memory consumption was 99.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:18,311 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:56:18,311 INFO ]: ChcToBoogie took 81.79 ms. Allocated memory is still 303.6 MB. Free memory was 238.1 MB in the beginning and 235.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:18,312 INFO ]: Boogie Preprocessor took 44.27 ms. Allocated memory is still 303.6 MB. Free memory was 235.1 MB in the beginning and 233.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:18,312 INFO ]: RCFGBuilder took 799.90 ms. Allocated memory is still 303.6 MB. Free memory was 233.1 MB in the beginning and 189.4 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:18,313 INFO ]: TraceAbstraction took 20564.73 ms. Allocated memory was 303.6 MB in the beginning and 585.1 MB in the end (delta: 281.5 MB). Free memory was 189.4 MB in the beginning and 420.6 MB in the end (delta: -231.1 MB). Peak memory consumption was 50.4 MB. Max. memory is 3.6 GB. [2018-06-22 00:56:18,321 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 303.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 81.79 ms. Allocated memory is still 303.6 MB. Free memory was 238.1 MB in the beginning and 235.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.27 ms. Allocated memory is still 303.6 MB. Free memory was 235.1 MB in the beginning and 233.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 799.90 ms. Allocated memory is still 303.6 MB. Free memory was 233.1 MB in the beginning and 189.4 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 20564.73 ms. Allocated memory was 303.6 MB in the beginning and 585.1 MB in the end (delta: 281.5 MB). Free memory was 189.4 MB in the beginning and 420.6 MB in the end (delta: -231.1 MB). Peak memory consumption was 50.4 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, 47 locations, 1 error locations. SAFE Result, 20.5s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 702 SDtfs, 7519 SDslu, 9391 SDs, 0 SdLazy, 1840 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 723 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 696 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27174 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=10, 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, 13 MinimizatonAttempts, 1674 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 446 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 433 ConstructedInterpolants, 0 QuantifiedInterpolants, 26589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 48/48 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/08.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-56-18-329.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/08.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-56-18-329.csv Received shutdown request...