java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:58:35,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:58:35,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:58:35,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:58:35,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:58:35,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:58:35,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:58:35,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:58:35,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:58:35,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:58:35,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:58:35,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:58:35,511 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:58:35,512 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:58:35,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:58:35,517 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:58:35,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:58:35,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:58:35,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:58:35,524 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:58:35,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:58:35,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:58:35,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:58:35,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:58:35,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:58:35,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:58:35,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:58:35,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:58:35,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:58:35,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:58:35,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:58:35,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:58:35,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:58:35,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:58:35,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:58:35,538 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:58:35,565 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:58:35,566 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:58:35,566 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:58:35,566 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:58:35,567 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:58:35,568 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:58:35,568 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:58:35,568 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:58:35,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:58:35,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:58:35,569 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:58:35,569 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:58:35,569 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:58:35,570 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:58:35,570 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:58:35,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:58:35,570 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:58:35,572 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:58:35,572 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:58:35,642 INFO ]: Repository-Root is: /tmp [2018-06-22 01:58:35,662 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:58:35,665 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:58:35,667 INFO ]: Initializing SmtParser... [2018-06-22 01:58:35,667 INFO ]: SmtParser initialized [2018-06-22 01:58:35,667 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 [2018-06-22 01:58:35,669 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:58:35,769 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 unknown [2018-06-22 01:58:36,337 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/x_plus_2_pow_n01.smt2 [2018-06-22 01:58:36,342 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:58:36,349 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:58:36,349 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:58:36,349 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:58:36,349 INFO ]: ChcToBoogie initialized [2018-06-22 01:58:36,353 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:58:36" (1/1) ... [2018-06-22 01:58:36,447 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:58:36 Unit [2018-06-22 01:58:36,448 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:58:36,448 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:58:36,448 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:58:36,448 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:58:36,470 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:58:36" (1/1) ... [2018-06-22 01:58:36,471 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:58:36" (1/1) ... [2018-06-22 01:58:36,496 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:58:36" (1/1) ... [2018-06-22 01:58:36,496 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:58:36" (1/1) ... [2018-06-22 01:58:36,517 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:58:36" (1/1) ... [2018-06-22 01:58:36,531 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:58:36" (1/1) ... [2018-06-22 01:58:36,534 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:58:36" (1/1) ... [2018-06-22 01:58:36,553 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:58:36,553 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:58:36,553 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:58:36,553 INFO ]: RCFGBuilder initialized [2018-06-22 01:58:36,554 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:58:36" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:58:36,581 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:58:36,581 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:58:36,581 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:58:36,581 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:58:36,581 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:58:36,581 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:58:38,280 INFO ]: Using library mode [2018-06-22 01:58:38,281 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:58:38 BoogieIcfgContainer [2018-06-22 01:58:38,281 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:58:38,282 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:58:38,282 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:58:38,286 INFO ]: TraceAbstraction initialized [2018-06-22 01:58:38,286 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:58:36" (1/3) ... [2018-06-22 01:58:38,287 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b10fe28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:58:38, skipping insertion in model container [2018-06-22 01:58:38,287 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:58:36" (2/3) ... [2018-06-22 01:58:38,287 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b10fe28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:58:38, skipping insertion in model container [2018-06-22 01:58:38,287 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:58:38" (3/3) ... [2018-06-22 01:58:38,289 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:58:38,299 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:58:38,308 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:58:38,367 INFO ]: Using default assertion order modulation [2018-06-22 01:58:38,368 INFO ]: Interprodecural is true [2018-06-22 01:58:38,368 INFO ]: Hoare is false [2018-06-22 01:58:38,368 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:58:38,368 INFO ]: Backedges is TWOTRACK [2018-06-22 01:58:38,368 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:58:38,368 INFO ]: Difference is false [2018-06-22 01:58:38,368 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:58:38,368 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:58:38,385 INFO ]: Start isEmpty. Operand 75 states. [2018-06-22 01:58:38,396 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:58:38,396 INFO ]: Found error trace [2018-06-22 01:58:38,397 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:58:38,398 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:58:38,402 INFO ]: Analyzing trace with hash -1616761001, now seen corresponding path program 1 times [2018-06-22 01:58:38,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:58:38,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:58:38,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:38,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:58:38,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:38,478 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:58:38,607 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:58:38,609 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:58:38,610 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:58:38,612 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:58:38,628 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:58:38,628 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:58:38,631 INFO ]: Start difference. First operand 75 states. Second operand 4 states. [2018-06-22 01:58:39,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:58:39,869 INFO ]: Finished difference Result 142 states and 234 transitions. [2018-06-22 01:58:39,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:58:39,870 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:58:39,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:58:39,897 INFO ]: With dead ends: 142 [2018-06-22 01:58:39,897 INFO ]: Without dead ends: 138 [2018-06-22 01:58:39,899 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:58:39,918 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-22 01:58:40,004 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-06-22 01:58:40,005 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 01:58:40,014 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 228 transitions. [2018-06-22 01:58:40,016 INFO ]: Start accepts. Automaton has 138 states and 228 transitions. Word has length 8 [2018-06-22 01:58:40,016 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:58:40,016 INFO ]: Abstraction has 138 states and 228 transitions. [2018-06-22 01:58:40,016 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:58:40,016 INFO ]: Start isEmpty. Operand 138 states and 228 transitions. [2018-06-22 01:58:40,023 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:58:40,023 INFO ]: Found error trace [2018-06-22 01:58:40,023 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:58:40,023 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:58:40,023 INFO ]: Analyzing trace with hash 428970446, now seen corresponding path program 1 times [2018-06-22 01:58:40,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:58:40,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:58:40,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:40,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:58:40,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:40,042 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:58:40,042 INFO ]: Advancing trace checker [2018-06-22 01:58:40,042 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-22 01:58:40,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:58:40,104 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:58:40,115 INFO ]: Computing forward predicates... [2018-06-22 01:58:40,145 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:58:40,168 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:58:40,168 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:58:40,169 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:58:40,169 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:58:40,169 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:58:40,170 INFO ]: Start difference. First operand 138 states and 228 transitions. Second operand 4 states. [2018-06-22 01:58:41,016 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:58:41,016 INFO ]: Finished difference Result 184 states and 306 transitions. [2018-06-22 01:58:41,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:58:41,017 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-22 01:58:41,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:58:41,028 INFO ]: With dead ends: 184 [2018-06-22 01:58:41,028 INFO ]: Without dead ends: 184 [2018-06-22 01:58:41,029 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:58:41,029 INFO ]: Start minimizeSevpa. Operand 184 states. [2018-06-22 01:58:41,056 INFO ]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-06-22 01:58:41,056 INFO ]: Start removeUnreachable. Operand 184 states. [2018-06-22 01:58:41,065 INFO ]: Finished removeUnreachable. Reduced from 184 states to 184 states and 306 transitions. [2018-06-22 01:58:41,065 INFO ]: Start accepts. Automaton has 184 states and 306 transitions. Word has length 16 [2018-06-22 01:58:41,065 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:58:41,065 INFO ]: Abstraction has 184 states and 306 transitions. [2018-06-22 01:58:41,065 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:58:41,066 INFO ]: Start isEmpty. Operand 184 states and 306 transitions. [2018-06-22 01:58:41,069 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:58:41,069 INFO ]: Found error trace [2018-06-22 01:58:41,069 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:58:41,069 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:58:41,069 INFO ]: Analyzing trace with hash -2025176765, now seen corresponding path program 1 times [2018-06-22 01:58:41,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:58:41,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:58:41,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:41,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:58:41,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:41,078 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:58:41,181 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:58:41,182 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:58:41,182 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:58:41,182 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:58:41,182 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:58:41,182 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:58:41,182 INFO ]: Start difference. First operand 184 states and 306 transitions. Second operand 4 states. [2018-06-22 01:58:41,574 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:58:41,574 INFO ]: Finished difference Result 230 states and 384 transitions. [2018-06-22 01:58:41,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:58:41,576 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-22 01:58:41,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:58:41,589 INFO ]: With dead ends: 230 [2018-06-22 01:58:41,589 INFO ]: Without dead ends: 230 [2018-06-22 01:58:41,589 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:58:41,589 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-22 01:58:41,616 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-06-22 01:58:41,617 INFO ]: Start removeUnreachable. Operand 230 states. [2018-06-22 01:58:41,625 INFO ]: Finished removeUnreachable. Reduced from 230 states to 230 states and 384 transitions. [2018-06-22 01:58:41,625 INFO ]: Start accepts. Automaton has 230 states and 384 transitions. Word has length 16 [2018-06-22 01:58:41,625 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:58:41,625 INFO ]: Abstraction has 230 states and 384 transitions. [2018-06-22 01:58:41,625 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:58:41,625 INFO ]: Start isEmpty. Operand 230 states and 384 transitions. [2018-06-22 01:58:41,628 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:58:41,628 INFO ]: Found error trace [2018-06-22 01:58:41,629 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:58:41,629 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:58:41,629 INFO ]: Analyzing trace with hash -1451572850, now seen corresponding path program 1 times [2018-06-22 01:58:41,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:58:41,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:58:41,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:41,630 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:58:41,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:41,638 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:58:41,638 INFO ]: Advancing trace checker [2018-06-22 01:58:41,638 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-22 01:58:41,658 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:58:41,682 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:58:41,684 INFO ]: Computing forward predicates... [2018-06-22 01:58:41,725 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:58:41,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:58:41,754 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:58:41,754 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:58:41,754 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:58:41,754 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:58:41,755 INFO ]: Start difference. First operand 230 states and 384 transitions. Second operand 4 states. [2018-06-22 01:58:42,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:58:42,645 INFO ]: Finished difference Result 276 states and 462 transitions. [2018-06-22 01:58:42,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:58:42,645 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-22 01:58:42,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:58:42,662 INFO ]: With dead ends: 276 [2018-06-22 01:58:42,662 INFO ]: Without dead ends: 276 [2018-06-22 01:58:42,662 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:58:42,663 INFO ]: Start minimizeSevpa. Operand 276 states. [2018-06-22 01:58:42,692 INFO ]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-06-22 01:58:42,692 INFO ]: Start removeUnreachable. Operand 276 states. [2018-06-22 01:58:42,702 INFO ]: Finished removeUnreachable. Reduced from 276 states to 276 states and 462 transitions. [2018-06-22 01:58:42,702 INFO ]: Start accepts. Automaton has 276 states and 462 transitions. Word has length 18 [2018-06-22 01:58:42,702 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:58:42,702 INFO ]: Abstraction has 276 states and 462 transitions. [2018-06-22 01:58:42,702 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:58:42,702 INFO ]: Start isEmpty. Operand 276 states and 462 transitions. [2018-06-22 01:58:42,707 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:58:42,707 INFO ]: Found error trace [2018-06-22 01:58:42,707 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:58:42,707 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:58:42,707 INFO ]: Analyzing trace with hash 587768826, now seen corresponding path program 1 times [2018-06-22 01:58:42,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:58:42,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:58:42,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:42,710 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:58:42,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:42,738 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:58:42,738 INFO ]: Advancing trace checker [2018-06-22 01:58:42,738 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) [2018-06-22 01:58:42,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:58:42,795 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:58:42,797 INFO ]: Computing forward predicates... [2018-06-22 01:58:42,808 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:58:42,832 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:58:42,832 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:58:42,832 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:58:42,832 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:58:42,832 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:58:42,833 INFO ]: Start difference. First operand 276 states and 462 transitions. Second operand 4 states. [2018-06-22 01:58:43,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:58:43,032 INFO ]: Finished difference Result 436 states and 737 transitions. [2018-06-22 01:58:43,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:58:43,032 INFO ]: Start accepts. Automaton has 4 states. Word has length 20 [2018-06-22 01:58:43,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:58:43,070 INFO ]: With dead ends: 436 [2018-06-22 01:58:43,070 INFO ]: Without dead ends: 436 [2018-06-22 01:58:43,070 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:58:43,071 INFO ]: Start minimizeSevpa. Operand 436 states. [2018-06-22 01:58:43,122 INFO ]: Finished minimizeSevpa. Reduced states from 436 to 286. [2018-06-22 01:58:43,123 INFO ]: Start removeUnreachable. Operand 286 states. [2018-06-22 01:58:43,132 INFO ]: Finished removeUnreachable. Reduced from 286 states to 286 states and 472 transitions. [2018-06-22 01:58:43,132 INFO ]: Start accepts. Automaton has 286 states and 472 transitions. Word has length 20 [2018-06-22 01:58:43,132 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:58:43,132 INFO ]: Abstraction has 286 states and 472 transitions. [2018-06-22 01:58:43,132 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:58:43,132 INFO ]: Start isEmpty. Operand 286 states and 472 transitions. [2018-06-22 01:58:43,152 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:58:43,152 INFO ]: Found error trace [2018-06-22 01:58:43,153 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:58:43,153 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:58:43,153 INFO ]: Analyzing trace with hash 768896695, now seen corresponding path program 1 times [2018-06-22 01:58:43,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:58:43,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:58:43,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:43,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:58:43,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:43,170 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:58:43,170 INFO ]: Advancing trace checker [2018-06-22 01:58:43,170 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-06-22 01:58:43,189 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:58:43,274 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:58:43,278 INFO ]: Computing forward predicates... [2018-06-22 01:58:43,475 INFO ]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 01:58:43,502 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:58:43,502 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:58:43,502 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:58:43,502 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:58:43,502 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:58:43,502 INFO ]: Start difference. First operand 286 states and 472 transitions. Second operand 6 states. [2018-06-22 01:58:45,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:58:45,420 INFO ]: Finished difference Result 879 states and 1974 transitions. [2018-06-22 01:58:45,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:58:45,420 INFO ]: Start accepts. Automaton has 6 states. Word has length 43 [2018-06-22 01:58:45,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:58:45,490 INFO ]: With dead ends: 879 [2018-06-22 01:58:45,491 INFO ]: Without dead ends: 658 [2018-06-22 01:58:45,491 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:58:45,491 INFO ]: Start minimizeSevpa. Operand 658 states. [2018-06-22 01:58:45,558 INFO ]: Finished minimizeSevpa. Reduced states from 658 to 340. [2018-06-22 01:58:45,559 INFO ]: Start removeUnreachable. Operand 340 states. [2018-06-22 01:58:45,565 INFO ]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-06-22 01:58:45,565 INFO ]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 43 [2018-06-22 01:58:45,565 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:58:45,565 INFO ]: Abstraction has 340 states and 562 transitions. [2018-06-22 01:58:45,565 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:58:45,565 INFO ]: Start isEmpty. Operand 340 states and 562 transitions. [2018-06-22 01:58:45,572 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:58:45,572 INFO ]: Found error trace [2018-06-22 01:58:45,572 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:58:45,572 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:58:45,572 INFO ]: Analyzing trace with hash 1442903739, now seen corresponding path program 1 times [2018-06-22 01:58:45,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:58:45,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:58:45,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:45,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:58:45,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:58:45,585 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:58:45,585 INFO ]: Advancing trace checker [2018-06-22 01:58:45,585 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:58:45,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:58:45,670 INFO ]: Conjunction of SSA is sat [2018-06-22 01:58:45,706 INFO ]: Counterexample might be feasible [2018-06-22 01:58:45,729 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:58:45 BoogieIcfgContainer [2018-06-22 01:58:45,729 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:58:45,739 INFO ]: Toolchain (without parser) took 9386.95 ms. Allocated memory was 305.7 MB in the beginning and 395.3 MB in the end (delta: 89.7 MB). Free memory was 236.1 MB in the beginning and 179.2 MB in the end (delta: 57.0 MB). Peak memory consumption was 146.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:58:45,741 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 305.7 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:58:45,741 INFO ]: ChcToBoogie took 98.67 ms. Allocated memory is still 305.7 MB. Free memory was 236.1 MB in the beginning and 232.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:58:45,742 INFO ]: Boogie Preprocessor took 104.34 ms. Allocated memory is still 305.7 MB. Free memory was 232.2 MB in the beginning and 230.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:58:45,742 INFO ]: RCFGBuilder took 1727.60 ms. Allocated memory was 305.7 MB in the beginning and 323.5 MB in the end (delta: 17.8 MB). Free memory was 230.2 MB in the beginning and 280.9 MB in the end (delta: -50.8 MB). Peak memory consumption was 51.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:58:45,743 INFO ]: TraceAbstraction took 7446.52 ms. Allocated memory was 323.5 MB in the beginning and 395.3 MB in the end (delta: 71.8 MB). Free memory was 278.7 MB in the beginning and 179.2 MB in the end (delta: 99.5 MB). Peak memory consumption was 171.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:58:45,745 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 305.7 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 98.67 ms. Allocated memory is still 305.7 MB. Free memory was 236.1 MB in the beginning and 232.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 104.34 ms. Allocated memory is still 305.7 MB. Free memory was 232.2 MB in the beginning and 230.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1727.60 ms. Allocated memory was 305.7 MB in the beginning and 323.5 MB in the end (delta: 17.8 MB). Free memory was 230.2 MB in the beginning and 280.9 MB in the end (delta: -50.8 MB). Peak memory consumption was 51.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7446.52 ms. Allocated memory was 323.5 MB in the beginning and 395.3 MB in the end (delta: 71.8 MB). Free memory was 278.7 MB in the beginning and 179.2 MB in the end (delta: 99.5 MB). Peak memory consumption was 171.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 14) [L0] COND FALSE !(gotoSwitch == 13) [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 10) [L0] COND FALSE !(gotoSwitch == 9) [L0] COND FALSE !(gotoSwitch == 8) [L0] COND FALSE !(gotoSwitch == 7) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND FALSE !(gotoSwitch == 5) [L0] COND FALSE !(gotoSwitch == 3) [L0] COND FALSE !(gotoSwitch == 2) [L0] assume true; [L0] hhv_failDLRunknownCLN12_0_Int := hbv_False_1_Int; [L0] havoc hbv_False_1_Int; [L0] assume (((((((((((((((((((hbv_failDLRunknownCLN12_5_Int == hbv_failDLRunknownCLN12_9_Int + hbv_failDLRunknownCLN12_10_Int && hbv_failDLRunknownCLN12_16_Int == 0) && 0 == hbv_failDLRunknownCLN12_3_Int) && hbv_failDLRunknownCLN12_6_Int == hbv_failDLRunknownCLN12_5_Int + hbv_failDLRunknownCLN12_4_Int) && hbv_failDLRunknownCLN12_15_Int == hbv_failDLRunknownCLN12_19_Int + hbv_failDLRunknownCLN12_20_Int) && hbv_failDLRunknownCLN12_1_Int == -4 * hbv_failDLRunknownCLN12_2_Int) && hbv_failDLRunknownCLN12_13_Int == hbv_failDLRunknownCLN12_11_Int + hbv_failDLRunknownCLN12_12_Int) && hbv_failDLRunknownCLN12_12_Int == 0) && hbv_failDLRunknownCLN12_11_Int == hbv_failDLRunknownCLN12_18_Int + hbv_failDLRunknownCLN12_1_Int) && hbv_failDLRunknownCLN12_4_Int == 0) && !((0 == hbv_failDLRunknownCLN12_7_Int || !(hbv_failDLRunknownCLN12_13_Int >= 0)) && (!(0 == hbv_failDLRunknownCLN12_7_Int) || hbv_failDLRunknownCLN12_13_Int >= 0))) && !(0 == hbv_failDLRunknownCLN12_14_Int)) && hhv_failDLRunknownCLN12_0_Int == 1) && hbv_failDLRunknownCLN12_17_Int == hbv_failDLRunknownCLN12_15_Int + hbv_failDLRunknownCLN12_16_Int) && hbv_failDLRunknownCLN12_9_Int == 2) && hbv_failDLRunknownCLN12_10_Int == -4 * hbv_failDLRunknownCLN12_2_Int) && !((hbv_failDLRunknownCLN12_17_Int > hbv_failDLRunknownCLN12_6_Int || !(0 == hbv_failDLRunknownCLN12_8_Int)) && (!(hbv_failDLRunknownCLN12_17_Int > hbv_failDLRunknownCLN12_6_Int) || 0 == hbv_failDLRunknownCLN12_8_Int))) && !((!(0 == hbv_failDLRunknownCLN12_3_Int) || (!(0 == hbv_failDLRunknownCLN12_7_Int) && !(0 == hbv_failDLRunknownCLN12_8_Int))) && ((0 == hbv_failDLRunknownCLN12_3_Int || 0 == hbv_failDLRunknownCLN12_7_Int) || 0 == hbv_failDLRunknownCLN12_8_Int))) && hbv_failDLRunknownCLN12_20_Int == -4 * hbv_failDLRunknownCLN12_21_Int) && hbv_failDLRunknownCLN12_18_Int == 2) && hbv_failDLRunknownCLN12_19_Int == 2; [L0] hhv_g_1032DLRunknownCLN29_0_Int, hhv_g_1032DLRunknownCLN29_1_Int, hhv_g_1032DLRunknownCLN29_2_Int, hhv_g_1032DLRunknownCLN29_3_Int, hhv_g_1032DLRunknownCLN29_4_Int, hhv_g_1032DLRunknownCLN29_5_Int, hhv_g_1032DLRunknownCLN29_6_Int, hhv_g_1032DLRunknownCLN29_7_Int, hhv_g_1032DLRunknownCLN29_8_Int, hhv_g_1032DLRunknownCLN29_9_Int, hhv_g_1032DLRunknownCLN29_10_Int := hbv_failDLRunknownCLN12_22_Int, hbv_failDLRunknownCLN12_23_Int, hbv_failDLRunknownCLN12_21_Int, hbv_failDLRunknownCLN12_14_Int, hbv_failDLRunknownCLN12_24_Int, hbv_failDLRunknownCLN12_25_Int, hbv_failDLRunknownCLN12_26_Int, hbv_failDLRunknownCLN12_2_Int, hbv_failDLRunknownCLN12_27_Int, hbv_failDLRunknownCLN12_28_Int, hbv_failDLRunknownCLN12_29_Int; [L0] havoc hbv_failDLRunknownCLN12_10_Int, hbv_failDLRunknownCLN12_17_Int, hbv_failDLRunknownCLN12_5_Int, hbv_failDLRunknownCLN12_8_Int, hbv_failDLRunknownCLN12_4_Int, hbv_failDLRunknownCLN12_6_Int, hbv_failDLRunknownCLN12_14_Int, hbv_failDLRunknownCLN12_16_Int, hbv_failDLRunknownCLN12_12_Int, hbv_failDLRunknownCLN12_7_Int, hbv_failDLRunknownCLN12_3_Int, hbv_failDLRunknownCLN12_28_Int, hbv_failDLRunknownCLN12_20_Int, hbv_failDLRunknownCLN12_25_Int, hbv_failDLRunknownCLN12_24_Int, hbv_failDLRunknownCLN12_11_Int, hbv_failDLRunknownCLN12_26_Int, hbv_failDLRunknownCLN12_22_Int, hbv_failDLRunknownCLN12_27_Int, hbv_failDLRunknownCLN12_19_Int, hbv_failDLRunknownCLN12_21_Int, hbv_failDLRunknownCLN12_15_Int, hbv_failDLRunknownCLN12_29_Int, hbv_failDLRunknownCLN12_1_Int, hbv_failDLRunknownCLN12_2_Int, hbv_failDLRunknownCLN12_9_Int, hbv_failDLRunknownCLN12_13_Int, hbv_failDLRunknownCLN12_18_Int, hbv_failDLRunknownCLN12_23_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_1_Int, hbv_g_1032DLRunknownCLN29_4_Int, hbv_g_1032DLRunknownCLN29_5_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_3_Int, hbv_f_1035DLRunknownCLN10_1_Int, hbv_f_1035DLRunknownCLN10_4_Int, hbv_f_1035DLRunknownCLN10_2_Int, hbv_f_1035DLRunknownCLN10_6_Int, hbv_f_1035DLRunknownCLN10_5_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] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 14) [L0] COND FALSE !(gotoSwitch == 13) [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 10) [L0] COND FALSE !(gotoSwitch == 9) [L0] COND FALSE !(gotoSwitch == 8) [L0] COND FALSE !(gotoSwitch == 7) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND FALSE !(gotoSwitch == 5) [L0] COND FALSE !(gotoSwitch == 3) [L0] COND TRUE gotoSwitch == 2 [L0] hhv_g_1032DLRunknownCLN29_0_Int, hhv_g_1032DLRunknownCLN29_1_Int, hhv_g_1032DLRunknownCLN29_2_Int, hhv_g_1032DLRunknownCLN29_3_Int, hhv_g_1032DLRunknownCLN29_4_Int, hhv_g_1032DLRunknownCLN29_5_Int, hhv_g_1032DLRunknownCLN29_6_Int, hhv_g_1032DLRunknownCLN29_7_Int, hhv_g_1032DLRunknownCLN29_8_Int, hhv_g_1032DLRunknownCLN29_9_Int, hhv_g_1032DLRunknownCLN29_10_Int := gpav_0_Int, gpav_1_Int, gpav_2_Int, gpav_3_Int, gpav_4_Int, gpav_5_Int, gpav_6_Int, gpav_7_Int, gpav_8_Int, gpav_9_Int, gpav_10_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_1_Int, hbv_g_1032DLRunknownCLN29_4_Int, hbv_g_1032DLRunknownCLN29_5_Int, hbv_g_1032DLRunknownCLN29_6_Int; [L0] assume (((((((((((hbv_f_1035DLRunknownCLN10_2_Int == 0 && hhv_f_1035DLRunknownCLN10_1_Int == 0) && hbv_f_1035DLRunknownCLN10_6_Int == 0) && hhv_f_1035DLRunknownCLN10_7_Int == hhv_f_1035DLRunknownCLN10_3_Int) && hhv_f_1035DLRunknownCLN10_2_Int == 0) && !((0 == hbv_f_1035DLRunknownCLN10_3_Int || !(hhv_f_1035DLRunknownCLN10_0_Int >= 0)) && (hhv_f_1035DLRunknownCLN10_0_Int >= 0 || !(0 == hbv_f_1035DLRunknownCLN10_3_Int)))) && !((!(0 == hbv_f_1035DLRunknownCLN10_4_Int) || hhv_f_1035DLRunknownCLN10_4_Int >= 0) && (0 == hbv_f_1035DLRunknownCLN10_4_Int || !(hhv_f_1035DLRunknownCLN10_4_Int >= 0)))) && hhv_f_1035DLRunknownCLN10_5_Int == hhv_f_1035DLRunknownCLN10_1_Int) && hhv_f_1035DLRunknownCLN10_3_Int == 0) && !((!(0 == hbv_f_1035DLRunknownCLN10_1_Int) || (!(0 == hbv_f_1035DLRunknownCLN10_4_Int) && !(0 == hbv_f_1035DLRunknownCLN10_3_Int))) && ((0 == hbv_f_1035DLRunknownCLN10_4_Int || 0 == hbv_f_1035DLRunknownCLN10_3_Int) || 0 == hbv_f_1035DLRunknownCLN10_1_Int))) && hbv_f_1035DLRunknownCLN10_5_Int == 0) && !(0 == hbv_f_1035DLRunknownCLN10_1_Int)) && hhv_f_1035DLRunknownCLN10_6_Int == hhv_f_1035DLRunknownCLN10_2_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_2_Int, hbv_g_1032DLRunknownCLN24_3_Int, hbv_g_1032DLRunknownCLN24_1_Int, hbv_g_1032DLRunknownCLN24_4_Int, hbv_g_1032DLRunknownCLN24_5_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_2_Int, hbv_g_without_checking_1152DLRunknownCLN41_3_Int; [L0] assume 0 == hhv_g_without_checking_1152DLRunknownCLN46_3_Int && hbv_g_without_checking_1152DLRunknownCLN46_1_Int == 1; [L0] hhv_g_1032DLRunknownCLN29_0_Int, hhv_g_1032DLRunknownCLN29_1_Int, hhv_g_1032DLRunknownCLN29_2_Int, hhv_g_1032DLRunknownCLN29_3_Int, hhv_g_1032DLRunknownCLN29_4_Int, hhv_g_1032DLRunknownCLN29_5_Int, hhv_g_1032DLRunknownCLN29_6_Int, hhv_g_1032DLRunknownCLN29_7_Int, hhv_g_1032DLRunknownCLN29_8_Int, hhv_g_1032DLRunknownCLN29_9_Int, hhv_g_1032DLRunknownCLN29_10_Int := 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; [L0] havoc hbv_g_without_checking_1152DLRunknownCLN46_1_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_1_Int, hbv_g_1032DLRunknownCLN29_4_Int, hbv_g_1032DLRunknownCLN29_5_Int, hbv_g_1032DLRunknownCLN29_6_Int; [L0] assume (((((((((((hbv_f_1035DLRunknownCLN10_2_Int == 0 && hhv_f_1035DLRunknownCLN10_1_Int == 0) && hbv_f_1035DLRunknownCLN10_6_Int == 0) && hhv_f_1035DLRunknownCLN10_7_Int == hhv_f_1035DLRunknownCLN10_3_Int) && hhv_f_1035DLRunknownCLN10_2_Int == 0) && !((0 == hbv_f_1035DLRunknownCLN10_3_Int || !(hhv_f_1035DLRunknownCLN10_0_Int >= 0)) && (hhv_f_1035DLRunknownCLN10_0_Int >= 0 || !(0 == hbv_f_1035DLRunknownCLN10_3_Int)))) && !((!(0 == hbv_f_1035DLRunknownCLN10_4_Int) || hhv_f_1035DLRunknownCLN10_4_Int >= 0) && (0 == hbv_f_1035DLRunknownCLN10_4_Int || !(hhv_f_1035DLRunknownCLN10_4_Int >= 0)))) && hhv_f_1035DLRunknownCLN10_5_Int == hhv_f_1035DLRunknownCLN10_1_Int) && hhv_f_1035DLRunknownCLN10_3_Int == 0) && !((!(0 == hbv_f_1035DLRunknownCLN10_1_Int) || (!(0 == hbv_f_1035DLRunknownCLN10_4_Int) && !(0 == hbv_f_1035DLRunknownCLN10_3_Int))) && ((0 == hbv_f_1035DLRunknownCLN10_4_Int || 0 == hbv_f_1035DLRunknownCLN10_3_Int) || 0 == hbv_f_1035DLRunknownCLN10_1_Int))) && hbv_f_1035DLRunknownCLN10_5_Int == 0) && !(0 == hbv_f_1035DLRunknownCLN10_1_Int)) && hhv_f_1035DLRunknownCLN10_6_Int == hhv_f_1035DLRunknownCLN10_2_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, 75 locations, 1 error locations. UNSAFE Result, 7.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 709 SDslu, 732 SDs, 0 SdLazy, 1668 SolverSat, 625 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=6, 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.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 468 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 4849 SizeOfPredicates, 5 NumberOfNonLiveVariables, 938 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 20/20 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.xml/Csv-Benchmark-0-2018-06-22_01-58-45-757.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.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-58-45-757.csv Received shutdown request...