java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i '/storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:38:53,566 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:38:53,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:38:53,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:38:53,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:38:53,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:38:53,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:38:53,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:38:53,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:38:53,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:38:53,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:38:53,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:38:53,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:38:53,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:38:53,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:38:53,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:38:53,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:38:53,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:38:53,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:38:53,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:38:53,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:38:53,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:38:53,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:38:53,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:38:53,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:38:53,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:38:53,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:38:53,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:38:53,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:38:53,622 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:38:53,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:38:53,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:38:53,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:38:53,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:38:53,630 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:38:53,630 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:38:53,644 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:38:53,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:38:53,644 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:38:53,644 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:38:53,645 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:38:53,646 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:38:53,646 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:38:53,646 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:38:53,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:38:53,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:38:53,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:38:53,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:38:53,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:38:53,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:38:53,653 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:38:53,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:38:53,653 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:38:53,653 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:38:53,653 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:38:53,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:38:53,654 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:38:53,655 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:38:53,655 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:38:53,693 INFO ]: Repository-Root is: /tmp [2018-06-24 21:38:53,707 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:38:53,711 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:38:53,712 INFO ]: Initializing SmtParser... [2018-06-24 21:38:53,713 INFO ]: SmtParser initialized [2018-06-24 21:38:53,713 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 [2018-06-24 21:38:53,714 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:38:53,803 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@49cad285 [2018-06-24 21:38:53,972 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 [2018-06-24 21:38:53,976 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:38:53,985 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:38:53,986 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:38:53,986 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:38:53,986 INFO ]: ChcToBoogie initialized [2018-06-24 21:38:53,990 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:38:53" (1/1) ... [2018-06-24 21:38:54,049 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:54 Unit [2018-06-24 21:38:54,049 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:38:54,053 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:38:54,053 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:38:54,053 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:38:54,072 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:54" (1/1) ... [2018-06-24 21:38:54,072 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:54" (1/1) ... [2018-06-24 21:38:54,079 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:54" (1/1) ... [2018-06-24 21:38:54,079 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:54" (1/1) ... [2018-06-24 21:38:54,084 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:54" (1/1) ... [2018-06-24 21:38:54,097 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:54" (1/1) ... [2018-06-24 21:38:54,098 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:54" (1/1) ... [2018-06-24 21:38:54,100 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:38:54,100 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:38:54,100 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:38:54,100 INFO ]: RCFGBuilder initialized [2018-06-24 21:38:54,101 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:54" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:38:54,117 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:38:54,117 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:38:54,117 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:38:54,117 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:38:54,117 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:38:54,117 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:38:54,620 INFO ]: Using library mode [2018-06-24 21:38:54,620 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:38:54 BoogieIcfgContainer [2018-06-24 21:38:54,620 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:38:54,621 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:38:54,621 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:38:54,622 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:38:54,622 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:38:54" (1/1) ... [2018-06-24 21:38:54,642 INFO ]: Initial Icfg 28 locations, 48 edges [2018-06-24 21:38:54,643 INFO ]: Using Remove infeasible edges [2018-06-24 21:38:54,644 INFO ]: Using Maximize final states [2018-06-24 21:38:54,645 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:38:54,645 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:38:54,647 INFO ]: Using Remove sink states [2018-06-24 21:38:54,649 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:38:54,649 INFO ]: Using Use SBE [2018-06-24 21:38:54,657 INFO ]: SBE split 0 edges [2018-06-24 21:38:54,662 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-24 21:38:54,668 INFO ]: 0 new accepting states [2018-06-24 21:38:54,724 INFO ]: Removed 18 edges and 6 locations by large block encoding [2018-06-24 21:38:54,726 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:38:54,728 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:38:54,728 INFO ]: 0 new accepting states [2018-06-24 21:38:54,728 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:38:54,729 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:38:54,729 INFO ]: Encoded RCFG 20 locations, 37 edges [2018-06-24 21:38:54,729 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:38:54 BasicIcfg [2018-06-24 21:38:54,729 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:38:54,730 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:38:54,730 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:38:54,733 INFO ]: TraceAbstraction initialized [2018-06-24 21:38:54,735 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:38:53" (1/4) ... [2018-06-24 21:38:54,736 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372e0afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:38:54, skipping insertion in model container [2018-06-24 21:38:54,736 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:54" (2/4) ... [2018-06-24 21:38:54,736 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372e0afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:38:54, skipping insertion in model container [2018-06-24 21:38:54,736 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:38:54" (3/4) ... [2018-06-24 21:38:54,736 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372e0afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:38:54, skipping insertion in model container [2018-06-24 21:38:54,736 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:38:54" (4/4) ... [2018-06-24 21:38:54,739 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:38:54,747 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:38:54,753 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:38:54,798 INFO ]: Using default assertion order modulation [2018-06-24 21:38:54,799 INFO ]: Interprodecural is true [2018-06-24 21:38:54,799 INFO ]: Hoare is false [2018-06-24 21:38:54,799 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:38:54,799 INFO ]: Backedges is TWOTRACK [2018-06-24 21:38:54,799 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:38:54,799 INFO ]: Difference is false [2018-06-24 21:38:54,799 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:38:54,799 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:38:54,813 INFO ]: Start isEmpty. Operand 20 states. [2018-06-24 21:38:54,826 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:38:54,826 INFO ]: Found error trace [2018-06-24 21:38:54,827 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:38:54,827 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:54,832 INFO ]: Analyzing trace with hash 40269286, now seen corresponding path program 1 times [2018-06-24 21:38:54,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:54,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:54,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:54,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:54,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:54,904 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:54,963 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:54,965 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:54,965 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:54,966 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:54,976 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:54,976 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:54,978 INFO ]: Start difference. First operand 20 states. Second operand 3 states. [2018-06-24 21:38:55,295 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:55,295 INFO ]: Finished difference Result 34 states and 63 transitions. [2018-06-24 21:38:55,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:55,298 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:38:55,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:55,307 INFO ]: With dead ends: 34 [2018-06-24 21:38:55,307 INFO ]: Without dead ends: 34 [2018-06-24 21:38:55,308 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:55,320 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 21:38:55,359 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 21:38:55,360 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:38:55,364 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-06-24 21:38:55,365 INFO ]: Start accepts. Automaton has 34 states and 63 transitions. Word has length 5 [2018-06-24 21:38:55,366 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:55,366 INFO ]: Abstraction has 34 states and 63 transitions. [2018-06-24 21:38:55,366 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:55,366 INFO ]: Start isEmpty. Operand 34 states and 63 transitions. [2018-06-24 21:38:55,370 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:38:55,370 INFO ]: Found error trace [2018-06-24 21:38:55,370 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:38:55,370 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:55,370 INFO ]: Analyzing trace with hash 40329829, now seen corresponding path program 1 times [2018-06-24 21:38:55,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:55,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:55,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:55,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:55,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:55,380 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:55,451 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:55,451 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:55,451 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:55,452 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:55,452 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:55,452 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:55,452 INFO ]: Start difference. First operand 34 states and 63 transitions. Second operand 3 states. [2018-06-24 21:38:55,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:55,818 INFO ]: Finished difference Result 48 states and 90 transitions. [2018-06-24 21:38:55,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:55,818 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:38:55,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:55,821 INFO ]: With dead ends: 48 [2018-06-24 21:38:55,821 INFO ]: Without dead ends: 48 [2018-06-24 21:38:55,822 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:55,822 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 21:38:55,834 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-24 21:38:55,834 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-24 21:38:55,838 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 90 transitions. [2018-06-24 21:38:55,838 INFO ]: Start accepts. Automaton has 48 states and 90 transitions. Word has length 5 [2018-06-24 21:38:55,838 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:55,838 INFO ]: Abstraction has 48 states and 90 transitions. [2018-06-24 21:38:55,838 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:55,838 INFO ]: Start isEmpty. Operand 48 states and 90 transitions. [2018-06-24 21:38:55,840 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:55,840 INFO ]: Found error trace [2018-06-24 21:38:55,840 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:55,840 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:55,840 INFO ]: Analyzing trace with hash 1255892002, now seen corresponding path program 1 times [2018-06-24 21:38:55,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:55,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:55,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:55,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:55,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:55,849 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:55,873 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:55,873 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:55,873 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:55,873 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:55,873 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:55,873 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:55,874 INFO ]: Start difference. First operand 48 states and 90 transitions. Second operand 3 states. [2018-06-24 21:38:56,039 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:56,039 INFO ]: Finished difference Result 62 states and 119 transitions. [2018-06-24 21:38:56,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:56,041 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:38:56,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:56,044 INFO ]: With dead ends: 62 [2018-06-24 21:38:56,044 INFO ]: Without dead ends: 62 [2018-06-24 21:38:56,044 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:56,044 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-24 21:38:56,064 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-06-24 21:38:56,064 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-24 21:38:56,068 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 119 transitions. [2018-06-24 21:38:56,068 INFO ]: Start accepts. Automaton has 62 states and 119 transitions. Word has length 6 [2018-06-24 21:38:56,068 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:56,068 INFO ]: Abstraction has 62 states and 119 transitions. [2018-06-24 21:38:56,069 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:56,069 INFO ]: Start isEmpty. Operand 62 states and 119 transitions. [2018-06-24 21:38:56,074 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:56,074 INFO ]: Found error trace [2018-06-24 21:38:56,074 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:56,074 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:56,074 INFO ]: Analyzing trace with hash 1256726150, now seen corresponding path program 1 times [2018-06-24 21:38:56,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:56,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:56,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:56,075 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:56,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:56,096 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:56,146 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:56,146 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:56,146 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:56,146 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:56,146 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:56,146 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:56,146 INFO ]: Start difference. First operand 62 states and 119 transitions. Second operand 3 states. [2018-06-24 21:38:56,170 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:56,170 INFO ]: Finished difference Result 90 states and 189 transitions. [2018-06-24 21:38:56,170 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:56,170 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:38:56,170 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:56,175 INFO ]: With dead ends: 90 [2018-06-24 21:38:56,175 INFO ]: Without dead ends: 90 [2018-06-24 21:38:56,175 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:56,175 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-24 21:38:56,189 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 66. [2018-06-24 21:38:56,189 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 21:38:56,191 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 127 transitions. [2018-06-24 21:38:56,191 INFO ]: Start accepts. Automaton has 66 states and 127 transitions. Word has length 6 [2018-06-24 21:38:56,192 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:56,192 INFO ]: Abstraction has 66 states and 127 transitions. [2018-06-24 21:38:56,192 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:56,192 INFO ]: Start isEmpty. Operand 66 states and 127 transitions. [2018-06-24 21:38:56,193 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:56,193 INFO ]: Found error trace [2018-06-24 21:38:56,193 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:56,193 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:56,193 INFO ]: Analyzing trace with hash 1257529546, now seen corresponding path program 1 times [2018-06-24 21:38:56,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:56,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:56,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:56,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:56,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:56,207 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:56,247 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:56,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:56,247 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:56,247 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:56,247 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:56,247 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:56,248 INFO ]: Start difference. First operand 66 states and 127 transitions. Second operand 3 states. [2018-06-24 21:38:56,267 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:56,267 INFO ]: Finished difference Result 70 states and 131 transitions. [2018-06-24 21:38:56,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:56,267 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:38:56,268 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:56,270 INFO ]: With dead ends: 70 [2018-06-24 21:38:56,270 INFO ]: Without dead ends: 70 [2018-06-24 21:38:56,270 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:56,270 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 21:38:56,279 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-24 21:38:56,279 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 21:38:56,281 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 131 transitions. [2018-06-24 21:38:56,281 INFO ]: Start accepts. Automaton has 70 states and 131 transitions. Word has length 6 [2018-06-24 21:38:56,281 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:56,281 INFO ]: Abstraction has 70 states and 131 transitions. [2018-06-24 21:38:56,281 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:56,281 INFO ]: Start isEmpty. Operand 70 states and 131 transitions. [2018-06-24 21:38:56,284 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:56,284 INFO ]: Found error trace [2018-06-24 21:38:56,284 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:56,284 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:56,284 INFO ]: Analyzing trace with hash -1859753251, now seen corresponding path program 1 times [2018-06-24 21:38:56,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:56,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:56,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:56,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:56,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:56,322 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:56,362 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:38:56,362 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:56,362 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:56,362 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:56,363 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:56,363 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:56,363 INFO ]: Start difference. First operand 70 states and 131 transitions. Second operand 3 states. [2018-06-24 21:38:56,383 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:56,384 INFO ]: Finished difference Result 74 states and 135 transitions. [2018-06-24 21:38:56,384 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:56,384 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 21:38:56,384 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:56,385 INFO ]: With dead ends: 74 [2018-06-24 21:38:56,385 INFO ]: Without dead ends: 74 [2018-06-24 21:38:56,385 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:56,386 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-24 21:38:56,394 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-24 21:38:56,394 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 21:38:56,396 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 135 transitions. [2018-06-24 21:38:56,396 INFO ]: Start accepts. Automaton has 74 states and 135 transitions. Word has length 12 [2018-06-24 21:38:56,396 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:56,396 INFO ]: Abstraction has 74 states and 135 transitions. [2018-06-24 21:38:56,396 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:56,396 INFO ]: Start isEmpty. Operand 74 states and 135 transitions. [2018-06-24 21:38:56,402 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:56,402 INFO ]: Found error trace [2018-06-24 21:38:56,402 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:56,402 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:56,402 INFO ]: Analyzing trace with hash 583519714, now seen corresponding path program 1 times [2018-06-24 21:38:56,402 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:56,402 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:56,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:56,403 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:56,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:56,431 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:56,683 WARN ]: Spent 166.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-06-24 21:38:56,745 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:56,745 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:56,745 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 21:38:56,745 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:38:56,746 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:38:56,746 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:38:56,746 INFO ]: Start difference. First operand 74 states and 135 transitions. Second operand 6 states. [2018-06-24 21:38:57,130 WARN ]: Spent 334.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-06-24 21:38:57,319 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:57,319 INFO ]: Finished difference Result 118 states and 233 transitions. [2018-06-24 21:38:57,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:38:57,321 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-24 21:38:57,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:57,325 INFO ]: With dead ends: 118 [2018-06-24 21:38:57,325 INFO ]: Without dead ends: 118 [2018-06-24 21:38:57,325 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:38:57,325 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-24 21:38:57,340 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 82. [2018-06-24 21:38:57,340 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-24 21:38:57,343 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 147 transitions. [2018-06-24 21:38:57,344 INFO ]: Start accepts. Automaton has 82 states and 147 transitions. Word has length 12 [2018-06-24 21:38:57,344 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:57,344 INFO ]: Abstraction has 82 states and 147 transitions. [2018-06-24 21:38:57,344 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:38:57,344 INFO ]: Start isEmpty. Operand 82 states and 147 transitions. [2018-06-24 21:38:57,346 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:57,346 INFO ]: Found error trace [2018-06-24 21:38:57,346 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:57,346 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:57,346 INFO ]: Analyzing trace with hash 553697885, now seen corresponding path program 1 times [2018-06-24 21:38:57,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:57,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:57,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:57,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:57,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:57,354 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:57,381 INFO ]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:38:57,381 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:57,382 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:57,382 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:57,382 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:57,382 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:57,382 INFO ]: Start difference. First operand 82 states and 147 transitions. Second operand 3 states. [2018-06-24 21:38:57,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:57,394 INFO ]: Finished difference Result 95 states and 180 transitions. [2018-06-24 21:38:57,397 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:57,397 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 21:38:57,397 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:57,400 INFO ]: With dead ends: 95 [2018-06-24 21:38:57,400 INFO ]: Without dead ends: 91 [2018-06-24 21:38:57,400 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:57,400 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-24 21:38:57,418 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 82. [2018-06-24 21:38:57,418 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-24 21:38:57,424 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 143 transitions. [2018-06-24 21:38:57,424 INFO ]: Start accepts. Automaton has 82 states and 143 transitions. Word has length 12 [2018-06-24 21:38:57,424 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:57,424 INFO ]: Abstraction has 82 states and 143 transitions. [2018-06-24 21:38:57,424 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:57,425 INFO ]: Start isEmpty. Operand 82 states and 143 transitions. [2018-06-24 21:38:57,426 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:38:57,426 INFO ]: Found error trace [2018-06-24 21:38:57,426 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:57,426 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:57,426 INFO ]: Analyzing trace with hash -1818871187, now seen corresponding path program 1 times [2018-06-24 21:38:57,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:57,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:57,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:57,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:57,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:57,455 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:57,584 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:38:57,584 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:57,584 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-24 21:38:57,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:57,631 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:57,636 INFO ]: Computing forward predicates... [2018-06-24 21:38:57,657 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:38:57,683 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:57,683 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 21:38:57,683 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:38:57,683 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:38:57,683 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:38:57,683 INFO ]: Start difference. First operand 82 states and 143 transitions. Second operand 5 states. [2018-06-24 21:38:57,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:57,728 INFO ]: Finished difference Result 78 states and 146 transitions. [2018-06-24 21:38:57,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:38:57,729 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-24 21:38:57,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:57,730 INFO ]: With dead ends: 78 [2018-06-24 21:38:57,730 INFO ]: Without dead ends: 56 [2018-06-24 21:38:57,730 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:38:57,731 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-24 21:38:57,736 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-06-24 21:38:57,736 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 21:38:57,737 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2018-06-24 21:38:57,737 INFO ]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 13 [2018-06-24 21:38:57,738 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:57,738 INFO ]: Abstraction has 51 states and 83 transitions. [2018-06-24 21:38:57,738 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:38:57,738 INFO ]: Start isEmpty. Operand 51 states and 83 transitions. [2018-06-24 21:38:57,739 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:38:57,739 INFO ]: Found error trace [2018-06-24 21:38:57,739 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:38:57,739 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:57,739 INFO ]: Analyzing trace with hash -1772405511, now seen corresponding path program 1 times [2018-06-24 21:38:57,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:57,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:57,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:57,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:57,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:57,779 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:58,001 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-06-24 21:38:58,223 INFO ]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:38:58,223 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:58,224 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-24 21:38:58,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:58,256 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:58,259 INFO ]: Computing forward predicates... [2018-06-24 21:38:58,765 WARN ]: Spent 274.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2018-06-24 21:38:58,908 INFO ]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:38:58,942 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:58,942 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:38:58,942 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:38:58,942 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:38:58,942 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:38:58,942 INFO ]: Start difference. First operand 51 states and 83 transitions. Second operand 12 states. [2018-06-24 21:38:59,116 WARN ]: Spent 160.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-06-24 21:38:59,257 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-06-24 21:38:59,376 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 19 [2018-06-24 21:38:59,575 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-06-24 21:39:00,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:00,023 INFO ]: Finished difference Result 105 states and 189 transitions. [2018-06-24 21:39:00,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:39:00,024 INFO ]: Start accepts. Automaton has 12 states. Word has length 18 [2018-06-24 21:39:00,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:00,026 INFO ]: With dead ends: 105 [2018-06-24 21:39:00,026 INFO ]: Without dead ends: 87 [2018-06-24 21:39:00,027 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:39:00,027 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-24 21:39:00,034 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 69. [2018-06-24 21:39:00,034 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-24 21:39:00,035 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2018-06-24 21:39:00,036 INFO ]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 18 [2018-06-24 21:39:00,036 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:00,036 INFO ]: Abstraction has 69 states and 107 transitions. [2018-06-24 21:39:00,036 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:39:00,036 INFO ]: Start isEmpty. Operand 69 states and 107 transitions. [2018-06-24 21:39:00,037 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:39:00,037 INFO ]: Found error trace [2018-06-24 21:39:00,037 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:00,037 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:00,038 INFO ]: Analyzing trace with hash 1354318695, now seen corresponding path program 2 times [2018-06-24 21:39:00,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:00,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:00,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:00,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:39:00,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:00,065 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:00,550 INFO ]: Checked inductivity of 38 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-24 21:39:00,550 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:00,550 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-24 21:39:00,556 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:39:00,584 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:39:00,584 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:00,587 INFO ]: Computing forward predicates... [2018-06-24 21:39:01,387 WARN ]: Spent 274.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 64 [2018-06-24 21:39:01,915 INFO ]: Checked inductivity of 38 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-24 21:39:01,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:01,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-24 21:39:01,935 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:39:01,935 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:39:01,935 INFO ]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:39:01,935 INFO ]: Start difference. First operand 69 states and 107 transitions. Second operand 21 states. [2018-06-24 21:39:02,637 WARN ]: Spent 125.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2018-06-24 21:39:02,878 WARN ]: Spent 207.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 33 [2018-06-24 21:39:03,242 WARN ]: Spent 167.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 79 [2018-06-24 21:39:03,874 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:03,874 INFO ]: Finished difference Result 98 states and 171 transitions. [2018-06-24 21:39:03,876 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:39:03,876 INFO ]: Start accepts. Automaton has 21 states. Word has length 30 [2018-06-24 21:39:03,876 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:03,878 INFO ]: With dead ends: 98 [2018-06-24 21:39:03,878 INFO ]: Without dead ends: 80 [2018-06-24 21:39:03,878 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:39:03,878 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-24 21:39:03,885 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-06-24 21:39:03,885 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-24 21:39:03,886 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2018-06-24 21:39:03,886 INFO ]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 30 [2018-06-24 21:39:03,887 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:03,887 INFO ]: Abstraction has 69 states and 104 transitions. [2018-06-24 21:39:03,887 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:39:03,887 INFO ]: Start isEmpty. Operand 69 states and 104 transitions. [2018-06-24 21:39:03,888 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 21:39:03,888 INFO ]: Found error trace [2018-06-24 21:39:03,888 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:03,888 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:03,888 INFO ]: Analyzing trace with hash -2143438146, now seen corresponding path program 3 times [2018-06-24 21:39:03,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:03,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:03,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:03,889 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:03,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:03,913 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:04,223 INFO ]: Checked inductivity of 62 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-24 21:39:04,223 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:04,223 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-24 21:39:04,228 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:39:04,326 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:39:04,326 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:04,331 INFO ]: Computing forward predicates... [2018-06-24 21:39:04,860 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-06-24 21:39:06,033 WARN ]: Spent 235.00 ms on a formula simplification. DAG size of input: 439 DAG size of output: 16 [2018-06-24 21:39:06,198 INFO ]: Checked inductivity of 62 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-24 21:39:06,231 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:06,231 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2018-06-24 21:39:06,231 INFO ]: Interpolant automaton has 29 states [2018-06-24 21:39:06,231 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 21:39:06,232 INFO ]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:39:06,232 INFO ]: Start difference. First operand 69 states and 104 transitions. Second operand 29 states. [2018-06-24 21:39:08,328 WARN ]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2018-06-24 21:39:08,742 WARN ]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-06-24 21:39:10,852 WARN ]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2018-06-24 21:39:11,359 WARN ]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-06-24 21:39:13,563 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:13,563 INFO ]: Finished difference Result 283 states and 733 transitions. [2018-06-24 21:39:13,563 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-24 21:39:13,563 INFO ]: Start accepts. Automaton has 29 states. Word has length 36 [2018-06-24 21:39:13,563 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:13,571 INFO ]: With dead ends: 283 [2018-06-24 21:39:13,571 INFO ]: Without dead ends: 280 [2018-06-24 21:39:13,574 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=858, Invalid=5622, Unknown=0, NotChecked=0, Total=6480 [2018-06-24 21:39:13,574 INFO ]: Start minimizeSevpa. Operand 280 states. [2018-06-24 21:39:13,620 INFO ]: Finished minimizeSevpa. Reduced states from 280 to 118. [2018-06-24 21:39:13,621 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-24 21:39:13,628 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 204 transitions. [2018-06-24 21:39:13,628 INFO ]: Start accepts. Automaton has 118 states and 204 transitions. Word has length 36 [2018-06-24 21:39:13,628 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:13,628 INFO ]: Abstraction has 118 states and 204 transitions. [2018-06-24 21:39:13,628 INFO ]: Interpolant automaton has 29 states. [2018-06-24 21:39:13,628 INFO ]: Start isEmpty. Operand 118 states and 204 transitions. [2018-06-24 21:39:13,633 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-24 21:39:13,633 INFO ]: Found error trace [2018-06-24 21:39:13,633 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:13,633 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:13,633 INFO ]: Analyzing trace with hash -57994027, now seen corresponding path program 4 times [2018-06-24 21:39:13,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:13,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:13,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:13,634 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:13,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:13,674 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:14,218 INFO ]: Checked inductivity of 92 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:39:14,218 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:14,218 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) [2018-06-24 21:39:14,234 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:39:14,283 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:39:14,283 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:14,289 INFO ]: Computing forward predicates... [2018-06-24 21:39:17,408 WARN ]: Spent 1.28 s on a formula simplification. DAG size of input: 513 DAG size of output: 119 [2018-06-24 21:39:17,642 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 66 [2018-06-24 21:39:17,887 INFO ]: Checked inductivity of 92 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:39:17,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:17,906 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-24 21:39:17,906 INFO ]: Interpolant automaton has 28 states [2018-06-24 21:39:17,906 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 21:39:17,907 INFO ]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:39:17,907 INFO ]: Start difference. First operand 118 states and 204 transitions. Second operand 28 states. [2018-06-24 21:39:18,654 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-06-24 21:39:19,027 WARN ]: Spent 189.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 106 [2018-06-24 21:39:19,441 WARN ]: Spent 202.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 123 [2018-06-24 21:39:19,655 WARN ]: Spent 137.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 79 [2018-06-24 21:39:19,902 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-06-24 21:39:20,432 WARN ]: Spent 448.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 156 [2018-06-24 21:39:20,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:20,568 INFO ]: Finished difference Result 150 states and 256 transitions. [2018-06-24 21:39:20,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:39:20,569 INFO ]: Start accepts. Automaton has 28 states. Word has length 42 [2018-06-24 21:39:20,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:20,572 INFO ]: With dead ends: 150 [2018-06-24 21:39:20,572 INFO ]: Without dead ends: 126 [2018-06-24 21:39:20,572 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:39:20,572 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-24 21:39:20,581 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 118. [2018-06-24 21:39:20,581 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-24 21:39:20,583 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 200 transitions. [2018-06-24 21:39:20,583 INFO ]: Start accepts. Automaton has 118 states and 200 transitions. Word has length 42 [2018-06-24 21:39:20,583 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:20,583 INFO ]: Abstraction has 118 states and 200 transitions. [2018-06-24 21:39:20,583 INFO ]: Interpolant automaton has 28 states. [2018-06-24 21:39:20,583 INFO ]: Start isEmpty. Operand 118 states and 200 transitions. [2018-06-24 21:39:20,585 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-24 21:39:20,585 INFO ]: Found error trace [2018-06-24 21:39:20,585 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:20,586 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:20,586 INFO ]: Analyzing trace with hash -56868436, now seen corresponding path program 5 times [2018-06-24 21:39:20,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:20,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:20,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:20,586 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:20,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:20,624 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:21,091 INFO ]: Checked inductivity of 128 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-24 21:39:21,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:39:21,092 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-24 21:39:21,100 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:39:21,137 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 21:39:21,137 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:39:21,142 INFO ]: Computing forward predicates... [2018-06-24 21:39:22,146 INFO ]: Checked inductivity of 128 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-06-24 21:39:22,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:39:22,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2018-06-24 21:39:22,165 INFO ]: Interpolant automaton has 35 states [2018-06-24 21:39:22,166 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 21:39:22,166 INFO ]: CoverageRelationStatistics Valid=94, Invalid=1096, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:39:22,166 INFO ]: Start difference. First operand 118 states and 200 transitions. Second operand 35 states. [2018-06-24 21:39:22,387 WARN ]: Spent 127.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 83 [2018-06-24 21:39:22,714 WARN ]: Spent 265.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 108 [2018-06-24 21:39:22,904 WARN ]: Spent 118.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2018-06-24 21:39:23,186 WARN ]: Spent 237.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2018-06-24 21:39:23,592 WARN ]: Spent 197.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2018-06-24 21:39:23,928 WARN ]: Spent 166.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-06-24 21:39:24,217 WARN ]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2018-06-24 21:39:24,922 WARN ]: Spent 130.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 78 [2018-06-24 21:39:25,161 WARN ]: Spent 119.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2018-06-24 21:39:25,449 WARN ]: Spent 264.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 105 [2018-06-24 21:39:26,523 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2018-06-24 21:39:26,804 WARN ]: Spent 230.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 105 [2018-06-24 21:39:27,172 WARN ]: Spent 190.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2018-06-24 21:39:27,508 WARN ]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2018-06-24 21:39:27,906 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-06-24 21:39:28,269 WARN ]: Spent 228.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-06-24 21:39:28,631 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 75 [2018-06-24 21:39:29,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:39:29,404 INFO ]: Finished difference Result 250 states and 502 transitions. [2018-06-24 21:39:29,404 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-24 21:39:29,404 INFO ]: Start accepts. Automaton has 35 states. Word has length 48 [2018-06-24 21:39:29,404 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:39:29,410 INFO ]: With dead ends: 250 [2018-06-24 21:39:29,410 INFO ]: Without dead ends: 232 [2018-06-24 21:39:29,412 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=923, Invalid=4627, Unknown=0, NotChecked=0, Total=5550 [2018-06-24 21:39:29,412 INFO ]: Start minimizeSevpa. Operand 232 states. [2018-06-24 21:39:29,430 INFO ]: Finished minimizeSevpa. Reduced states from 232 to 192. [2018-06-24 21:39:29,430 INFO ]: Start removeUnreachable. Operand 192 states. [2018-06-24 21:39:29,435 INFO ]: Finished removeUnreachable. Reduced from 192 states to 192 states and 330 transitions. [2018-06-24 21:39:29,435 INFO ]: Start accepts. Automaton has 192 states and 330 transitions. Word has length 48 [2018-06-24 21:39:29,435 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:39:29,435 INFO ]: Abstraction has 192 states and 330 transitions. [2018-06-24 21:39:29,435 INFO ]: Interpolant automaton has 35 states. [2018-06-24 21:39:29,435 INFO ]: Start isEmpty. Operand 192 states and 330 transitions. [2018-06-24 21:39:29,440 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-24 21:39:29,440 INFO ]: Found error trace [2018-06-24 21:39:29,440 INFO ]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:39:29,440 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:39:29,440 INFO ]: Analyzing trace with hash 791794586, now seen corresponding path program 6 times [2018-06-24 21:39:29,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:39:29,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:39:29,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:29,442 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:39:29,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:39:29,468 INFO ]: Conjunction of SSA is sat [2018-06-24 21:39:29,471 INFO ]: Counterexample might be feasible [2018-06-24 21:39:29,498 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:39:29,499 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:39:29 BasicIcfg [2018-06-24 21:39:29,499 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:39:29,500 INFO ]: Toolchain (without parser) took 35523.03 ms. Allocated memory was 309.3 MB in the beginning and 742.4 MB in the end (delta: 433.1 MB). Free memory was 263.7 MB in the beginning and 311.2 MB in the end (delta: -47.5 MB). Peak memory consumption was 385.6 MB. Max. memory is 3.6 GB. [2018-06-24 21:39:29,501 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:39:29,501 INFO ]: ChcToBoogie took 63.66 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:39:29,501 INFO ]: Boogie Preprocessor took 47.21 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:39:29,502 INFO ]: RCFGBuilder took 520.17 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 247.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:39:29,502 INFO ]: BlockEncodingV2 took 108.60 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 241.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:39:29,502 INFO ]: TraceAbstraction took 34768.70 ms. Allocated memory was 309.3 MB in the beginning and 742.4 MB in the end (delta: 433.1 MB). Free memory was 241.8 MB in the beginning and 311.2 MB in the end (delta: -69.4 MB). Peak memory consumption was 363.6 MB. Max. memory is 3.6 GB. [2018-06-24 21:39:29,508 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 28 locations, 48 edges - StatisticsResult: Encoded RCFG 20 locations, 37 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.66 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.21 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 520.17 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 247.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 108.60 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 241.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 34768.70 ms. Allocated memory was 309.3 MB in the beginning and 742.4 MB in the end (delta: 433.1 MB). Free memory was 241.8 MB in the beginning and 311.2 MB in the end (delta: -69.4 MB). Peak memory consumption was 363.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0); [L0] assume ((!(hbv_False_2_Int <= 1) && !(hbv_False_1_Int <= 0)) && !(hbv_False_1_Int + hbv_False_3_Int == (if hbv_False_2_Int == 10 then 10 else hbv_False_2_Int + hbv_False_4_Int))) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hbv_False_1_Int - 1, hbv_False_2_Int - 1, hbv_False_3_Int, hbv_False_4_Int; [L0] havoc hbv_False_1_Int, hbv_False_2_Int, hbv_False_4_Int, hbv_False_3_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == hhv_INV_REC_f^f_1_Int) && hhv_INV_REC_f^f_1_Int <= 1; [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int := hhv_INV_REC_f^f_0_Int - 1, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int; [L0] assume hhv_INV_REC_f__1_0_Int <= 0 && hhv_INV_REC_f__1_1_Int == hhv_INV_REC_f__1_0_Int; [L0] hhv_INV_REC_f__1_PRE_0_Int := hhv_INV_REC_f__1_0_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. UNSAFE Result, 34.7s OverallTime, 15 OverallIterations, 9 TraceHistogramMax, 21.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 642 SDtfs, 748 SDslu, 2935 SDs, 0 SdLazy, 4655 SolverSat, 1044 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3094 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 313 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 498 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 418 ConstructedInterpolants, 10 QuantifiedInterpolants, 248037 SizeOfPredicates, 84 NumberOfNonLiveVariables, 1336 ConjunctsInSsa, 376 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 424/678 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__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-39-29-524.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-39-29-524.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-39-29-524.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-39-29-524.csv Received shutdown request...