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/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:55:04,548 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:55:04,551 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:55:04,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:55:04,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:55:04,567 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:55:04,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:55:04,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:55:04,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:55:04,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:55:04,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:55:04,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:55:04,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:55:04,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:55:04,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:55:04,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:55:04,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:55:04,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:55:04,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:55:04,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:55:04,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:55:04,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:55:04,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:55:04,602 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:55:04,603 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:55:04,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:55:04,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:55:04,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:55:04,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:55:04,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:55:04,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:55:04,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:55:04,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:55:04,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:55:04,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:55:04,616 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 08:55:04,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:55:04,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:55:04,630 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:55:04,633 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:55:04,634 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:55:04,635 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:55:04,635 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:55:04,635 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:55:04,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:55:04,635 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:55:04,636 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:55:04,636 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:55:04,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:55:04,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:55:04,636 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:55:04,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:55:04,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:55:04,637 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:55:04,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:55:04,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:55:04,637 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:55:04,643 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:55:04,643 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:55:04,699 INFO ]: Repository-Root is: /tmp [2018-06-25 08:55:04,714 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:55:04,718 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:55:04,719 INFO ]: Initializing SmtParser... [2018-06-25 08:55:04,719 INFO ]: SmtParser initialized [2018-06-25 08:55:04,720 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 [2018-06-25 08:55:04,721 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 08:55:04,814 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 unknown [2018-06-25 08:55:04,971 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 [2018-06-25 08:55:04,980 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:55:04,984 INFO ]: Walking toolchain with 4 elements. [2018-06-25 08:55:04,985 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:55:04,985 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:55:04,985 INFO ]: ChcToBoogie initialized [2018-06-25 08:55:04,988 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:55:04" (1/1) ... [2018-06-25 08:55:05,045 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:55:05 Unit [2018-06-25 08:55:05,046 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:55:05,046 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:55:05,046 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:55:05,046 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:55:05,068 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:55:05" (1/1) ... [2018-06-25 08:55:05,068 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:55:05" (1/1) ... [2018-06-25 08:55:05,075 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:55:05" (1/1) ... [2018-06-25 08:55:05,076 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:55:05" (1/1) ... [2018-06-25 08:55:05,079 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:55:05" (1/1) ... [2018-06-25 08:55:05,081 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:55:05" (1/1) ... [2018-06-25 08:55:05,083 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:55:05" (1/1) ... [2018-06-25 08:55:05,084 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:55:05,084 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:55:05,084 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:55:05,084 INFO ]: RCFGBuilder initialized [2018-06-25 08:55:05,085 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:55:05" (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 08:55:05,099 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:55:05,100 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:55:05,100 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:55:05,100 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:55:05,100 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:55:05,100 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 08:55:05,436 INFO ]: Using library mode [2018-06-25 08:55:05,436 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:55:05 BoogieIcfgContainer [2018-06-25 08:55:05,436 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:55:05,438 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:55:05,438 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:55:05,441 INFO ]: TraceAbstraction initialized [2018-06-25 08:55:05,441 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:55:04" (1/3) ... [2018-06-25 08:55:05,442 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52eebfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:55:05, skipping insertion in model container [2018-06-25 08:55:05,442 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:55:05" (2/3) ... [2018-06-25 08:55:05,442 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52eebfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:55:05, skipping insertion in model container [2018-06-25 08:55:05,442 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:55:05" (3/3) ... [2018-06-25 08:55:05,445 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 08:55:05,454 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:55:05,462 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:55:05,502 INFO ]: Using default assertion order modulation [2018-06-25 08:55:05,502 INFO ]: Interprodecural is true [2018-06-25 08:55:05,502 INFO ]: Hoare is false [2018-06-25 08:55:05,502 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:55:05,502 INFO ]: Backedges is TWOTRACK [2018-06-25 08:55:05,502 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:55:05,502 INFO ]: Difference is false [2018-06-25 08:55:05,502 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:55:05,502 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:55:05,517 INFO ]: Start isEmpty. Operand 14 states. [2018-06-25 08:55:05,532 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:55:05,532 INFO ]: Found error trace [2018-06-25 08:55:05,533 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:55:05,533 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:55:05,537 INFO ]: Analyzing trace with hash 1878860966, now seen corresponding path program 1 times [2018-06-25 08:55:05,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:55:05,539 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:55:05,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:05,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:55:05,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:05,609 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:05,731 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:55:05,733 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:55:05,734 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:55:05,735 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:55:05,749 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:55:05,750 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:55:05,752 INFO ]: Start difference. First operand 14 states. Second operand 5 states. [2018-06-25 08:55:05,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:55:05,890 INFO ]: Finished difference Result 19 states and 24 transitions. [2018-06-25 08:55:05,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:55:05,891 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 08:55:05,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:55:05,899 INFO ]: With dead ends: 19 [2018-06-25 08:55:05,899 INFO ]: Without dead ends: 19 [2018-06-25 08:55:05,902 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:55:05,916 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 08:55:05,935 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-25 08:55:05,936 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 08:55:05,938 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-25 08:55:05,940 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-25 08:55:05,940 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:55:05,940 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-25 08:55:05,940 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:55:05,940 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-25 08:55:05,940 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 08:55:05,940 INFO ]: Found error trace [2018-06-25 08:55:05,940 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:55:05,941 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:55:05,941 INFO ]: Analyzing trace with hash 2071160840, now seen corresponding path program 1 times [2018-06-25 08:55:05,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:55:05,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:55:05,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:05,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:55:05,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:05,959 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:06,044 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:55:06,044 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:55:06,044 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:55:06,045 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:55:06,046 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:55:06,046 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:55:06,046 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 5 states. [2018-06-25 08:55:06,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:55:06,454 INFO ]: Finished difference Result 21 states and 27 transitions. [2018-06-25 08:55:06,455 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:55:06,455 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-25 08:55:06,455 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:55:06,456 INFO ]: With dead ends: 21 [2018-06-25 08:55:06,456 INFO ]: Without dead ends: 20 [2018-06-25 08:55:06,456 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:55:06,457 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 08:55:06,458 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-06-25 08:55:06,459 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 08:55:06,460 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-25 08:55:06,460 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 12 [2018-06-25 08:55:06,460 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:55:06,460 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-25 08:55:06,460 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:55:06,460 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-25 08:55:06,461 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 08:55:06,461 INFO ]: Found error trace [2018-06-25 08:55:06,461 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:55:06,461 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:55:06,461 INFO ]: Analyzing trace with hash 516861642, now seen corresponding path program 1 times [2018-06-25 08:55:06,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:55:06,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:55:06,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:06,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:55:06,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:06,476 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:06,555 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:55:06,555 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:55:06,555 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 08:55:06,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:55:06,587 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:06,594 INFO ]: Computing forward predicates... [2018-06-25 08:55:06,755 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:55:06,791 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 08:55:06,791 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-06-25 08:55:06,791 INFO ]: Interpolant automaton has 8 states [2018-06-25 08:55:06,792 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 08:55:06,792 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 08:55:06,792 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2018-06-25 08:55:06,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:55:06,916 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-25 08:55:06,917 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 08:55:06,917 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-25 08:55:06,917 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:55:06,917 INFO ]: With dead ends: 17 [2018-06-25 08:55:06,917 INFO ]: Without dead ends: 14 [2018-06-25 08:55:06,918 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:55:06,918 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 08:55:06,920 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 08:55:06,920 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 08:55:06,920 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-25 08:55:06,920 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-25 08:55:06,920 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:55:06,920 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-25 08:55:06,921 INFO ]: Interpolant automaton has 8 states. [2018-06-25 08:55:06,921 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-25 08:55:06,921 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 08:55:06,921 INFO ]: Found error trace [2018-06-25 08:55:06,921 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:55:06,921 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:55:06,921 INFO ]: Analyzing trace with hash -2111776856, now seen corresponding path program 1 times [2018-06-25 08:55:06,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:55:06,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:55:06,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:06,922 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:55:06,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:06,942 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:07,027 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:55:07,027 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:55:07,028 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:55:07,028 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:55:07,028 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:55:07,028 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:55:07,028 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 5 states. [2018-06-25 08:55:07,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:55:07,099 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-25 08:55:07,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:55:07,100 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-25 08:55:07,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:55:07,100 INFO ]: With dead ends: 15 [2018-06-25 08:55:07,100 INFO ]: Without dead ends: 15 [2018-06-25 08:55:07,101 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:55:07,101 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 08:55:07,119 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 08:55:07,119 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:55:07,119 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-25 08:55:07,119 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2018-06-25 08:55:07,119 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:55:07,119 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-25 08:55:07,119 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:55:07,120 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-25 08:55:07,120 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 08:55:07,120 INFO ]: Found error trace [2018-06-25 08:55:07,120 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:55:07,120 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:55:07,120 INFO ]: Analyzing trace with hash -987044284, now seen corresponding path program 1 times [2018-06-25 08:55:07,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:55:07,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:55:07,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:07,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:55:07,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:07,147 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:07,689 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:55:07,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:55:07,689 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 08:55:07,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:55:07,718 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:07,721 INFO ]: Computing forward predicates... [2018-06-25 08:55:07,862 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:55:07,881 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:55:07,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-25 08:55:07,882 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:55:07,882 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:55:07,883 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:55:07,883 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 12 states. [2018-06-25 08:55:08,088 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:55:08,088 INFO ]: Finished difference Result 30 states and 37 transitions. [2018-06-25 08:55:08,088 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 08:55:08,089 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-25 08:55:08,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:55:08,089 INFO ]: With dead ends: 30 [2018-06-25 08:55:08,089 INFO ]: Without dead ends: 30 [2018-06-25 08:55:08,090 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-06-25 08:55:08,090 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 08:55:08,092 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-06-25 08:55:08,092 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 08:55:08,092 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-25 08:55:08,092 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14 [2018-06-25 08:55:08,093 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:55:08,093 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-25 08:55:08,093 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:55:08,093 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-25 08:55:08,093 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 08:55:08,093 INFO ]: Found error trace [2018-06-25 08:55:08,093 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:55:08,093 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:55:08,093 INFO ]: Analyzing trace with hash -1667870814, now seen corresponding path program 2 times [2018-06-25 08:55:08,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:55:08,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:55:08,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:08,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:55:08,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:08,105 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:08,182 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:55:08,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:55:08,183 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-25 08:55:08,195 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:55:08,231 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:55:08,231 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:08,233 INFO ]: Computing forward predicates... [2018-06-25 08:55:08,271 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:55:08,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:55:08,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 08:55:08,291 INFO ]: Interpolant automaton has 9 states [2018-06-25 08:55:08,291 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 08:55:08,291 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 08:55:08,291 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2018-06-25 08:55:08,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:55:08,420 INFO ]: Finished difference Result 26 states and 32 transitions. [2018-06-25 08:55:08,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 08:55:08,421 INFO ]: Start accepts. Automaton has 9 states. Word has length 15 [2018-06-25 08:55:08,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:55:08,421 INFO ]: With dead ends: 26 [2018-06-25 08:55:08,421 INFO ]: Without dead ends: 26 [2018-06-25 08:55:08,422 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:55:08,422 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 08:55:08,424 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-06-25 08:55:08,424 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 08:55:08,424 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-06-25 08:55:08,424 INFO ]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2018-06-25 08:55:08,425 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:55:08,425 INFO ]: Abstraction has 20 states and 25 transitions. [2018-06-25 08:55:08,425 INFO ]: Interpolant automaton has 9 states. [2018-06-25 08:55:08,425 INFO ]: Start isEmpty. Operand 20 states and 25 transitions. [2018-06-25 08:55:08,425 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 08:55:08,425 INFO ]: Found error trace [2018-06-25 08:55:08,425 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:55:08,425 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:55:08,425 INFO ]: Analyzing trace with hash -480072920, now seen corresponding path program 3 times [2018-06-25 08:55:08,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:55:08,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:55:08,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:08,426 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:55:08,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:08,438 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:08,501 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:55:08,501 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:55:08,501 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-25 08:55:08,508 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:55:08,550 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-25 08:55:08,550 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:08,552 INFO ]: Computing forward predicates... [2018-06-25 08:55:08,679 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:55:08,699 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:55:08,699 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-25 08:55:08,699 INFO ]: Interpolant automaton has 10 states [2018-06-25 08:55:08,699 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 08:55:08,699 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:55:08,700 INFO ]: Start difference. First operand 20 states and 25 transitions. Second operand 10 states. [2018-06-25 08:55:08,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:55:08,782 INFO ]: Finished difference Result 28 states and 34 transitions. [2018-06-25 08:55:08,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 08:55:08,782 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-25 08:55:08,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:55:08,783 INFO ]: With dead ends: 28 [2018-06-25 08:55:08,783 INFO ]: Without dead ends: 25 [2018-06-25 08:55:08,783 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-25 08:55:08,783 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 08:55:08,785 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-25 08:55:08,785 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 08:55:08,786 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-06-25 08:55:08,786 INFO ]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2018-06-25 08:55:08,786 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:55:08,786 INFO ]: Abstraction has 22 states and 26 transitions. [2018-06-25 08:55:08,786 INFO ]: Interpolant automaton has 10 states. [2018-06-25 08:55:08,786 INFO ]: Start isEmpty. Operand 22 states and 26 transitions. [2018-06-25 08:55:08,787 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 08:55:08,787 INFO ]: Found error trace [2018-06-25 08:55:08,787 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:55:08,787 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:55:08,787 INFO ]: Analyzing trace with hash -700781084, now seen corresponding path program 4 times [2018-06-25 08:55:08,787 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:55:08,787 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:55:08,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:08,788 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:55:08,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:08,797 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:08,865 INFO ]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:55:08,865 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:55:08,865 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:55:08,871 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:55:08,889 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:55:08,889 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:08,900 INFO ]: Computing forward predicates... [2018-06-25 08:55:08,955 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:55:08,977 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:55:08,977 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-06-25 08:55:08,977 INFO ]: Interpolant automaton has 12 states [2018-06-25 08:55:08,977 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 08:55:08,977 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:55:08,977 INFO ]: Start difference. First operand 22 states and 26 transitions. Second operand 12 states. [2018-06-25 08:55:09,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:55:09,208 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-25 08:55:09,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 08:55:09,209 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-25 08:55:09,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:55:09,209 INFO ]: With dead ends: 22 [2018-06-25 08:55:09,209 INFO ]: Without dead ends: 17 [2018-06-25 08:55:09,210 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-06-25 08:55:09,210 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 08:55:09,211 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 08:55:09,211 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 08:55:09,212 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-25 08:55:09,212 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-06-25 08:55:09,212 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:55:09,212 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-25 08:55:09,212 INFO ]: Interpolant automaton has 12 states. [2018-06-25 08:55:09,212 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-25 08:55:09,212 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 08:55:09,212 INFO ]: Found error trace [2018-06-25 08:55:09,212 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:55:09,212 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:55:09,213 INFO ]: Analyzing trace with hash -110858870, now seen corresponding path program 5 times [2018-06-25 08:55:09,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:55:09,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:55:09,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:09,213 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:55:09,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:09,223 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:09,296 INFO ]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:55:09,296 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:55:09,296 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-25 08:55:09,306 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:55:09,329 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:55:09,329 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:55:09,332 INFO ]: Computing forward predicates... [2018-06-25 08:55:09,398 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 08:55:09,422 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:55:09,422 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-06-25 08:55:09,422 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:55:09,422 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:55:09,423 INFO ]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:55:09,423 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2018-06-25 08:55:09,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:55:09,483 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-25 08:55:09,483 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 08:55:09,483 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-25 08:55:09,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:55:09,483 INFO ]: With dead ends: 21 [2018-06-25 08:55:09,484 INFO ]: Without dead ends: 18 [2018-06-25 08:55:09,484 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-06-25 08:55:09,484 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 08:55:09,485 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 08:55:09,485 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 08:55:09,486 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-25 08:55:09,486 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2018-06-25 08:55:09,486 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:55:09,486 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-25 08:55:09,486 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:55:09,486 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-25 08:55:09,486 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 08:55:09,486 INFO ]: Found error trace [2018-06-25 08:55:09,486 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:55:09,487 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:55:09,487 INFO ]: Analyzing trace with hash -1635114650, now seen corresponding path program 6 times [2018-06-25 08:55:09,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:55:09,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:55:09,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:09,487 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:55:09,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:55:09,511 INFO ]: Conjunction of SSA is sat [2018-06-25 08:55:09,520 INFO ]: Counterexample might be feasible [2018-06-25 08:55:09,539 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:55:09 BoogieIcfgContainer [2018-06-25 08:55:09,539 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 08:55:09,540 INFO ]: Toolchain (without parser) took 4559.79 ms. Allocated memory was 306.2 MB in the beginning and 341.8 MB in the end (delta: 35.7 MB). Free memory was 262.5 MB in the beginning and 263.7 MB in the end (delta: -1.1 MB). Peak memory consumption was 34.5 MB. Max. memory is 3.6 GB. [2018-06-25 08:55:09,542 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:55:09,542 INFO ]: ChcToBoogie took 61.32 ms. Allocated memory is still 306.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:55:09,542 INFO ]: Boogie Preprocessor took 37.72 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 258.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-25 08:55:09,543 INFO ]: RCFGBuilder took 351.88 ms. Allocated memory is still 306.2 MB. Free memory was 258.5 MB in the beginning and 249.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:55:09,543 INFO ]: TraceAbstraction took 4101.81 ms. Allocated memory was 306.2 MB in the beginning and 341.8 MB in the end (delta: 35.7 MB). Free memory was 249.5 MB in the beginning and 263.7 MB in the end (delta: -14.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 3.6 GB. [2018-06-25 08:55:09,549 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.32 ms. Allocated memory is still 306.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.72 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 258.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 351.88 ms. Allocated memory is still 306.2 MB. Free memory was 258.5 MB in the beginning and 249.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4101.81 ms. Allocated memory was 306.2 MB in the beginning and 341.8 MB in the end (delta: 35.7 MB). Free memory was 249.5 MB in the beginning and 263.7 MB in the end (delta: -14.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume !(hbv_False_1_Int == hbv_False_2_Int); [L0] hhv_inv_main27_0_Int, hhv_inv_main27_1_Int, hhv_inv_main27_2_Int := hbv_False_3_Int, hbv_False_1_Int, hbv_False_2_Int; [L0] havoc hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int; [L0] assume !(0 <= hbv_inv_main27_1_Int + -1); [L0] hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := hhv_inv_main27_0_Int, hhv_inv_main27_1_Int, hbv_inv_main27_2_Int, hhv_inv_main27_2_Int, hbv_inv_main27_1_Int; [L0] havoc hbv_inv_main27_2_Int, hbv_inv_main27_1_Int; [L0] assume (hhv_inv_main23_3_Int == hbv_inv_main23_2_Int + hhv_inv_main23_2_Int && hhv_inv_main23_4_Int == hbv_inv_main23_1_Int + -1) && 0 <= hbv_inv_main23_1_Int + -1; [L0] hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] havoc hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] assume (hhv_inv_main23_3_Int == hbv_inv_main23_2_Int + hhv_inv_main23_2_Int && hhv_inv_main23_4_Int == hbv_inv_main23_1_Int + -1) && 0 <= hbv_inv_main23_1_Int + -1; [L0] hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] havoc hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] assume ((hhv_inv_main23_2_Int == hhv_inv_main23_0_Int && hhv_inv_main23_3_Int == 0) && hhv_inv_main23_4_Int == hhv_inv_main23_0_Int) && !(0 <= hbv_inv_main23_1_Int + -1); [L0] hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main23_0_Int, hbv_inv_main23_2_Int, hhv_inv_main23_1_Int, hbv_inv_main23_1_Int; [L0] havoc hbv_inv_main23_2_Int, hbv_inv_main23_1_Int; [L0] assume (0 <= hbv_inv_main14_2_Int + -1 && hhv_inv_main14_2_Int == hbv_inv_main14_1_Int + hhv_inv_main14_1_Int) && hhv_inv_main14_3_Int == hbv_inv_main14_2_Int + -1; [L0] hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] havoc hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] assume (0 <= hbv_inv_main14_2_Int + -1 && hhv_inv_main14_2_Int == hbv_inv_main14_1_Int + hhv_inv_main14_1_Int) && hhv_inv_main14_3_Int == hbv_inv_main14_2_Int + -1; [L0] hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] havoc hbv_inv_main14_1_Int, hbv_inv_main14_2_Int; [L0] assume hhv_inv_main14_2_Int == 0 && !(0 <= hbv_inv_main14_1_Int + -1); [L0] hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_3_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int; [L0] havoc hbv_inv_main14_1_Int; [L0] assume (hhv_inv_main8_3_Int == hbv_inv_main8_1_Int + -1 && 0 <= hbv_inv_main8_1_Int + -1) && hhv_inv_main8_2_Int == hbv_inv_main8_2_Int + hhv_inv_main8_1_Int; [L0] hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int; [L0] havoc hbv_inv_main8_1_Int, hbv_inv_main8_2_Int; [L0] assume (hhv_inv_main8_3_Int == hbv_inv_main8_1_Int + -1 && 0 <= hbv_inv_main8_1_Int + -1) && hhv_inv_main8_2_Int == hbv_inv_main8_2_Int + hhv_inv_main8_1_Int; [L0] hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int; [L0] havoc hbv_inv_main8_1_Int, hbv_inv_main8_2_Int; [L0] assume (hhv_inv_main8_3_Int == hhv_inv_main8_0_Int && hhv_inv_main8_1_Int == hhv_inv_main8_0_Int) && hhv_inv_main8_2_Int == 0; [L0] hhv_inv_main3_0_Int := hhv_inv_main8_0_Int; [L0] assume true; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. UNSAFE Result, 4.0s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 109 SDtfs, 126 SDslu, 495 SDs, 0 SdLazy, 330 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 32 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 7042 SizeOfPredicates, 42 NumberOfNonLiveVariables, 731 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 32/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_08-55-09-569.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_08-55-09-569.csv Received shutdown request...