java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:28:32,742 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:28:32,744 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:28:32,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:28:32,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:28:32,757 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:28:32,758 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:28:32,760 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:28:32,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:28:32,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:28:32,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:28:32,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:28:32,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:28:32,765 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:28:32,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:28:32,766 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:28:32,768 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:28:32,770 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:28:32,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:28:32,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:28:32,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:28:32,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:28:32,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:28:32,776 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:28:32,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:28:32,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:28:32,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:28:32,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:28:32,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:28:32,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:28:32,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:28:32,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:28:32,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:28:32,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:28:32,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:28:32,784 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:28:32,797 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:28:32,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:28:32,797 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:28:32,798 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:28:32,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:28:32,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:28:32,799 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:28:32,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:28:32,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:28:32,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:28:32,800 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:28:32,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:28:32,800 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:28:32,800 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:28:32,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:28:32,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:28:32,801 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:28:32,802 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:28:32,802 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:28:32,838 INFO ]: Repository-Root is: /tmp [2018-06-22 01:28:32,852 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:28:32,855 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:28:32,858 INFO ]: Initializing SmtParser... [2018-06-22 01:28:32,858 INFO ]: SmtParser initialized [2018-06-22 01:28:32,859 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 [2018-06-22 01:28:32,860 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:28:32,953 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 unknown [2018-06-22 01:28:33,166 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 [2018-06-22 01:28:33,174 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:28:33,179 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:28:33,180 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:28:33,180 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:28:33,180 INFO ]: ChcToBoogie initialized [2018-06-22 01:28:33,184 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:28:33" (1/1) ... [2018-06-22 01:28:33,230 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:33 Unit [2018-06-22 01:28:33,230 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:28:33,230 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:28:33,230 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:28:33,230 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:28:33,249 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:33" (1/1) ... [2018-06-22 01:28:33,249 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:33" (1/1) ... [2018-06-22 01:28:33,259 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:33" (1/1) ... [2018-06-22 01:28:33,259 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:33" (1/1) ... [2018-06-22 01:28:33,264 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:33" (1/1) ... [2018-06-22 01:28:33,266 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:33" (1/1) ... [2018-06-22 01:28:33,267 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:33" (1/1) ... [2018-06-22 01:28:33,269 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:28:33,270 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:28:33,270 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:28:33,270 INFO ]: RCFGBuilder initialized [2018-06-22 01:28:33,270 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:33" (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:28:33,290 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:28:33,290 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:28:33,290 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:28:33,290 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:28:33,290 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:28:33,290 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:28:33,616 INFO ]: Using library mode [2018-06-22 01:28:33,617 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:28:33 BoogieIcfgContainer [2018-06-22 01:28:33,617 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:28:33,618 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:28:33,618 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:28:33,621 INFO ]: TraceAbstraction initialized [2018-06-22 01:28:33,621 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:28:33" (1/3) ... [2018-06-22 01:28:33,622 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e412840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:28:33, skipping insertion in model container [2018-06-22 01:28:33,622 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:33" (2/3) ... [2018-06-22 01:28:33,622 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e412840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:28:33, skipping insertion in model container [2018-06-22 01:28:33,622 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:28:33" (3/3) ... [2018-06-22 01:28:33,624 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:28:33,632 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:28:33,641 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:28:33,676 INFO ]: Using default assertion order modulation [2018-06-22 01:28:33,676 INFO ]: Interprodecural is true [2018-06-22 01:28:33,676 INFO ]: Hoare is false [2018-06-22 01:28:33,676 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:28:33,676 INFO ]: Backedges is TWOTRACK [2018-06-22 01:28:33,676 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:28:33,676 INFO ]: Difference is false [2018-06-22 01:28:33,676 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:28:33,676 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:28:33,688 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:28:33,696 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:28:33,696 INFO ]: Found error trace [2018-06-22 01:28:33,697 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:28:33,697 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:33,700 INFO ]: Analyzing trace with hash -1603173500, now seen corresponding path program 1 times [2018-06-22 01:28:33,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:33,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:33,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:33,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:33,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:33,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:33,779 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:28:33,781 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:33,781 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:28:33,787 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:28:33,801 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:28:33,802 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:28:33,805 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-22 01:28:33,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:33,826 INFO ]: Finished difference Result 10 states and 19 transitions. [2018-06-22 01:28:33,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:28:33,827 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:28:33,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:33,836 INFO ]: With dead ends: 10 [2018-06-22 01:28:33,836 INFO ]: Without dead ends: 10 [2018-06-22 01:28:33,839 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:28:33,853 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:28:33,867 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:28:33,868 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:28:33,868 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-06-22 01:28:33,869 INFO ]: Start accepts. Automaton has 10 states and 19 transitions. Word has length 6 [2018-06-22 01:28:33,869 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:33,869 INFO ]: Abstraction has 10 states and 19 transitions. [2018-06-22 01:28:33,870 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:28:33,870 INFO ]: Start isEmpty. Operand 10 states and 19 transitions. [2018-06-22 01:28:33,870 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:28:33,870 INFO ]: Found error trace [2018-06-22 01:28:33,870 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:33,870 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:33,870 INFO ]: Analyzing trace with hash 1836814402, now seen corresponding path program 1 times [2018-06-22 01:28:33,870 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:33,870 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:33,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:33,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:33,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:33,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:33,929 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:28:33,929 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:33,929 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:33,931 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:33,931 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:33,931 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:33,931 INFO ]: Start difference. First operand 10 states and 19 transitions. Second operand 3 states. [2018-06-22 01:28:33,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:33,992 INFO ]: Finished difference Result 14 states and 26 transitions. [2018-06-22 01:28:33,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:33,993 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:28:33,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:33,995 INFO ]: With dead ends: 14 [2018-06-22 01:28:33,995 INFO ]: Without dead ends: 14 [2018-06-22 01:28:33,997 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:28:33,998 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:28:34,000 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:28:34,000 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:34,002 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2018-06-22 01:28:34,002 INFO ]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 7 [2018-06-22 01:28:34,002 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:34,002 INFO ]: Abstraction has 11 states and 22 transitions. [2018-06-22 01:28:34,002 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:34,002 INFO ]: Start isEmpty. Operand 11 states and 22 transitions. [2018-06-22 01:28:34,002 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:28:34,002 INFO ]: Found error trace [2018-06-22 01:28:34,002 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:34,002 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:34,002 INFO ]: Analyzing trace with hash 1842057618, now seen corresponding path program 1 times [2018-06-22 01:28:34,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:34,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:34,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:34,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:34,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:34,011 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:34,047 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:28:34,047 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:34,047 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:34,047 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:34,047 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:34,047 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:34,047 INFO ]: Start difference. First operand 11 states and 22 transitions. Second operand 3 states. [2018-06-22 01:28:34,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:34,069 INFO ]: Finished difference Result 12 states and 23 transitions. [2018-06-22 01:28:34,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:34,069 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:28:34,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:34,070 INFO ]: With dead ends: 12 [2018-06-22 01:28:34,070 INFO ]: Without dead ends: 12 [2018-06-22 01:28:34,070 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:28:34,070 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:28:34,072 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:28:34,072 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:28:34,072 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2018-06-22 01:28:34,072 INFO ]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 7 [2018-06-22 01:28:34,072 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:34,073 INFO ]: Abstraction has 12 states and 23 transitions. [2018-06-22 01:28:34,073 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:34,073 INFO ]: Start isEmpty. Operand 12 states and 23 transitions. [2018-06-22 01:28:34,073 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:34,073 INFO ]: Found error trace [2018-06-22 01:28:34,073 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:34,073 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:34,073 INFO ]: Analyzing trace with hash 1119803863, now seen corresponding path program 1 times [2018-06-22 01:28:34,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:34,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:34,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:34,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:34,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:34,086 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:34,154 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:34,154 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:34,155 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:28:34,161 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:34,206 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:34,215 INFO ]: Computing forward predicates... [2018-06-22 01:28:34,245 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:34,278 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:34,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:28:34,278 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:28:34,278 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:28:34,278 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:28:34,279 INFO ]: Start difference. First operand 12 states and 23 transitions. Second operand 4 states. [2018-06-22 01:28:34,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:34,521 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-22 01:28:34,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:34,522 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:28:34,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:34,523 INFO ]: With dead ends: 14 [2018-06-22 01:28:34,523 INFO ]: Without dead ends: 14 [2018-06-22 01:28:34,523 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 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:28:34,523 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:28:34,524 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-22 01:28:34,524 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:28:34,525 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-22 01:28:34,525 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 8 [2018-06-22 01:28:34,525 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:34,525 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-22 01:28:34,525 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:28:34,525 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-22 01:28:34,525 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:34,525 INFO ]: Found error trace [2018-06-22 01:28:34,525 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:34,526 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:34,526 INFO ]: Analyzing trace with hash 1109347222, now seen corresponding path program 1 times [2018-06-22 01:28:34,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:34,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:34,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:34,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:34,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:34,542 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:34,700 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:28:34,700 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:34,700 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:28:34,700 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:28:34,700 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:28:34,700 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:28:34,701 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 4 states. [2018-06-22 01:28:34,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:34,947 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 01:28:34,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:28:34,948 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:28:34,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:34,949 INFO ]: With dead ends: 15 [2018-06-22 01:28:34,949 INFO ]: Without dead ends: 15 [2018-06-22 01:28:34,949 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:28:34,949 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:28:34,951 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-22 01:28:34,951 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:34,951 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-22 01:28:34,951 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-22 01:28:34,951 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:34,951 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-22 01:28:34,951 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:28:34,952 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-22 01:28:34,952 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:34,952 INFO ]: Found error trace [2018-06-22 01:28:34,952 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:34,952 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:34,952 INFO ]: Analyzing trace with hash 1270039876, now seen corresponding path program 1 times [2018-06-22 01:28:34,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:34,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:34,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:34,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:34,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:34,973 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:35,017 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:35,017 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:35,017 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:35,017 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:35,017 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:35,017 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:35,018 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2018-06-22 01:28:35,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:35,026 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-22 01:28:35,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:35,026 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:28:35,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:35,026 INFO ]: With dead ends: 12 [2018-06-22 01:28:35,026 INFO ]: Without dead ends: 11 [2018-06-22 01:28:35,027 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:28:35,027 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:28:35,028 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:28:35,028 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:35,028 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-22 01:28:35,028 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 8 [2018-06-22 01:28:35,028 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:35,028 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-22 01:28:35,029 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:35,029 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-22 01:28:35,029 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:28:35,029 INFO ]: Found error trace [2018-06-22 01:28:35,029 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:35,029 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:35,029 INFO ]: Analyzing trace with hash 356856993, now seen corresponding path program 1 times [2018-06-22 01:28:35,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:35,029 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:35,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:35,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:35,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:35,044 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:35,140 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:35,140 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:35,140 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:28:35,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:35,181 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:35,183 INFO ]: Computing forward predicates... [2018-06-22 01:28:35,351 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:28:35,370 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:28:35,370 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-22 01:28:35,370 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:28:35,370 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:28:35,370 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:28:35,370 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 7 states. [2018-06-22 01:28:35,654 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:35,654 INFO ]: Finished difference Result 18 states and 26 transitions. [2018-06-22 01:28:35,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:28:35,655 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 01:28:35,655 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:35,655 INFO ]: With dead ends: 18 [2018-06-22 01:28:35,655 INFO ]: Without dead ends: 16 [2018-06-22 01:28:35,656 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:28:35,656 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:28:35,659 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-22 01:28:35,659 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:28:35,660 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-06-22 01:28:35,660 INFO ]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 9 [2018-06-22 01:28:35,660 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:35,660 INFO ]: Abstraction has 12 states and 18 transitions. [2018-06-22 01:28:35,660 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:28:35,660 INFO ]: Start isEmpty. Operand 12 states and 18 transitions. [2018-06-22 01:28:35,660 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:28:35,660 INFO ]: Found error trace [2018-06-22 01:28:35,660 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:35,660 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:35,661 INFO ]: Analyzing trace with hash -1703252587, now seen corresponding path program 1 times [2018-06-22 01:28:35,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:35,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:35,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:35,661 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:35,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:35,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:35,703 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:35,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:35,703 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:28:35,710 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:35,731 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:35,733 INFO ]: Computing forward predicates... [2018-06-22 01:28:35,737 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:35,772 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:35,772 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:28:35,772 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:28:35,773 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:28:35,773 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:28:35,773 INFO ]: Start difference. First operand 12 states and 18 transitions. Second operand 4 states. [2018-06-22 01:28:35,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:35,832 INFO ]: Finished difference Result 12 states and 18 transitions. [2018-06-22 01:28:35,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:28:35,832 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:28:35,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:35,832 INFO ]: With dead ends: 12 [2018-06-22 01:28:35,832 INFO ]: Without dead ends: 12 [2018-06-22 01:28:35,833 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:28:35,833 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:28:35,834 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:28:35,834 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:28:35,834 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-06-22 01:28:35,834 INFO ]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 9 [2018-06-22 01:28:35,834 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:35,834 INFO ]: Abstraction has 12 states and 18 transitions. [2018-06-22 01:28:35,834 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:28:35,834 INFO ]: Start isEmpty. Operand 12 states and 18 transitions. [2018-06-22 01:28:35,835 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:28:35,835 INFO ]: Found error trace [2018-06-22 01:28:35,835 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:35,835 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:35,835 INFO ]: Analyzing trace with hash -934391166, now seen corresponding path program 2 times [2018-06-22 01:28:35,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:35,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:35,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:35,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:35,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:35,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:36,085 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:36,085 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:36,085 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) [2018-06-22 01:28:36,098 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:28:36,146 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:28:36,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:36,148 INFO ]: Computing forward predicates... [2018-06-22 01:28:36,210 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:36,229 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:36,229 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-22 01:28:36,230 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:28:36,230 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:28:36,230 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:28:36,230 INFO ]: Start difference. First operand 12 states and 18 transitions. Second operand 9 states. [2018-06-22 01:28:36,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:36,364 INFO ]: Finished difference Result 19 states and 32 transitions. [2018-06-22 01:28:36,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:28:36,365 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-22 01:28:36,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:36,365 INFO ]: With dead ends: 19 [2018-06-22 01:28:36,365 INFO ]: Without dead ends: 19 [2018-06-22 01:28:36,366 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:28:36,366 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:28:36,367 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-22 01:28:36,367 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:28:36,367 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-22 01:28:36,367 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 10 [2018-06-22 01:28:36,368 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:36,368 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-22 01:28:36,368 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:28:36,368 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-22 01:28:36,368 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:28:36,368 INFO ]: Found error trace [2018-06-22 01:28:36,368 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:36,368 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:36,368 INFO ]: Analyzing trace with hash 1425476405, now seen corresponding path program 3 times [2018-06-22 01:28:36,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:36,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:36,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:36,369 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:28:36,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:36,381 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:36,429 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:36,429 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:36,429 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-22 01:28:36,435 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:28:36,452 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:28:36,452 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:36,453 INFO ]: Computing forward predicates... [2018-06-22 01:28:36,503 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:36,522 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:36,522 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-22 01:28:36,522 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:28:36,522 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:28:36,522 INFO ]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:28:36,523 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 11 states. [2018-06-22 01:28:36,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:36,762 INFO ]: Finished difference Result 24 states and 42 transitions. [2018-06-22 01:28:36,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:28:36,763 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-22 01:28:36,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:36,763 INFO ]: With dead ends: 24 [2018-06-22 01:28:36,763 INFO ]: Without dead ends: 24 [2018-06-22 01:28:36,764 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:28:36,764 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:28:36,766 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 14. [2018-06-22 01:28:36,766 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:28:36,767 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2018-06-22 01:28:36,767 INFO ]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 11 [2018-06-22 01:28:36,767 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:36,767 INFO ]: Abstraction has 14 states and 22 transitions. [2018-06-22 01:28:36,767 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:28:36,767 INFO ]: Start isEmpty. Operand 14 states and 22 transitions. [2018-06-22 01:28:36,767 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:28:36,767 INFO ]: Found error trace [2018-06-22 01:28:36,767 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:36,768 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:36,768 INFO ]: Analyzing trace with hash 1566927074, now seen corresponding path program 4 times [2018-06-22 01:28:36,768 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:36,768 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:36,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:36,769 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:28:36,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:36,782 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:36,986 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:36,986 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:36,986 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:28:36,997 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:28:37,017 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:28:37,017 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:37,019 INFO ]: Computing forward predicates... [2018-06-22 01:28:37,026 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:37,046 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:37,046 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:28:37,046 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:28:37,047 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:28:37,047 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:28:37,047 INFO ]: Start difference. First operand 14 states and 22 transitions. Second operand 7 states. [2018-06-22 01:28:37,071 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:37,071 INFO ]: Finished difference Result 15 states and 24 transitions. [2018-06-22 01:28:37,071 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:28:37,071 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-22 01:28:37,071 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:37,071 INFO ]: With dead ends: 15 [2018-06-22 01:28:37,071 INFO ]: Without dead ends: 15 [2018-06-22 01:28:37,072 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:28:37,072 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:28:37,073 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:28:37,073 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:28:37,074 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-22 01:28:37,074 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 12 [2018-06-22 01:28:37,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:37,074 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-22 01:28:37,074 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:28:37,074 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-22 01:28:37,074 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:28:37,074 INFO ]: Found error trace [2018-06-22 01:28:37,074 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:37,074 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:37,074 INFO ]: Analyzing trace with hash 1656930517, now seen corresponding path program 5 times [2018-06-22 01:28:37,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:37,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:37,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:37,075 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:28:37,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:37,096 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:37,173 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:37,174 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:37,174 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:28:37,182 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:28:37,232 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:28:37,233 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:37,235 INFO ]: Computing forward predicates... [2018-06-22 01:28:37,243 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:37,265 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:37,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:28:37,265 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:28:37,265 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:28:37,266 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:28:37,266 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 8 states. [2018-06-22 01:28:37,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:37,306 INFO ]: Finished difference Result 16 states and 26 transitions. [2018-06-22 01:28:37,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:28:37,306 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 01:28:37,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:37,307 INFO ]: With dead ends: 16 [2018-06-22 01:28:37,307 INFO ]: Without dead ends: 16 [2018-06-22 01:28:37,307 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:28:37,307 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:28:37,308 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:28:37,308 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:28:37,309 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2018-06-22 01:28:37,309 INFO ]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 13 [2018-06-22 01:28:37,309 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:37,309 INFO ]: Abstraction has 16 states and 26 transitions. [2018-06-22 01:28:37,309 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:28:37,309 INFO ]: Start isEmpty. Operand 16 states and 26 transitions. [2018-06-22 01:28:37,309 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:28:37,309 INFO ]: Found error trace [2018-06-22 01:28:37,309 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:37,309 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:37,310 INFO ]: Analyzing trace with hash 152069954, now seen corresponding path program 6 times [2018-06-22 01:28:37,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:37,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:37,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:37,310 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:28:37,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:37,333 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:37,497 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:37,497 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:37,497 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:28:37,505 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:28:37,527 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:28:37,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:37,529 INFO ]: Computing forward predicates... [2018-06-22 01:28:37,683 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:37,704 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:37,704 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-22 01:28:37,704 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:28:37,704 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:28:37,705 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:28:37,705 INFO ]: Start difference. First operand 16 states and 26 transitions. Second operand 17 states. [2018-06-22 01:28:38,251 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:38,251 INFO ]: Finished difference Result 45 states and 84 transitions. [2018-06-22 01:28:38,251 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:28:38,251 INFO ]: Start accepts. Automaton has 17 states. Word has length 14 [2018-06-22 01:28:38,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:38,252 INFO ]: With dead ends: 45 [2018-06-22 01:28:38,252 INFO ]: Without dead ends: 45 [2018-06-22 01:28:38,253 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=661, Invalid=1319, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:28:38,253 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:28:38,255 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 17. [2018-06-22 01:28:38,255 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:28:38,256 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-22 01:28:38,256 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 14 [2018-06-22 01:28:38,256 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:38,256 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-22 01:28:38,256 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:28:38,256 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-22 01:28:38,256 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:28:38,256 INFO ]: Found error trace [2018-06-22 01:28:38,256 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:38,256 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:38,257 INFO ]: Analyzing trace with hash 746032757, now seen corresponding path program 7 times [2018-06-22 01:28:38,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:38,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:38,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:38,257 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:28:38,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:38,271 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:38,382 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:38,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:38,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:28:38,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:38,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:38,429 INFO ]: Computing forward predicates... [2018-06-22 01:28:38,439 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:38,469 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:38,469 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 01:28:38,469 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:28:38,470 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:28:38,470 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:28:38,470 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 10 states. [2018-06-22 01:28:38,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:38,630 INFO ]: Finished difference Result 18 states and 30 transitions. [2018-06-22 01:28:38,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:28:38,630 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-22 01:28:38,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:38,630 INFO ]: With dead ends: 18 [2018-06-22 01:28:38,630 INFO ]: Without dead ends: 18 [2018-06-22 01:28:38,630 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:28:38,630 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:28:38,632 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 01:28:38,633 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:28:38,633 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-06-22 01:28:38,633 INFO ]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 15 [2018-06-22 01:28:38,633 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:38,633 INFO ]: Abstraction has 18 states and 30 transitions. [2018-06-22 01:28:38,633 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:28:38,633 INFO ]: Start isEmpty. Operand 18 states and 30 transitions. [2018-06-22 01:28:38,634 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:28:38,634 INFO ]: Found error trace [2018-06-22 01:28:38,634 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:38,634 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:38,634 INFO ]: Analyzing trace with hash 1979010466, now seen corresponding path program 8 times [2018-06-22 01:28:38,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:38,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:38,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:38,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:38,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:38,655 INFO ]: Conjunction of SSA is sat [2018-06-22 01:28:38,659 INFO ]: Counterexample might be feasible [2018-06-22 01:28:38,675 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:28:38 BoogieIcfgContainer [2018-06-22 01:28:38,675 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:28:38,676 INFO ]: Toolchain (without parser) took 5501.31 ms. Allocated memory was 307.2 MB in the beginning and 338.2 MB in the end (delta: 30.9 MB). Free memory was 261.8 MB in the beginning and 176.2 MB in the end (delta: 85.6 MB). Peak memory consumption was 116.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:38,677 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 307.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:28:38,678 INFO ]: ChcToBoogie took 50.23 ms. Allocated memory is still 307.2 MB. Free memory was 261.8 MB in the beginning and 259.8 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:28:38,678 INFO ]: Boogie Preprocessor took 38.89 ms. Allocated memory is still 307.2 MB. Free memory was 259.8 MB in the beginning and 257.8 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:28:38,679 INFO ]: RCFGBuilder took 347.13 ms. Allocated memory is still 307.2 MB. Free memory was 257.8 MB in the beginning and 247.8 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:28:38,679 INFO ]: TraceAbstraction took 5056.88 ms. Allocated memory was 307.2 MB in the beginning and 338.2 MB in the end (delta: 30.9 MB). Free memory was 247.8 MB in the beginning and 176.2 MB in the end (delta: 71.6 MB). Peak memory consumption was 102.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:38,682 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 307.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.23 ms. Allocated memory is still 307.2 MB. Free memory was 261.8 MB in the beginning and 259.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.89 ms. Allocated memory is still 307.2 MB. Free memory was 259.8 MB in the beginning and 257.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 347.13 ms. Allocated memory is still 307.2 MB. Free memory was 257.8 MB in the beginning and 247.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5056.88 ms. Allocated memory was 307.2 MB in the beginning and 338.2 MB in the end (delta: 30.9 MB). Free memory was 247.8 MB in the beginning and 176.2 MB in the end (delta: 71.6 MB). Peak memory consumption was 102.5 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); [L0] gotoSwitch := gotoSwitch_in; [L0] assume (((((hbv_False_1_Int + -1 == hbv_False_3_Int && hbv_False_2_Int + -1 == hbv_False_5_Int) && hbv_False_2_Int + -10 == 0) && !(hbv_False_2_Int <= 1)) && !(hbv_False_1_Int + hbv_False_4_Int + -10 == 0)) && !(hbv_False_1_Int <= 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int; [L0] havoc hbv_False_1_Int, hbv_False_5_Int, hbv_False_4_Int, hbv_False_3_Int, hbv_False_6_Int, hbv_False_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_2_Int; [L0] assume (((hhv_REC_f_f_3_Int == hhv_REC_f_f_2_Int && hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hhv_REC_f_f_2_Int <= 1; [L0] hhv_REC_f__0_Int, hhv_REC_f__1_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume hhv_REC_f__1_Int == hhv_REC_f__0_Int && hhv_REC_f__0_Int <= 0; [L0] RET call gotoProc(0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. UNSAFE Result, 5.0s OverallTime, 15 OverallIterations, 8 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 188 SDtfs, 23 SDslu, 403 SDs, 0 SdLazy, 313 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=14, 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, 14 MinimizatonAttempts, 59 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 4592 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1036 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 2/173 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/014c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-28-38-693.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-28-38-693.csv Received shutdown request...