java -Xss4m -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/llreve-bench/smt2/loop__loop_unswitching.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:54:19,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:54:19,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:54:19,246 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:54:19,246 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:54:19,247 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:54:19,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:54:19,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:54:19,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:54:19,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:54:19,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:54:19,259 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:54:19,259 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:54:19,261 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:54:19,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:54:19,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:54:19,264 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:54:19,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:54:19,268 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:54:19,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:54:19,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:54:19,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:54:19,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:54:19,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:54:19,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:54:19,275 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:54:19,276 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:54:19,277 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:54:19,278 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:54:19,278 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:54:19,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:54:19,279 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:54:19,279 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:54:19,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:54:19,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:54:19,281 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:54:19,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:54:19,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:54:19,296 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:54:19,296 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:54:19,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:54:19,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:54:19,297 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:54:19,297 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:54:19,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:54:19,298 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:54:19,298 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:54:19,298 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:54:19,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:54:19,299 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:54:19,299 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:54:19,299 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:54:19,299 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:54:19,300 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:54:19,300 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:54:19,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:54:19,300 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:54:19,304 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:54:19,304 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:54:19,346 INFO ]: Repository-Root is: /tmp [2018-06-25 09:54:19,363 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:54:19,368 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:54:19,369 INFO ]: Initializing SmtParser... [2018-06-25 09:54:19,369 INFO ]: SmtParser initialized [2018-06-25 09:54:19,370 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__loop_unswitching.smt2 [2018-06-25 09:54:19,371 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-25 09:54:19,466 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__loop_unswitching.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3859e430 [2018-06-25 09:54:19,689 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__loop_unswitching.smt2 [2018-06-25 09:54:19,698 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:54:19,704 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:54:19,704 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:54:19,705 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:54:19,705 INFO ]: ChcToBoogie initialized [2018-06-25 09:54:19,711 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:54:19" (1/1) ... [2018-06-25 09:54:19,771 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:19 Unit [2018-06-25 09:54:19,771 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:54:19,772 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:54:19,772 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:54:19,772 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:54:19,787 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:19" (1/1) ... [2018-06-25 09:54:19,787 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:19" (1/1) ... [2018-06-25 09:54:19,791 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:19" (1/1) ... [2018-06-25 09:54:19,791 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:19" (1/1) ... [2018-06-25 09:54:19,794 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:19" (1/1) ... [2018-06-25 09:54:19,796 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:19" (1/1) ... [2018-06-25 09:54:19,797 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:19" (1/1) ... [2018-06-25 09:54:19,799 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:54:19,799 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:54:19,799 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:54:19,800 INFO ]: RCFGBuilder initialized [2018-06-25 09:54:19,800 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:19" (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-25 09:54:19,811 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:54:19,811 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:54:19,811 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:54:19,811 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:54:19,811 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:54:19,811 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-25 09:54:20,118 INFO ]: Using library mode [2018-06-25 09:54:20,119 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:54:20 BoogieIcfgContainer [2018-06-25 09:54:20,119 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:54:20,120 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:54:20,120 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:54:20,132 INFO ]: TraceAbstraction initialized [2018-06-25 09:54:20,133 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:54:19" (1/3) ... [2018-06-25 09:54:20,133 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3914f4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:54:20, skipping insertion in model container [2018-06-25 09:54:20,133 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:19" (2/3) ... [2018-06-25 09:54:20,134 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3914f4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:54:20, skipping insertion in model container [2018-06-25 09:54:20,134 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:54:20" (3/3) ... [2018-06-25 09:54:20,135 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:54:20,158 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:54:20,172 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:54:20,226 INFO ]: Using default assertion order modulation [2018-06-25 09:54:20,227 INFO ]: Interprodecural is true [2018-06-25 09:54:20,227 INFO ]: Hoare is false [2018-06-25 09:54:20,227 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:54:20,227 INFO ]: Backedges is TWOTRACK [2018-06-25 09:54:20,227 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:54:20,227 INFO ]: Difference is false [2018-06-25 09:54:20,227 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:54:20,227 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:54:20,243 INFO ]: Start isEmpty. Operand 11 states. [2018-06-25 09:54:20,254 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:54:20,254 INFO ]: Found error trace [2018-06-25 09:54:20,255 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:20,255 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:20,259 INFO ]: Analyzing trace with hash 1999979798, now seen corresponding path program 1 times [2018-06-25 09:54:20,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:20,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:20,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:20,292 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:20,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:20,323 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:20,372 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:54:20,374 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:20,374 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:54:20,375 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:54:20,387 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:54:20,387 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:54:20,391 INFO ]: Start difference. First operand 11 states. Second operand 3 states. [2018-06-25 09:54:20,452 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:20,452 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-25 09:54:20,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:54:20,454 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:54:20,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:20,461 INFO ]: With dead ends: 10 [2018-06-25 09:54:20,461 INFO ]: Without dead ends: 10 [2018-06-25 09:54:20,463 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-25 09:54:20,480 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:54:20,497 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:54:20,498 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:54:20,499 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-25 09:54:20,500 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 7 [2018-06-25 09:54:20,500 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:20,500 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-25 09:54:20,500 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:54:20,500 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-25 09:54:20,501 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:54:20,501 INFO ]: Found error trace [2018-06-25 09:54:20,501 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:20,501 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:20,502 INFO ]: Analyzing trace with hash 2001975795, now seen corresponding path program 1 times [2018-06-25 09:54:20,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:20,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:20,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:20,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:20,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:20,514 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:20,589 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:54:20,589 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:20,589 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:54:20,590 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:54:20,591 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:54:20,591 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:54:20,591 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2018-06-25 09:54:20,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:20,705 INFO ]: Finished difference Result 11 states and 21 transitions. [2018-06-25 09:54:20,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:54:20,705 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:54:20,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:20,706 INFO ]: With dead ends: 11 [2018-06-25 09:54:20,706 INFO ]: Without dead ends: 11 [2018-06-25 09:54:20,706 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-25 09:54:20,707 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:54:20,708 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:54:20,708 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:54:20,709 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-06-25 09:54:20,709 INFO ]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 7 [2018-06-25 09:54:20,709 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:20,709 INFO ]: Abstraction has 11 states and 21 transitions. [2018-06-25 09:54:20,709 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:54:20,710 INFO ]: Start isEmpty. Operand 11 states and 21 transitions. [2018-06-25 09:54:20,710 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:54:20,710 INFO ]: Found error trace [2018-06-25 09:54:20,710 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:20,710 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:20,710 INFO ]: Analyzing trace with hash 1870272853, now seen corresponding path program 1 times [2018-06-25 09:54:20,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:20,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:20,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:20,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:20,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:20,730 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:20,807 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:54:20,807 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:20,807 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:54:20,807 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:54:20,807 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:54:20,807 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:54:20,807 INFO ]: Start difference. First operand 11 states and 21 transitions. Second operand 3 states. [2018-06-25 09:54:20,912 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:20,912 INFO ]: Finished difference Result 12 states and 24 transitions. [2018-06-25 09:54:20,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:54:20,913 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:54:20,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:20,914 INFO ]: With dead ends: 12 [2018-06-25 09:54:20,914 INFO ]: Without dead ends: 11 [2018-06-25 09:54:20,914 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-25 09:54:20,914 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:54:20,915 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:54:20,916 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:54:20,916 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-25 09:54:20,916 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-25 09:54:20,916 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:20,916 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-25 09:54:20,916 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:54:20,916 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-25 09:54:20,917 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:54:20,917 INFO ]: Found error trace [2018-06-25 09:54:20,917 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:20,918 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:20,918 INFO ]: Analyzing trace with hash 1861961164, now seen corresponding path program 1 times [2018-06-25 09:54:20,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:20,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:20,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:20,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:20,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:20,952 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:21,059 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:54:21,059 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:54:21,059 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:54:21,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:21,108 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:21,116 INFO ]: Computing forward predicates... [2018-06-25 09:54:21,276 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:54:21,309 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:54:21,309 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:54:21,309 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:54:21,310 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:54:21,310 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:54:21,310 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 4 states. [2018-06-25 09:54:21,349 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:21,349 INFO ]: Finished difference Result 11 states and 16 transitions. [2018-06-25 09:54:21,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:54:21,350 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:54:21,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:21,350 INFO ]: With dead ends: 11 [2018-06-25 09:54:21,350 INFO ]: Without dead ends: 9 [2018-06-25 09:54:21,351 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:54:21,351 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:54:21,352 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:54:21,352 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:54:21,353 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:54:21,353 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 8 [2018-06-25 09:54:21,353 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:21,353 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:54:21,353 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:54:21,353 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:54:21,353 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:54:21,353 INFO ]: Found error trace [2018-06-25 09:54:21,353 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:21,353 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:21,353 INFO ]: Analyzing trace with hash 1939685883, now seen corresponding path program 1 times [2018-06-25 09:54:21,353 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:21,353 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:21,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:21,354 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:21,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:21,368 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:21,402 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:54:21,402 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:21,402 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:54:21,402 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:54:21,402 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:54:21,402 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:54:21,402 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-25 09:54:21,452 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:21,452 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-25 09:54:21,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:54:21,453 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:54:21,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:21,453 INFO ]: With dead ends: 10 [2018-06-25 09:54:21,453 INFO ]: Without dead ends: 9 [2018-06-25 09:54:21,454 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-25 09:54:21,454 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:54:21,455 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:54:21,455 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:54:21,455 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-25 09:54:21,455 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2018-06-25 09:54:21,455 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:21,455 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-25 09:54:21,455 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:54:21,455 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-25 09:54:21,456 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:54:21,456 INFO ]: Found error trace [2018-06-25 09:54:21,456 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:21,456 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:21,456 INFO ]: Analyzing trace with hash 1934144757, now seen corresponding path program 1 times [2018-06-25 09:54:21,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:21,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:21,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:21,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:21,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:21,474 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:21,540 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:54:21,540 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:54:21,540 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-25 09:54:21,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:21,567 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:21,569 INFO ]: Computing forward predicates... [2018-06-25 09:54:21,612 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:54:21,632 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:54:21,632 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:54:21,632 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:54:21,632 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:54:21,632 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:54:21,633 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-06-25 09:54:21,642 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:21,642 INFO ]: Finished difference Result 5 states and 5 transitions. [2018-06-25 09:54:21,643 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:54:21,643 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:54:21,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:21,643 INFO ]: With dead ends: 5 [2018-06-25 09:54:21,643 INFO ]: Without dead ends: 0 [2018-06-25 09:54:21,643 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:54:21,643 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:54:21,643 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:54:21,643 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:54:21,643 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:54:21,643 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2018-06-25 09:54:21,644 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:21,644 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:54:21,644 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:54:21,644 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:54:21,644 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:54:21,649 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:54:21 BoogieIcfgContainer [2018-06-25 09:54:21,649 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:54:21,650 INFO ]: Toolchain (without parser) took 1951.61 ms. Allocated memory is still 303.6 MB. Free memory was 259.1 MB in the beginning and 196.4 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:54:21,651 INFO ]: SmtParser took 0.08 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-25 09:54:21,652 INFO ]: ChcToBoogie took 66.90 ms. Allocated memory is still 303.6 MB. Free memory was 259.1 MB in the beginning and 257.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:54:21,652 INFO ]: Boogie Preprocessor took 27.17 ms. Allocated memory is still 303.6 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:54:21,653 INFO ]: RCFGBuilder took 319.65 ms. Allocated memory is still 303.6 MB. Free memory was 255.1 MB in the beginning and 246.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:54:21,654 INFO ]: TraceAbstraction took 1528.55 ms. Allocated memory is still 303.6 MB. Free memory was 245.1 MB in the beginning and 196.4 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:54:21,659 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 303.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.90 ms. Allocated memory is still 303.6 MB. Free memory was 259.1 MB in the beginning and 257.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 27.17 ms. Allocated memory is still 303.6 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 319.65 ms. Allocated memory is still 303.6 MB. Free memory was 255.1 MB in the beginning and 246.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 1528.55 ms. Allocated memory is still 303.6 MB. Free memory was 245.1 MB in the beginning and 196.4 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 locations, 1 error locations. SAFE Result, 1.4s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 0 SDslu, 59 SDs, 0 SdLazy, 30 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 780 SizeOfPredicates, 8 NumberOfNonLiveVariables, 126 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 2/6 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/loop__loop_unswitching.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-54-21-676.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__loop_unswitching.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-54-21-676.csv Received shutdown request...