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/rec__inlining.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:59:21,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:59:21,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:59:21,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:59:21,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:59:21,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:59:21,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:59:21,649 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:59:21,650 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:59:21,652 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:59:21,653 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:59:21,653 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:59:21,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:59:21,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:59:21,659 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:59:21,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:59:21,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:59:21,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:59:21,676 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:59:21,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:59:21,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:59:21,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:59:21,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:59:21,680 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:59:21,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:59:21,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:59:21,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:59:21,686 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:59:21,687 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:59:21,687 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:59:21,688 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:59:21,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:59:21,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:59:21,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:59:21,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:59:21,696 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:59:21,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:59:21,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:59:21,711 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:59:21,711 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:59:21,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:59:21,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:59:21,712 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:59:21,713 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:59:21,713 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:59:21,713 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:59:21,713 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:59:21,713 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:59:21,714 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:59:21,714 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:59:21,714 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:59:21,714 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:59:21,714 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:59:21,715 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:59:21,715 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:59:21,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:59:21,715 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:59:21,716 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:59:21,717 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:59:21,762 INFO ]: Repository-Root is: /tmp [2018-06-24 21:59:21,780 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:59:21,784 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:59:21,785 INFO ]: Initializing SmtParser... [2018-06-24 21:59:21,785 INFO ]: SmtParser initialized [2018-06-24 21:59:21,786 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 [2018-06-24 21:59:21,787 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:59:21,863 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@52539617 [2018-06-24 21:59:22,121 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 [2018-06-24 21:59:22,130 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:59:22,137 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:59:22,137 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:59:22,137 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:59:22,137 INFO ]: ChcToBoogie initialized [2018-06-24 21:59:22,141 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:59:22" (1/1) ... [2018-06-24 21:59:22,198 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:22 Unit [2018-06-24 21:59:22,198 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:59:22,199 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:59:22,199 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:59:22,199 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:59:22,222 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:22" (1/1) ... [2018-06-24 21:59:22,222 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:22" (1/1) ... [2018-06-24 21:59:22,228 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:22" (1/1) ... [2018-06-24 21:59:22,230 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:22" (1/1) ... [2018-06-24 21:59:22,239 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:22" (1/1) ... [2018-06-24 21:59:22,242 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:22" (1/1) ... [2018-06-24 21:59:22,244 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:22" (1/1) ... [2018-06-24 21:59:22,246 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:59:22,246 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:59:22,246 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:59:22,246 INFO ]: RCFGBuilder initialized [2018-06-24 21:59:22,255 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:22" (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:59:22,266 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:59:22,267 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:59:22,267 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:59:22,267 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:59:22,267 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:59:22,267 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:59:22,709 INFO ]: Using library mode [2018-06-24 21:59:22,710 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:59:22 BoogieIcfgContainer [2018-06-24 21:59:22,710 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:59:22,710 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:59:22,710 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:59:22,711 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:59:22,712 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:59:22" (1/1) ... [2018-06-24 21:59:22,729 INFO ]: Initial Icfg 29 locations, 50 edges [2018-06-24 21:59:22,729 INFO ]: Using Remove infeasible edges [2018-06-24 21:59:22,730 INFO ]: Using Maximize final states [2018-06-24 21:59:22,730 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:59:22,731 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:59:22,732 INFO ]: Using Remove sink states [2018-06-24 21:59:22,733 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:59:22,733 INFO ]: Using Use SBE [2018-06-24 21:59:22,739 INFO ]: SBE split 0 edges [2018-06-24 21:59:22,745 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-24 21:59:22,746 INFO ]: 0 new accepting states [2018-06-24 21:59:22,896 INFO ]: Removed 27 edges and 8 locations by large block encoding [2018-06-24 21:59:22,898 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:59:22,899 INFO ]: Removed 2 edges and 0 locations because of local infeasibility [2018-06-24 21:59:22,900 INFO ]: 0 new accepting states [2018-06-24 21:59:22,900 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:59:22,900 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:59:22,901 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:59:22,901 INFO ]: 0 new accepting states [2018-06-24 21:59:22,901 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:59:22,902 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:59:22,902 INFO ]: Encoded RCFG 19 locations, 37 edges [2018-06-24 21:59:22,903 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:59:22 BasicIcfg [2018-06-24 21:59:22,903 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:59:22,904 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:59:22,904 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:59:22,907 INFO ]: TraceAbstraction initialized [2018-06-24 21:59:22,907 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:59:22" (1/4) ... [2018-06-24 21:59:22,909 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a814f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:59:22, skipping insertion in model container [2018-06-24 21:59:22,909 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:22" (2/4) ... [2018-06-24 21:59:22,909 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a814f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:59:22, skipping insertion in model container [2018-06-24 21:59:22,909 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:59:22" (3/4) ... [2018-06-24 21:59:22,910 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a814f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:59:22, skipping insertion in model container [2018-06-24 21:59:22,910 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:59:22" (4/4) ... [2018-06-24 21:59:22,912 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:59:22,921 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:59:22,938 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:59:22,983 INFO ]: Using default assertion order modulation [2018-06-24 21:59:22,984 INFO ]: Interprodecural is true [2018-06-24 21:59:22,984 INFO ]: Hoare is false [2018-06-24 21:59:22,984 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:59:22,984 INFO ]: Backedges is TWOTRACK [2018-06-24 21:59:22,984 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:59:22,984 INFO ]: Difference is false [2018-06-24 21:59:22,984 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:59:22,984 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:59:22,997 INFO ]: Start isEmpty. Operand 19 states. [2018-06-24 21:59:23,010 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:59:23,010 INFO ]: Found error trace [2018-06-24 21:59:23,011 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:59:23,011 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:23,016 INFO ]: Analyzing trace with hash 37114415, now seen corresponding path program 1 times [2018-06-24 21:59:23,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:23,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:23,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:23,054 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:23,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:23,089 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:23,142 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:59:23,144 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:23,144 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:23,145 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:23,155 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:23,156 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:23,157 INFO ]: Start difference. First operand 19 states. Second operand 3 states. [2018-06-24 21:59:23,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:23,555 INFO ]: Finished difference Result 29 states and 58 transitions. [2018-06-24 21:59:23,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:23,557 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:59:23,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:23,568 INFO ]: With dead ends: 29 [2018-06-24 21:59:23,568 INFO ]: Without dead ends: 29 [2018-06-24 21:59:23,570 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:59:23,587 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:59:23,613 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 21:59:23,614 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:59:23,616 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-06-24 21:59:23,618 INFO ]: Start accepts. Automaton has 29 states and 58 transitions. Word has length 5 [2018-06-24 21:59:23,618 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:23,619 INFO ]: Abstraction has 29 states and 58 transitions. [2018-06-24 21:59:23,619 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:23,619 INFO ]: Start isEmpty. Operand 29 states and 58 transitions. [2018-06-24 21:59:23,621 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:59:23,621 INFO ]: Found error trace [2018-06-24 21:59:23,622 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:59:23,622 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:23,622 INFO ]: Analyzing trace with hash 37024081, now seen corresponding path program 1 times [2018-06-24 21:59:23,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:23,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:23,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:23,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:23,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:23,628 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:23,668 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:59:23,668 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:23,668 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:23,669 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:23,669 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:23,669 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:23,670 INFO ]: Start difference. First operand 29 states and 58 transitions. Second operand 3 states. [2018-06-24 21:59:23,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:23,840 INFO ]: Finished difference Result 39 states and 80 transitions. [2018-06-24 21:59:23,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:23,840 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:59:23,841 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:23,843 INFO ]: With dead ends: 39 [2018-06-24 21:59:23,843 INFO ]: Without dead ends: 39 [2018-06-24 21:59:23,844 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:59:23,844 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 21:59:23,853 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 21:59:23,853 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 21:59:23,855 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 80 transitions. [2018-06-24 21:59:23,855 INFO ]: Start accepts. Automaton has 39 states and 80 transitions. Word has length 5 [2018-06-24 21:59:23,855 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:23,855 INFO ]: Abstraction has 39 states and 80 transitions. [2018-06-24 21:59:23,855 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:23,855 INFO ]: Start isEmpty. Operand 39 states and 80 transitions. [2018-06-24 21:59:23,858 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:59:23,858 INFO ]: Found error trace [2018-06-24 21:59:23,858 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:59:23,858 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:23,858 INFO ]: Analyzing trace with hash 1151982047, now seen corresponding path program 1 times [2018-06-24 21:59:23,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:23,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:23,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:23,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:23,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:23,873 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:23,903 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:59:23,903 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:23,903 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:23,903 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:23,903 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:23,903 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:23,903 INFO ]: Start difference. First operand 39 states and 80 transitions. Second operand 3 states. [2018-06-24 21:59:23,928 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:23,928 INFO ]: Finished difference Result 42 states and 83 transitions. [2018-06-24 21:59:23,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:23,928 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:59:23,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:23,930 INFO ]: With dead ends: 42 [2018-06-24 21:59:23,930 INFO ]: Without dead ends: 42 [2018-06-24 21:59:23,930 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:59:23,930 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 21:59:23,937 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-24 21:59:23,937 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 21:59:23,939 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 83 transitions. [2018-06-24 21:59:23,939 INFO ]: Start accepts. Automaton has 42 states and 83 transitions. Word has length 6 [2018-06-24 21:59:23,939 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:23,939 INFO ]: Abstraction has 42 states and 83 transitions. [2018-06-24 21:59:23,939 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:23,939 INFO ]: Start isEmpty. Operand 42 states and 83 transitions. [2018-06-24 21:59:23,941 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:59:23,941 INFO ]: Found error trace [2018-06-24 21:59:23,941 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:23,941 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:23,942 INFO ]: Analyzing trace with hash 1351114483, now seen corresponding path program 1 times [2018-06-24 21:59:23,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:23,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:23,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:23,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:23,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:23,958 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:24,116 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:59:24,116 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:24,116 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:59:24,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:24,166 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:24,173 INFO ]: Computing forward predicates... [2018-06-24 21:59:24,305 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:24,333 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:59:24,333 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-24 21:59:24,333 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:59:24,333 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:59:24,333 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:59:24,333 INFO ]: Start difference. First operand 42 states and 83 transitions. Second operand 5 states. [2018-06-24 21:59:24,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:24,542 INFO ]: Finished difference Result 55 states and 111 transitions. [2018-06-24 21:59:24,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:59:24,542 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 21:59:24,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:24,546 INFO ]: With dead ends: 55 [2018-06-24 21:59:24,546 INFO ]: Without dead ends: 45 [2018-06-24 21:59:24,547 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:59:24,547 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 21:59:24,557 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-06-24 21:59:24,557 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 21:59:24,558 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2018-06-24 21:59:24,558 INFO ]: Start accepts. Automaton has 39 states and 68 transitions. Word has length 7 [2018-06-24 21:59:24,559 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:24,559 INFO ]: Abstraction has 39 states and 68 transitions. [2018-06-24 21:59:24,559 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:59:24,559 INFO ]: Start isEmpty. Operand 39 states and 68 transitions. [2018-06-24 21:59:24,560 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:59:24,560 INFO ]: Found error trace [2018-06-24 21:59:24,560 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:24,560 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:24,560 INFO ]: Analyzing trace with hash 114904741, now seen corresponding path program 1 times [2018-06-24 21:59:24,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:24,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:24,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:24,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:24,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:24,587 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:24,810 WARN ]: Spent 133.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-06-24 21:59:24,980 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2018-06-24 21:59:25,193 WARN ]: Spent 154.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-06-24 21:59:25,194 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:59:25,195 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:25,195 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:59:25,195 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:59:25,195 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:59:25,195 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:59:25,195 INFO ]: Start difference. First operand 39 states and 68 transitions. Second operand 5 states. [2018-06-24 21:59:25,677 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-06-24 21:59:25,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:25,955 INFO ]: Finished difference Result 62 states and 122 transitions. [2018-06-24 21:59:25,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:59:25,955 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-24 21:59:25,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:25,957 INFO ]: With dead ends: 62 [2018-06-24 21:59:25,957 INFO ]: Without dead ends: 60 [2018-06-24 21:59:25,958 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:59:25,958 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-24 21:59:25,975 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 45. [2018-06-24 21:59:25,975 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 21:59:25,976 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 84 transitions. [2018-06-24 21:59:25,976 INFO ]: Start accepts. Automaton has 45 states and 84 transitions. Word has length 11 [2018-06-24 21:59:25,977 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:25,977 INFO ]: Abstraction has 45 states and 84 transitions. [2018-06-24 21:59:25,977 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:59:25,977 INFO ]: Start isEmpty. Operand 45 states and 84 transitions. [2018-06-24 21:59:25,979 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:59:25,979 INFO ]: Found error trace [2018-06-24 21:59:25,979 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:25,979 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:25,979 INFO ]: Analyzing trace with hash -973696576, now seen corresponding path program 1 times [2018-06-24 21:59:25,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:25,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:25,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:25,980 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:25,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:26,000 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:26,076 INFO ]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:59:26,076 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:26,076 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:59:26,076 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:59:26,076 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:59:26,076 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:59:26,076 INFO ]: Start difference. First operand 45 states and 84 transitions. Second operand 4 states. [2018-06-24 21:59:26,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:26,098 INFO ]: Finished difference Result 50 states and 106 transitions. [2018-06-24 21:59:26,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:59:26,099 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-24 21:59:26,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:26,102 INFO ]: With dead ends: 50 [2018-06-24 21:59:26,102 INFO ]: Without dead ends: 50 [2018-06-24 21:59:26,102 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:59:26,102 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 21:59:26,114 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-06-24 21:59:26,114 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 21:59:26,115 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2018-06-24 21:59:26,116 INFO ]: Start accepts. Automaton has 46 states and 85 transitions. Word has length 16 [2018-06-24 21:59:26,116 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:26,116 INFO ]: Abstraction has 46 states and 85 transitions. [2018-06-24 21:59:26,116 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:59:26,116 INFO ]: Start isEmpty. Operand 46 states and 85 transitions. [2018-06-24 21:59:26,117 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:59:26,117 INFO ]: Found error trace [2018-06-24 21:59:26,117 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:26,117 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:26,117 INFO ]: Analyzing trace with hash 637644874, now seen corresponding path program 1 times [2018-06-24 21:59:26,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:26,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:26,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:26,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:26,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:26,150 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:26,370 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-24 21:59:26,583 INFO ]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:59:26,583 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:26,583 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:59:26,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:26,625 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:26,628 INFO ]: Computing forward predicates... [2018-06-24 21:59:27,547 WARN ]: Spent 517.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 10 [2018-06-24 21:59:27,678 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:59:27,710 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:27,710 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-06-24 21:59:27,711 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:59:27,711 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:59:27,711 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:59:27,711 INFO ]: Start difference. First operand 46 states and 85 transitions. Second operand 15 states. [2018-06-24 21:59:28,894 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:28,895 INFO ]: Finished difference Result 75 states and 150 transitions. [2018-06-24 21:59:28,895 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:59:28,895 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 21:59:28,895 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:28,897 INFO ]: With dead ends: 75 [2018-06-24 21:59:28,897 INFO ]: Without dead ends: 75 [2018-06-24 21:59:28,898 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:59:28,898 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-24 21:59:28,913 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 47. [2018-06-24 21:59:28,913 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 21:59:28,914 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. [2018-06-24 21:59:28,914 INFO ]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 17 [2018-06-24 21:59:28,914 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:28,914 INFO ]: Abstraction has 47 states and 86 transitions. [2018-06-24 21:59:28,914 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:59:28,914 INFO ]: Start isEmpty. Operand 47 states and 86 transitions. [2018-06-24 21:59:28,915 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:59:28,915 INFO ]: Found error trace [2018-06-24 21:59:28,915 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:28,916 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:28,916 INFO ]: Analyzing trace with hash -1055143956, now seen corresponding path program 1 times [2018-06-24 21:59:28,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:28,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:28,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:28,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:28,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:28,928 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:28,981 INFO ]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:59:28,981 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:28,981 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:59:28,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:29,019 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:29,021 INFO ]: Computing forward predicates... [2018-06-24 21:59:29,070 INFO ]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:59:29,091 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:29,091 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2018-06-24 21:59:29,092 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:59:29,092 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:59:29,092 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:59:29,092 INFO ]: Start difference. First operand 47 states and 86 transitions. Second operand 9 states. [2018-06-24 21:59:29,414 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:29,414 INFO ]: Finished difference Result 66 states and 125 transitions. [2018-06-24 21:59:29,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:59:29,447 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-24 21:59:29,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:29,448 INFO ]: With dead ends: 66 [2018-06-24 21:59:29,448 INFO ]: Without dead ends: 57 [2018-06-24 21:59:29,448 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:59:29,448 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 21:59:29,457 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-06-24 21:59:29,457 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 21:59:29,458 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 74 transitions. [2018-06-24 21:59:29,458 INFO ]: Start accepts. Automaton has 44 states and 74 transitions. Word has length 17 [2018-06-24 21:59:29,458 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:29,458 INFO ]: Abstraction has 44 states and 74 transitions. [2018-06-24 21:59:29,458 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:59:29,458 INFO ]: Start isEmpty. Operand 44 states and 74 transitions. [2018-06-24 21:59:29,459 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 21:59:29,460 INFO ]: Found error trace [2018-06-24 21:59:29,460 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:29,460 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:29,460 INFO ]: Analyzing trace with hash 614455377, now seen corresponding path program 1 times [2018-06-24 21:59:29,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:29,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:29,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:29,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:29,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:29,474 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:29,528 INFO ]: Checked inductivity of 17 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:59:29,528 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:29,528 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:59:29,540 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:29,572 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:29,574 INFO ]: Computing forward predicates... [2018-06-24 21:59:29,581 INFO ]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 21:59:29,612 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:59:29,612 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2018-06-24 21:59:29,612 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:59:29,612 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:59:29,612 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:59:29,612 INFO ]: Start difference. First operand 44 states and 74 transitions. Second operand 7 states. [2018-06-24 21:59:29,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:29,936 INFO ]: Finished difference Result 66 states and 126 transitions. [2018-06-24 21:59:29,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:59:29,936 INFO ]: Start accepts. Automaton has 7 states. Word has length 23 [2018-06-24 21:59:29,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:29,938 INFO ]: With dead ends: 66 [2018-06-24 21:59:29,938 INFO ]: Without dead ends: 66 [2018-06-24 21:59:29,938 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:59:29,938 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-24 21:59:29,952 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-06-24 21:59:29,952 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 21:59:29,953 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2018-06-24 21:59:29,953 INFO ]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 23 [2018-06-24 21:59:29,954 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:29,954 INFO ]: Abstraction has 50 states and 80 transitions. [2018-06-24 21:59:29,954 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:59:29,954 INFO ]: Start isEmpty. Operand 50 states and 80 transitions. [2018-06-24 21:59:29,959 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:59:29,959 INFO ]: Found error trace [2018-06-24 21:59:29,959 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:29,959 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:29,959 INFO ]: Analyzing trace with hash 1867656897, now seen corresponding path program 1 times [2018-06-24 21:59:29,959 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:29,959 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:29,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:29,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:29,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:29,991 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:30,275 INFO ]: Checked inductivity of 20 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:59:30,275 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:30,275 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-24 21:59:30,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:30,316 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:30,319 INFO ]: Computing forward predicates... [2018-06-24 21:59:31,205 INFO ]: Checked inductivity of 20 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:59:31,223 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:31,223 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-24 21:59:31,224 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:59:31,224 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:59:31,224 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:59:31,224 INFO ]: Start difference. First operand 50 states and 80 transitions. Second operand 17 states. [2018-06-24 21:59:32,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:32,464 INFO ]: Finished difference Result 93 states and 186 transitions. [2018-06-24 21:59:32,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:59:32,465 INFO ]: Start accepts. Automaton has 17 states. Word has length 24 [2018-06-24 21:59:32,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:32,467 INFO ]: With dead ends: 93 [2018-06-24 21:59:32,467 INFO ]: Without dead ends: 92 [2018-06-24 21:59:32,469 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:59:32,469 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-24 21:59:32,490 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 66. [2018-06-24 21:59:32,490 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 21:59:32,491 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 112 transitions. [2018-06-24 21:59:32,491 INFO ]: Start accepts. Automaton has 66 states and 112 transitions. Word has length 24 [2018-06-24 21:59:32,492 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:32,492 INFO ]: Abstraction has 66 states and 112 transitions. [2018-06-24 21:59:32,492 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:59:32,492 INFO ]: Start isEmpty. Operand 66 states and 112 transitions. [2018-06-24 21:59:32,498 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:59:32,498 INFO ]: Found error trace [2018-06-24 21:59:32,498 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:32,498 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:32,498 INFO ]: Analyzing trace with hash 1699106172, now seen corresponding path program 2 times [2018-06-24 21:59:32,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:32,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:32,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:32,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:32,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:32,519 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:32,577 INFO ]: Checked inductivity of 36 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 21:59:32,577 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:32,577 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:59:32,583 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:59:32,616 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:59:32,616 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:32,618 INFO ]: Computing forward predicates... [2018-06-24 21:59:32,632 INFO ]: Checked inductivity of 36 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 21:59:32,652 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:32,652 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 21:59:32,652 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:59:32,652 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:59:32,652 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:59:32,652 INFO ]: Start difference. First operand 66 states and 112 transitions. Second operand 7 states. [2018-06-24 21:59:32,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:32,704 INFO ]: Finished difference Result 74 states and 141 transitions. [2018-06-24 21:59:32,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:59:32,705 INFO ]: Start accepts. Automaton has 7 states. Word has length 30 [2018-06-24 21:59:32,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:32,706 INFO ]: With dead ends: 74 [2018-06-24 21:59:32,706 INFO ]: Without dead ends: 74 [2018-06-24 21:59:32,706 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:59:32,706 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-24 21:59:32,724 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-06-24 21:59:32,724 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-24 21:59:32,725 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 129 transitions. [2018-06-24 21:59:32,725 INFO ]: Start accepts. Automaton has 72 states and 129 transitions. Word has length 30 [2018-06-24 21:59:32,726 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:32,726 INFO ]: Abstraction has 72 states and 129 transitions. [2018-06-24 21:59:32,726 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:59:32,726 INFO ]: Start isEmpty. Operand 72 states and 129 transitions. [2018-06-24 21:59:32,727 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 21:59:32,727 INFO ]: Found error trace [2018-06-24 21:59:32,727 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:32,728 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:32,733 INFO ]: Analyzing trace with hash 1290135460, now seen corresponding path program 3 times [2018-06-24 21:59:32,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:32,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:32,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:32,734 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:32,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:32,768 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:33,080 WARN ]: Spent 190.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-06-24 21:59:33,416 INFO ]: Checked inductivity of 41 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 21:59:33,416 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:33,416 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-24 21:59:33,434 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:59:33,464 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:59:33,464 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:33,467 INFO ]: Computing forward predicates... [2018-06-24 21:59:33,967 INFO ]: Checked inductivity of 41 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 21:59:33,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:33,986 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 25 [2018-06-24 21:59:33,987 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:59:33,987 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:59:33,987 INFO ]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:59:33,987 INFO ]: Start difference. First operand 72 states and 129 transitions. Second operand 25 states. [2018-06-24 21:59:36,145 WARN ]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-24 21:59:37,238 WARN ]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-24 21:59:38,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:38,818 INFO ]: Finished difference Result 179 states and 412 transitions. [2018-06-24 21:59:38,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-06-24 21:59:38,819 INFO ]: Start accepts. Automaton has 25 states. Word has length 31 [2018-06-24 21:59:38,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:38,822 INFO ]: With dead ends: 179 [2018-06-24 21:59:38,822 INFO ]: Without dead ends: 179 [2018-06-24 21:59:38,826 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=581, Invalid=5425, Unknown=0, NotChecked=0, Total=6006 [2018-06-24 21:59:38,826 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-24 21:59:38,844 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 121. [2018-06-24 21:59:38,844 INFO ]: Start removeUnreachable. Operand 121 states. [2018-06-24 21:59:38,846 INFO ]: Finished removeUnreachable. Reduced from 121 states to 121 states and 218 transitions. [2018-06-24 21:59:38,846 INFO ]: Start accepts. Automaton has 121 states and 218 transitions. Word has length 31 [2018-06-24 21:59:38,846 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:38,846 INFO ]: Abstraction has 121 states and 218 transitions. [2018-06-24 21:59:38,846 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:59:38,846 INFO ]: Start isEmpty. Operand 121 states and 218 transitions. [2018-06-24 21:59:38,849 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:59:38,849 INFO ]: Found error trace [2018-06-24 21:59:38,849 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:38,849 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:38,849 INFO ]: Analyzing trace with hash -21420312, now seen corresponding path program 4 times [2018-06-24 21:59:38,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:38,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:38,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:38,850 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:38,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:38,862 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:38,995 INFO ]: Checked inductivity of 47 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:59:38,995 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:38,995 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-24 21:59:39,000 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:59:39,032 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:59:39,032 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:39,035 INFO ]: Computing forward predicates... [2018-06-24 21:59:39,146 INFO ]: Checked inductivity of 47 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 21:59:39,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:39,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-06-24 21:59:39,169 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:59:39,169 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:59:39,169 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:59:39,169 INFO ]: Start difference. First operand 121 states and 218 transitions. Second operand 15 states. [2018-06-24 21:59:40,169 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:40,170 INFO ]: Finished difference Result 203 states and 444 transitions. [2018-06-24 21:59:40,170 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-24 21:59:40,170 INFO ]: Start accepts. Automaton has 15 states. Word has length 32 [2018-06-24 21:59:40,170 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:40,174 INFO ]: With dead ends: 203 [2018-06-24 21:59:40,174 INFO ]: Without dead ends: 190 [2018-06-24 21:59:40,175 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=530, Invalid=3130, Unknown=0, NotChecked=0, Total=3660 [2018-06-24 21:59:40,175 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-24 21:59:40,197 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 140. [2018-06-24 21:59:40,197 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-24 21:59:40,200 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 247 transitions. [2018-06-24 21:59:40,200 INFO ]: Start accepts. Automaton has 140 states and 247 transitions. Word has length 32 [2018-06-24 21:59:40,200 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:40,200 INFO ]: Abstraction has 140 states and 247 transitions. [2018-06-24 21:59:40,200 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:59:40,200 INFO ]: Start isEmpty. Operand 140 states and 247 transitions. [2018-06-24 21:59:40,203 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 21:59:40,203 INFO ]: Found error trace [2018-06-24 21:59:40,208 INFO ]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:40,208 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:40,208 INFO ]: Analyzing trace with hash -231176184, now seen corresponding path program 5 times [2018-06-24 21:59:40,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:40,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:40,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:40,208 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:40,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:40,230 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:40,414 INFO ]: Checked inductivity of 114 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-24 21:59:40,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:40,414 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) [2018-06-24 21:59:40,430 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:40,494 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:59:40,494 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:40,498 INFO ]: Computing forward predicates... [2018-06-24 21:59:40,553 INFO ]: Checked inductivity of 114 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-24 21:59:40,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:40,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-24 21:59:40,574 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:59:40,574 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:59:40,574 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:59:40,574 INFO ]: Start difference. First operand 140 states and 247 transitions. Second operand 11 states. [2018-06-24 21:59:41,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:41,407 INFO ]: Finished difference Result 154 states and 306 transitions. [2018-06-24 21:59:41,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:59:41,409 INFO ]: Start accepts. Automaton has 11 states. Word has length 46 [2018-06-24 21:59:41,410 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:41,412 INFO ]: With dead ends: 154 [2018-06-24 21:59:41,412 INFO ]: Without dead ends: 154 [2018-06-24 21:59:41,412 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:59:41,412 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-24 21:59:41,425 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 148. [2018-06-24 21:59:41,425 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-24 21:59:41,430 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 274 transitions. [2018-06-24 21:59:41,430 INFO ]: Start accepts. Automaton has 148 states and 274 transitions. Word has length 46 [2018-06-24 21:59:41,430 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:41,430 INFO ]: Abstraction has 148 states and 274 transitions. [2018-06-24 21:59:41,430 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:59:41,430 INFO ]: Start isEmpty. Operand 148 states and 274 transitions. [2018-06-24 21:59:41,433 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 21:59:41,433 INFO ]: Found error trace [2018-06-24 21:59:41,433 INFO ]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:41,433 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:41,433 INFO ]: Analyzing trace with hash 1686176087, now seen corresponding path program 6 times [2018-06-24 21:59:41,433 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:41,433 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:41,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:41,434 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:41,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:41,473 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:41,854 WARN ]: Spent 299.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-06-24 21:59:42,277 WARN ]: Spent 376.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-06-24 21:59:42,455 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2018-06-24 21:59:42,582 INFO ]: Checked inductivity of 76 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 21:59:42,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:42,582 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-24 21:59:42,588 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:59:42,620 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:59:42,620 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:42,624 INFO ]: Computing forward predicates... [2018-06-24 21:59:43,222 INFO ]: Checked inductivity of 76 backedges. 29 proven. 28 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 21:59:43,242 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:43,242 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 31 [2018-06-24 21:59:43,242 INFO ]: Interpolant automaton has 31 states [2018-06-24 21:59:43,242 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 21:59:43,242 INFO ]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:59:43,243 INFO ]: Start difference. First operand 148 states and 274 transitions. Second operand 31 states. [2018-06-24 21:59:45,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:45,763 INFO ]: Finished difference Result 212 states and 464 transitions. [2018-06-24 21:59:45,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 21:59:45,763 INFO ]: Start accepts. Automaton has 31 states. Word has length 39 [2018-06-24 21:59:45,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:45,767 INFO ]: With dead ends: 212 [2018-06-24 21:59:45,767 INFO ]: Without dead ends: 212 [2018-06-24 21:59:45,768 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=337, Invalid=3323, Unknown=0, NotChecked=0, Total=3660 [2018-06-24 21:59:45,769 INFO ]: Start minimizeSevpa. Operand 212 states. [2018-06-24 21:59:45,787 INFO ]: Finished minimizeSevpa. Reduced states from 212 to 151. [2018-06-24 21:59:45,787 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-24 21:59:45,789 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 278 transitions. [2018-06-24 21:59:45,789 INFO ]: Start accepts. Automaton has 151 states and 278 transitions. Word has length 39 [2018-06-24 21:59:45,789 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:45,789 INFO ]: Abstraction has 151 states and 278 transitions. [2018-06-24 21:59:45,789 INFO ]: Interpolant automaton has 31 states. [2018-06-24 21:59:45,789 INFO ]: Start isEmpty. Operand 151 states and 278 transitions. [2018-06-24 21:59:45,792 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-24 21:59:45,792 INFO ]: Found error trace [2018-06-24 21:59:45,792 INFO ]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:45,792 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:45,793 INFO ]: Analyzing trace with hash 2027225852, now seen corresponding path program 7 times [2018-06-24 21:59:45,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:45,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:45,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:45,793 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:45,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:45,818 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:46,481 INFO ]: Checked inductivity of 125 backedges. 69 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-24 21:59:46,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:46,481 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:46,486 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:46,525 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:46,529 INFO ]: Computing forward predicates... [2018-06-24 21:59:47,238 INFO ]: Checked inductivity of 125 backedges. 61 proven. 31 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-24 21:59:47,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:47,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-06-24 21:59:47,258 INFO ]: Interpolant automaton has 29 states [2018-06-24 21:59:47,258 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 21:59:47,259 INFO ]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:59:47,259 INFO ]: Start difference. First operand 151 states and 278 transitions. Second operand 29 states. [2018-06-24 21:59:50,472 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:50,472 INFO ]: Finished difference Result 252 states and 582 transitions. [2018-06-24 21:59:50,472 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-24 21:59:50,472 INFO ]: Start accepts. Automaton has 29 states. Word has length 47 [2018-06-24 21:59:50,472 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:50,478 INFO ]: With dead ends: 252 [2018-06-24 21:59:50,478 INFO ]: Without dead ends: 252 [2018-06-24 21:59:50,479 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=646, Invalid=4904, Unknown=0, NotChecked=0, Total=5550 [2018-06-24 21:59:50,480 INFO ]: Start minimizeSevpa. Operand 252 states. [2018-06-24 21:59:50,499 INFO ]: Finished minimizeSevpa. Reduced states from 252 to 163. [2018-06-24 21:59:50,499 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-24 21:59:50,501 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 302 transitions. [2018-06-24 21:59:50,501 INFO ]: Start accepts. Automaton has 163 states and 302 transitions. Word has length 47 [2018-06-24 21:59:50,502 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:50,502 INFO ]: Abstraction has 163 states and 302 transitions. [2018-06-24 21:59:50,502 INFO ]: Interpolant automaton has 29 states. [2018-06-24 21:59:50,502 INFO ]: Start isEmpty. Operand 163 states and 302 transitions. [2018-06-24 21:59:50,518 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-24 21:59:50,518 INFO ]: Found error trace [2018-06-24 21:59:50,518 INFO ]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:50,518 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:50,522 INFO ]: Analyzing trace with hash -1315100422, now seen corresponding path program 8 times [2018-06-24 21:59:50,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:50,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:50,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:50,522 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:50,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:50,544 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:50,681 INFO ]: Checked inductivity of 226 backedges. 130 proven. 22 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-24 21:59:50,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:50,681 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-24 21:59:50,687 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:59:50,732 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:59:50,732 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:50,735 INFO ]: Computing forward predicates... [2018-06-24 21:59:50,799 INFO ]: Checked inductivity of 226 backedges. 113 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-24 21:59:50,820 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:50,820 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-06-24 21:59:50,820 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:59:50,820 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:59:50,820 INFO ]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:59:50,820 INFO ]: Start difference. First operand 163 states and 302 transitions. Second operand 17 states. [2018-06-24 21:59:51,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:51,448 INFO ]: Finished difference Result 276 states and 565 transitions. [2018-06-24 21:59:51,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:59:51,524 INFO ]: Start accepts. Automaton has 17 states. Word has length 61 [2018-06-24 21:59:51,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:51,526 INFO ]: With dead ends: 276 [2018-06-24 21:59:51,526 INFO ]: Without dead ends: 276 [2018-06-24 21:59:51,527 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=1423, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 21:59:51,527 INFO ]: Start minimizeSevpa. Operand 276 states. [2018-06-24 21:59:51,542 INFO ]: Finished minimizeSevpa. Reduced states from 276 to 159. [2018-06-24 21:59:51,542 INFO ]: Start removeUnreachable. Operand 159 states. [2018-06-24 21:59:51,544 INFO ]: Finished removeUnreachable. Reduced from 159 states to 159 states and 312 transitions. [2018-06-24 21:59:51,544 INFO ]: Start accepts. Automaton has 159 states and 312 transitions. Word has length 61 [2018-06-24 21:59:51,544 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:51,544 INFO ]: Abstraction has 159 states and 312 transitions. [2018-06-24 21:59:51,544 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:59:51,544 INFO ]: Start isEmpty. Operand 159 states and 312 transitions. [2018-06-24 21:59:51,547 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-24 21:59:51,547 INFO ]: Found error trace [2018-06-24 21:59:51,547 INFO ]: trace histogram [8, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:51,547 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:51,547 INFO ]: Analyzing trace with hash -156633067, now seen corresponding path program 9 times [2018-06-24 21:59:51,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:51,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:51,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:51,548 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:51,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:51,569 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:51,975 INFO ]: Checked inductivity of 185 backedges. 51 proven. 32 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-24 21:59:51,975 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:51,975 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:51,981 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:59:52,025 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:59:52,025 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:52,027 INFO ]: Computing forward predicates... [2018-06-24 21:59:52,230 INFO ]: Checked inductivity of 185 backedges. 50 proven. 37 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-24 21:59:52,250 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:52,250 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-24 21:59:52,251 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:59:52,251 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:59:52,251 INFO ]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:59:52,251 INFO ]: Start difference. First operand 159 states and 312 transitions. Second operand 15 states. [2018-06-24 21:59:52,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:52,913 INFO ]: Finished difference Result 380 states and 942 transitions. [2018-06-24 21:59:52,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 21:59:52,913 INFO ]: Start accepts. Automaton has 15 states. Word has length 55 [2018-06-24 21:59:52,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:52,919 INFO ]: With dead ends: 380 [2018-06-24 21:59:52,919 INFO ]: Without dead ends: 365 [2018-06-24 21:59:52,920 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:59:52,920 INFO ]: Start minimizeSevpa. Operand 365 states. [2018-06-24 21:59:52,951 INFO ]: Finished minimizeSevpa. Reduced states from 365 to 276. [2018-06-24 21:59:52,951 INFO ]: Start removeUnreachable. Operand 276 states. [2018-06-24 21:59:52,955 INFO ]: Finished removeUnreachable. Reduced from 276 states to 276 states and 589 transitions. [2018-06-24 21:59:52,956 INFO ]: Start accepts. Automaton has 276 states and 589 transitions. Word has length 55 [2018-06-24 21:59:52,956 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:52,956 INFO ]: Abstraction has 276 states and 589 transitions. [2018-06-24 21:59:52,956 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:59:52,957 INFO ]: Start isEmpty. Operand 276 states and 589 transitions. [2018-06-24 21:59:52,962 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-24 21:59:52,962 INFO ]: Found error trace [2018-06-24 21:59:52,962 INFO ]: trace histogram [9, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:52,963 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:52,963 INFO ]: Analyzing trace with hash -561248387, now seen corresponding path program 10 times [2018-06-24 21:59:52,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:52,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:52,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:52,963 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:52,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:53,006 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:53,593 WARN ]: Spent 446.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-06-24 21:59:54,250 WARN ]: Spent 257.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2018-06-24 21:59:54,377 INFO ]: Checked inductivity of 200 backedges. 103 proven. 38 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-06-24 21:59:54,377 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:54,377 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:54,388 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:59:54,434 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:59:54,434 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:54,437 INFO ]: Computing forward predicates... [2018-06-24 21:59:55,187 INFO ]: Checked inductivity of 200 backedges. 105 proven. 38 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-24 21:59:55,206 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:55,206 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-06-24 21:59:55,206 INFO ]: Interpolant automaton has 30 states [2018-06-24 21:59:55,207 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 21:59:55,207 INFO ]: CoverageRelationStatistics Valid=65, Invalid=805, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:59:55,207 INFO ]: Start difference. First operand 276 states and 589 transitions. Second operand 30 states. [2018-06-24 21:59:58,249 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:58,249 INFO ]: Finished difference Result 490 states and 1334 transitions. [2018-06-24 21:59:58,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:59:58,250 INFO ]: Start accepts. Automaton has 30 states. Word has length 56 [2018-06-24 21:59:58,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:58,256 INFO ]: With dead ends: 490 [2018-06-24 21:59:58,256 INFO ]: Without dead ends: 490 [2018-06-24 21:59:58,257 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=267, Invalid=2925, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 21:59:58,257 INFO ]: Start minimizeSevpa. Operand 490 states. [2018-06-24 21:59:58,304 INFO ]: Finished minimizeSevpa. Reduced states from 490 to 332. [2018-06-24 21:59:58,304 INFO ]: Start removeUnreachable. Operand 332 states. [2018-06-24 21:59:58,309 INFO ]: Finished removeUnreachable. Reduced from 332 states to 332 states and 757 transitions. [2018-06-24 21:59:58,309 INFO ]: Start accepts. Automaton has 332 states and 757 transitions. Word has length 56 [2018-06-24 21:59:58,309 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:58,309 INFO ]: Abstraction has 332 states and 757 transitions. [2018-06-24 21:59:58,309 INFO ]: Interpolant automaton has 30 states. [2018-06-24 21:59:58,309 INFO ]: Start isEmpty. Operand 332 states and 757 transitions. [2018-06-24 21:59:58,316 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-24 21:59:58,316 INFO ]: Found error trace [2018-06-24 21:59:58,316 INFO ]: trace histogram [11, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:58,316 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:58,316 INFO ]: Analyzing trace with hash -1139147976, now seen corresponding path program 11 times [2018-06-24 21:59:58,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:58,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:58,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:58,317 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:58,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:58,336 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:58,468 INFO ]: Checked inductivity of 277 backedges. 167 proven. 29 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-24 21:59:58,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:58,468 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:58,474 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:59:58,528 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 21:59:58,529 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:58,531 INFO ]: Computing forward predicates... [2018-06-24 21:59:58,576 INFO ]: Checked inductivity of 277 backedges. 167 proven. 29 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-24 21:59:58,595 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:58,595 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-24 21:59:58,595 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:59:58,595 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:59:58,595 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:59:58,595 INFO ]: Start difference. First operand 332 states and 757 transitions. Second operand 14 states. [2018-06-24 21:59:58,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:58,785 INFO ]: Finished difference Result 334 states and 759 transitions. [2018-06-24 21:59:58,790 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:59:58,790 INFO ]: Start accepts. Automaton has 14 states. Word has length 64 [2018-06-24 21:59:58,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:58,793 INFO ]: With dead ends: 334 [2018-06-24 21:59:58,793 INFO ]: Without dead ends: 334 [2018-06-24 21:59:58,794 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:59:58,794 INFO ]: Start minimizeSevpa. Operand 334 states. [2018-06-24 21:59:58,818 INFO ]: Finished minimizeSevpa. Reduced states from 334 to 334. [2018-06-24 21:59:58,818 INFO ]: Start removeUnreachable. Operand 334 states. [2018-06-24 21:59:58,824 INFO ]: Finished removeUnreachable. Reduced from 334 states to 334 states and 759 transitions. [2018-06-24 21:59:58,824 INFO ]: Start accepts. Automaton has 334 states and 759 transitions. Word has length 64 [2018-06-24 21:59:58,824 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:58,824 INFO ]: Abstraction has 334 states and 759 transitions. [2018-06-24 21:59:58,824 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:59:58,824 INFO ]: Start isEmpty. Operand 334 states and 759 transitions. [2018-06-24 21:59:58,831 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-24 21:59:58,831 INFO ]: Found error trace [2018-06-24 21:59:58,831 INFO ]: trace histogram [12, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:58,831 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:58,831 INFO ]: Analyzing trace with hash 600341992, now seen corresponding path program 12 times [2018-06-24 21:59:58,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:58,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:58,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:58,832 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:58,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:58,870 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:59,282 WARN ]: Spent 305.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-06-24 21:59:59,990 WARN ]: Spent 393.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 6 [2018-06-24 22:00:00,261 INFO ]: Checked inductivity of 296 backedges. 185 proven. 45 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 22:00:00,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:00,261 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:00,270 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 22:00:00,329 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 22:00:00,329 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:00,333 INFO ]: Computing forward predicates... [2018-06-24 22:00:01,079 INFO ]: Checked inductivity of 296 backedges. 211 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-24 22:00:01,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:00:01,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2018-06-24 22:00:01,098 INFO ]: Interpolant automaton has 36 states [2018-06-24 22:00:01,099 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 22:00:01,099 INFO ]: CoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 22:00:01,099 INFO ]: Start difference. First operand 334 states and 759 transitions. Second operand 36 states. [2018-06-24 22:00:03,697 WARN ]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-24 22:00:05,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:05,477 INFO ]: Finished difference Result 499 states and 1334 transitions. [2018-06-24 22:00:05,478 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-06-24 22:00:05,478 INFO ]: Start accepts. Automaton has 36 states. Word has length 65 [2018-06-24 22:00:05,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:05,487 INFO ]: With dead ends: 499 [2018-06-24 22:00:05,487 INFO ]: Without dead ends: 499 [2018-06-24 22:00:05,489 INFO ]: 0 DeclaredPredicates, 157 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=729, Invalid=6243, Unknown=0, NotChecked=0, Total=6972 [2018-06-24 22:00:05,489 INFO ]: Start minimizeSevpa. Operand 499 states. [2018-06-24 22:00:05,524 INFO ]: Finished minimizeSevpa. Reduced states from 499 to 320. [2018-06-24 22:00:05,524 INFO ]: Start removeUnreachable. Operand 320 states. [2018-06-24 22:00:05,532 INFO ]: Finished removeUnreachable. Reduced from 320 states to 320 states and 674 transitions. [2018-06-24 22:00:05,533 INFO ]: Start accepts. Automaton has 320 states and 674 transitions. Word has length 65 [2018-06-24 22:00:05,533 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:05,533 INFO ]: Abstraction has 320 states and 674 transitions. [2018-06-24 22:00:05,533 INFO ]: Interpolant automaton has 36 states. [2018-06-24 22:00:05,533 INFO ]: Start isEmpty. Operand 320 states and 674 transitions. [2018-06-24 22:00:05,539 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-24 22:00:05,539 INFO ]: Found error trace [2018-06-24 22:00:05,539 INFO ]: trace histogram [11, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:05,539 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:05,539 INFO ]: Analyzing trace with hash -744046972, now seen corresponding path program 13 times [2018-06-24 22:00:05,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:05,539 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:05,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:05,539 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:00:05,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:05,560 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:06,383 INFO ]: Checked inductivity of 277 backedges. 126 proven. 34 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-06-24 22:00:06,383 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:06,383 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:06,390 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:06,438 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:06,442 INFO ]: Computing forward predicates... [2018-06-24 22:00:06,520 INFO ]: Checked inductivity of 277 backedges. 173 proven. 3 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-24 22:00:06,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:00:06,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 20 [2018-06-24 22:00:06,553 INFO ]: Interpolant automaton has 20 states [2018-06-24 22:00:06,553 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 22:00:06,553 INFO ]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-06-24 22:00:06,553 INFO ]: Start difference. First operand 320 states and 674 transitions. Second operand 20 states. [2018-06-24 22:00:09,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:09,804 INFO ]: Finished difference Result 505 states and 1464 transitions. [2018-06-24 22:00:09,805 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-06-24 22:00:09,806 INFO ]: Start accepts. Automaton has 20 states. Word has length 64 [2018-06-24 22:00:09,806 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:09,810 INFO ]: With dead ends: 505 [2018-06-24 22:00:09,810 INFO ]: Without dead ends: 505 [2018-06-24 22:00:09,811 INFO ]: 0 DeclaredPredicates, 152 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=691, Invalid=4565, Unknown=0, NotChecked=0, Total=5256 [2018-06-24 22:00:09,812 INFO ]: Start minimizeSevpa. Operand 505 states. [2018-06-24 22:00:09,850 INFO ]: Finished minimizeSevpa. Reduced states from 505 to 332. [2018-06-24 22:00:09,850 INFO ]: Start removeUnreachable. Operand 332 states. [2018-06-24 22:00:09,853 INFO ]: Finished removeUnreachable. Reduced from 332 states to 332 states and 742 transitions. [2018-06-24 22:00:09,853 INFO ]: Start accepts. Automaton has 332 states and 742 transitions. Word has length 64 [2018-06-24 22:00:09,853 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:09,853 INFO ]: Abstraction has 332 states and 742 transitions. [2018-06-24 22:00:09,853 INFO ]: Interpolant automaton has 20 states. [2018-06-24 22:00:09,854 INFO ]: Start isEmpty. Operand 332 states and 742 transitions. [2018-06-24 22:00:09,858 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-24 22:00:09,858 INFO ]: Found error trace [2018-06-24 22:00:09,858 INFO ]: trace histogram [13, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:09,859 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:09,859 INFO ]: Analyzing trace with hash 424004744, now seen corresponding path program 14 times [2018-06-24 22:00:09,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:09,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:09,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:09,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:00:09,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:09,879 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:10,270 INFO ]: Checked inductivity of 316 backedges. 166 proven. 45 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-06-24 22:00:10,271 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:10,271 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:10,276 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 22:00:10,327 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 22:00:10,328 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:10,330 INFO ]: Computing forward predicates... [2018-06-24 22:00:10,357 INFO ]: Checked inductivity of 316 backedges. 174 proven. 39 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-24 22:00:10,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:00:10,376 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 18 [2018-06-24 22:00:10,376 INFO ]: Interpolant automaton has 18 states [2018-06-24 22:00:10,376 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 22:00:10,376 INFO ]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-06-24 22:00:10,376 INFO ]: Start difference. First operand 332 states and 742 transitions. Second operand 18 states. [2018-06-24 22:00:12,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:12,019 INFO ]: Finished difference Result 517 states and 1657 transitions. [2018-06-24 22:00:12,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-24 22:00:12,019 INFO ]: Start accepts. Automaton has 18 states. Word has length 66 [2018-06-24 22:00:12,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:12,027 INFO ]: With dead ends: 517 [2018-06-24 22:00:12,027 INFO ]: Without dead ends: 517 [2018-06-24 22:00:12,029 INFO ]: 0 DeclaredPredicates, 160 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=709, Invalid=3983, Unknown=0, NotChecked=0, Total=4692 [2018-06-24 22:00:12,029 INFO ]: Start minimizeSevpa. Operand 517 states. [2018-06-24 22:00:12,076 INFO ]: Finished minimizeSevpa. Reduced states from 517 to 348. [2018-06-24 22:00:12,076 INFO ]: Start removeUnreachable. Operand 348 states. [2018-06-24 22:00:12,079 INFO ]: Finished removeUnreachable. Reduced from 348 states to 348 states and 805 transitions. [2018-06-24 22:00:12,080 INFO ]: Start accepts. Automaton has 348 states and 805 transitions. Word has length 66 [2018-06-24 22:00:12,080 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:12,080 INFO ]: Abstraction has 348 states and 805 transitions. [2018-06-24 22:00:12,080 INFO ]: Interpolant automaton has 18 states. [2018-06-24 22:00:12,080 INFO ]: Start isEmpty. Operand 348 states and 805 transitions. [2018-06-24 22:00:12,086 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-24 22:00:12,086 INFO ]: Found error trace [2018-06-24 22:00:12,086 INFO ]: trace histogram [15, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:12,086 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:12,086 INFO ]: Analyzing trace with hash 167131949, now seen corresponding path program 15 times [2018-06-24 22:00:12,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:12,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:12,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:12,088 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:00:12,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:12,112 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:12,289 INFO ]: Checked inductivity of 410 backedges. 106 proven. 66 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-06-24 22:00:12,289 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:12,289 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:12,297 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 22:00:12,360 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 22:00:12,360 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:12,363 INFO ]: Computing forward predicates... [2018-06-24 22:00:12,409 INFO ]: Checked inductivity of 410 backedges. 103 proven. 69 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-06-24 22:00:12,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:00:12,442 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-24 22:00:12,442 INFO ]: Interpolant automaton has 16 states [2018-06-24 22:00:12,442 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 22:00:12,442 INFO ]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-06-24 22:00:12,442 INFO ]: Start difference. First operand 348 states and 805 transitions. Second operand 16 states. [2018-06-24 22:00:13,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:13,289 INFO ]: Finished difference Result 651 states and 1852 transitions. [2018-06-24 22:00:13,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 22:00:13,289 INFO ]: Start accepts. Automaton has 16 states. Word has length 74 [2018-06-24 22:00:13,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:13,298 INFO ]: With dead ends: 651 [2018-06-24 22:00:13,298 INFO ]: Without dead ends: 651 [2018-06-24 22:00:13,299 INFO ]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=1182, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 22:00:13,299 INFO ]: Start minimizeSevpa. Operand 651 states. [2018-06-24 22:00:13,341 INFO ]: Finished minimizeSevpa. Reduced states from 651 to 479. [2018-06-24 22:00:13,341 INFO ]: Start removeUnreachable. Operand 479 states. [2018-06-24 22:00:13,346 INFO ]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1198 transitions. [2018-06-24 22:00:13,347 INFO ]: Start accepts. Automaton has 479 states and 1198 transitions. Word has length 74 [2018-06-24 22:00:13,347 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:13,347 INFO ]: Abstraction has 479 states and 1198 transitions. [2018-06-24 22:00:13,347 INFO ]: Interpolant automaton has 16 states. [2018-06-24 22:00:13,347 INFO ]: Start isEmpty. Operand 479 states and 1198 transitions. [2018-06-24 22:00:13,355 INFO ]: Finished isEmpty. Found accepting run of length 76 [2018-06-24 22:00:13,355 INFO ]: Found error trace [2018-06-24 22:00:13,355 INFO ]: trace histogram [16, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:13,355 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:13,355 INFO ]: Analyzing trace with hash 885532517, now seen corresponding path program 16 times [2018-06-24 22:00:13,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:13,355 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:13,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:13,356 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:00:13,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:13,392 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:13,613 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-06-24 22:00:14,268 INFO ]: Checked inductivity of 434 backedges. 229 proven. 92 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-24 22:00:14,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:14,269 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:00:14,275 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 22:00:14,332 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 22:00:14,332 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:14,336 INFO ]: Computing forward predicates... [2018-06-24 22:00:15,381 INFO ]: Checked inductivity of 434 backedges. 232 proven. 83 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-06-24 22:00:15,413 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:00:15,413 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 42 [2018-06-24 22:00:15,414 INFO ]: Interpolant automaton has 42 states [2018-06-24 22:00:15,414 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-24 22:00:15,414 INFO ]: CoverageRelationStatistics Valid=109, Invalid=1613, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 22:00:15,414 INFO ]: Start difference. First operand 479 states and 1198 transitions. Second operand 42 states. [2018-06-24 22:00:19,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:19,723 INFO ]: Finished difference Result 899 states and 3135 transitions. [2018-06-24 22:00:19,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 22:00:19,723 INFO ]: Start accepts. Automaton has 42 states. Word has length 75 [2018-06-24 22:00:19,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:19,741 INFO ]: With dead ends: 899 [2018-06-24 22:00:19,741 INFO ]: Without dead ends: 899 [2018-06-24 22:00:19,742 INFO ]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=362, Invalid=4750, Unknown=0, NotChecked=0, Total=5112 [2018-06-24 22:00:19,743 INFO ]: Start minimizeSevpa. Operand 899 states. [2018-06-24 22:00:19,822 INFO ]: Finished minimizeSevpa. Reduced states from 899 to 570. [2018-06-24 22:00:19,822 INFO ]: Start removeUnreachable. Operand 570 states. [2018-06-24 22:00:19,829 INFO ]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1468 transitions. [2018-06-24 22:00:19,829 INFO ]: Start accepts. Automaton has 570 states and 1468 transitions. Word has length 75 [2018-06-24 22:00:19,829 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:19,829 INFO ]: Abstraction has 570 states and 1468 transitions. [2018-06-24 22:00:19,829 INFO ]: Interpolant automaton has 42 states. [2018-06-24 22:00:19,829 INFO ]: Start isEmpty. Operand 570 states and 1468 transitions. [2018-06-24 22:00:19,839 INFO ]: Finished isEmpty. Found accepting run of length 85 [2018-06-24 22:00:19,839 INFO ]: Found error trace [2018-06-24 22:00:19,839 INFO ]: trace histogram [19, 10, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:00:19,839 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:19,840 INFO ]: Analyzing trace with hash -1808547270, now seen corresponding path program 17 times [2018-06-24 22:00:19,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:19,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:19,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:19,840 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:00:19,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:19,870 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 22:00:19,965 WARN ]: Verification canceled [2018-06-24 22:00:19,967 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 22:00:19,969 WARN ]: Timeout [2018-06-24 22:00:19,969 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:00:19 BasicIcfg [2018-06-24 22:00:19,969 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 22:00:19,973 INFO ]: Toolchain (without parser) took 57842.34 ms. Allocated memory was 306.7 MB in the beginning and 892.9 MB in the end (delta: 586.2 MB). Free memory was 261.2 MB in the beginning and 436.3 MB in the end (delta: -175.1 MB). Peak memory consumption was 411.1 MB. Max. memory is 3.6 GB. [2018-06-24 22:00:19,974 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 22:00:19,974 INFO ]: ChcToBoogie took 61.44 ms. Allocated memory is still 306.7 MB. Free memory was 261.2 MB in the beginning and 258.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:00:19,974 INFO ]: Boogie Preprocessor took 46.84 ms. Allocated memory is still 306.7 MB. Free memory was 258.2 MB in the beginning and 257.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-24 22:00:19,974 INFO ]: RCFGBuilder took 463.60 ms. Allocated memory is still 306.7 MB. Free memory was 257.2 MB in the beginning and 244.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:00:19,975 INFO ]: BlockEncodingV2 took 192.42 ms. Allocated memory is still 306.7 MB. Free memory was 244.3 MB in the beginning and 237.3 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:00:19,975 INFO ]: TraceAbstraction took 57065.56 ms. Allocated memory was 306.7 MB in the beginning and 892.9 MB in the end (delta: 586.2 MB). Free memory was 237.3 MB in the beginning and 436.3 MB in the end (delta: -199.1 MB). Peak memory consumption was 387.1 MB. Max. memory is 3.6 GB. [2018-06-24 22:00:19,978 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 29 locations, 50 edges - StatisticsResult: Encoded RCFG 19 locations, 37 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.44 ms. Allocated memory is still 306.7 MB. Free memory was 261.2 MB in the beginning and 258.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.84 ms. Allocated memory is still 306.7 MB. Free memory was 258.2 MB in the beginning and 257.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 463.60 ms. Allocated memory is still 306.7 MB. Free memory was 257.2 MB in the beginning and 244.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 192.42 ms. Allocated memory is still 306.7 MB. Free memory was 244.3 MB in the beginning and 237.3 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57065.56 ms. Allocated memory was 306.7 MB in the beginning and 892.9 MB in the end (delta: 586.2 MB). Free memory was 237.3 MB in the beginning and 436.3 MB in the end (delta: -199.1 MB). Peak memory consumption was 387.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 19, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 83 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. TIMEOUT Result, 56.9s OverallTime, 26 OverallIterations, 19 TraceHistogramMax, 36.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1619 SDtfs, 1578 SDslu, 9868 SDs, 0 SdLazy, 22078 SolverSat, 2678 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 952 SyntacticMatches, 10 SemanticMatches, 863 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12604 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=25, 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.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 1760 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 1829 NumberOfCodeBlocks, 1815 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 1784 ConstructedInterpolants, 0 QuantifiedInterpolants, 499446 SizeOfPredicates, 232 NumberOfNonLiveVariables, 6990 ConjunctsInSsa, 794 ConjunctsInUnsatCore, 45 InterpolantComputations, 7 PerfectInterpolantSequences, 5351/6237 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__inlining.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_22-00-19-988.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__inlining.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_22-00-19-988.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__inlining.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_22-00-19-988.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__inlining.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_22-00-19-988.csv Completed graceful shutdown