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-14921ce [2018-06-24 21:30:09,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:30:09,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:30:09,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:30:09,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:30:09,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:30:09,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:30:09,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:30:09,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:30:09,748 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:30:09,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:30:09,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:30:09,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:30:09,752 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:30:09,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:30:09,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:30:09,757 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:30:09,766 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:30:09,768 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:30:09,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:30:09,769 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:30:09,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:30:09,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:30:09,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:30:09,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:30:09,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:30:09,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:30:09,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:30:09,780 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:30:09,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:30:09,782 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:30:09,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:30:09,783 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:30:09,784 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:30:09,785 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:30:09,785 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:30:09,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:30:09,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:30:09,803 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:30:09,803 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:30:09,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:30:09,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:30:09,807 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:30:09,807 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:30:09,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:30:09,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:30:09,808 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:30:09,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:30:09,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:30:09,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:30:09,808 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:30:09,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:30:09,809 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:30:09,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:30:09,810 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:30:09,810 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:30:09,810 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:30:09,812 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:30:09,812 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:30:09,862 INFO ]: Repository-Root is: /tmp [2018-06-24 21:30:09,879 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:30:09,882 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:30:09,884 INFO ]: Initializing SmtParser... [2018-06-24 21:30:09,886 INFO ]: SmtParser initialized [2018-06-24 21:30:09,887 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 [2018-06-24 21:30:09,888 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-24 21:30:09,973 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 unknown [2018-06-24 21:30:10,506 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 [2018-06-24 21:30:10,510 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:30:10,516 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:30:10,517 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:30:10,517 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:30:10,517 INFO ]: ChcToBoogie initialized [2018-06-24 21:30:10,520 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:30:10" (1/1) ... [2018-06-24 21:30:10,610 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:30:10 Unit [2018-06-24 21:30:10,611 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:30:10,611 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:30:10,611 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:30:10,611 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:30:10,632 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:30:10" (1/1) ... [2018-06-24 21:30:10,632 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:30:10" (1/1) ... [2018-06-24 21:30:10,654 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:30:10" (1/1) ... [2018-06-24 21:30:10,654 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:30:10" (1/1) ... [2018-06-24 21:30:10,673 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:30:10" (1/1) ... [2018-06-24 21:30:10,686 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:30:10" (1/1) ... [2018-06-24 21:30:10,688 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:30:10" (1/1) ... [2018-06-24 21:30:10,702 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:30:10,703 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:30:10,703 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:30:10,703 INFO ]: RCFGBuilder initialized [2018-06-24 21:30:10,704 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:30:10" (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-24 21:30:10,736 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:30:10,736 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:30:10,737 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:30:10,737 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:30:10,737 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:30:10,737 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-24 21:30:11,996 INFO ]: Using library mode [2018-06-24 21:30:11,997 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:30:11 BoogieIcfgContainer [2018-06-24 21:30:11,997 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:30:12,000 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:30:12,000 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:30:12,001 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:30:12,001 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:30:11" (1/1) ... [2018-06-24 21:30:12,044 INFO ]: Initial Icfg 75 locations, 123 edges [2018-06-24 21:30:12,046 INFO ]: Using Remove infeasible edges [2018-06-24 21:30:12,046 INFO ]: Using Maximize final states [2018-06-24 21:30:12,047 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:30:12,047 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:30:12,050 INFO ]: Using Remove sink states [2018-06-24 21:30:12,051 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:30:12,051 INFO ]: Using Use SBE [2018-06-24 21:30:12,125 INFO ]: SBE split 5 edges [2018-06-24 21:30:12,131 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-24 21:30:12,133 INFO ]: 0 new accepting states [2018-06-24 21:30:13,381 INFO ]: Removed 98 edges and 20 locations by large block encoding [2018-06-24 21:30:13,383 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 21:30:13,386 INFO ]: Removed 3 edges and 0 locations because of local infeasibility [2018-06-24 21:30:13,386 INFO ]: 0 new accepting states [2018-06-24 21:30:13,387 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:30:13,388 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:30:13,389 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:30:13,389 INFO ]: 0 new accepting states [2018-06-24 21:30:13,390 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:30:13,391 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:30:13,391 INFO ]: Encoded RCFG 52 locations, 107 edges [2018-06-24 21:30:13,391 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:30:13 BasicIcfg [2018-06-24 21:30:13,392 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:30:13,395 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:30:13,395 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:30:13,398 INFO ]: TraceAbstraction initialized [2018-06-24 21:30:13,398 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:30:10" (1/4) ... [2018-06-24 21:30:13,399 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64471b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:30:13, skipping insertion in model container [2018-06-24 21:30:13,399 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:30:10" (2/4) ... [2018-06-24 21:30:13,400 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64471b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:30:13, skipping insertion in model container [2018-06-24 21:30:13,400 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:30:11" (3/4) ... [2018-06-24 21:30:13,400 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64471b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:30:13, skipping insertion in model container [2018-06-24 21:30:13,400 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:30:13" (4/4) ... [2018-06-24 21:30:13,402 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:30:13,414 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:30:13,424 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:30:13,485 INFO ]: Using default assertion order modulation [2018-06-24 21:30:13,486 INFO ]: Interprodecural is true [2018-06-24 21:30:13,486 INFO ]: Hoare is false [2018-06-24 21:30:13,486 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:30:13,486 INFO ]: Backedges is TWOTRACK [2018-06-24 21:30:13,486 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:30:13,486 INFO ]: Difference is false [2018-06-24 21:30:13,486 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:30:13,486 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:30:13,503 INFO ]: Start isEmpty. Operand 52 states. [2018-06-24 21:30:13,527 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 21:30:13,527 INFO ]: Found error trace [2018-06-24 21:30:13,528 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 21:30:13,528 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:30:13,535 INFO ]: Analyzing trace with hash 2979789, now seen corresponding path program 1 times [2018-06-24 21:30:13,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:30:13,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:30:13,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:30:13,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:30:13,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:30:13,634 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:30:13,721 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:30:13,724 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:30:13,724 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:30:13,726 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:30:13,742 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:30:13,743 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:30:13,745 INFO ]: Start difference. First operand 52 states. Second operand 3 states. [2018-06-24 21:30:15,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:30:15,145 INFO ]: Finished difference Result 83 states and 170 transitions. [2018-06-24 21:30:15,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:30:15,164 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 21:30:15,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:30:15,190 INFO ]: With dead ends: 83 [2018-06-24 21:30:15,190 INFO ]: Without dead ends: 82 [2018-06-24 21:30:15,193 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-24 21:30:15,215 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-24 21:30:15,265 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-06-24 21:30:15,266 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-24 21:30:15,274 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 167 transitions. [2018-06-24 21:30:15,275 INFO ]: Start accepts. Automaton has 82 states and 167 transitions. Word has length 4 [2018-06-24 21:30:15,276 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:30:15,276 INFO ]: Abstraction has 82 states and 167 transitions. [2018-06-24 21:30:15,276 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:30:15,276 INFO ]: Start isEmpty. Operand 82 states and 167 transitions. [2018-06-24 21:30:15,306 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:30:15,306 INFO ]: Found error trace [2018-06-24 21:30:15,306 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:30:15,307 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:30:15,307 INFO ]: Analyzing trace with hash 92979361, now seen corresponding path program 1 times [2018-06-24 21:30:15,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:30:15,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:30:15,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:30:15,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:30:15,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:30:15,324 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:30:15,397 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:30:15,397 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:30:15,397 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:30:15,398 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:30:15,398 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:30:15,398 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:30:15,399 INFO ]: Start difference. First operand 82 states and 167 transitions. Second operand 3 states. [2018-06-24 21:30:15,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:30:15,875 INFO ]: Finished difference Result 113 states and 236 transitions. [2018-06-24 21:30:15,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:30:15,875 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:30:15,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:30:15,883 INFO ]: With dead ends: 113 [2018-06-24 21:30:15,883 INFO ]: Without dead ends: 113 [2018-06-24 21:30:15,884 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-24 21:30:15,884 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-24 21:30:15,905 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-06-24 21:30:15,905 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-24 21:30:15,915 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 236 transitions. [2018-06-24 21:30:15,915 INFO ]: Start accepts. Automaton has 113 states and 236 transitions. Word has length 5 [2018-06-24 21:30:15,915 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:30:15,915 INFO ]: Abstraction has 113 states and 236 transitions. [2018-06-24 21:30:15,915 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:30:15,916 INFO ]: Start isEmpty. Operand 113 states and 236 transitions. [2018-06-24 21:30:15,919 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:30:15,924 INFO ]: Found error trace [2018-06-24 21:30:15,924 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:30:15,924 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:30:15,924 INFO ]: Analyzing trace with hash 93009152, now seen corresponding path program 1 times [2018-06-24 21:30:15,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:30:15,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:30:15,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:30:15,925 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:30:15,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:30:15,942 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-24 21:30:15,942 INFO ]: Advancing trace checker [2018-06-24 21:30:15,942 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-24 21:30:15,959 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:30:15,984 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:30:15,991 INFO ]: Computing forward predicates... [2018-06-24 21:30:16,064 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:30:16,095 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:30:16,095 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:30:16,096 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:30:16,096 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:30:16,096 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:30:16,096 INFO ]: Start difference. First operand 113 states and 236 transitions. Second operand 3 states. [2018-06-24 21:30:17,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:30:17,133 INFO ]: Finished difference Result 144 states and 306 transitions. [2018-06-24 21:30:17,134 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:30:17,134 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:30:17,134 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:30:17,140 INFO ]: With dead ends: 144 [2018-06-24 21:30:17,140 INFO ]: Without dead ends: 144 [2018-06-24 21:30:17,140 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-24 21:30:17,140 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-24 21:30:17,162 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-06-24 21:30:17,162 INFO ]: Start removeUnreachable. Operand 144 states. [2018-06-24 21:30:17,166 INFO ]: Finished removeUnreachable. Reduced from 144 states to 144 states and 306 transitions. [2018-06-24 21:30:17,167 INFO ]: Start accepts. Automaton has 144 states and 306 transitions. Word has length 5 [2018-06-24 21:30:17,167 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:30:17,167 INFO ]: Abstraction has 144 states and 306 transitions. [2018-06-24 21:30:17,167 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:30:17,167 INFO ]: Start isEmpty. Operand 144 states and 306 transitions. [2018-06-24 21:30:17,169 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:30:17,169 INFO ]: Found error trace [2018-06-24 21:30:17,169 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:30:17,169 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:30:17,170 INFO ]: Analyzing trace with hash 93128316, now seen corresponding path program 1 times [2018-06-24 21:30:17,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:30:17,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:30:17,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:30:17,170 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:30:17,170 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:30:17,175 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-24 21:30:17,175 INFO ]: Advancing trace checker [2018-06-24 21:30:17,175 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-24 21:30:17,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:30:17,222 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:30:17,223 INFO ]: Computing forward predicates... [2018-06-24 21:30:17,257 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:30:17,276 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:30:17,276 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:30:17,276 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:30:17,276 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:30:17,276 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:30:17,276 INFO ]: Start difference. First operand 144 states and 306 transitions. Second operand 3 states. [2018-06-24 21:30:17,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:30:17,413 INFO ]: Finished difference Result 260 states and 538 transitions. [2018-06-24 21:30:17,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:30:17,413 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:30:17,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:30:17,431 INFO ]: With dead ends: 260 [2018-06-24 21:30:17,431 INFO ]: Without dead ends: 260 [2018-06-24 21:30:17,432 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-24 21:30:17,432 INFO ]: Start minimizeSevpa. Operand 260 states. [2018-06-24 21:30:17,476 INFO ]: Finished minimizeSevpa. Reduced states from 260 to 148. [2018-06-24 21:30:17,476 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-24 21:30:17,481 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 310 transitions. [2018-06-24 21:30:17,481 INFO ]: Start accepts. Automaton has 148 states and 310 transitions. Word has length 5 [2018-06-24 21:30:17,481 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:30:17,481 INFO ]: Abstraction has 148 states and 310 transitions. [2018-06-24 21:30:17,481 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:30:17,481 INFO ]: Start isEmpty. Operand 148 states and 310 transitions. [2018-06-24 21:30:17,494 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:30:17,494 INFO ]: Found error trace [2018-06-24 21:30:17,494 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:30:17,494 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:30:17,495 INFO ]: Analyzing trace with hash -1914732547, now seen corresponding path program 1 times [2018-06-24 21:30:17,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:30:17,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:30:17,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:30:17,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:30:17,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:30:17,509 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-24 21:30:17,509 INFO ]: Advancing trace checker [2018-06-24 21:30:17,509 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-24 21:30:17,522 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:30:17,594 INFO ]: Conjunction of SSA is sat [2018-06-24 21:30:17,626 INFO ]: Counterexample might be feasible [2018-06-24 21:30:17,638 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:30:17,640 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:30:17 BasicIcfg [2018-06-24 21:30:17,640 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:30:17,641 INFO ]: Toolchain (without parser) took 7129.96 ms. Allocated memory was 303.6 MB in the beginning and 368.1 MB in the end (delta: 64.5 MB). Free memory was 234.0 MB in the beginning and 184.7 MB in the end (delta: 49.2 MB). Peak memory consumption was 113.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:30:17,642 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:30:17,643 INFO ]: ChcToBoogie took 94.28 ms. Allocated memory is still 303.6 MB. Free memory was 234.0 MB in the beginning and 228.0 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:30:17,643 INFO ]: Boogie Preprocessor took 91.29 ms. Allocated memory is still 303.6 MB. Free memory was 228.0 MB in the beginning and 226.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:30:17,644 INFO ]: RCFGBuilder took 1293.63 ms. Allocated memory was 303.6 MB in the beginning and 327.7 MB in the end (delta: 24.1 MB). Free memory was 226.0 MB in the beginning and 287.7 MB in the end (delta: -61.6 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:30:17,644 INFO ]: BlockEncodingV2 took 1391.85 ms. Allocated memory is still 327.7 MB. Free memory was 287.7 MB in the beginning and 227.8 MB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 3.6 GB. [2018-06-24 21:30:17,645 INFO ]: TraceAbstraction took 4245.02 ms. Allocated memory was 327.7 MB in the beginning and 368.1 MB in the end (delta: 40.4 MB). Free memory was 226.2 MB in the beginning and 184.7 MB in the end (delta: 41.5 MB). Peak memory consumption was 81.8 MB. Max. memory is 3.6 GB. [2018-06-24 21:30:17,648 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.09 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 94.28 ms. Allocated memory is still 303.6 MB. Free memory was 234.0 MB in the beginning and 228.0 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 91.29 ms. Allocated memory is still 303.6 MB. Free memory was 228.0 MB in the beginning and 226.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1293.63 ms. Allocated memory was 303.6 MB in the beginning and 327.7 MB in the end (delta: 24.1 MB). Free memory was 226.0 MB in the beginning and 287.7 MB in the end (delta: -61.6 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1391.85 ms. Allocated memory is still 327.7 MB. Free memory was 287.7 MB in the beginning and 227.8 MB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4245.02 ms. Allocated memory was 327.7 MB in the beginning and 368.1 MB in the end (delta: 40.4 MB). Free memory was 226.2 MB in the beginning and 184.7 MB in the end (delta: 41.5 MB). Peak memory consumption was 81.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 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_3_Int, hbv_g_1032DLRunknownCLN29_2_Int, hbv_g_1032DLRunknownCLN29_5_Int, hbv_g_1032DLRunknownCLN29_1_Int, hbv_g_1032DLRunknownCLN29_4_Int, hbv_g_1032DLRunknownCLN29_6_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_5_Int, hbv_f_1035DLRunknownCLN10_3_Int, hbv_f_1035DLRunknownCLN10_4_Int, hbv_f_1035DLRunknownCLN10_2_Int, hbv_f_1035DLRunknownCLN10_6_Int, hbv_f_1035DLRunknownCLN10_1_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_3_Int, hbv_g_1032DLRunknownCLN29_2_Int, hbv_g_1032DLRunknownCLN29_5_Int, hbv_g_1032DLRunknownCLN29_1_Int, hbv_g_1032DLRunknownCLN29_4_Int, hbv_g_1032DLRunknownCLN29_6_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_5_Int, hbv_g_1032DLRunknownCLN24_4_Int, hbv_g_1032DLRunknownCLN24_2_Int, hbv_g_1032DLRunknownCLN24_3_Int, hbv_g_1032DLRunknownCLN24_1_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_2_Int, hbv_g_without_checking_1152DLRunknownCLN41_1_Int, hbv_g_without_checking_1152DLRunknownCLN41_3_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_3_Int, hbv_g_1032DLRunknownCLN29_2_Int, hbv_g_1032DLRunknownCLN29_5_Int, hbv_g_1032DLRunknownCLN29_1_Int, hbv_g_1032DLRunknownCLN29_4_Int, hbv_g_1032DLRunknownCLN29_6_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, 4.1s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 3.1s 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.7s 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-24_21-30-17-660.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-24_21-30-17-660.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-24_21-30-17-660.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-24_21-30-17-660.csv Received shutdown request...