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__cocome1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:59:09,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:59:09,241 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:59:09,257 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:59:09,257 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:59:09,258 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:59:09,259 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:59:09,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:59:09,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:59:09,263 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:59:09,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:59:09,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:59:09,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:59:09,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:59:09,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:59:09,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:59:09,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:59:09,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:59:09,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:59:09,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:59:09,288 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:59:09,295 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:59:09,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:59:09,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:59:09,297 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:59:09,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:59:09,298 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:59:09,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:59:09,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:59:09,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:59:09,307 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:59:09,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:59:09,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:59:09,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:59:09,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:59:09,309 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:09,326 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:59:09,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:59:09,326 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:59:09,327 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:59:09,328 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:59:09,328 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:59:09,328 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:59:09,328 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:59:09,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:59:09,329 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:59:09,329 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:59:09,329 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:59:09,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:59:09,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:59:09,330 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:59:09,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:59:09,330 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:59:09,330 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:59:09,330 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:59:09,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:59:09,331 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:59:09,332 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:59:09,333 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:59:09,377 INFO ]: Repository-Root is: /tmp [2018-06-24 21:59:09,395 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:59:09,401 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:59:09,403 INFO ]: Initializing SmtParser... [2018-06-24 21:59:09,403 INFO ]: SmtParser initialized [2018-06-24 21:59:09,403 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__cocome1.smt2 [2018-06-24 21:59:09,405 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:09,498 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__cocome1.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@7b425343 [2018-06-24 21:59:09,734 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__cocome1.smt2 [2018-06-24 21:59:09,742 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:59:09,754 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:59:09,755 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:59:09,755 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:59:09,755 INFO ]: ChcToBoogie initialized [2018-06-24 21:59:09,759 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:59:09" (1/1) ... [2018-06-24 21:59:09,816 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:09 Unit [2018-06-24 21:59:09,817 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:59:09,817 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:59:09,817 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:59:09,817 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:59:09,837 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:09" (1/1) ... [2018-06-24 21:59:09,837 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:09" (1/1) ... [2018-06-24 21:59:09,843 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:09" (1/1) ... [2018-06-24 21:59:09,844 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:09" (1/1) ... [2018-06-24 21:59:09,848 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:09" (1/1) ... [2018-06-24 21:59:09,850 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:09" (1/1) ... [2018-06-24 21:59:09,851 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:09" (1/1) ... [2018-06-24 21:59:09,854 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:59:09,855 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:59:09,855 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:59:09,855 INFO ]: RCFGBuilder initialized [2018-06-24 21:59:09,856 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:09" (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:09,872 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:59:09,872 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:59:09,872 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:59:09,872 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:59:09,872 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:59:09,872 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:10,307 INFO ]: Using library mode [2018-06-24 21:59:10,308 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:59:10 BoogieIcfgContainer [2018-06-24 21:59:10,308 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:59:10,308 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:59:10,308 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:59:10,309 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:59:10,309 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:59:10" (1/1) ... [2018-06-24 21:59:10,329 INFO ]: Initial Icfg 28 locations, 43 edges [2018-06-24 21:59:10,330 INFO ]: Using Remove infeasible edges [2018-06-24 21:59:10,331 INFO ]: Using Maximize final states [2018-06-24 21:59:10,331 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:59:10,331 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:59:10,333 INFO ]: Using Remove sink states [2018-06-24 21:59:10,334 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:59:10,336 INFO ]: Using Use SBE [2018-06-24 21:59:10,343 INFO ]: SBE split 0 edges [2018-06-24 21:59:10,348 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:59:10,350 INFO ]: 0 new accepting states [2018-06-24 21:59:10,453 INFO ]: Removed 21 edges and 7 locations by large block encoding [2018-06-24 21:59:10,455 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:59:10,456 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:59:10,456 INFO ]: 0 new accepting states [2018-06-24 21:59:10,457 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:59:10,457 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:59:10,457 INFO ]: Encoded RCFG 19 locations, 36 edges [2018-06-24 21:59:10,458 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:59:10 BasicIcfg [2018-06-24 21:59:10,458 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:59:10,459 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:59:10,459 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:59:10,462 INFO ]: TraceAbstraction initialized [2018-06-24 21:59:10,463 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:59:09" (1/4) ... [2018-06-24 21:59:10,464 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3065fd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:59:10, skipping insertion in model container [2018-06-24 21:59:10,464 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:59:09" (2/4) ... [2018-06-24 21:59:10,465 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3065fd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:59:10, skipping insertion in model container [2018-06-24 21:59:10,465 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:59:10" (3/4) ... [2018-06-24 21:59:10,465 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3065fd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:59:10, skipping insertion in model container [2018-06-24 21:59:10,465 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:59:10" (4/4) ... [2018-06-24 21:59:10,467 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:59:10,478 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:59:10,487 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:59:10,522 INFO ]: Using default assertion order modulation [2018-06-24 21:59:10,523 INFO ]: Interprodecural is true [2018-06-24 21:59:10,523 INFO ]: Hoare is false [2018-06-24 21:59:10,523 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:59:10,523 INFO ]: Backedges is TWOTRACK [2018-06-24 21:59:10,523 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:59:10,523 INFO ]: Difference is false [2018-06-24 21:59:10,523 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:59:10,523 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:59:10,532 INFO ]: Start isEmpty. Operand 19 states. [2018-06-24 21:59:10,547 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:59:10,547 INFO ]: Found error trace [2018-06-24 21:59:10,548 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:59:10,548 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:10,552 INFO ]: Analyzing trace with hash 38268259, now seen corresponding path program 1 times [2018-06-24 21:59:10,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:10,554 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:10,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:10,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:10,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:10,626 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:10,673 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:10,674 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:10,674 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:10,676 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:10,688 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:10,689 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:10,691 INFO ]: Start difference. First operand 19 states. Second operand 3 states. [2018-06-24 21:59:10,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:10,938 INFO ]: Finished difference Result 35 states and 67 transitions. [2018-06-24 21:59:10,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:10,939 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:59:10,940 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:10,950 INFO ]: With dead ends: 35 [2018-06-24 21:59:10,950 INFO ]: Without dead ends: 35 [2018-06-24 21:59:10,951 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:10,966 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:59:11,013 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 21:59:11,015 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:59:11,018 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. [2018-06-24 21:59:11,019 INFO ]: Start accepts. Automaton has 35 states and 67 transitions. Word has length 5 [2018-06-24 21:59:11,021 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:11,021 INFO ]: Abstraction has 35 states and 67 transitions. [2018-06-24 21:59:11,021 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:11,022 INFO ]: Start isEmpty. Operand 35 states and 67 transitions. [2018-06-24 21:59:11,023 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:59:11,023 INFO ]: Found error trace [2018-06-24 21:59:11,023 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:59:11,023 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:11,023 INFO ]: Analyzing trace with hash 1189571245, now seen corresponding path program 1 times [2018-06-24 21:59:11,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:11,024 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:11,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:11,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,034 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:11,108 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:11,108 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:11,109 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:11,110 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:11,110 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:11,110 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:11,110 INFO ]: Start difference. First operand 35 states and 67 transitions. Second operand 3 states. [2018-06-24 21:59:11,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:11,441 INFO ]: Finished difference Result 51 states and 100 transitions. [2018-06-24 21:59:11,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:11,441 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:59:11,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:11,444 INFO ]: With dead ends: 51 [2018-06-24 21:59:11,444 INFO ]: Without dead ends: 51 [2018-06-24 21:59:11,445 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:11,445 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 21:59:11,457 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-24 21:59:11,457 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 21:59:11,459 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 100 transitions. [2018-06-24 21:59:11,460 INFO ]: Start accepts. Automaton has 51 states and 100 transitions. Word has length 6 [2018-06-24 21:59:11,460 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:11,460 INFO ]: Abstraction has 51 states and 100 transitions. [2018-06-24 21:59:11,460 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:11,460 INFO ]: Start isEmpty. Operand 51 states and 100 transitions. [2018-06-24 21:59:11,460 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:59:11,461 INFO ]: Found error trace [2018-06-24 21:59:11,461 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:59:11,461 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:11,461 INFO ]: Analyzing trace with hash 1191984316, now seen corresponding path program 1 times [2018-06-24 21:59:11,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:11,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:11,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:11,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,483 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:11,531 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:11,531 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:11,532 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:11,532 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:11,532 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:11,532 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:11,532 INFO ]: Start difference. First operand 51 states and 100 transitions. Second operand 3 states. [2018-06-24 21:59:11,575 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:11,576 INFO ]: Finished difference Result 96 states and 215 transitions. [2018-06-24 21:59:11,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:11,576 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:59:11,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:11,581 INFO ]: With dead ends: 96 [2018-06-24 21:59:11,581 INFO ]: Without dead ends: 96 [2018-06-24 21:59:11,582 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:11,582 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-24 21:59:11,601 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 54. [2018-06-24 21:59:11,601 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-24 21:59:11,603 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 109 transitions. [2018-06-24 21:59:11,603 INFO ]: Start accepts. Automaton has 54 states and 109 transitions. Word has length 6 [2018-06-24 21:59:11,603 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:11,603 INFO ]: Abstraction has 54 states and 109 transitions. [2018-06-24 21:59:11,603 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:11,603 INFO ]: Start isEmpty. Operand 54 states and 109 transitions. [2018-06-24 21:59:11,606 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:59:11,606 INFO ]: Found error trace [2018-06-24 21:59:11,607 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:11,607 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:11,607 INFO ]: Analyzing trace with hash 1983028345, now seen corresponding path program 1 times [2018-06-24 21:59:11,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:11,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:11,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:11,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,614 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:11,636 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:11,636 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:11,636 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:59:11,637 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:59:11,637 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:59:11,637 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:59:11,637 INFO ]: Start difference. First operand 54 states and 109 transitions. Second operand 3 states. [2018-06-24 21:59:11,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:11,649 INFO ]: Finished difference Result 23 states and 35 transitions. [2018-06-24 21:59:11,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:59:11,650 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 21:59:11,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:11,650 INFO ]: With dead ends: 23 [2018-06-24 21:59:11,650 INFO ]: Without dead ends: 19 [2018-06-24 21:59:11,651 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:11,651 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:59:11,653 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-24 21:59:11,653 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:59:11,653 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-06-24 21:59:11,653 INFO ]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2018-06-24 21:59:11,653 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:11,653 INFO ]: Abstraction has 17 states and 23 transitions. [2018-06-24 21:59:11,653 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:59:11,654 INFO ]: Start isEmpty. Operand 17 states and 23 transitions. [2018-06-24 21:59:11,655 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:59:11,655 INFO ]: Found error trace [2018-06-24 21:59:11,655 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:11,655 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:11,655 INFO ]: Analyzing trace with hash 1500796004, now seen corresponding path program 1 times [2018-06-24 21:59:11,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:11,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:11,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:11,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,674 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:11,758 INFO ]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:59:11,758 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:59:11,758 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 21:59:11,758 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:59:11,758 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:59:11,758 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:59:11,758 INFO ]: Start difference. First operand 17 states and 23 transitions. Second operand 6 states. [2018-06-24 21:59:11,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:11,974 INFO ]: Finished difference Result 25 states and 37 transitions. [2018-06-24 21:59:11,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:59:11,975 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-24 21:59:11,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:11,976 INFO ]: With dead ends: 25 [2018-06-24 21:59:11,976 INFO ]: Without dead ends: 25 [2018-06-24 21:59:11,976 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:59:11,976 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 21:59:11,979 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-06-24 21:59:11,979 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:59:11,980 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-24 21:59:11,980 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 12 [2018-06-24 21:59:11,980 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:11,980 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-24 21:59:11,980 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:59:11,980 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-24 21:59:11,981 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:59:11,981 INFO ]: Found error trace [2018-06-24 21:59:11,981 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:11,987 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:11,987 INFO ]: Analyzing trace with hash -720373209, now seen corresponding path program 1 times [2018-06-24 21:59:11,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:11,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:11,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:11,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:11,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:12,011 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:12,179 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:59:12,179 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:12,179 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:12,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:12,216 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:12,224 INFO ]: Computing forward predicates... [2018-06-24 21:59:12,639 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:59:12,660 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:12,660 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 21:59:12,661 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:59:12,661 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:59:12,661 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:59:12,661 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 7 states. [2018-06-24 21:59:12,898 WARN ]: Spent 194.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-06-24 21:59:13,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:13,110 INFO ]: Finished difference Result 29 states and 39 transitions. [2018-06-24 21:59:13,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:59:13,112 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-24 21:59:13,112 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:13,113 INFO ]: With dead ends: 29 [2018-06-24 21:59:13,113 INFO ]: Without dead ends: 29 [2018-06-24 21:59:13,113 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:59:13,113 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:59:13,116 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-24 21:59:13,116 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:59:13,118 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-24 21:59:13,118 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2018-06-24 21:59:13,118 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:13,118 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-24 21:59:13,118 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:59:13,118 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-24 21:59:13,119 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:59:13,119 INFO ]: Found error trace [2018-06-24 21:59:13,119 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:59:13,119 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:13,119 INFO ]: Analyzing trace with hash 611677567, now seen corresponding path program 2 times [2018-06-24 21:59:13,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:13,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:13,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:13,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:13,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:13,141 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:13,201 INFO ]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:59:13,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:13,201 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:13,209 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:59:13,264 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:59:13,264 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:13,267 INFO ]: Computing forward predicates... [2018-06-24 21:59:13,299 INFO ]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:59:13,328 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:13,328 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 21:59:13,329 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:59:13,329 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:59:13,329 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:59:13,329 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 7 states. [2018-06-24 21:59:13,526 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:13,526 INFO ]: Finished difference Result 31 states and 47 transitions. [2018-06-24 21:59:13,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:59:13,527 INFO ]: Start accepts. Automaton has 7 states. Word has length 19 [2018-06-24 21:59:13,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:13,528 INFO ]: With dead ends: 31 [2018-06-24 21:59:13,528 INFO ]: Without dead ends: 29 [2018-06-24 21:59:13,528 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:59:13,528 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:59:13,532 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-24 21:59:13,532 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 21:59:13,533 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-06-24 21:59:13,533 INFO ]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 19 [2018-06-24 21:59:13,533 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:13,533 INFO ]: Abstraction has 27 states and 36 transitions. [2018-06-24 21:59:13,533 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:59:13,533 INFO ]: Start isEmpty. Operand 27 states and 36 transitions. [2018-06-24 21:59:13,534 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:59:13,534 INFO ]: Found error trace [2018-06-24 21:59:13,534 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-06-24 21:59:13,534 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:13,534 INFO ]: Analyzing trace with hash -1383206926, now seen corresponding path program 3 times [2018-06-24 21:59:13,534 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:13,534 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:13,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:13,535 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:13,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:13,573 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:13,754 INFO ]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:59:13,754 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:13,754 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:13,762 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:59:13,804 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:59:13,804 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:13,807 INFO ]: Computing forward predicates... [2018-06-24 21:59:13,998 INFO ]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:59:14,023 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:14,023 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2018-06-24 21:59:14,024 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:59:14,024 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:59:14,024 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:59:14,024 INFO ]: Start difference. First operand 27 states and 36 transitions. Second operand 14 states. [2018-06-24 21:59:14,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:14,779 INFO ]: Finished difference Result 58 states and 85 transitions. [2018-06-24 21:59:14,780 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:59:14,780 INFO ]: Start accepts. Automaton has 14 states. Word has length 20 [2018-06-24 21:59:14,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:14,781 INFO ]: With dead ends: 58 [2018-06-24 21:59:14,781 INFO ]: Without dead ends: 57 [2018-06-24 21:59:14,781 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:59:14,782 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 21:59:14,787 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-06-24 21:59:14,787 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 21:59:14,788 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2018-06-24 21:59:14,788 INFO ]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 20 [2018-06-24 21:59:14,788 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:14,788 INFO ]: Abstraction has 43 states and 61 transitions. [2018-06-24 21:59:14,788 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:59:14,789 INFO ]: Start isEmpty. Operand 43 states and 61 transitions. [2018-06-24 21:59:14,789 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:59:14,789 INFO ]: Found error trace [2018-06-24 21:59:14,790 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-06-24 21:59:14,790 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:14,790 INFO ]: Analyzing trace with hash 69849177, now seen corresponding path program 4 times [2018-06-24 21:59:14,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:14,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:14,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:14,791 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:14,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:14,811 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:14,901 INFO ]: Checked inductivity of 26 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:59:14,902 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:14,902 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:14,919 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:59:14,944 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:59:14,944 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:14,946 INFO ]: Computing forward predicates... [2018-06-24 21:59:15,108 INFO ]: Checked inductivity of 26 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:59:15,127 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:15,128 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-24 21:59:15,128 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:59:15,128 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:59:15,128 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:59:15,128 INFO ]: Start difference. First operand 43 states and 61 transitions. Second operand 10 states. [2018-06-24 21:59:15,279 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:15,279 INFO ]: Finished difference Result 67 states and 103 transitions. [2018-06-24 21:59:15,280 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:59:15,280 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-24 21:59:15,280 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:15,281 INFO ]: With dead ends: 67 [2018-06-24 21:59:15,281 INFO ]: Without dead ends: 67 [2018-06-24 21:59:15,282 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:59:15,282 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 21:59:15,288 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 61. [2018-06-24 21:59:15,288 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-24 21:59:15,290 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2018-06-24 21:59:15,290 INFO ]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 21 [2018-06-24 21:59:15,290 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:15,290 INFO ]: Abstraction has 61 states and 91 transitions. [2018-06-24 21:59:15,290 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:59:15,290 INFO ]: Start isEmpty. Operand 61 states and 91 transitions. [2018-06-24 21:59:15,292 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 21:59:15,292 INFO ]: Found error trace [2018-06-24 21:59:15,292 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-06-24 21:59:15,292 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:15,293 INFO ]: Analyzing trace with hash 369829369, now seen corresponding path program 5 times [2018-06-24 21:59:15,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:15,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:15,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:15,293 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:15,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:15,314 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:15,431 INFO ]: Checked inductivity of 87 backedges. 43 proven. 18 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-24 21:59:15,432 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:15,432 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:15,440 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:59:15,513 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 21:59:15,513 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:15,516 INFO ]: Computing forward predicates... [2018-06-24 21:59:15,880 INFO ]: Checked inductivity of 87 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 21:59:15,900 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:15,900 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2018-06-24 21:59:15,900 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:59:15,900 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:59:15,900 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:59:15,901 INFO ]: Start difference. First operand 61 states and 91 transitions. Second operand 14 states. [2018-06-24 21:59:16,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:16,635 INFO ]: Finished difference Result 64 states and 102 transitions. [2018-06-24 21:59:16,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:59:16,635 INFO ]: Start accepts. Automaton has 14 states. Word has length 35 [2018-06-24 21:59:16,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:16,636 INFO ]: With dead ends: 64 [2018-06-24 21:59:16,636 INFO ]: Without dead ends: 64 [2018-06-24 21:59:16,637 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:59:16,637 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 21:59:16,647 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-06-24 21:59:16,647 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-24 21:59:16,648 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2018-06-24 21:59:16,648 INFO ]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 35 [2018-06-24 21:59:16,649 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:16,649 INFO ]: Abstraction has 63 states and 99 transitions. [2018-06-24 21:59:16,649 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:59:16,649 INFO ]: Start isEmpty. Operand 63 states and 99 transitions. [2018-06-24 21:59:16,654 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 21:59:16,654 INFO ]: Found error trace [2018-06-24 21:59:16,654 INFO ]: trace histogram [7, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-06-24 21:59:16,655 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:16,655 INFO ]: Analyzing trace with hash 99424489, now seen corresponding path program 6 times [2018-06-24 21:59:16,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:16,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:16,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:16,655 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:16,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:16,691 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:16,799 INFO ]: Checked inductivity of 108 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 21:59:16,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:16,800 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) [2018-06-24 21:59:16,817 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:16,911 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 21:59:16,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:16,914 INFO ]: Computing forward predicates... [2018-06-24 21:59:17,092 INFO ]: Checked inductivity of 108 backedges. 41 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-24 21:59:17,111 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:17,111 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-24 21:59:17,112 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:59:17,112 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:59:17,112 INFO ]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:59:17,112 INFO ]: Start difference. First operand 63 states and 99 transitions. Second operand 16 states. [2018-06-24 21:59:18,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:18,003 INFO ]: Finished difference Result 76 states and 130 transitions. [2018-06-24 21:59:18,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 21:59:18,003 INFO ]: Start accepts. Automaton has 16 states. Word has length 37 [2018-06-24 21:59:18,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:18,005 INFO ]: With dead ends: 76 [2018-06-24 21:59:18,005 INFO ]: Without dead ends: 76 [2018-06-24 21:59:18,005 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=1201, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 21:59:18,005 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-24 21:59:18,013 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-06-24 21:59:18,013 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-24 21:59:18,014 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 113 transitions. [2018-06-24 21:59:18,015 INFO ]: Start accepts. Automaton has 68 states and 113 transitions. Word has length 37 [2018-06-24 21:59:18,015 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:18,015 INFO ]: Abstraction has 68 states and 113 transitions. [2018-06-24 21:59:18,015 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:59:18,015 INFO ]: Start isEmpty. Operand 68 states and 113 transitions. [2018-06-24 21:59:18,018 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 21:59:18,019 INFO ]: Found error trace [2018-06-24 21:59:18,019 INFO ]: trace histogram [9, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-06-24 21:59:18,019 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:18,019 INFO ]: Analyzing trace with hash 380562959, now seen corresponding path program 7 times [2018-06-24 21:59:18,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:18,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:18,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:18,020 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:18,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:18,037 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:18,192 INFO ]: Checked inductivity of 133 backedges. 45 proven. 27 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-24 21:59:18,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:18,193 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:18,199 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:18,255 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:18,259 INFO ]: Computing forward predicates... [2018-06-24 21:59:18,369 INFO ]: Checked inductivity of 133 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-24 21:59:18,388 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:18,388 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-24 21:59:18,388 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:59:18,388 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:59:18,388 INFO ]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:59:18,389 INFO ]: Start difference. First operand 68 states and 113 transitions. Second operand 16 states. [2018-06-24 21:59:18,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:18,613 INFO ]: Finished difference Result 78 states and 131 transitions. [2018-06-24 21:59:18,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:59:18,614 INFO ]: Start accepts. Automaton has 16 states. Word has length 39 [2018-06-24 21:59:18,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:18,615 INFO ]: With dead ends: 78 [2018-06-24 21:59:18,615 INFO ]: Without dead ends: 78 [2018-06-24 21:59:18,616 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:59:18,616 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-24 21:59:18,623 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 71. [2018-06-24 21:59:18,623 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-24 21:59:18,624 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 116 transitions. [2018-06-24 21:59:18,624 INFO ]: Start accepts. Automaton has 71 states and 116 transitions. Word has length 39 [2018-06-24 21:59:18,625 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:18,625 INFO ]: Abstraction has 71 states and 116 transitions. [2018-06-24 21:59:18,625 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:59:18,625 INFO ]: Start isEmpty. Operand 71 states and 116 transitions. [2018-06-24 21:59:18,626 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 21:59:18,626 INFO ]: Found error trace [2018-06-24 21:59:18,626 INFO ]: trace histogram [10, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-06-24 21:59:18,626 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:18,626 INFO ]: Analyzing trace with hash -1087859236, now seen corresponding path program 8 times [2018-06-24 21:59:18,626 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:18,626 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:18,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:18,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:18,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:18,646 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:18,859 WARN ]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-24 21:59:18,953 INFO ]: Checked inductivity of 147 backedges. 54 proven. 22 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-24 21:59:18,953 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:18,953 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:18,959 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:59:18,996 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:59:18,996 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:19,000 INFO ]: Computing forward predicates... [2018-06-24 21:59:19,269 INFO ]: Checked inductivity of 147 backedges. 54 proven. 22 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-24 21:59:19,288 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:19,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-06-24 21:59:19,289 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:59:19,289 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:59:19,289 INFO ]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:59:19,289 INFO ]: Start difference. First operand 71 states and 116 transitions. Second operand 18 states. [2018-06-24 21:59:19,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:19,662 INFO ]: Finished difference Result 113 states and 188 transitions. [2018-06-24 21:59:19,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:59:19,663 INFO ]: Start accepts. Automaton has 18 states. Word has length 40 [2018-06-24 21:59:19,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:19,666 INFO ]: With dead ends: 113 [2018-06-24 21:59:19,666 INFO ]: Without dead ends: 113 [2018-06-24 21:59:19,666 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:59:19,666 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-24 21:59:19,676 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-06-24 21:59:19,676 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-24 21:59:19,679 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 176 transitions. [2018-06-24 21:59:19,679 INFO ]: Start accepts. Automaton has 107 states and 176 transitions. Word has length 40 [2018-06-24 21:59:19,679 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:19,679 INFO ]: Abstraction has 107 states and 176 transitions. [2018-06-24 21:59:19,679 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:59:19,679 INFO ]: Start isEmpty. Operand 107 states and 176 transitions. [2018-06-24 21:59:19,683 INFO ]: Finished isEmpty. Found accepting run of length 77 [2018-06-24 21:59:19,683 INFO ]: Found error trace [2018-06-24 21:59:19,684 INFO ]: trace histogram [22, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-06-24 21:59:19,684 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:19,684 INFO ]: Analyzing trace with hash 1700194588, now seen corresponding path program 9 times [2018-06-24 21:59:19,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:19,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:19,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:19,684 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:19,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:19,718 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:20,138 INFO ]: Checked inductivity of 629 backedges. 273 proven. 103 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-06-24 21:59:20,138 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:20,138 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:59:20,144 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:59:20,208 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 21:59:20,208 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:20,214 INFO ]: Computing forward predicates... [2018-06-24 21:59:20,905 INFO ]: Checked inductivity of 629 backedges. 329 proven. 29 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-06-24 21:59:20,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:20,927 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 29 [2018-06-24 21:59:20,927 INFO ]: Interpolant automaton has 29 states [2018-06-24 21:59:20,927 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 21:59:20,927 INFO ]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:59:20,928 INFO ]: Start difference. First operand 107 states and 176 transitions. Second operand 29 states. [2018-06-24 21:59:26,627 WARN ]: Spent 195.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2018-06-24 21:59:27,432 WARN ]: Spent 258.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-06-24 21:59:30,449 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2018-06-24 21:59:35,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:35,704 INFO ]: Finished difference Result 1236 states and 3668 transitions. [2018-06-24 21:59:35,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-06-24 21:59:35,704 INFO ]: Start accepts. Automaton has 29 states. Word has length 76 [2018-06-24 21:59:35,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:35,790 INFO ]: With dead ends: 1236 [2018-06-24 21:59:35,790 INFO ]: Without dead ends: 1234 [2018-06-24 21:59:35,802 INFO ]: 0 DeclaredPredicates, 310 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18537 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=5093, Invalid=44859, Unknown=0, NotChecked=0, Total=49952 [2018-06-24 21:59:35,803 INFO ]: Start minimizeSevpa. Operand 1234 states. [2018-06-24 21:59:35,993 INFO ]: Finished minimizeSevpa. Reduced states from 1234 to 466. [2018-06-24 21:59:35,993 INFO ]: Start removeUnreachable. Operand 466 states. [2018-06-24 21:59:36,006 INFO ]: Finished removeUnreachable. Reduced from 466 states to 466 states and 861 transitions. [2018-06-24 21:59:36,006 INFO ]: Start accepts. Automaton has 466 states and 861 transitions. Word has length 76 [2018-06-24 21:59:36,006 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:36,006 INFO ]: Abstraction has 466 states and 861 transitions. [2018-06-24 21:59:36,006 INFO ]: Interpolant automaton has 29 states. [2018-06-24 21:59:36,006 INFO ]: Start isEmpty. Operand 466 states and 861 transitions. [2018-06-24 21:59:36,016 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-24 21:59:36,016 INFO ]: Found error trace [2018-06-24 21:59:36,016 INFO ]: trace histogram [26, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-06-24 21:59:36,017 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:36,017 INFO ]: Analyzing trace with hash -1760750212, now seen corresponding path program 10 times [2018-06-24 21:59:36,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:36,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:36,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:36,018 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:36,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:36,057 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:36,380 INFO ]: Checked inductivity of 759 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-06-24 21:59:36,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:36,380 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:36,386 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:59:36,457 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:59:36,457 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:36,462 INFO ]: Computing forward predicates... [2018-06-24 21:59:36,990 INFO ]: Checked inductivity of 759 backedges. 462 proven. 45 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-06-24 21:59:37,010 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:37,011 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 25 [2018-06-24 21:59:37,011 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:59:37,011 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:59:37,011 INFO ]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:59:37,011 INFO ]: Start difference. First operand 466 states and 861 transitions. Second operand 25 states. [2018-06-24 21:59:39,384 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:39,384 INFO ]: Finished difference Result 615 states and 1180 transitions. [2018-06-24 21:59:39,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-06-24 21:59:39,387 INFO ]: Start accepts. Automaton has 25 states. Word has length 80 [2018-06-24 21:59:39,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:39,403 INFO ]: With dead ends: 615 [2018-06-24 21:59:39,403 INFO ]: Without dead ends: 615 [2018-06-24 21:59:39,408 INFO ]: 0 DeclaredPredicates, 167 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1296, Invalid=7076, Unknown=0, NotChecked=0, Total=8372 [2018-06-24 21:59:39,409 INFO ]: Start minimizeSevpa. Operand 615 states. [2018-06-24 21:59:39,450 INFO ]: Finished minimizeSevpa. Reduced states from 615 to 528. [2018-06-24 21:59:39,450 INFO ]: Start removeUnreachable. Operand 528 states. [2018-06-24 21:59:39,459 INFO ]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1043 transitions. [2018-06-24 21:59:39,459 INFO ]: Start accepts. Automaton has 528 states and 1043 transitions. Word has length 80 [2018-06-24 21:59:39,460 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:39,460 INFO ]: Abstraction has 528 states and 1043 transitions. [2018-06-24 21:59:39,460 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:59:39,460 INFO ]: Start isEmpty. Operand 528 states and 1043 transitions. [2018-06-24 21:59:39,473 INFO ]: Finished isEmpty. Found accepting run of length 84 [2018-06-24 21:59:39,473 INFO ]: Found error trace [2018-06-24 21:59:39,473 INFO ]: trace histogram [29, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-06-24 21:59:39,473 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:39,473 INFO ]: Analyzing trace with hash -1166463047, now seen corresponding path program 11 times [2018-06-24 21:59:39,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:39,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:39,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:39,475 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:39,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:39,510 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:39,803 INFO ]: Checked inductivity of 867 backedges. 345 proven. 159 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-06-24 21:59:39,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:39,804 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:39,812 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:59:39,887 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 21:59:39,887 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:39,891 INFO ]: Computing forward predicates... [2018-06-24 21:59:40,123 INFO ]: Checked inductivity of 867 backedges. 503 proven. 95 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-06-24 21:59:40,146 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:40,146 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 27 [2018-06-24 21:59:40,146 INFO ]: Interpolant automaton has 27 states [2018-06-24 21:59:40,146 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 21:59:40,147 INFO ]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:59:40,147 INFO ]: Start difference. First operand 528 states and 1043 transitions. Second operand 27 states. [2018-06-24 21:59:43,910 WARN ]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 21:59:44,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:44,276 INFO ]: Finished difference Result 1088 states and 3496 transitions. [2018-06-24 21:59:44,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-06-24 21:59:44,276 INFO ]: Start accepts. Automaton has 27 states. Word has length 83 [2018-06-24 21:59:44,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:44,320 INFO ]: With dead ends: 1088 [2018-06-24 21:59:44,320 INFO ]: Without dead ends: 1088 [2018-06-24 21:59:44,323 INFO ]: 0 DeclaredPredicates, 203 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4329 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1742, Invalid=11830, Unknown=0, NotChecked=0, Total=13572 [2018-06-24 21:59:44,323 INFO ]: Start minimizeSevpa. Operand 1088 states. [2018-06-24 21:59:44,439 INFO ]: Finished minimizeSevpa. Reduced states from 1088 to 840. [2018-06-24 21:59:44,439 INFO ]: Start removeUnreachable. Operand 840 states. [2018-06-24 21:59:44,454 INFO ]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1780 transitions. [2018-06-24 21:59:44,454 INFO ]: Start accepts. Automaton has 840 states and 1780 transitions. Word has length 83 [2018-06-24 21:59:44,454 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:44,454 INFO ]: Abstraction has 840 states and 1780 transitions. [2018-06-24 21:59:44,454 INFO ]: Interpolant automaton has 27 states. [2018-06-24 21:59:44,454 INFO ]: Start isEmpty. Operand 840 states and 1780 transitions. [2018-06-24 21:59:44,469 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-24 21:59:44,469 INFO ]: Found error trace [2018-06-24 21:59:44,469 INFO ]: trace histogram [31, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-06-24 21:59:44,469 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:44,469 INFO ]: Analyzing trace with hash 1827223209, now seen corresponding path program 12 times [2018-06-24 21:59:44,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:44,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:44,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:44,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:44,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:44,505 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:45,500 INFO ]: Checked inductivity of 944 backedges. 420 proven. 136 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-06-24 21:59:45,500 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:45,500 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:45,506 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:59:45,594 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 21:59:45,594 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:45,598 INFO ]: Computing forward predicates... [2018-06-24 21:59:46,025 INFO ]: Checked inductivity of 944 backedges. 463 proven. 141 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-06-24 21:59:46,044 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:46,044 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2018-06-24 21:59:46,045 INFO ]: Interpolant automaton has 34 states [2018-06-24 21:59:46,045 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 21:59:46,045 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:59:46,045 INFO ]: Start difference. First operand 840 states and 1780 transitions. Second operand 34 states. [2018-06-24 21:59:53,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:53,437 INFO ]: Finished difference Result 2475 states and 7855 transitions. [2018-06-24 21:59:53,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-06-24 21:59:53,438 INFO ]: Start accepts. Automaton has 34 states. Word has length 85 [2018-06-24 21:59:53,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:53,562 INFO ]: With dead ends: 2475 [2018-06-24 21:59:53,563 INFO ]: Without dead ends: 2475 [2018-06-24 21:59:53,565 INFO ]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7980 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2744, Invalid=21436, Unknown=0, NotChecked=0, Total=24180 [2018-06-24 21:59:53,567 INFO ]: Start minimizeSevpa. Operand 2475 states. [2018-06-24 21:59:53,817 INFO ]: Finished minimizeSevpa. Reduced states from 2475 to 1573. [2018-06-24 21:59:53,817 INFO ]: Start removeUnreachable. Operand 1573 states. [2018-06-24 21:59:53,850 INFO ]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 3715 transitions. [2018-06-24 21:59:53,851 INFO ]: Start accepts. Automaton has 1573 states and 3715 transitions. Word has length 85 [2018-06-24 21:59:53,851 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:53,851 INFO ]: Abstraction has 1573 states and 3715 transitions. [2018-06-24 21:59:53,851 INFO ]: Interpolant automaton has 34 states. [2018-06-24 21:59:53,851 INFO ]: Start isEmpty. Operand 1573 states and 3715 transitions. [2018-06-24 21:59:53,908 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-24 21:59:53,908 INFO ]: Found error trace [2018-06-24 21:59:53,908 INFO ]: trace histogram [32, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-06-24 21:59:53,908 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:53,908 INFO ]: Analyzing trace with hash 1699772220, now seen corresponding path program 13 times [2018-06-24 21:59:53,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:53,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:53,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:53,910 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:59:53,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:53,940 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:54,807 INFO ]: Checked inductivity of 984 backedges. 214 proven. 150 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-06-24 21:59:54,807 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:54,807 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:54,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:54,886 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:54,890 INFO ]: Computing forward predicates... [2018-06-24 21:59:55,125 INFO ]: Checked inductivity of 984 backedges. 203 proven. 87 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-06-24 21:59:55,144 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:55,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 25 [2018-06-24 21:59:55,145 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:59:55,145 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:59:55,145 INFO ]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:59:55,145 INFO ]: Start difference. First operand 1573 states and 3715 transitions. Second operand 25 states. [2018-06-24 21:59:56,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:59:56,840 INFO ]: Finished difference Result 1812 states and 4240 transitions. [2018-06-24 21:59:56,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-24 21:59:56,840 INFO ]: Start accepts. Automaton has 25 states. Word has length 86 [2018-06-24 21:59:56,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:59:56,898 INFO ]: With dead ends: 1812 [2018-06-24 21:59:56,898 INFO ]: Without dead ends: 1812 [2018-06-24 21:59:56,898 INFO ]: 0 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1075, Invalid=3755, Unknown=0, NotChecked=0, Total=4830 [2018-06-24 21:59:56,901 INFO ]: Start minimizeSevpa. Operand 1812 states. [2018-06-24 21:59:57,046 INFO ]: Finished minimizeSevpa. Reduced states from 1812 to 1580. [2018-06-24 21:59:57,046 INFO ]: Start removeUnreachable. Operand 1580 states. [2018-06-24 21:59:57,079 INFO ]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 3722 transitions. [2018-06-24 21:59:57,080 INFO ]: Start accepts. Automaton has 1580 states and 3722 transitions. Word has length 86 [2018-06-24 21:59:57,080 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:59:57,080 INFO ]: Abstraction has 1580 states and 3722 transitions. [2018-06-24 21:59:57,080 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:59:57,080 INFO ]: Start isEmpty. Operand 1580 states and 3722 transitions. [2018-06-24 21:59:57,134 INFO ]: Finished isEmpty. Found accepting run of length 88 [2018-06-24 21:59:57,134 INFO ]: Found error trace [2018-06-24 21:59:57,134 INFO ]: trace histogram [33, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-06-24 21:59:57,135 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:59:57,135 INFO ]: Analyzing trace with hash 1152922191, now seen corresponding path program 14 times [2018-06-24 21:59:57,135 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:59:57,135 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:59:57,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:57,135 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:59:57,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:59:57,167 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:57,864 INFO ]: Checked inductivity of 1025 backedges. 248 proven. 157 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-06-24 21:59:57,864 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:59:57,865 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:57,870 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:59:57,990 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:59:57,990 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:59:57,996 INFO ]: Computing forward predicates... [2018-06-24 21:59:58,300 INFO ]: Checked inductivity of 1025 backedges. 239 proven. 92 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-06-24 21:59:58,319 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:59:58,319 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 27 [2018-06-24 21:59:58,319 INFO ]: Interpolant automaton has 27 states [2018-06-24 21:59:58,320 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 21:59:58,320 INFO ]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:59:58,320 INFO ]: Start difference. First operand 1580 states and 3722 transitions. Second operand 27 states. [2018-06-24 22:00:00,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:00,252 INFO ]: Finished difference Result 1819 states and 4247 transitions. [2018-06-24 22:00:00,252 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-24 22:00:00,252 INFO ]: Start accepts. Automaton has 27 states. Word has length 87 [2018-06-24 22:00:00,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:00,325 INFO ]: With dead ends: 1819 [2018-06-24 22:00:00,325 INFO ]: Without dead ends: 1819 [2018-06-24 22:00:00,326 INFO ]: 0 DeclaredPredicates, 153 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1193, Invalid=4209, Unknown=0, NotChecked=0, Total=5402 [2018-06-24 22:00:00,327 INFO ]: Start minimizeSevpa. Operand 1819 states. [2018-06-24 22:00:00,468 INFO ]: Finished minimizeSevpa. Reduced states from 1819 to 1587. [2018-06-24 22:00:00,468 INFO ]: Start removeUnreachable. Operand 1587 states. [2018-06-24 22:00:00,502 INFO ]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 3729 transitions. [2018-06-24 22:00:00,502 INFO ]: Start accepts. Automaton has 1587 states and 3729 transitions. Word has length 87 [2018-06-24 22:00:00,503 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:00,503 INFO ]: Abstraction has 1587 states and 3729 transitions. [2018-06-24 22:00:00,503 INFO ]: Interpolant automaton has 27 states. [2018-06-24 22:00:00,503 INFO ]: Start isEmpty. Operand 1587 states and 3729 transitions. [2018-06-24 22:00:00,516 INFO ]: Finished isEmpty. Found accepting run of length 89 [2018-06-24 22:00:00,516 INFO ]: Found error trace [2018-06-24 22:00:00,516 INFO ]: trace histogram [34, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-06-24 22:00:00,516 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:00,516 INFO ]: Analyzing trace with hash 1380440476, now seen corresponding path program 15 times [2018-06-24 22:00:00,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:00,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:00,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:00,517 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:00:00,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:00,549 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:00,947 INFO ]: Checked inductivity of 1067 backedges. 282 proven. 165 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-06-24 22:00:00,947 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:00:00,947 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 22:00:00,953 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 22:00:01,147 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-24 22:00:01,147 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:00:01,154 INFO ]: Computing forward predicates... [2018-06-24 22:00:01,781 INFO ]: Checked inductivity of 1067 backedges. 398 proven. 149 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-06-24 22:00:01,801 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:00:01,801 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2018-06-24 22:00:01,801 INFO ]: Interpolant automaton has 36 states [2018-06-24 22:00:01,801 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 22:00:01,801 INFO ]: CoverageRelationStatistics Valid=121, Invalid=1139, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 22:00:01,802 INFO ]: Start difference. First operand 1587 states and 3729 transitions. Second operand 36 states. [2018-06-24 22:00:06,122 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2018-06-24 22:00:07,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:00:07,725 INFO ]: Finished difference Result 4653 states and 18168 transitions. [2018-06-24 22:00:07,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-06-24 22:00:07,725 INFO ]: Start accepts. Automaton has 36 states. Word has length 88 [2018-06-24 22:00:07,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:00:08,141 INFO ]: With dead ends: 4653 [2018-06-24 22:00:08,141 INFO ]: Without dead ends: 4653 [2018-06-24 22:00:08,143 INFO ]: 0 DeclaredPredicates, 227 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5146 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2749, Invalid=15883, Unknown=0, NotChecked=0, Total=18632 [2018-06-24 22:00:08,145 INFO ]: Start minimizeSevpa. Operand 4653 states. [2018-06-24 22:00:08,627 INFO ]: Finished minimizeSevpa. Reduced states from 4653 to 3535. [2018-06-24 22:00:08,627 INFO ]: Start removeUnreachable. Operand 3535 states. [2018-06-24 22:00:08,756 INFO ]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 8026 transitions. [2018-06-24 22:00:08,756 INFO ]: Start accepts. Automaton has 3535 states and 8026 transitions. Word has length 88 [2018-06-24 22:00:08,756 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:00:08,756 INFO ]: Abstraction has 3535 states and 8026 transitions. [2018-06-24 22:00:08,756 INFO ]: Interpolant automaton has 36 states. [2018-06-24 22:00:08,756 INFO ]: Start isEmpty. Operand 3535 states and 8026 transitions. [2018-06-24 22:00:08,809 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-24 22:00:08,809 INFO ]: Found error trace [2018-06-24 22:00:08,809 INFO ]: trace histogram [35, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-06-24 22:00:08,809 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:00:08,809 INFO ]: Analyzing trace with hash -156427281, now seen corresponding path program 16 times [2018-06-24 22:00:08,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:00:08,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:00:08,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:08,810 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:00:08,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:00:08,842 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 22:00:09,250 WARN ]: Verification canceled [2018-06-24 22:00:09,252 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 22:00:09,253 WARN ]: Timeout [2018-06-24 22:00:09,253 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:00:09 BasicIcfg [2018-06-24 22:00:09,253 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 22:00:09,254 INFO ]: Toolchain (without parser) took 59511.51 ms. Allocated memory was 303.0 MB in the beginning and 1.2 GB in the end (delta: 869.3 MB). Free memory was 258.4 MB in the beginning and 662.2 MB in the end (delta: -403.8 MB). Peak memory consumption was 465.5 MB. Max. memory is 3.6 GB. [2018-06-24 22:00:09,255 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 22:00:09,255 INFO ]: ChcToBoogie took 61.82 ms. Allocated memory is still 303.0 MB. Free memory was 257.4 MB in the beginning and 255.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:00:09,261 INFO ]: Boogie Preprocessor took 37.26 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 254.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 22:00:09,261 INFO ]: RCFGBuilder took 452.96 ms. Allocated memory is still 303.0 MB. Free memory was 254.4 MB in the beginning and 242.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:00:09,261 INFO ]: BlockEncodingV2 took 149.43 ms. Allocated memory is still 303.0 MB. Free memory was 242.4 MB in the beginning and 236.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:00:09,262 INFO ]: TraceAbstraction took 58794.52 ms. Allocated memory was 303.0 MB in the beginning and 1.2 GB in the end (delta: 869.3 MB). Free memory was 236.4 MB in the beginning and 662.2 MB in the end (delta: -425.8 MB). Peak memory consumption was 443.5 MB. Max. memory is 3.6 GB. [2018-06-24 22:00:09,264 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 28 locations, 43 edges - StatisticsResult: Encoded RCFG 19 locations, 36 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.82 ms. Allocated memory is still 303.0 MB. Free memory was 257.4 MB in the beginning and 255.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.26 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 254.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 452.96 ms. Allocated memory is still 303.0 MB. Free memory was 254.4 MB in the beginning and 242.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 149.43 ms. Allocated memory is still 303.0 MB. Free memory was 242.4 MB in the beginning and 236.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58794.52 ms. Allocated memory was 303.0 MB in the beginning and 1.2 GB in the end (delta: 869.3 MB). Free memory was 236.4 MB in the beginning and 662.2 MB in the end (delta: -425.8 MB). Peak memory consumption was 443.5 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 90 with TraceHistMax 35, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 88 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. TIMEOUT Result, 58.7s OverallTime, 21 OverallIterations, 35 TraceHistogramMax, 43.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 533 SDtfs, 1452 SDslu, 2631 SDs, 0 SdLazy, 21626 SolverSat, 2968 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1861 GetRequests, 777 SyntacticMatches, 37 SemanticMatches, 1047 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40454 ImplicationChecksByTransitivity, 33.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3535occurred in iteration=20, 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: 1.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 3685 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1659 NumberOfCodeBlocks, 1595 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 1624 ConstructedInterpolants, 9 QuantifiedInterpolants, 342068 SizeOfPredicates, 67 NumberOfNonLiveVariables, 7008 ConjunctsInSsa, 522 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 11848/13647 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__cocome1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_22-00-09-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__cocome1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_22-00-09-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__cocome1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_22-00-09-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__cocome1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_22-00-09-275.csv Completed graceful shutdown