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/reve/018-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:29:02,733 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:29:02,734 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:29:02,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:29:02,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:29:02,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:29:02,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:29:02,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:29:02,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:29:02,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:29:02,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:29:02,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:29:02,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:29:02,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:29:02,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:29:02,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:29:02,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:29:02,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:29:02,762 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:29:02,763 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:29:02,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:29:02,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:29:02,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:29:02,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:29:02,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:29:02,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:29:02,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:29:02,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:29:02,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:29:02,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:29:02,791 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:29:02,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:29:02,792 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:29:02,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:29:02,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:29:02,793 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:29:02,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:29:02,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:29:02,815 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:29:02,815 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:29:02,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:29:02,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:29:02,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:29:02,816 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:29:02,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:29:02,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:29:02,817 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:29:02,817 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:29:02,817 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:29:02,818 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:29:02,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:29:02,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:29:02,818 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:29:02,821 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:29:02,821 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:29:02,860 INFO ]: Repository-Root is: /tmp [2018-06-22 01:29:02,876 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:29:02,880 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:29:02,881 INFO ]: Initializing SmtParser... [2018-06-22 01:29:02,881 INFO ]: SmtParser initialized [2018-06-22 01:29:02,882 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/018-horn.smt2 [2018-06-22 01:29:02,883 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:29:02,975 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018-horn.smt2 unknown [2018-06-22 01:29:03,233 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018-horn.smt2 [2018-06-22 01:29:03,243 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:29:03,252 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:29:03,253 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:29:03,253 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:29:03,253 INFO ]: ChcToBoogie initialized [2018-06-22 01:29:03,259 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:29:03" (1/1) ... [2018-06-22 01:29:03,323 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:03 Unit [2018-06-22 01:29:03,323 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:29:03,324 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:29:03,324 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:29:03,324 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:29:03,345 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:03" (1/1) ... [2018-06-22 01:29:03,345 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:03" (1/1) ... [2018-06-22 01:29:03,353 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:03" (1/1) ... [2018-06-22 01:29:03,353 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:03" (1/1) ... [2018-06-22 01:29:03,367 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:03" (1/1) ... [2018-06-22 01:29:03,372 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:03" (1/1) ... [2018-06-22 01:29:03,373 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:03" (1/1) ... [2018-06-22 01:29:03,382 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:29:03,382 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:29:03,383 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:29:03,383 INFO ]: RCFGBuilder initialized [2018-06-22 01:29:03,383 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:03" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:29:03,402 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:29:03,402 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:29:03,402 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:29:03,402 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:29:03,402 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:29:03,402 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:29:03,853 INFO ]: Using library mode [2018-06-22 01:29:03,854 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:29:03 BoogieIcfgContainer [2018-06-22 01:29:03,854 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:29:03,856 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:29:03,856 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:29:03,862 INFO ]: TraceAbstraction initialized [2018-06-22 01:29:03,862 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:29:03" (1/3) ... [2018-06-22 01:29:03,863 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b43aad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:29:03, skipping insertion in model container [2018-06-22 01:29:03,863 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:29:03" (2/3) ... [2018-06-22 01:29:03,863 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b43aad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:29:03, skipping insertion in model container [2018-06-22 01:29:03,863 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:29:03" (3/3) ... [2018-06-22 01:29:03,865 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:29:03,875 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:29:03,883 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:29:03,922 INFO ]: Using default assertion order modulation [2018-06-22 01:29:03,923 INFO ]: Interprodecural is true [2018-06-22 01:29:03,923 INFO ]: Hoare is false [2018-06-22 01:29:03,923 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:29:03,923 INFO ]: Backedges is TWOTRACK [2018-06-22 01:29:03,923 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:29:03,923 INFO ]: Difference is false [2018-06-22 01:29:03,923 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:29:03,923 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:29:03,937 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:29:03,946 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:29:03,946 INFO ]: Found error trace [2018-06-22 01:29:03,947 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:03,947 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:03,952 INFO ]: Analyzing trace with hash 2110486806, now seen corresponding path program 1 times [2018-06-22 01:29:03,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:03,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:03,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:03,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:03,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,011 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:04,041 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:29:04,043 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:04,043 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:29:04,045 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:29:04,056 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:29:04,056 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:29:04,058 INFO ]: Start difference. First operand 13 states. Second operand 2 states. [2018-06-22 01:29:04,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:04,076 INFO ]: Finished difference Result 9 states and 15 transitions. [2018-06-22 01:29:04,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:29:04,077 INFO ]: Start accepts. Automaton has 2 states. Word has length 7 [2018-06-22 01:29:04,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:04,095 INFO ]: With dead ends: 9 [2018-06-22 01:29:04,095 INFO ]: Without dead ends: 9 [2018-06-22 01:29:04,097 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:29:04,111 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:29:04,125 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:29:04,127 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:29:04,127 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-22 01:29:04,128 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 7 [2018-06-22 01:29:04,128 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:04,128 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-22 01:29:04,128 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:29:04,129 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-22 01:29:04,129 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:29:04,129 INFO ]: Found error trace [2018-06-22 01:29:04,129 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:04,129 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:04,129 INFO ]: Analyzing trace with hash 2118828286, now seen corresponding path program 1 times [2018-06-22 01:29:04,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:04,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:04,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:04,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,149 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:04,246 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:29:04,246 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:04,246 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:29:04,247 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:29:04,248 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:29:04,248 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:04,248 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 3 states. [2018-06-22 01:29:04,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:04,299 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-22 01:29:04,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:29:04,299 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:29:04,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:04,300 INFO ]: With dead ends: 10 [2018-06-22 01:29:04,300 INFO ]: Without dead ends: 10 [2018-06-22 01:29:04,301 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:04,301 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:29:04,303 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:29:04,303 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:29:04,303 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-22 01:29:04,303 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 7 [2018-06-22 01:29:04,303 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:04,303 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-22 01:29:04,303 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:29:04,303 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-22 01:29:04,304 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:29:04,304 INFO ]: Found error trace [2018-06-22 01:29:04,304 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:04,304 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:04,304 INFO ]: Analyzing trace with hash 2120883865, now seen corresponding path program 1 times [2018-06-22 01:29:04,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:04,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:04,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:04,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,314 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:04,335 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:29:04,335 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:04,335 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:29:04,335 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:29:04,336 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:29:04,336 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:04,336 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2018-06-22 01:29:04,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:04,389 INFO ]: Finished difference Result 11 states and 21 transitions. [2018-06-22 01:29:04,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:29:04,389 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:29:04,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:04,390 INFO ]: With dead ends: 11 [2018-06-22 01:29:04,390 INFO ]: Without dead ends: 11 [2018-06-22 01:29:04,390 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:04,390 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:29:04,392 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:29:04,392 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:29:04,392 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-06-22 01:29:04,392 INFO ]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 7 [2018-06-22 01:29:04,392 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:04,392 INFO ]: Abstraction has 11 states and 21 transitions. [2018-06-22 01:29:04,392 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:29:04,392 INFO ]: Start isEmpty. Operand 11 states and 21 transitions. [2018-06-22 01:29:04,393 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:29:04,393 INFO ]: Found error trace [2018-06-22 01:29:04,393 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:04,393 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:04,393 INFO ]: Analyzing trace with hash 1256897738, now seen corresponding path program 1 times [2018-06-22 01:29:04,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:04,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:04,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:04,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:04,524 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:04,524 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:29:04,524 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:29:04,540 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:29:04,593 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:04,602 INFO ]: Computing forward predicates... [2018-06-22 01:29:04,711 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:04,737 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:29:04,737 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:29:04,737 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:29:04,737 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:29:04,737 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:29:04,737 INFO ]: Start difference. First operand 11 states and 21 transitions. Second operand 5 states. [2018-06-22 01:29:04,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:04,905 INFO ]: Finished difference Result 14 states and 28 transitions. [2018-06-22 01:29:04,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:29:04,906 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:29:04,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:04,906 INFO ]: With dead ends: 14 [2018-06-22 01:29:04,907 INFO ]: Without dead ends: 14 [2018-06-22 01:29:04,907 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:29:04,907 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:29:04,909 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:29:04,909 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:29:04,909 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-06-22 01:29:04,910 INFO ]: Start accepts. Automaton has 14 states and 28 transitions. Word has length 8 [2018-06-22 01:29:04,910 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:04,912 INFO ]: Abstraction has 14 states and 28 transitions. [2018-06-22 01:29:04,912 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:29:04,912 INFO ]: Start isEmpty. Operand 14 states and 28 transitions. [2018-06-22 01:29:04,912 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:29:04,912 INFO ]: Found error trace [2018-06-22 01:29:04,912 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:04,913 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:04,913 INFO ]: Analyzing trace with hash 1249509570, now seen corresponding path program 1 times [2018-06-22 01:29:04,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:04,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:04,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:04,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:04,957 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:05,119 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:05,119 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:29:05,119 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:29:05,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:05,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:05,169 INFO ]: Computing forward predicates... [2018-06-22 01:29:05,232 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:05,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:29:05,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-22 01:29:05,262 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:29:05,262 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:29:05,262 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:29:05,262 INFO ]: Start difference. First operand 14 states and 28 transitions. Second operand 6 states. [2018-06-22 01:29:05,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:05,499 INFO ]: Finished difference Result 21 states and 43 transitions. [2018-06-22 01:29:05,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:29:05,499 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-22 01:29:05,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:05,501 INFO ]: With dead ends: 21 [2018-06-22 01:29:05,501 INFO ]: Without dead ends: 21 [2018-06-22 01:29:05,501 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:29:05,501 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:29:05,504 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-22 01:29:05,504 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:29:05,505 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2018-06-22 01:29:05,505 INFO ]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 8 [2018-06-22 01:29:05,505 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:05,505 INFO ]: Abstraction has 18 states and 38 transitions. [2018-06-22 01:29:05,505 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:29:05,505 INFO ]: Start isEmpty. Operand 18 states and 38 transitions. [2018-06-22 01:29:05,505 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:29:05,505 INFO ]: Found error trace [2018-06-22 01:29:05,505 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:05,506 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:05,506 INFO ]: Analyzing trace with hash 1327293871, now seen corresponding path program 1 times [2018-06-22 01:29:05,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:05,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:05,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:05,506 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:05,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:05,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:05,541 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:05,541 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:05,541 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:29:05,541 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:29:05,541 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:29:05,541 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:05,542 INFO ]: Start difference. First operand 18 states and 38 transitions. Second operand 3 states. [2018-06-22 01:29:05,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:05,598 INFO ]: Finished difference Result 20 states and 42 transitions. [2018-06-22 01:29:05,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:29:05,598 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:29:05,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:05,599 INFO ]: With dead ends: 20 [2018-06-22 01:29:05,599 INFO ]: Without dead ends: 18 [2018-06-22 01:29:05,599 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:29:05,599 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:29:05,601 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:29:05,601 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:29:05,602 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2018-06-22 01:29:05,602 INFO ]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 8 [2018-06-22 01:29:05,602 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:05,602 INFO ]: Abstraction has 18 states and 34 transitions. [2018-06-22 01:29:05,602 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:29:05,602 INFO ]: Start isEmpty. Operand 18 states and 34 transitions. [2018-06-22 01:29:05,602 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:29:05,602 INFO ]: Found error trace [2018-06-22 01:29:05,602 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:05,602 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:05,603 INFO ]: Analyzing trace with hash 1318982182, now seen corresponding path program 1 times [2018-06-22 01:29:05,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:05,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:05,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:05,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:05,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:05,619 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:05,771 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:05,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:29:05,771 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:29:05,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:05,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:05,801 INFO ]: Computing forward predicates... [2018-06-22 01:29:05,953 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:05,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:29:05,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:29:05,988 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:29:05,988 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:29:05,988 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:29:05,989 INFO ]: Start difference. First operand 18 states and 34 transitions. Second operand 5 states. [2018-06-22 01:29:06,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:06,128 INFO ]: Finished difference Result 21 states and 37 transitions. [2018-06-22 01:29:06,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:29:06,130 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:29:06,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:06,130 INFO ]: With dead ends: 21 [2018-06-22 01:29:06,130 INFO ]: Without dead ends: 21 [2018-06-22 01:29:06,131 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:29:06,131 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:29:06,136 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 01:29:06,136 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:29:06,136 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-06-22 01:29:06,136 INFO ]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 8 [2018-06-22 01:29:06,136 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:06,136 INFO ]: Abstraction has 19 states and 35 transitions. [2018-06-22 01:29:06,136 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:29:06,136 INFO ]: Start isEmpty. Operand 19 states and 35 transitions. [2018-06-22 01:29:06,137 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:29:06,137 INFO ]: Found error trace [2018-06-22 01:29:06,137 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:06,137 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:06,137 INFO ]: Analyzing trace with hash 70433150, now seen corresponding path program 2 times [2018-06-22 01:29:06,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:06,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:06,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,138 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:29:06,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:06,214 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:06,214 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:06,215 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:29:06,215 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:29:06,215 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:29:06,215 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:06,215 INFO ]: Start difference. First operand 19 states and 35 transitions. Second operand 4 states. [2018-06-22 01:29:06,242 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:06,242 INFO ]: Finished difference Result 21 states and 35 transitions. [2018-06-22 01:29:06,242 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:29:06,242 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:29:06,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:06,243 INFO ]: With dead ends: 21 [2018-06-22 01:29:06,243 INFO ]: Without dead ends: 19 [2018-06-22 01:29:06,243 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:06,243 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:29:06,245 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-22 01:29:06,245 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:29:06,245 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 01:29:06,245 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-22 01:29:06,245 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:06,245 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 01:29:06,245 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:29:06,245 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 01:29:06,245 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:29:06,245 INFO ]: Found error trace [2018-06-22 01:29:06,246 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:06,246 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:06,246 INFO ]: Analyzing trace with hash -2065133511, now seen corresponding path program 2 times [2018-06-22 01:29:06,246 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:06,246 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:06,246 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,247 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:29:06,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,256 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:06,284 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:06,284 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:06,284 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:29:06,284 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:29:06,284 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:29:06,284 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:06,285 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 4 states. [2018-06-22 01:29:06,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:06,308 INFO ]: Finished difference Result 15 states and 21 transitions. [2018-06-22 01:29:06,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:29:06,309 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:29:06,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:06,310 INFO ]: With dead ends: 15 [2018-06-22 01:29:06,310 INFO ]: Without dead ends: 12 [2018-06-22 01:29:06,310 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:29:06,310 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:29:06,311 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:29:06,311 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:29:06,312 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-22 01:29:06,312 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 9 [2018-06-22 01:29:06,312 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:06,312 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-22 01:29:06,312 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:29:06,312 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-22 01:29:06,312 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:29:06,312 INFO ]: Found error trace [2018-06-22 01:29:06,312 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:29:06,312 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:29:06,312 INFO ]: Analyzing trace with hash 73131130, now seen corresponding path program 1 times [2018-06-22 01:29:06,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:29:06,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:29:06,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,313 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:29:06,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:29:06,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:29:06,381 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:29:06,381 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:29:06,382 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:29:06,382 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:29:06,382 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:29:06,382 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:29:06,382 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 5 states. [2018-06-22 01:29:06,396 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:29:06,396 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-22 01:29:06,396 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:29:06,397 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-22 01:29:06,397 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:29:06,397 INFO ]: With dead ends: 13 [2018-06-22 01:29:06,397 INFO ]: Without dead ends: 0 [2018-06-22 01:29:06,397 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:29:06,397 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:29:06,397 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:29:06,397 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:29:06,397 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:29:06,397 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-06-22 01:29:06,397 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:29:06,397 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:29:06,397 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:29:06,397 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:29:06,397 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:29:06,401 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:29:06 BoogieIcfgContainer [2018-06-22 01:29:06,401 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:29:06,401 INFO ]: Toolchain (without parser) took 3158.32 ms. Allocated memory was 308.8 MB in the beginning and 327.2 MB in the end (delta: 18.4 MB). Free memory was 258.2 MB in the beginning and 244.0 MB in the end (delta: 14.2 MB). Peak memory consumption was 32.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:29:06,403 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:29:06,403 INFO ]: ChcToBoogie took 70.67 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 255.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:29:06,404 INFO ]: Boogie Preprocessor took 58.02 ms. Allocated memory is still 308.8 MB. Free memory was 255.2 MB in the beginning and 254.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:29:06,405 INFO ]: RCFGBuilder took 471.53 ms. Allocated memory is still 308.8 MB. Free memory was 254.2 MB in the beginning and 237.1 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:29:06,405 INFO ]: TraceAbstraction took 2545.30 ms. Allocated memory was 308.8 MB in the beginning and 327.2 MB in the end (delta: 18.4 MB). Free memory was 237.1 MB in the beginning and 244.0 MB in the end (delta: -6.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:29:06,409 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 70.67 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 255.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 58.02 ms. Allocated memory is still 308.8 MB. Free memory was 255.2 MB in the beginning and 254.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 471.53 ms. Allocated memory is still 308.8 MB. Free memory was 254.2 MB in the beginning and 237.1 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2545.30 ms. Allocated memory was 308.8 MB in the beginning and 327.2 MB in the end (delta: 18.4 MB). Free memory was 237.1 MB in the beginning and 244.0 MB in the end (delta: -6.9 MB). Peak memory consumption was 11.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, 13 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 4 SDslu, 173 SDs, 0 SdLazy, 105 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=7, 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, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 1650 SizeOfPredicates, 8 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 17/23 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/018-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-29-06-425.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/018-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-29-06-425.csv Received shutdown request...