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/llreve/square_twice_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:15:11,434 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:15:11,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:15:11,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:15:11,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:15:11,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:15:11,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:15:11,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:15:11,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:15:11,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:15:11,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:15:11,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:15:11,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:15:11,459 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:15:11,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:15:11,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:15:11,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:15:11,466 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:15:11,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:15:11,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:15:11,471 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:15:11,474 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:15:11,474 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:15:11,474 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:15:11,475 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:15:11,476 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:15:11,476 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:15:11,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:15:11,478 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:15:11,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:15:11,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:15:11,480 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:15:11,480 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:15:11,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:15:11,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:15:11,482 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:15:11,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:15:11,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:15:11,495 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:15:11,496 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:15:11,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:15:11,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:15:11,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:15:11,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:15:11,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:15:11,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:15:11,498 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:15:11,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:15:11,498 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:15:11,498 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:15:11,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:15:11,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:15:11,499 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:15:11,500 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:15:11,500 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:15:11,537 INFO ]: Repository-Root is: /tmp [2018-06-22 01:15:11,553 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:15:11,560 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:15:11,562 INFO ]: Initializing SmtParser... [2018-06-22 01:15:11,562 INFO ]: SmtParser initialized [2018-06-22 01:15:11,563 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 [2018-06-22 01:15:11,564 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:15:11,657 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 unknown [2018-06-22 01:15:11,815 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 [2018-06-22 01:15:11,820 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:15:11,828 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:15:11,828 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:15:11,828 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:15:11,831 INFO ]: ChcToBoogie initialized [2018-06-22 01:15:11,834 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:15:11" (1/1) ... [2018-06-22 01:15:11,890 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:11 Unit [2018-06-22 01:15:11,890 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:15:11,891 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:15:11,891 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:15:11,891 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:15:11,912 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:11" (1/1) ... [2018-06-22 01:15:11,912 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:11" (1/1) ... [2018-06-22 01:15:11,918 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:11" (1/1) ... [2018-06-22 01:15:11,918 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:11" (1/1) ... [2018-06-22 01:15:11,921 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:11" (1/1) ... [2018-06-22 01:15:11,923 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:11" (1/1) ... [2018-06-22 01:15:11,925 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:11" (1/1) ... [2018-06-22 01:15:11,927 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:15:11,927 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:15:11,927 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:15:11,927 INFO ]: RCFGBuilder initialized [2018-06-22 01:15:11,928 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:11" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:15:11,948 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:15:11,948 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:15:11,948 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:15:11,949 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:15:11,949 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:15:11,949 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:15:12,232 INFO ]: Using library mode [2018-06-22 01:15:12,232 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:15:12 BoogieIcfgContainer [2018-06-22 01:15:12,233 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:15:12,236 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:15:12,236 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:15:12,239 INFO ]: TraceAbstraction initialized [2018-06-22 01:15:12,239 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:15:11" (1/3) ... [2018-06-22 01:15:12,240 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dec71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:15:12, skipping insertion in model container [2018-06-22 01:15:12,240 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:15:11" (2/3) ... [2018-06-22 01:15:12,241 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dec71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:15:12, skipping insertion in model container [2018-06-22 01:15:12,241 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:15:12" (3/3) ... [2018-06-22 01:15:12,242 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:15:12,252 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:15:12,260 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:15:12,306 INFO ]: Using default assertion order modulation [2018-06-22 01:15:12,306 INFO ]: Interprodecural is true [2018-06-22 01:15:12,306 INFO ]: Hoare is false [2018-06-22 01:15:12,306 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:15:12,306 INFO ]: Backedges is TWOTRACK [2018-06-22 01:15:12,306 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:15:12,306 INFO ]: Difference is false [2018-06-22 01:15:12,306 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:15:12,306 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:15:12,318 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:15:12,326 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:15:12,327 INFO ]: Found error trace [2018-06-22 01:15:12,327 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:12,328 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:12,333 INFO ]: Analyzing trace with hash 823673744, now seen corresponding path program 1 times [2018-06-22 01:15:12,334 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:12,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:12,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:12,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:12,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:12,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:12,523 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:15:12,524 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:15:12,525 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:15:12,526 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:15:12,540 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:15:12,540 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:15:12,543 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-22 01:15:12,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:12,676 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-22 01:15:12,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:15:12,677 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 01:15:12,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:12,689 INFO ]: With dead ends: 19 [2018-06-22 01:15:12,689 INFO ]: Without dead ends: 19 [2018-06-22 01:15:12,691 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:15:12,708 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:15:12,729 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-22 01:15:12,730 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:15:12,731 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-22 01:15:12,733 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 10 [2018-06-22 01:15:12,734 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:12,734 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-22 01:15:12,734 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:15:12,734 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-22 01:15:12,734 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:15:12,734 INFO ]: Found error trace [2018-06-22 01:15:12,734 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:12,735 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:12,735 INFO ]: Analyzing trace with hash 538571526, now seen corresponding path program 1 times [2018-06-22 01:15:12,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:12,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:12,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:12,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:12,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:12,755 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:12,841 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:15:12,841 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:15:12,841 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:15:12,843 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:15:12,843 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:15:12,843 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:15:12,843 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 3 states. [2018-06-22 01:15:12,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:12,954 INFO ]: Finished difference Result 15 states and 25 transitions. [2018-06-22 01:15:12,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:15:12,955 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-22 01:15:12,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:12,956 INFO ]: With dead ends: 15 [2018-06-22 01:15:12,956 INFO ]: Without dead ends: 15 [2018-06-22 01:15:12,957 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:15:12,957 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:15:12,958 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-22 01:15:12,959 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:15:12,959 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-22 01:15:12,959 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 10 [2018-06-22 01:15:12,959 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:12,959 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-22 01:15:12,959 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:15:12,959 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-22 01:15:12,961 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:15:12,961 INFO ]: Found error trace [2018-06-22 01:15:12,961 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:12,962 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:12,962 INFO ]: Analyzing trace with hash -987566592, now seen corresponding path program 1 times [2018-06-22 01:15:12,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:12,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:12,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:12,963 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:12,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:12,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:13,157 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:13,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:15:13,158 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:15:13,158 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:15:13,158 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:15:13,158 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:15:13,158 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 4 states. [2018-06-22 01:15:13,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:13,342 INFO ]: Finished difference Result 30 states and 43 transitions. [2018-06-22 01:15:13,343 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:15:13,343 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-22 01:15:13,343 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:13,344 INFO ]: With dead ends: 30 [2018-06-22 01:15:13,344 INFO ]: Without dead ends: 30 [2018-06-22 01:15:13,344 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:15:13,344 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:15:13,348 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-06-22 01:15:13,349 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:15:13,349 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2018-06-22 01:15:13,349 INFO ]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 12 [2018-06-22 01:15:13,349 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:13,350 INFO ]: Abstraction has 19 states and 29 transitions. [2018-06-22 01:15:13,350 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:15:13,350 INFO ]: Start isEmpty. Operand 19 states and 29 transitions. [2018-06-22 01:15:13,350 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:15:13,350 INFO ]: Found error trace [2018-06-22 01:15:13,350 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:13,350 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:13,350 INFO ]: Analyzing trace with hash 1532393342, now seen corresponding path program 1 times [2018-06-22 01:15:13,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:13,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:13,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:13,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:13,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:13,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:13,533 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:13,533 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:15:13,533 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:15:13,533 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:15:13,533 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:15:13,533 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:15:13,534 INFO ]: Start difference. First operand 19 states and 29 transitions. Second operand 4 states. [2018-06-22 01:15:13,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:13,641 INFO ]: Finished difference Result 26 states and 41 transitions. [2018-06-22 01:15:13,641 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:15:13,641 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-22 01:15:13,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:13,642 INFO ]: With dead ends: 26 [2018-06-22 01:15:13,642 INFO ]: Without dead ends: 26 [2018-06-22 01:15:13,642 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:15:13,642 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:15:13,645 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-06-22 01:15:13,645 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:15:13,646 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-06-22 01:15:13,646 INFO ]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 12 [2018-06-22 01:15:13,646 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:13,646 INFO ]: Abstraction has 20 states and 30 transitions. [2018-06-22 01:15:13,646 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:15:13,646 INFO ]: Start isEmpty. Operand 20 states and 30 transitions. [2018-06-22 01:15:13,647 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:15:13,647 INFO ]: Found error trace [2018-06-22 01:15:13,647 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:13,647 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:13,647 INFO ]: Analyzing trace with hash 372550148, now seen corresponding path program 1 times [2018-06-22 01:15:13,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:13,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:13,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:13,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:13,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:13,665 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:13,769 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:13,769 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:15:13,769 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:15:13,769 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:15:13,769 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:15:13,770 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:15:13,770 INFO ]: Start difference. First operand 20 states and 30 transitions. Second operand 4 states. [2018-06-22 01:15:14,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:14,147 INFO ]: Finished difference Result 28 states and 36 transitions. [2018-06-22 01:15:14,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:15:14,149 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-22 01:15:14,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:14,150 INFO ]: With dead ends: 28 [2018-06-22 01:15:14,150 INFO ]: Without dead ends: 25 [2018-06-22 01:15:14,150 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:15:14,150 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:15:14,152 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-22 01:15:14,152 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:15:14,153 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-06-22 01:15:14,153 INFO ]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 12 [2018-06-22 01:15:14,153 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:14,153 INFO ]: Abstraction has 18 states and 23 transitions. [2018-06-22 01:15:14,153 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:15:14,153 INFO ]: Start isEmpty. Operand 18 states and 23 transitions. [2018-06-22 01:15:14,154 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:15:14,154 INFO ]: Found error trace [2018-06-22 01:15:14,154 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:14,155 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:14,155 INFO ]: Analyzing trace with hash 200412602, now seen corresponding path program 1 times [2018-06-22 01:15:14,155 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:14,155 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:14,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:14,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:14,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:14,188 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:14,379 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:14,379 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:14,379 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-22 01:15:14,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:14,428 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:14,436 INFO ]: Computing forward predicates... [2018-06-22 01:15:14,546 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:14,578 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:14,578 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-06-22 01:15:14,579 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:15:14,579 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:15:14,579 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:15:14,579 INFO ]: Start difference. First operand 18 states and 23 transitions. Second operand 10 states. [2018-06-22 01:15:14,914 WARN ]: Spent 176.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-22 01:15:15,186 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:15:16,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:16,029 INFO ]: Finished difference Result 30 states and 38 transitions. [2018-06-22 01:15:16,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:15:16,030 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 01:15:16,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:16,030 INFO ]: With dead ends: 30 [2018-06-22 01:15:16,030 INFO ]: Without dead ends: 30 [2018-06-22 01:15:16,031 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:15:16,031 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:15:16,033 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-06-22 01:15:16,033 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:15:16,034 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-22 01:15:16,034 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 13 [2018-06-22 01:15:16,034 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:16,034 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-22 01:15:16,034 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:15:16,034 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-22 01:15:16,034 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:15:16,034 INFO ]: Found error trace [2018-06-22 01:15:16,034 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:16,034 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:16,034 INFO ]: Analyzing trace with hash -585641418, now seen corresponding path program 1 times [2018-06-22 01:15:16,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:16,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:16,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:16,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:16,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:16,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:16,123 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:16,123 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:16,123 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:15:16,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:16,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:16,167 INFO ]: Computing forward predicates... [2018-06-22 01:15:16,214 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:15:16,233 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:16,233 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-06-22 01:15:16,233 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:15:16,233 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:15:16,233 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:15:16,233 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 10 states. [2018-06-22 01:15:16,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:16,531 INFO ]: Finished difference Result 25 states and 31 transitions. [2018-06-22 01:15:16,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:15:16,532 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 01:15:16,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:16,532 INFO ]: With dead ends: 25 [2018-06-22 01:15:16,532 INFO ]: Without dead ends: 25 [2018-06-22 01:15:16,533 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:15:16,533 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:15:16,535 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-06-22 01:15:16,535 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:15:16,535 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-06-22 01:15:16,536 INFO ]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2018-06-22 01:15:16,536 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:16,536 INFO ]: Abstraction has 20 states and 25 transitions. [2018-06-22 01:15:16,536 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:15:16,536 INFO ]: Start isEmpty. Operand 20 states and 25 transitions. [2018-06-22 01:15:16,536 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:15:16,536 INFO ]: Found error trace [2018-06-22 01:15:16,536 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:16,536 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:16,536 INFO ]: Analyzing trace with hash -155269258, now seen corresponding path program 2 times [2018-06-22 01:15:16,536 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:16,536 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:16,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:16,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:15:16,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:16,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:16,620 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 01:15:16,620 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:16,620 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:15:16,626 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:16,646 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:16,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:16,648 INFO ]: Computing forward predicates... [2018-06-22 01:15:16,723 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:16,743 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:16,743 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-22 01:15:16,744 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:15:16,744 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:15:16,744 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:15:16,744 INFO ]: Start difference. First operand 20 states and 25 transitions. Second operand 10 states. [2018-06-22 01:15:16,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:16,990 INFO ]: Finished difference Result 32 states and 39 transitions. [2018-06-22 01:15:16,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:15:16,991 INFO ]: Start accepts. Automaton has 10 states. Word has length 16 [2018-06-22 01:15:16,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:16,991 INFO ]: With dead ends: 32 [2018-06-22 01:15:16,991 INFO ]: Without dead ends: 18 [2018-06-22 01:15:16,992 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:15:16,992 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:15:16,993 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:15:16,993 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:15:16,994 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-06-22 01:15:16,994 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 16 [2018-06-22 01:15:16,994 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:16,994 INFO ]: Abstraction has 18 states and 21 transitions. [2018-06-22 01:15:16,994 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:15:16,994 INFO ]: Start isEmpty. Operand 18 states and 21 transitions. [2018-06-22 01:15:16,994 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:15:16,994 INFO ]: Found error trace [2018-06-22 01:15:16,994 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:16,994 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:16,995 INFO ]: Analyzing trace with hash -1328881286, now seen corresponding path program 2 times [2018-06-22 01:15:16,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:16,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:16,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:16,995 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:16,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:17,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:17,294 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:17,294 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:17,294 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:17,300 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:15:17,317 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:15:17,317 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:17,320 INFO ]: Computing forward predicates... [2018-06-22 01:15:17,480 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:15:17,500 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:17,500 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-06-22 01:15:17,500 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:15:17,500 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:15:17,500 INFO ]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:15:17,501 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 15 states. [2018-06-22 01:15:18,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:18,140 INFO ]: Finished difference Result 28 states and 33 transitions. [2018-06-22 01:15:18,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:15:18,140 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-22 01:15:18,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:18,141 INFO ]: With dead ends: 28 [2018-06-22 01:15:18,141 INFO ]: Without dead ends: 28 [2018-06-22 01:15:18,142 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:15:18,142 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:15:18,143 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 21. [2018-06-22 01:15:18,143 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:15:18,144 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-06-22 01:15:18,144 INFO ]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2018-06-22 01:15:18,144 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:18,144 INFO ]: Abstraction has 21 states and 24 transitions. [2018-06-22 01:15:18,144 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:15:18,144 INFO ]: Start isEmpty. Operand 21 states and 24 transitions. [2018-06-22 01:15:18,144 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:15:18,144 INFO ]: Found error trace [2018-06-22 01:15:18,144 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:18,145 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:18,145 INFO ]: Analyzing trace with hash 433010886, now seen corresponding path program 3 times [2018-06-22 01:15:18,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:18,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:18,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:18,145 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:18,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:18,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:18,275 INFO ]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:18,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:18,276 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:15:18,290 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:18,370 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:15:18,370 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:18,373 INFO ]: Computing forward predicates... [2018-06-22 01:15:18,737 INFO ]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:15:18,758 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:18,758 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-22 01:15:18,759 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:15:18,759 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:15:18,759 INFO ]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:15:18,759 INFO ]: Start difference. First operand 21 states and 24 transitions. Second operand 18 states. [2018-06-22 01:15:19,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:19,022 INFO ]: Finished difference Result 34 states and 40 transitions. [2018-06-22 01:15:19,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:15:19,022 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-22 01:15:19,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:19,023 INFO ]: With dead ends: 34 [2018-06-22 01:15:19,023 INFO ]: Without dead ends: 34 [2018-06-22 01:15:19,023 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:15:19,023 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:15:19,025 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 22. [2018-06-22 01:15:19,025 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:15:19,026 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-06-22 01:15:19,026 INFO ]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2018-06-22 01:15:19,026 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:19,026 INFO ]: Abstraction has 22 states and 25 transitions. [2018-06-22 01:15:19,026 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:15:19,026 INFO ]: Start isEmpty. Operand 22 states and 25 transitions. [2018-06-22 01:15:19,026 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:15:19,026 INFO ]: Found error trace [2018-06-22 01:15:19,026 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:15:19,027 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:15:19,027 INFO ]: Analyzing trace with hash 479294834, now seen corresponding path program 4 times [2018-06-22 01:15:19,027 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:15:19,027 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:15:19,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:19,027 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:15:19,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:15:19,042 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:19,110 INFO ]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 01:15:19,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:15:19,110 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:15:19,117 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:15:19,152 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:15:19,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:15:19,155 INFO ]: Computing forward predicates... [2018-06-22 01:15:19,301 INFO ]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:15:19,320 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:15:19,320 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2018-06-22 01:15:19,321 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:15:19,321 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:15:19,321 INFO ]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:15:19,321 INFO ]: Start difference. First operand 22 states and 25 transitions. Second operand 12 states. [2018-06-22 01:15:19,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:15:19,676 INFO ]: Finished difference Result 27 states and 32 transitions. [2018-06-22 01:15:19,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:15:19,676 INFO ]: Start accepts. Automaton has 12 states. Word has length 20 [2018-06-22 01:15:19,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:15:19,677 INFO ]: With dead ends: 27 [2018-06-22 01:15:19,677 INFO ]: Without dead ends: 0 [2018-06-22 01:15:19,677 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=646, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:15:19,677 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:15:19,677 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:15:19,677 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:15:19,677 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:15:19,677 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-06-22 01:15:19,678 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:15:19,678 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:15:19,678 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:15:19,678 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:15:19,678 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:15:19,682 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:15:19 BoogieIcfgContainer [2018-06-22 01:15:19,682 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:15:19,683 INFO ]: Toolchain (without parser) took 7862.08 ms. Allocated memory was 308.3 MB in the beginning and 360.2 MB in the end (delta: 51.9 MB). Free memory was 263.7 MB in the beginning and 189.7 MB in the end (delta: 73.9 MB). Peak memory consumption was 125.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:19,683 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:15:19,684 INFO ]: ChcToBoogie took 62.25 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:19,684 INFO ]: Boogie Preprocessor took 35.76 ms. Allocated memory is still 308.3 MB. Free memory was 261.7 MB in the beginning and 260.7 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:15:19,685 INFO ]: RCFGBuilder took 305.28 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 250.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:19,685 INFO ]: TraceAbstraction took 7445.99 ms. Allocated memory was 308.3 MB in the beginning and 360.2 MB in the end (delta: 51.9 MB). Free memory was 250.7 MB in the beginning and 189.7 MB in the end (delta: 60.9 MB). Peak memory consumption was 112.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:15:19,688 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.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.25 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.76 ms. Allocated memory is still 308.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 305.28 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 250.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7445.99 ms. Allocated memory was 308.3 MB in the beginning and 360.2 MB in the end (delta: 51.9 MB). Free memory was 250.7 MB in the beginning and 189.7 MB in the end (delta: 60.9 MB). Peak memory consumption was 112.8 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, 7.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 155 SDtfs, 134 SDslu, 425 SDs, 0 SdLazy, 567 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 64 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 8866 SizeOfPredicates, 66 NumberOfNonLiveVariables, 929 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 86/134 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/square_twice_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-15-19-698.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-15-19-698.csv Received shutdown request...