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/llreve-bench/smt2/faulty__barthe!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:08:36,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:08:36,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:08:36,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:08:36,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:08:36,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:08:36,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:08:36,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:08:36,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:08:36,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:08:36,593 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:08:36,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:08:36,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:08:36,595 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:08:36,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:08:36,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:08:36,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:08:36,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:08:36,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:08:36,614 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:08:36,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:08:36,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:08:36,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:08:36,620 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:08:36,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:08:36,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:08:36,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:08:36,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:08:36,626 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:08:36,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:08:36,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:08:36,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:08:36,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:08:36,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:08:36,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:08:36,632 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:08:36,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:08:36,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:08:36,661 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:08:36,661 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:08:36,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:08:36,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:08:36,663 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:08:36,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:08:36,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:08:36,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:08:36,664 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:08:36,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:08:36,665 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:08:36,665 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:08:36,665 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:08:36,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:08:36,665 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:08:36,667 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:08:36,667 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:08:36,724 INFO ]: Repository-Root is: /tmp [2018-06-22 02:08:36,741 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:08:36,745 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:08:36,747 INFO ]: Initializing SmtParser... [2018-06-22 02:08:36,747 INFO ]: SmtParser initialized [2018-06-22 02:08:36,748 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 [2018-06-22 02:08:36,749 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 02:08:36,848 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@45c2db6c [2018-06-22 02:08:37,036 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 [2018-06-22 02:08:37,042 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:08:37,048 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:08:37,049 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:08:37,049 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:08:37,049 INFO ]: ChcToBoogie initialized [2018-06-22 02:08:37,053 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:08:37" (1/1) ... [2018-06-22 02:08:37,116 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:37 Unit [2018-06-22 02:08:37,116 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:08:37,116 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:08:37,116 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:08:37,116 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:08:37,140 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:37" (1/1) ... [2018-06-22 02:08:37,140 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:37" (1/1) ... [2018-06-22 02:08:37,147 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:37" (1/1) ... [2018-06-22 02:08:37,147 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:37" (1/1) ... [2018-06-22 02:08:37,150 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:37" (1/1) ... [2018-06-22 02:08:37,151 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:37" (1/1) ... [2018-06-22 02:08:37,153 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:37" (1/1) ... [2018-06-22 02:08:37,155 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:08:37,155 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:08:37,155 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:08:37,155 INFO ]: RCFGBuilder initialized [2018-06-22 02:08:37,158 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:37" (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 02:08:37,170 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:08:37,170 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:08:37,170 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:08:37,170 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:08:37,170 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:08:37,170 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 02:08:37,483 INFO ]: Using library mode [2018-06-22 02:08:37,483 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:08:37 BoogieIcfgContainer [2018-06-22 02:08:37,483 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:08:37,485 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:08:37,485 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:08:37,489 INFO ]: TraceAbstraction initialized [2018-06-22 02:08:37,489 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:08:37" (1/3) ... [2018-06-22 02:08:37,490 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d08d2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:08:37, skipping insertion in model container [2018-06-22 02:08:37,490 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:08:37" (2/3) ... [2018-06-22 02:08:37,491 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d08d2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:08:37, skipping insertion in model container [2018-06-22 02:08:37,491 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:08:37" (3/3) ... [2018-06-22 02:08:37,493 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:08:37,503 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:08:37,513 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:08:37,566 INFO ]: Using default assertion order modulation [2018-06-22 02:08:37,567 INFO ]: Interprodecural is true [2018-06-22 02:08:37,567 INFO ]: Hoare is false [2018-06-22 02:08:37,567 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:08:37,567 INFO ]: Backedges is TWOTRACK [2018-06-22 02:08:37,567 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:08:37,567 INFO ]: Difference is false [2018-06-22 02:08:37,567 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:08:37,567 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:08:37,583 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 02:08:37,600 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:08:37,600 INFO ]: Found error trace [2018-06-22 02:08:37,601 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:37,601 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:37,607 INFO ]: Analyzing trace with hash -204663978, now seen corresponding path program 1 times [2018-06-22 02:08:37,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:37,610 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:37,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:37,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:37,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:37,692 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:37,816 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:37,819 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:37,819 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:37,821 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:37,839 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:37,840 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:37,842 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 02:08:37,931 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:37,931 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-22 02:08:37,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:37,933 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 02:08:37,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:37,943 INFO ]: With dead ends: 9 [2018-06-22 02:08:37,943 INFO ]: Without dead ends: 9 [2018-06-22 02:08:37,946 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:37,960 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 02:08:37,978 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 02:08:37,979 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 02:08:37,980 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-22 02:08:37,981 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-22 02:08:37,981 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:37,981 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-22 02:08:37,981 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:37,981 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-22 02:08:37,982 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:08:37,982 INFO ]: Found error trace [2018-06-22 02:08:37,982 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:37,982 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:37,982 INFO ]: Analyzing trace with hash -2057099186, now seen corresponding path program 1 times [2018-06-22 02:08:37,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:37,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:37,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:37,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:37,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:38,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:38,086 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:38,086 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:38,086 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:38,088 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:38,089 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:38,089 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:38,089 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-22 02:08:38,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:38,151 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-22 02:08:38,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:38,152 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 02:08:38,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:38,152 INFO ]: With dead ends: 10 [2018-06-22 02:08:38,152 INFO ]: Without dead ends: 10 [2018-06-22 02:08:38,153 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:38,153 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 02:08:38,154 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 02:08:38,155 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 02:08:38,155 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-22 02:08:38,155 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 8 [2018-06-22 02:08:38,155 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:38,155 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-22 02:08:38,155 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:38,155 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-22 02:08:38,156 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:08:38,156 INFO ]: Found error trace [2018-06-22 02:08:38,156 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:38,156 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:38,156 INFO ]: Analyzing trace with hash -2053405102, now seen corresponding path program 1 times [2018-06-22 02:08:38,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:38,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:38,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:38,157 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:38,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:38,177 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:38,233 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:38,233 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:08:38,233 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:08:38,233 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:08:38,234 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:08:38,234 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:38,234 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2018-06-22 02:08:38,339 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:38,339 INFO ]: Finished difference Result 12 states and 22 transitions. [2018-06-22 02:08:38,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:08:38,339 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 02:08:38,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:38,340 INFO ]: With dead ends: 12 [2018-06-22 02:08:38,340 INFO ]: Without dead ends: 12 [2018-06-22 02:08:38,340 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:08:38,340 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 02:08:38,342 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-22 02:08:38,342 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 02:08:38,343 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-22 02:08:38,343 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 8 [2018-06-22 02:08:38,343 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:38,343 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-22 02:08:38,343 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:08:38,343 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-22 02:08:38,343 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:08:38,343 INFO ]: Found error trace [2018-06-22 02:08:38,343 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:38,343 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:38,343 INFO ]: Analyzing trace with hash -2048787497, now seen corresponding path program 1 times [2018-06-22 02:08:38,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:38,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:38,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:38,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:38,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:38,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:38,477 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:38,477 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:38,477 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:38,485 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:38,538 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:38,547 INFO ]: Computing forward predicates... [2018-06-22 02:08:38,594 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:38,615 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:38,615 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 02:08:38,616 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:08:38,616 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:08:38,616 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:08:38,616 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 5 states. [2018-06-22 02:08:38,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:38,668 INFO ]: Finished difference Result 12 states and 22 transitions. [2018-06-22 02:08:38,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:08:38,669 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 02:08:38,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:38,669 INFO ]: With dead ends: 12 [2018-06-22 02:08:38,669 INFO ]: Without dead ends: 12 [2018-06-22 02:08:38,670 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:08:38,670 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 02:08:38,671 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-22 02:08:38,671 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 02:08:38,672 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-22 02:08:38,672 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-22 02:08:38,672 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:38,672 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-22 02:08:38,672 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:08:38,672 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-22 02:08:38,672 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:08:38,672 INFO ]: Found error trace [2018-06-22 02:08:38,672 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:38,673 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:38,673 INFO ]: Analyzing trace with hash 655263199, now seen corresponding path program 1 times [2018-06-22 02:08:38,673 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:38,673 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:38,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:38,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:38,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:38,691 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:38,744 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:38,744 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:38,744 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:38,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:38,795 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:38,804 INFO ]: Computing forward predicates... [2018-06-22 02:08:38,986 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:39,014 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:39,014 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-22 02:08:39,014 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:08:39,014 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:08:39,014 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:08:39,015 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-06-22 02:08:39,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:39,184 INFO ]: Finished difference Result 15 states and 27 transitions. [2018-06-22 02:08:39,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:08:39,184 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 02:08:39,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:39,184 INFO ]: With dead ends: 15 [2018-06-22 02:08:39,184 INFO ]: Without dead ends: 10 [2018-06-22 02:08:39,185 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:08:39,185 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 02:08:39,186 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 02:08:39,186 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 02:08:39,186 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-22 02:08:39,186 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2018-06-22 02:08:39,186 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:39,187 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-22 02:08:39,187 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:08:39,187 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-22 02:08:39,187 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:08:39,187 INFO ]: Found error trace [2018-06-22 02:08:39,187 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:39,187 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:39,187 INFO ]: Analyzing trace with hash 912925558, now seen corresponding path program 2 times [2018-06-22 02:08:39,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:39,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:39,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:39,202 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:39,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:39,243 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:39,553 WARN ]: Spent 199.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-06-22 02:08:39,637 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:39,637 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:39,637 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:39,646 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:08:39,671 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:08:39,671 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:39,673 INFO ]: Computing forward predicates... [2018-06-22 02:08:39,785 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:39,807 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:39,807 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 02:08:39,807 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:08:39,808 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:08:39,808 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:08:39,808 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-22 02:08:39,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:39,922 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-22 02:08:39,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:08:39,923 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 02:08:39,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:39,923 INFO ]: With dead ends: 11 [2018-06-22 02:08:39,923 INFO ]: Without dead ends: 11 [2018-06-22 02:08:39,924 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:08:39,924 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 02:08:39,925 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 02:08:39,925 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 02:08:39,925 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-22 02:08:39,925 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-22 02:08:39,926 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:39,926 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-22 02:08:39,926 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:08:39,926 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-22 02:08:39,926 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:08:39,926 INFO ]: Found error trace [2018-06-22 02:08:39,926 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:39,926 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:39,926 INFO ]: Analyzing trace with hash -1763250249, now seen corresponding path program 3 times [2018-06-22 02:08:39,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:39,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:39,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:39,927 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:08:39,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:39,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:40,069 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:40,069 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:40,069 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:40,076 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:08:40,148 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 02:08:40,148 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:40,153 INFO ]: Computing forward predicates... [2018-06-22 02:08:40,558 WARN ]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-22 02:08:40,645 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:40,665 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:40,665 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 02:08:40,666 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:08:40,666 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:08:40,666 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:08:40,666 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-22 02:08:40,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:40,696 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-22 02:08:40,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:08:40,700 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-22 02:08:40,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:40,700 INFO ]: With dead ends: 12 [2018-06-22 02:08:40,700 INFO ]: Without dead ends: 12 [2018-06-22 02:08:40,701 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:08:40,701 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 02:08:40,702 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 02:08:40,702 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 02:08:40,702 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-22 02:08:40,702 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-22 02:08:40,702 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:40,703 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-22 02:08:40,703 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:08:40,703 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-22 02:08:40,703 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:08:40,703 INFO ]: Found error trace [2018-06-22 02:08:40,703 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:40,703 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:40,703 INFO ]: Analyzing trace with hash 1174645654, now seen corresponding path program 4 times [2018-06-22 02:08:40,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:40,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:40,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:40,704 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:08:40,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:40,751 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:40,947 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:40,947 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:40,947 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:40,954 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:08:40,984 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:08:40,985 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:40,988 INFO ]: Computing forward predicates... [2018-06-22 02:08:41,342 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:41,375 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:41,375 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 02:08:41,375 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:08:41,375 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:08:41,375 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:08:41,376 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2018-06-22 02:08:41,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:41,424 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-22 02:08:41,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:08:41,424 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-22 02:08:41,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:41,425 INFO ]: With dead ends: 13 [2018-06-22 02:08:41,425 INFO ]: Without dead ends: 13 [2018-06-22 02:08:41,425 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:08:41,425 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 02:08:41,429 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 02:08:41,429 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 02:08:41,429 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-22 02:08:41,429 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-22 02:08:41,429 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:41,429 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-22 02:08:41,429 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:08:41,429 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-22 02:08:41,430 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:08:41,430 INFO ]: Found error trace [2018-06-22 02:08:41,430 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:41,430 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:41,430 INFO ]: Analyzing trace with hash 2055105431, now seen corresponding path program 5 times [2018-06-22 02:08:41,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:41,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:41,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:41,431 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:08:41,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:41,473 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:42,014 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:42,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:42,014 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:42,032 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:08:42,085 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 02:08:42,085 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:42,090 INFO ]: Computing forward predicates... [2018-06-22 02:08:42,687 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:42,706 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:42,706 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 02:08:42,707 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:08:42,707 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:08:42,707 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:08:42,707 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-06-22 02:08:42,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:42,762 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-22 02:08:42,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:08:42,764 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-22 02:08:42,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:42,764 INFO ]: With dead ends: 14 [2018-06-22 02:08:42,764 INFO ]: Without dead ends: 14 [2018-06-22 02:08:42,765 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:08:42,765 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 02:08:42,766 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 02:08:42,766 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 02:08:42,766 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-22 02:08:42,766 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-22 02:08:42,766 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:42,767 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-22 02:08:42,767 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:08:42,767 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-22 02:08:42,767 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:08:42,767 INFO ]: Found error trace [2018-06-22 02:08:42,767 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:42,768 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:42,768 INFO ]: Analyzing trace with hash -715412554, now seen corresponding path program 6 times [2018-06-22 02:08:42,768 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:42,768 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:42,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:42,768 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:08:42,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:42,819 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:43,085 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:43,085 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:43,085 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:43,095 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 02:08:43,125 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 02:08:43,125 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:43,129 INFO ]: Computing forward predicates... [2018-06-22 02:08:43,549 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:43,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:43,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-22 02:08:43,571 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:08:43,572 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:08:43,572 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:08:43,572 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-06-22 02:08:43,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:43,660 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-22 02:08:43,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:08:43,660 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-22 02:08:43,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:43,660 INFO ]: With dead ends: 15 [2018-06-22 02:08:43,660 INFO ]: Without dead ends: 15 [2018-06-22 02:08:43,661 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:08:43,661 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 02:08:43,662 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 02:08:43,662 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 02:08:43,663 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-22 02:08:43,663 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-22 02:08:43,663 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:43,663 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-22 02:08:43,663 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:08:43,663 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-22 02:08:43,663 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 02:08:43,663 INFO ]: Found error trace [2018-06-22 02:08:43,663 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:43,663 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:43,663 INFO ]: Analyzing trace with hash -702124169, now seen corresponding path program 7 times [2018-06-22 02:08:43,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:43,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:43,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:43,664 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:08:43,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:43,715 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:44,131 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 02:08:44,384 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:44,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:44,384 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:44,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:44,440 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:44,445 INFO ]: Computing forward predicates... [2018-06-22 02:08:45,273 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:45,301 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:45,302 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-22 02:08:45,302 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:08:45,302 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:08:45,302 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:08:45,302 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 16 states. [2018-06-22 02:08:45,403 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:45,403 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-22 02:08:45,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:08:45,403 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-22 02:08:45,404 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:45,404 INFO ]: With dead ends: 16 [2018-06-22 02:08:45,404 INFO ]: Without dead ends: 16 [2018-06-22 02:08:45,404 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:08:45,404 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 02:08:45,406 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 02:08:45,406 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 02:08:45,406 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-22 02:08:45,406 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-22 02:08:45,406 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:45,406 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-22 02:08:45,406 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:08:45,406 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-22 02:08:45,406 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 02:08:45,406 INFO ]: Found error trace [2018-06-22 02:08:45,406 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:45,407 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:45,407 INFO ]: Analyzing trace with hash -290184234, now seen corresponding path program 8 times [2018-06-22 02:08:45,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:45,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:45,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:45,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:08:45,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:45,447 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:45,681 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:45,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:45,681 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:45,687 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:08:45,721 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:08:45,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:45,725 INFO ]: Computing forward predicates... [2018-06-22 02:08:46,174 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:46,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:46,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-06-22 02:08:46,194 INFO ]: Interpolant automaton has 18 states [2018-06-22 02:08:46,194 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 02:08:46,194 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:08:46,195 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 18 states. [2018-06-22 02:08:46,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:46,305 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-22 02:08:46,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:08:46,306 INFO ]: Start accepts. Automaton has 18 states. Word has length 15 [2018-06-22 02:08:46,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:46,306 INFO ]: With dead ends: 17 [2018-06-22 02:08:46,306 INFO ]: Without dead ends: 17 [2018-06-22 02:08:46,307 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-22 02:08:46,307 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 02:08:46,308 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 02:08:46,308 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 02:08:46,308 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-22 02:08:46,308 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-22 02:08:46,308 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:46,308 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-22 02:08:46,308 INFO ]: Interpolant automaton has 18 states. [2018-06-22 02:08:46,308 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-22 02:08:46,308 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:08:46,308 INFO ]: Found error trace [2018-06-22 02:08:46,308 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:46,309 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:46,309 INFO ]: Analyzing trace with hash -404948137, now seen corresponding path program 9 times [2018-06-22 02:08:46,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:46,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:46,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:46,309 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:08:46,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:46,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:46,890 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-06-22 02:08:46,910 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:46,910 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:46,910 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:46,917 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:08:46,960 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 02:08:46,960 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:46,965 INFO ]: Computing forward predicates... [2018-06-22 02:08:47,540 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:47,561 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:47,561 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 02:08:47,561 INFO ]: Interpolant automaton has 20 states [2018-06-22 02:08:47,561 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 02:08:47,562 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:08:47,562 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 20 states. [2018-06-22 02:08:47,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:47,657 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-22 02:08:47,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:08:47,657 INFO ]: Start accepts. Automaton has 20 states. Word has length 16 [2018-06-22 02:08:47,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:47,658 INFO ]: With dead ends: 18 [2018-06-22 02:08:47,658 INFO ]: Without dead ends: 18 [2018-06-22 02:08:47,658 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:08:47,658 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 02:08:47,659 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-22 02:08:47,659 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 02:08:47,660 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-22 02:08:47,660 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-22 02:08:47,660 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:47,660 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-22 02:08:47,660 INFO ]: Interpolant automaton has 20 states. [2018-06-22 02:08:47,660 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-22 02:08:47,660 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:08:47,660 INFO ]: Found error trace [2018-06-22 02:08:47,660 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:47,660 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:47,660 INFO ]: Analyzing trace with hash 332338166, now seen corresponding path program 10 times [2018-06-22 02:08:47,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:47,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:47,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:47,662 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:08:47,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:47,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:48,047 WARN ]: Spent 250.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-06-22 02:08:48,411 WARN ]: Spent 314.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-06-22 02:08:48,862 WARN ]: Spent 371.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-06-22 02:08:49,108 WARN ]: Spent 146.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-06-22 02:08:49,457 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:49,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:49,457 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 02:08:49,468 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:49,522 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:08:49,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:49,527 INFO ]: Computing forward predicates... [2018-06-22 02:08:50,886 WARN ]: Spent 531.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2018-06-22 02:08:51,381 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:51,402 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:51,402 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 02:08:51,402 INFO ]: Interpolant automaton has 24 states [2018-06-22 02:08:51,403 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 02:08:51,403 INFO ]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:08:51,403 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 24 states. [2018-06-22 02:08:51,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:51,783 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-22 02:08:51,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:08:51,783 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-22 02:08:51,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:51,783 INFO ]: With dead ends: 19 [2018-06-22 02:08:51,783 INFO ]: Without dead ends: 19 [2018-06-22 02:08:51,785 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:08:51,785 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 02:08:51,786 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 02:08:51,786 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 02:08:51,787 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-22 02:08:51,787 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-22 02:08:51,787 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:51,787 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-22 02:08:51,787 INFO ]: Interpolant automaton has 24 states. [2018-06-22 02:08:51,787 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-22 02:08:51,787 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 02:08:51,787 INFO ]: Found error trace [2018-06-22 02:08:51,787 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:51,788 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:51,791 INFO ]: Analyzing trace with hash 1713377079, now seen corresponding path program 11 times [2018-06-22 02:08:51,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:51,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:51,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:51,792 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:08:51,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:51,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:52,337 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:52,337 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:08:52,337 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:08:52,343 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 02:08:52,402 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 02:08:52,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:08:52,409 INFO ]: Computing forward predicates... [2018-06-22 02:08:53,269 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:08:53,289 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:08:53,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-06-22 02:08:53,289 INFO ]: Interpolant automaton has 24 states [2018-06-22 02:08:53,290 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 02:08:53,290 INFO ]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:08:53,290 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 24 states. [2018-06-22 02:08:53,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:08:53,524 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-22 02:08:53,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:08:53,524 INFO ]: Start accepts. Automaton has 24 states. Word has length 18 [2018-06-22 02:08:53,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:08:53,525 INFO ]: With dead ends: 20 [2018-06-22 02:08:53,525 INFO ]: Without dead ends: 20 [2018-06-22 02:08:53,525 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-06-22 02:08:53,525 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 02:08:53,527 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 02:08:53,527 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 02:08:53,527 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-22 02:08:53,527 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-22 02:08:53,527 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:08:53,527 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-22 02:08:53,527 INFO ]: Interpolant automaton has 24 states. [2018-06-22 02:08:53,528 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-22 02:08:53,528 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:08:53,528 INFO ]: Found error trace [2018-06-22 02:08:53,528 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:08:53,528 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:08:53,528 INFO ]: Analyzing trace with hash 1575910422, now seen corresponding path program 12 times [2018-06-22 02:08:53,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:08:53,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:08:53,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:53,529 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:08:53,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:08:53,564 INFO ]: Conjunction of SSA is sat [2018-06-22 02:08:53,568 INFO ]: Counterexample might be feasible [2018-06-22 02:08:53,590 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:08:53 BoogieIcfgContainer [2018-06-22 02:08:53,590 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:08:53,591 INFO ]: Toolchain (without parser) took 16548.08 ms. Allocated memory was 303.6 MB in the beginning and 462.9 MB in the end (delta: 159.4 MB). Free memory was 259.9 MB in the beginning and 400.9 MB in the end (delta: -141.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 3.6 GB. [2018-06-22 02:08:53,591 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-22 02:08:53,592 INFO ]: ChcToBoogie took 67.09 ms. Allocated memory is still 303.6 MB. Free memory was 259.9 MB in the beginning and 256.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:08:53,592 INFO ]: Boogie Preprocessor took 38.22 ms. Allocated memory is still 303.6 MB. Free memory was 256.9 MB in the beginning and 256.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 02:08:53,593 INFO ]: RCFGBuilder took 328.36 ms. Allocated memory is still 303.6 MB. Free memory was 256.0 MB in the beginning and 248.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:08:53,593 INFO ]: TraceAbstraction took 16105.26 ms. Allocated memory was 303.6 MB in the beginning and 462.9 MB in the end (delta: 159.4 MB). Free memory was 247.0 MB in the beginning and 400.9 MB in the end (delta: -154.0 MB). Peak memory consumption was 5.4 MB. Max. memory is 3.6 GB. [2018-06-22 02:08:53,596 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * 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 67.09 ms. Allocated memory is still 303.6 MB. Free memory was 259.9 MB in the beginning and 256.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.22 ms. Allocated memory is still 303.6 MB. Free memory was 256.9 MB in the beginning and 256.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 328.36 ms. Allocated memory is still 303.6 MB. Free memory was 256.0 MB in the beginning and 248.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 16105.26 ms. Allocated memory was 303.6 MB in the beginning and 462.9 MB in the end (delta: 159.4 MB). Free memory was 247.0 MB in the beginning and 400.9 MB in the end (delta: -154.0 MB). Peak memory consumption was 5.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); [L0] gotoSwitch := gotoSwitch_in; [L0] assume (!(hbv_False_1_Int == hbv_False_2_Int) && !(hbv_False_5_Int < hbv_False_6_Int)) && !(hbv_False_3_Int < hbv_False_4_Int); [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hbv_False_7_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_1_Int, hbv_False_3_Int, hbv_False_8_Int, hbv_False_4_Int, hbv_False_2_Int; [L0] havoc hbv_False_4_Int, hbv_False_8_Int, hbv_False_6_Int, hbv_False_2_Int, hbv_False_1_Int, hbv_False_3_Int, hbv_False_5_Int, hbv_False_7_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int; [L0] assume ((((hhv_INV_MAIN_42_0_Int == hhv_INV_MAIN_42_5_Int && hhv_INV_MAIN_42_3_Int == 0) && hhv_INV_MAIN_42_4_Int == 0) && hhv_INV_MAIN_42_2_Int == hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_1_Int == 0) && hhv_INV_MAIN_42_7_Int == 0; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. UNSAFE Result, 16.0s OverallTime, 16 OverallIterations, 12 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 111 SDtfs, 10 SDslu, 533 SDs, 0 SdLazy, 1115 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 100 SyntacticMatches, 8 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 84546 SizeOfPredicates, 69 NumberOfNonLiveVariables, 2596 ConjunctsInSsa, 1414 ConjunctsInUnsatCore, 27 InterpolantComputations, 3 PerfectInterpolantSequences, 5/580 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/faulty__barthe!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-08-53-618.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__barthe!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-08-53-618.csv Received shutdown request...