java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:32:45,581 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:32:45,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:32:45,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:32:45,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:32:45,596 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:32:45,597 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:32:45,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:32:45,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:32:45,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:32:45,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:32:45,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:32:45,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:32:45,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:32:45,615 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:32:45,615 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:32:45,616 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:32:45,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:32:45,631 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:32:45,632 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:32:45,633 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:32:45,634 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:32:45,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:32:45,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:32:45,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:32:45,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:32:45,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:32:45,644 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:32:45,644 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:32:45,650 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:32:45,650 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:32:45,651 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:32:45,651 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:32:45,651 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:32:45,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:32:45,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:32:45,654 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:32:45,673 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:32:45,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:32:45,676 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:32:45,677 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:32:45,678 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:32:45,678 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:32:45,678 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:32:45,678 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:32:45,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:32:45,679 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:32:45,679 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:32:45,679 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:32:45,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:32:45,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:32:45,679 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:32:45,680 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:32:45,681 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:32:45,681 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:32:45,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:32:45,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:32:45,681 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:32:45,683 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:32:45,683 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:32:45,726 INFO ]: Repository-Root is: /tmp [2018-06-26 18:32:45,742 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:32:45,746 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:32:45,748 INFO ]: Initializing SmtParser... [2018-06-26 18:32:45,748 INFO ]: SmtParser initialized [2018-06-26 18:32:45,749 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 [2018-06-26 18:32:45,750 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-26 18:32:45,841 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 unknown [2018-06-26 18:32:46,456 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 [2018-06-26 18:32:46,461 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:32:46,476 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:32:46,476 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:32:46,476 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:32:46,476 INFO ]: ChcToBoogie initialized [2018-06-26 18:32:46,480 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:32:46" (1/1) ... [2018-06-26 18:32:46,605 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:32:46 Unit [2018-06-26 18:32:46,605 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:32:46,606 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:32:46,606 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:32:46,606 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:32:46,626 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:32:46" (1/1) ... [2018-06-26 18:32:46,626 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:32:46" (1/1) ... [2018-06-26 18:32:46,636 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:32:46" (1/1) ... [2018-06-26 18:32:46,636 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:32:46" (1/1) ... [2018-06-26 18:32:46,649 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:32:46" (1/1) ... [2018-06-26 18:32:46,652 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:32:46" (1/1) ... [2018-06-26 18:32:46,655 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:32:46" (1/1) ... [2018-06-26 18:32:46,660 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:32:46,661 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:32:46,661 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:32:46,661 INFO ]: RCFGBuilder initialized [2018-06-26 18:32:46,662 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:32:46" (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-26 18:32:46,693 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:32:46,693 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:32:46,693 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:32:46,693 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:32:46,694 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:32:46,694 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-26 18:32:47,845 INFO ]: Using library mode [2018-06-26 18:32:47,846 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:32:47 BoogieIcfgContainer [2018-06-26 18:32:47,846 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:32:47,846 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:32:47,846 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:32:47,847 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:32:47,848 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:32:47" (1/1) ... [2018-06-26 18:32:47,878 INFO ]: Initial Icfg 75 locations, 123 edges [2018-06-26 18:32:47,879 INFO ]: Using Remove infeasible edges [2018-06-26 18:32:47,880 INFO ]: Using Maximize final states [2018-06-26 18:32:47,880 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:32:47,880 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:32:47,885 INFO ]: Using Remove sink states [2018-06-26 18:32:47,885 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:32:47,885 INFO ]: Using Use SBE [2018-06-26 18:32:47,957 INFO ]: SBE split 5 edges [2018-06-26 18:32:47,962 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-26 18:32:47,964 INFO ]: 0 new accepting states [2018-06-26 18:32:49,119 INFO ]: Removed 98 edges and 20 locations by large block encoding [2018-06-26 18:32:49,121 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-26 18:32:49,125 INFO ]: Removed 3 edges and 0 locations because of local infeasibility [2018-06-26 18:32:49,125 INFO ]: 0 new accepting states [2018-06-26 18:32:49,126 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:32:49,126 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:32:49,127 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:32:49,127 INFO ]: 0 new accepting states [2018-06-26 18:32:49,129 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:32:49,129 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:32:49,130 INFO ]: Encoded RCFG 52 locations, 107 edges [2018-06-26 18:32:49,131 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:32:49 BasicIcfg [2018-06-26 18:32:49,131 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:32:49,132 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:32:49,132 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:32:49,135 INFO ]: TraceAbstraction initialized [2018-06-26 18:32:49,135 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:32:46" (1/4) ... [2018-06-26 18:32:49,136 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4b3e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:32:49, skipping insertion in model container [2018-06-26 18:32:49,136 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:32:46" (2/4) ... [2018-06-26 18:32:49,136 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4b3e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:32:49, skipping insertion in model container [2018-06-26 18:32:49,136 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:32:47" (3/4) ... [2018-06-26 18:32:49,137 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4b3e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:32:49, skipping insertion in model container [2018-06-26 18:32:49,137 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:32:49" (4/4) ... [2018-06-26 18:32:49,141 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:32:49,151 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:32:49,160 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:32:49,204 INFO ]: Using default assertion order modulation [2018-06-26 18:32:49,205 INFO ]: Interprodecural is true [2018-06-26 18:32:49,205 INFO ]: Hoare is false [2018-06-26 18:32:49,205 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:32:49,205 INFO ]: Backedges is TWOTRACK [2018-06-26 18:32:49,205 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:32:49,205 INFO ]: Difference is false [2018-06-26 18:32:49,205 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:32:49,205 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:32:49,217 INFO ]: Start isEmpty. Operand 52 states. [2018-06-26 18:32:49,233 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 18:32:49,233 INFO ]: Found error trace [2018-06-26 18:32:49,234 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 18:32:49,234 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:32:49,239 INFO ]: Analyzing trace with hash 2979789, now seen corresponding path program 1 times [2018-06-26 18:32:49,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:32:49,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:32:49,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:32:49,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:32:49,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:32:49,308 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:32:49,388 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:32:49,389 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:32:49,389 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:32:49,391 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:32:49,404 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:32:49,404 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:32:49,407 INFO ]: Start difference. First operand 52 states. Second operand 3 states. [2018-06-26 18:32:50,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:32:50,655 INFO ]: Finished difference Result 83 states and 170 transitions. [2018-06-26 18:32:50,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:32:50,657 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 18:32:50,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:32:50,676 INFO ]: With dead ends: 83 [2018-06-26 18:32:50,676 INFO ]: Without dead ends: 82 [2018-06-26 18:32:50,678 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-26 18:32:50,692 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-26 18:32:50,730 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-06-26 18:32:50,731 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-26 18:32:50,737 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 167 transitions. [2018-06-26 18:32:50,738 INFO ]: Start accepts. Automaton has 82 states and 167 transitions. Word has length 4 [2018-06-26 18:32:50,739 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:32:50,739 INFO ]: Abstraction has 82 states and 167 transitions. [2018-06-26 18:32:50,739 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:32:50,739 INFO ]: Start isEmpty. Operand 82 states and 167 transitions. [2018-06-26 18:32:50,741 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:32:50,741 INFO ]: Found error trace [2018-06-26 18:32:50,742 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:32:50,742 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:32:50,742 INFO ]: Analyzing trace with hash 93187898, now seen corresponding path program 1 times [2018-06-26 18:32:50,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:32:50,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:32:50,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:32:50,743 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:32:50,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:32:50,757 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:32:50,822 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:32:50,823 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:32:50,823 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:32:50,824 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:32:50,824 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:32:50,824 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:32:50,824 INFO ]: Start difference. First operand 82 states and 167 transitions. Second operand 3 states. [2018-06-26 18:32:51,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:32:51,118 INFO ]: Finished difference Result 113 states and 236 transitions. [2018-06-26 18:32:51,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:32:51,118 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:32:51,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:32:51,126 INFO ]: With dead ends: 113 [2018-06-26 18:32:51,126 INFO ]: Without dead ends: 113 [2018-06-26 18:32:51,127 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-26 18:32:51,127 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-26 18:32:51,147 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-06-26 18:32:51,147 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-26 18:32:51,153 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 236 transitions. [2018-06-26 18:32:51,153 INFO ]: Start accepts. Automaton has 113 states and 236 transitions. Word has length 5 [2018-06-26 18:32:51,153 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:32:51,153 INFO ]: Abstraction has 113 states and 236 transitions. [2018-06-26 18:32:51,153 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:32:51,153 INFO ]: Start isEmpty. Operand 113 states and 236 transitions. [2018-06-26 18:32:51,156 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:32:51,156 INFO ]: Found error trace [2018-06-26 18:32:51,156 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:32:51,156 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:32:51,156 INFO ]: Analyzing trace with hash 93128316, now seen corresponding path program 1 times [2018-06-26 18:32:51,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:32:51,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:32:51,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:32:51,157 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:32:51,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:32:51,163 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-26 18:32:51,163 INFO ]: Advancing trace checker [2018-06-26 18:32:51,163 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-26 18:32:51,182 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:32:51,207 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:32:51,213 INFO ]: Computing forward predicates... [2018-06-26 18:32:51,228 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:32:51,249 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:32:51,249 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:32:51,249 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:32:51,249 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:32:51,249 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:32:51,250 INFO ]: Start difference. First operand 113 states and 236 transitions. Second operand 3 states. [2018-06-26 18:32:51,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:32:51,871 INFO ]: Finished difference Result 144 states and 306 transitions. [2018-06-26 18:32:51,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:32:51,873 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:32:51,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:32:51,882 INFO ]: With dead ends: 144 [2018-06-26 18:32:51,882 INFO ]: Without dead ends: 144 [2018-06-26 18:32:51,882 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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-26 18:32:51,883 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-26 18:32:51,915 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-06-26 18:32:51,915 INFO ]: Start removeUnreachable. Operand 144 states. [2018-06-26 18:32:51,919 INFO ]: Finished removeUnreachable. Reduced from 144 states to 144 states and 306 transitions. [2018-06-26 18:32:51,919 INFO ]: Start accepts. Automaton has 144 states and 306 transitions. Word has length 5 [2018-06-26 18:32:51,919 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:32:51,919 INFO ]: Abstraction has 144 states and 306 transitions. [2018-06-26 18:32:51,919 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:32:51,919 INFO ]: Start isEmpty. Operand 144 states and 306 transitions. [2018-06-26 18:32:51,922 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:32:51,922 INFO ]: Found error trace [2018-06-26 18:32:51,922 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:32:51,922 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:32:51,922 INFO ]: Analyzing trace with hash 93158107, now seen corresponding path program 1 times [2018-06-26 18:32:51,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:32:51,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:32:51,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:32:51,923 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:32:51,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:32:51,929 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-26 18:32:51,929 INFO ]: Advancing trace checker [2018-06-26 18:32:51,929 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-26 18:32:51,948 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:32:51,975 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:32:51,977 INFO ]: Computing forward predicates... [2018-06-26 18:32:52,037 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:32:52,071 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:32:52,071 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:32:52,071 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:32:52,071 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:32:52,071 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:32:52,071 INFO ]: Start difference. First operand 144 states and 306 transitions. Second operand 3 states. [2018-06-26 18:32:52,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:32:52,671 INFO ]: Finished difference Result 260 states and 538 transitions. [2018-06-26 18:32:52,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:32:52,672 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:32:52,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:32:52,693 INFO ]: With dead ends: 260 [2018-06-26 18:32:52,693 INFO ]: Without dead ends: 260 [2018-06-26 18:32:52,693 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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-26 18:32:52,694 INFO ]: Start minimizeSevpa. Operand 260 states. [2018-06-26 18:32:52,730 INFO ]: Finished minimizeSevpa. Reduced states from 260 to 148. [2018-06-26 18:32:52,730 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-26 18:32:52,734 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 310 transitions. [2018-06-26 18:32:52,734 INFO ]: Start accepts. Automaton has 148 states and 310 transitions. Word has length 5 [2018-06-26 18:32:52,735 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:32:52,735 INFO ]: Abstraction has 148 states and 310 transitions. [2018-06-26 18:32:52,735 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:32:52,735 INFO ]: Start isEmpty. Operand 148 states and 310 transitions. [2018-06-26 18:32:52,746 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:32:52,746 INFO ]: Found error trace [2018-06-26 18:32:52,747 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:32:52,747 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:32:52,747 INFO ]: Analyzing trace with hash -847959232, now seen corresponding path program 1 times [2018-06-26 18:32:52,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:32:52,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:32:52,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:32:52,748 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:32:52,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:32:52,755 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-26 18:32:52,755 INFO ]: Advancing trace checker [2018-06-26 18:32:52,756 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-26 18:32:52,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:32:52,886 INFO ]: Conjunction of SSA is sat [2018-06-26 18:32:52,920 INFO ]: Counterexample might be feasible [2018-06-26 18:32:52,932 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:32:52,933 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:32:52 BasicIcfg [2018-06-26 18:32:52,933 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:32:52,934 INFO ]: Toolchain (without parser) took 6473.08 ms. Allocated memory was 309.9 MB in the beginning and 378.0 MB in the end (delta: 68.2 MB). Free memory was 238.2 MB in the beginning and 332.8 MB in the end (delta: -94.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:32:52,936 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:32:52,936 INFO ]: ChcToBoogie took 129.30 ms. Allocated memory is still 309.9 MB. Free memory was 238.2 MB in the beginning and 235.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:32:52,936 INFO ]: Boogie Preprocessor took 54.43 ms. Allocated memory is still 309.9 MB. Free memory was 235.2 MB in the beginning and 233.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:32:52,937 INFO ]: RCFGBuilder took 1184.81 ms. Allocated memory was 309.9 MB in the beginning and 324.0 MB in the end (delta: 14.2 MB). Free memory was 232.3 MB in the beginning and 284.2 MB in the end (delta: -51.9 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. [2018-06-26 18:32:52,937 INFO ]: BlockEncodingV2 took 1284.56 ms. Allocated memory is still 324.0 MB. Free memory was 284.2 MB in the beginning and 225.3 MB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 3.6 GB. [2018-06-26 18:32:52,938 INFO ]: TraceAbstraction took 3801.49 ms. Allocated memory was 324.0 MB in the beginning and 378.0 MB in the end (delta: 54.0 MB). Free memory was 223.8 MB in the beginning and 332.8 MB in the end (delta: -108.9 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:32:52,940 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 75 locations, 123 edges - StatisticsResult: Encoded RCFG 52 locations, 107 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 129.30 ms. Allocated memory is still 309.9 MB. Free memory was 238.2 MB in the beginning and 235.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 54.43 ms. Allocated memory is still 309.9 MB. Free memory was 235.2 MB in the beginning and 233.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1184.81 ms. Allocated memory was 309.9 MB in the beginning and 324.0 MB in the end (delta: 14.2 MB). Free memory was 232.3 MB in the beginning and 284.2 MB in the end (delta: -51.9 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1284.56 ms. Allocated memory is still 324.0 MB. Free memory was 284.2 MB in the beginning and 225.3 MB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3801.49 ms. Allocated memory was 324.0 MB in the beginning and 378.0 MB in the end (delta: 54.0 MB). Free memory was 223.8 MB in the beginning and 332.8 MB in the end (delta: -108.9 MB). There was no memory consumed. 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, 0, 0, 0, 0, 0, 0, 0); [L0] assume ((((((((0 == hbv_g_1032DLRunknownCLN29_3_Int && hbv_g_1032DLRunknownCLN29_4_Int == 0) && hbv_g_1032DLRunknownCLN29_5_Int == hbv_g_1032DLRunknownCLN29_1_Int * hbv_g_1032DLRunknownCLN29_2_Int) && hhv_g_1032DLRunknownCLN29_7_Int == hbv_g_1032DLRunknownCLN29_5_Int + hbv_g_1032DLRunknownCLN29_4_Int) && hbv_g_1032DLRunknownCLN29_1_Int == 0) && !((hbv_g_1032DLRunknownCLN29_2_Int == 0 || !(0 == hbv_g_1032DLRunknownCLN29_3_Int)) && (!(hbv_g_1032DLRunknownCLN29_2_Int == 0) || 0 == hbv_g_1032DLRunknownCLN29_3_Int))) && hbv_g_1032DLRunknownCLN29_6_Int == hbv_g_1032DLRunknownCLN29_2_Int - 1) && hhv_g_1032DLRunknownCLN29_10_Int == hhv_g_1032DLRunknownCLN29_6_Int) && hhv_g_1032DLRunknownCLN29_9_Int == hhv_g_1032DLRunknownCLN29_5_Int) && hhv_g_1032DLRunknownCLN29_8_Int == hhv_g_1032DLRunknownCLN29_4_Int; [L0] hhv_f_1035DLRunknownCLN10_0_Int, hhv_f_1035DLRunknownCLN10_1_Int, hhv_f_1035DLRunknownCLN10_2_Int, hhv_f_1035DLRunknownCLN10_3_Int, hhv_f_1035DLRunknownCLN10_4_Int, hhv_f_1035DLRunknownCLN10_5_Int, hhv_f_1035DLRunknownCLN10_6_Int, hhv_f_1035DLRunknownCLN10_7_Int := hhv_g_1032DLRunknownCLN29_0_Int, hhv_g_1032DLRunknownCLN29_1_Int, hhv_g_1032DLRunknownCLN29_2_Int, hhv_g_1032DLRunknownCLN29_3_Int, hbv_g_1032DLRunknownCLN29_2_Int, hhv_g_1032DLRunknownCLN29_4_Int, hhv_g_1032DLRunknownCLN29_5_Int, hhv_g_1032DLRunknownCLN29_6_Int; [L0] havoc hbv_g_1032DLRunknownCLN29_5_Int, hbv_g_1032DLRunknownCLN29_4_Int, hbv_g_1032DLRunknownCLN29_2_Int, hbv_g_1032DLRunknownCLN29_3_Int, hbv_g_1032DLRunknownCLN29_6_Int, hbv_g_1032DLRunknownCLN29_1_Int; [L0] assume (((((!((hbv_f_1035DLRunknownCLN10_2_Int == 0 || !(0 == hbv_f_1035DLRunknownCLN10_3_Int)) && (!(hbv_f_1035DLRunknownCLN10_2_Int == 0) || 0 == hbv_f_1035DLRunknownCLN10_3_Int)) && hbv_f_1035DLRunknownCLN10_6_Int == hbv_f_1035DLRunknownCLN10_5_Int + hbv_f_1035DLRunknownCLN10_4_Int) && hbv_f_1035DLRunknownCLN10_4_Int == 0) && hhv_f_1035DLRunknownCLN10_4_Int == hbv_f_1035DLRunknownCLN10_2_Int - 1) && hbv_f_1035DLRunknownCLN10_5_Int == hbv_f_1035DLRunknownCLN10_1_Int * hbv_f_1035DLRunknownCLN10_2_Int) && 0 == hbv_f_1035DLRunknownCLN10_3_Int) && hbv_f_1035DLRunknownCLN10_1_Int == 0; [L0] hhv_g_1032DLRunknownCLN24_0_Int, hhv_g_1032DLRunknownCLN24_1_Int, hhv_g_1032DLRunknownCLN24_2_Int, hhv_g_1032DLRunknownCLN24_3_Int, hhv_g_1032DLRunknownCLN24_4_Int, hhv_g_1032DLRunknownCLN24_5_Int, hhv_g_1032DLRunknownCLN24_6_Int, hhv_g_1032DLRunknownCLN24_7_Int, hhv_g_1032DLRunknownCLN24_8_Int, hhv_g_1032DLRunknownCLN24_9_Int, hhv_g_1032DLRunknownCLN24_10_Int := hhv_f_1035DLRunknownCLN10_0_Int, hhv_f_1035DLRunknownCLN10_1_Int, hhv_f_1035DLRunknownCLN10_2_Int, hhv_f_1035DLRunknownCLN10_3_Int, hhv_f_1035DLRunknownCLN10_5_Int, hhv_f_1035DLRunknownCLN10_6_Int, hhv_f_1035DLRunknownCLN10_7_Int, hbv_f_1035DLRunknownCLN10_6_Int, hhv_f_1035DLRunknownCLN10_5_Int, hhv_f_1035DLRunknownCLN10_6_Int, hhv_f_1035DLRunknownCLN10_7_Int; [L0] havoc hbv_f_1035DLRunknownCLN10_2_Int, hbv_f_1035DLRunknownCLN10_1_Int, hbv_f_1035DLRunknownCLN10_3_Int, hbv_f_1035DLRunknownCLN10_6_Int, hbv_f_1035DLRunknownCLN10_5_Int, hbv_f_1035DLRunknownCLN10_4_Int; [L0] assume hbv_g_1032DLRunknownCLN24_2_Int == 1 && 0 == hbv_g_1032DLRunknownCLN24_1_Int; [L0] CALL call gotoProc(2, hbv_g_1032DLRunknownCLN24_3_Int, hbv_g_1032DLRunknownCLN24_4_Int, hbv_g_1032DLRunknownCLN24_5_Int, hbv_g_1032DLRunknownCLN24_1_Int, hhv_g_1032DLRunknownCLN24_4_Int, hhv_g_1032DLRunknownCLN24_5_Int, hhv_g_1032DLRunknownCLN24_6_Int, hhv_g_1032DLRunknownCLN24_7_Int, hhv_g_1032DLRunknownCLN24_8_Int, hhv_g_1032DLRunknownCLN24_9_Int, hhv_g_1032DLRunknownCLN24_10_Int, 0); [L0] assume ((((((((0 == hbv_g_1032DLRunknownCLN29_3_Int && hbv_g_1032DLRunknownCLN29_4_Int == 0) && hbv_g_1032DLRunknownCLN29_5_Int == hbv_g_1032DLRunknownCLN29_1_Int * hbv_g_1032DLRunknownCLN29_2_Int) && hhv_g_1032DLRunknownCLN29_7_Int == hbv_g_1032DLRunknownCLN29_5_Int + hbv_g_1032DLRunknownCLN29_4_Int) && hbv_g_1032DLRunknownCLN29_1_Int == 0) && !((hbv_g_1032DLRunknownCLN29_2_Int == 0 || !(0 == hbv_g_1032DLRunknownCLN29_3_Int)) && (!(hbv_g_1032DLRunknownCLN29_2_Int == 0) || 0 == hbv_g_1032DLRunknownCLN29_3_Int))) && hbv_g_1032DLRunknownCLN29_6_Int == hbv_g_1032DLRunknownCLN29_2_Int - 1) && hhv_g_1032DLRunknownCLN29_10_Int == hhv_g_1032DLRunknownCLN29_6_Int) && hhv_g_1032DLRunknownCLN29_9_Int == hhv_g_1032DLRunknownCLN29_5_Int) && hhv_g_1032DLRunknownCLN29_8_Int == hhv_g_1032DLRunknownCLN29_4_Int; [L0] hhv_f_1035DLRunknownCLN10_0_Int, hhv_f_1035DLRunknownCLN10_1_Int, hhv_f_1035DLRunknownCLN10_2_Int, hhv_f_1035DLRunknownCLN10_3_Int, hhv_f_1035DLRunknownCLN10_4_Int, hhv_f_1035DLRunknownCLN10_5_Int, hhv_f_1035DLRunknownCLN10_6_Int, hhv_f_1035DLRunknownCLN10_7_Int := hhv_g_1032DLRunknownCLN29_0_Int, hhv_g_1032DLRunknownCLN29_1_Int, hhv_g_1032DLRunknownCLN29_2_Int, hhv_g_1032DLRunknownCLN29_3_Int, hbv_g_1032DLRunknownCLN29_2_Int, hhv_g_1032DLRunknownCLN29_4_Int, hhv_g_1032DLRunknownCLN29_5_Int, hhv_g_1032DLRunknownCLN29_6_Int; [L0] havoc hbv_g_1032DLRunknownCLN29_5_Int, hbv_g_1032DLRunknownCLN29_4_Int, hbv_g_1032DLRunknownCLN29_2_Int, hbv_g_1032DLRunknownCLN29_3_Int, hbv_g_1032DLRunknownCLN29_6_Int, hbv_g_1032DLRunknownCLN29_1_Int; [L0] RET call gotoProc(2, hbv_g_1032DLRunknownCLN24_3_Int, hbv_g_1032DLRunknownCLN24_4_Int, hbv_g_1032DLRunknownCLN24_5_Int, hbv_g_1032DLRunknownCLN24_1_Int, hhv_g_1032DLRunknownCLN24_4_Int, hhv_g_1032DLRunknownCLN24_5_Int, hhv_g_1032DLRunknownCLN24_6_Int, hhv_g_1032DLRunknownCLN24_7_Int, hhv_g_1032DLRunknownCLN24_8_Int, hhv_g_1032DLRunknownCLN24_9_Int, hhv_g_1032DLRunknownCLN24_10_Int, 0); [L0] hhv_g_without_checking_1152DLRunknownCLN41_0_Int, hhv_g_without_checking_1152DLRunknownCLN41_1_Int, hhv_g_without_checking_1152DLRunknownCLN41_2_Int, hhv_g_without_checking_1152DLRunknownCLN41_3_Int, hhv_g_without_checking_1152DLRunknownCLN41_4_Int, hhv_g_without_checking_1152DLRunknownCLN41_5_Int, hhv_g_without_checking_1152DLRunknownCLN41_6_Int, hhv_g_without_checking_1152DLRunknownCLN41_7_Int, hhv_g_without_checking_1152DLRunknownCLN41_8_Int, hhv_g_without_checking_1152DLRunknownCLN41_9_Int, hhv_g_without_checking_1152DLRunknownCLN41_10_Int := hhv_g_1032DLRunknownCLN24_0_Int, hhv_g_1032DLRunknownCLN24_1_Int, hhv_g_1032DLRunknownCLN24_2_Int, hhv_g_1032DLRunknownCLN24_3_Int, hhv_g_1032DLRunknownCLN24_4_Int, hhv_g_1032DLRunknownCLN24_5_Int, hhv_g_1032DLRunknownCLN24_6_Int, hhv_g_1032DLRunknownCLN24_7_Int, hhv_g_1032DLRunknownCLN24_8_Int, hhv_g_1032DLRunknownCLN24_9_Int, hhv_g_1032DLRunknownCLN24_10_Int; [L0] havoc hbv_g_1032DLRunknownCLN24_3_Int, hbv_g_1032DLRunknownCLN24_2_Int, hbv_g_1032DLRunknownCLN24_5_Int, hbv_g_1032DLRunknownCLN24_1_Int, hbv_g_1032DLRunknownCLN24_4_Int; [L0] assume (hhv_g_without_checking_1152DLRunknownCLN41_1_Int == hhv_g_without_checking_1152DLRunknownCLN41_0_Int && hhv_g_without_checking_1152DLRunknownCLN41_7_Int == hhv_g_without_checking_1152DLRunknownCLN41_2_Int) && hhv_g_without_checking_1152DLRunknownCLN41_3_Int == 1; [L0] hhv_g_without_checking_1152DLRunknownCLN46_0_Int, hhv_g_without_checking_1152DLRunknownCLN46_1_Int, hhv_g_without_checking_1152DLRunknownCLN46_2_Int, hhv_g_without_checking_1152DLRunknownCLN46_3_Int, hhv_g_without_checking_1152DLRunknownCLN46_4_Int, hhv_g_without_checking_1152DLRunknownCLN46_5_Int, hhv_g_without_checking_1152DLRunknownCLN46_6_Int, hhv_g_without_checking_1152DLRunknownCLN46_7_Int, hhv_g_without_checking_1152DLRunknownCLN46_8_Int, hhv_g_without_checking_1152DLRunknownCLN46_9_Int, hhv_g_without_checking_1152DLRunknownCLN46_10_Int := hhv_g_without_checking_1152DLRunknownCLN41_0_Int, hbv_g_without_checking_1152DLRunknownCLN41_1_Int, hbv_g_without_checking_1152DLRunknownCLN41_2_Int, hbv_g_without_checking_1152DLRunknownCLN41_3_Int, hhv_g_without_checking_1152DLRunknownCLN41_4_Int, hhv_g_without_checking_1152DLRunknownCLN41_5_Int, hhv_g_without_checking_1152DLRunknownCLN41_6_Int, hhv_g_without_checking_1152DLRunknownCLN41_2_Int, hhv_g_without_checking_1152DLRunknownCLN41_8_Int, hhv_g_without_checking_1152DLRunknownCLN41_9_Int, hhv_g_without_checking_1152DLRunknownCLN41_10_Int; [L0] havoc hbv_g_without_checking_1152DLRunknownCLN41_1_Int, hbv_g_without_checking_1152DLRunknownCLN41_3_Int, hbv_g_without_checking_1152DLRunknownCLN41_2_Int; [L0] assume ((((((((0 == hbv_g_1032DLRunknownCLN29_3_Int && hbv_g_1032DLRunknownCLN29_4_Int == 0) && hbv_g_1032DLRunknownCLN29_5_Int == hbv_g_1032DLRunknownCLN29_1_Int * hbv_g_1032DLRunknownCLN29_2_Int) && hhv_g_1032DLRunknownCLN29_7_Int == hbv_g_1032DLRunknownCLN29_5_Int + hbv_g_1032DLRunknownCLN29_4_Int) && hbv_g_1032DLRunknownCLN29_1_Int == 0) && !((hbv_g_1032DLRunknownCLN29_2_Int == 0 || !(0 == hbv_g_1032DLRunknownCLN29_3_Int)) && (!(hbv_g_1032DLRunknownCLN29_2_Int == 0) || 0 == hbv_g_1032DLRunknownCLN29_3_Int))) && hbv_g_1032DLRunknownCLN29_6_Int == hbv_g_1032DLRunknownCLN29_2_Int - 1) && hhv_g_1032DLRunknownCLN29_10_Int == hhv_g_1032DLRunknownCLN29_6_Int) && hhv_g_1032DLRunknownCLN29_9_Int == hhv_g_1032DLRunknownCLN29_5_Int) && hhv_g_1032DLRunknownCLN29_8_Int == hhv_g_1032DLRunknownCLN29_4_Int; [L0] hhv_f_1035DLRunknownCLN10_0_Int, hhv_f_1035DLRunknownCLN10_1_Int, hhv_f_1035DLRunknownCLN10_2_Int, hhv_f_1035DLRunknownCLN10_3_Int, hhv_f_1035DLRunknownCLN10_4_Int, hhv_f_1035DLRunknownCLN10_5_Int, hhv_f_1035DLRunknownCLN10_6_Int, hhv_f_1035DLRunknownCLN10_7_Int := hhv_g_1032DLRunknownCLN29_0_Int, hhv_g_1032DLRunknownCLN29_1_Int, hhv_g_1032DLRunknownCLN29_2_Int, hhv_g_1032DLRunknownCLN29_3_Int, hbv_g_1032DLRunknownCLN29_2_Int, hhv_g_1032DLRunknownCLN29_4_Int, hhv_g_1032DLRunknownCLN29_5_Int, hhv_g_1032DLRunknownCLN29_6_Int; [L0] havoc hbv_g_1032DLRunknownCLN29_5_Int, hbv_g_1032DLRunknownCLN29_4_Int, hbv_g_1032DLRunknownCLN29_2_Int, hbv_g_1032DLRunknownCLN29_3_Int, hbv_g_1032DLRunknownCLN29_6_Int, hbv_g_1032DLRunknownCLN29_1_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. UNSAFE Result, 3.7s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 422 SDtfs, 128 SDslu, 226 SDs, 0 SdLazy, 304 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=4, 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 112 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 2 NumberOfNonLiveVariables, 291 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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/x_plus_2_pow_n01.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-32-52-954.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/x_plus_2_pow_n01.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-32-52-954.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/x_plus_2_pow_n01.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-32-52-954.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/x_plus_2_pow_n01.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-32-52-954.csv Received shutdown request...