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/hopv/lia/mochi/bcopy2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:13:19,498 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:13:19,503 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:13:19,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:13:19,515 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:13:19,516 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:13:19,517 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:13:19,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:13:19,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:13:19,520 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:13:19,521 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:13:19,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:13:19,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:13:19,523 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:13:19,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:13:19,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:13:19,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:13:19,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:13:19,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:13:19,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:13:19,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:13:19,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:13:19,549 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:13:19,549 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:13:19,550 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:13:19,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:13:19,551 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:13:19,552 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:13:19,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:13:19,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:13:19,554 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:13:19,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:13:19,554 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:13:19,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:13:19,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:13:19,557 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:13:19,574 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:13:19,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:13:19,579 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:13:19,579 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:13:19,580 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:13:19,580 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:13:19,580 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:13:19,581 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:13:19,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:13:19,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:13:19,581 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:13:19,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:13:19,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:13:19,582 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:13:19,582 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:13:19,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:13:19,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:13:19,582 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:13:19,583 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:13:19,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:13:19,584 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:13:19,586 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:13:19,586 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:13:19,634 INFO ]: Repository-Root is: /tmp [2018-06-24 21:13:19,653 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:13:19,659 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:13:19,661 INFO ]: Initializing SmtParser... [2018-06-24 21:13:19,661 INFO ]: SmtParser initialized [2018-06-24 21:13:19,663 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/bcopy2.smt2 [2018-06-24 21:13:19,664 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:13:19,751 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/bcopy2.smt2 unknown [2018-06-24 21:13:20,062 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/bcopy2.smt2 [2018-06-24 21:13:20,067 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:13:20,072 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:13:20,073 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:13:20,073 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:13:20,073 INFO ]: ChcToBoogie initialized [2018-06-24 21:13:20,076 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:13:20" (1/1) ... [2018-06-24 21:13:20,144 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:20 Unit [2018-06-24 21:13:20,144 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:13:20,145 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:13:20,145 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:13:20,145 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:13:20,166 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:20" (1/1) ... [2018-06-24 21:13:20,166 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:20" (1/1) ... [2018-06-24 21:13:20,174 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:20" (1/1) ... [2018-06-24 21:13:20,175 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:20" (1/1) ... [2018-06-24 21:13:20,181 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:20" (1/1) ... [2018-06-24 21:13:20,184 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:20" (1/1) ... [2018-06-24 21:13:20,185 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:20" (1/1) ... [2018-06-24 21:13:20,189 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:13:20,190 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:13:20,190 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:13:20,190 INFO ]: RCFGBuilder initialized [2018-06-24 21:13:20,191 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:20" (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:13:20,217 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:13:20,217 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:13:20,217 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:13:20,217 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:13:20,217 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:13:20,217 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:13:20,663 INFO ]: Using library mode [2018-06-24 21:13:20,664 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:20 BoogieIcfgContainer [2018-06-24 21:13:20,665 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:13:20,665 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:13:20,665 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:13:20,666 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:13:20,667 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:20" (1/1) ... [2018-06-24 21:13:20,694 INFO ]: Initial Icfg 44 locations, 63 edges [2018-06-24 21:13:20,695 INFO ]: Using Remove infeasible edges [2018-06-24 21:13:20,695 INFO ]: Using Maximize final states [2018-06-24 21:13:20,696 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:13:20,696 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:13:20,697 INFO ]: Using Remove sink states [2018-06-24 21:13:20,698 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:13:20,698 INFO ]: Using Use SBE [2018-06-24 21:13:20,738 INFO ]: SBE split 1 edges [2018-06-24 21:13:20,746 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:13:20,748 INFO ]: 0 new accepting states [2018-06-24 21:13:21,001 INFO ]: Removed 45 edges and 17 locations by large block encoding [2018-06-24 21:13:21,003 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:13:21,004 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:13:21,005 INFO ]: 0 new accepting states [2018-06-24 21:13:21,007 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:13:21,008 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:13:21,008 INFO ]: Encoded RCFG 25 locations, 45 edges [2018-06-24 21:13:21,008 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:13:21 BasicIcfg [2018-06-24 21:13:21,008 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:13:21,009 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:13:21,009 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:13:21,014 INFO ]: TraceAbstraction initialized [2018-06-24 21:13:21,014 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:13:20" (1/4) ... [2018-06-24 21:13:21,016 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58571415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:13:21, skipping insertion in model container [2018-06-24 21:13:21,016 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:20" (2/4) ... [2018-06-24 21:13:21,016 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58571415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:13:21, skipping insertion in model container [2018-06-24 21:13:21,016 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:20" (3/4) ... [2018-06-24 21:13:21,016 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58571415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:13:21, skipping insertion in model container [2018-06-24 21:13:21,017 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:13:21" (4/4) ... [2018-06-24 21:13:21,018 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:13:21,029 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:13:21,038 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:13:21,089 INFO ]: Using default assertion order modulation [2018-06-24 21:13:21,089 INFO ]: Interprodecural is true [2018-06-24 21:13:21,089 INFO ]: Hoare is false [2018-06-24 21:13:21,089 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:13:21,089 INFO ]: Backedges is TWOTRACK [2018-06-24 21:13:21,089 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:13:21,089 INFO ]: Difference is false [2018-06-24 21:13:21,089 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:13:21,089 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:13:21,102 INFO ]: Start isEmpty. Operand 25 states. [2018-06-24 21:13:21,115 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:13:21,115 INFO ]: Found error trace [2018-06-24 21:13:21,116 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:13:21,117 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:21,121 INFO ]: Analyzing trace with hash 1311401726, now seen corresponding path program 1 times [2018-06-24 21:13:21,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:21,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:21,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:21,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:21,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:21,211 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:21,325 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:13:21,326 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:21,326 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:21,327 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:21,338 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:21,338 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:21,341 INFO ]: Start difference. First operand 25 states. Second operand 3 states. [2018-06-24 21:13:21,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:21,682 INFO ]: Finished difference Result 35 states and 67 transitions. [2018-06-24 21:13:21,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:21,684 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:13:21,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:21,696 INFO ]: With dead ends: 35 [2018-06-24 21:13:21,696 INFO ]: Without dead ends: 35 [2018-06-24 21:13:21,699 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:13:21,716 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:13:21,756 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 21:13:21,760 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:13:21,762 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. [2018-06-24 21:13:21,765 INFO ]: Start accepts. Automaton has 35 states and 67 transitions. Word has length 6 [2018-06-24 21:13:21,766 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:21,766 INFO ]: Abstraction has 35 states and 67 transitions. [2018-06-24 21:13:21,766 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:21,766 INFO ]: Start isEmpty. Operand 35 states and 67 transitions. [2018-06-24 21:13:21,775 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:13:21,775 INFO ]: Found error trace [2018-06-24 21:13:21,775 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:13:21,775 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:21,775 INFO ]: Analyzing trace with hash 1312325247, now seen corresponding path program 1 times [2018-06-24 21:13:21,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:21,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:21,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:21,776 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:21,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:21,799 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:21,890 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:13:21,891 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:21,891 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:21,892 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:21,892 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:21,892 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:21,893 INFO ]: Start difference. First operand 35 states and 67 transitions. Second operand 3 states. [2018-06-24 21:13:21,988 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:21,988 INFO ]: Finished difference Result 37 states and 67 transitions. [2018-06-24 21:13:21,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:21,990 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:13:21,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:21,992 INFO ]: With dead ends: 37 [2018-06-24 21:13:21,992 INFO ]: Without dead ends: 35 [2018-06-24 21:13:21,993 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:13:21,993 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:13:22,006 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 21:13:22,006 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:13:22,011 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 65 transitions. [2018-06-24 21:13:22,011 INFO ]: Start accepts. Automaton has 35 states and 65 transitions. Word has length 6 [2018-06-24 21:13:22,011 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:22,011 INFO ]: Abstraction has 35 states and 65 transitions. [2018-06-24 21:13:22,011 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:22,011 INFO ]: Start isEmpty. Operand 35 states and 65 transitions. [2018-06-24 21:13:22,012 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:13:22,012 INFO ]: Found error trace [2018-06-24 21:13:22,013 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:13:22,013 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:22,013 INFO ]: Analyzing trace with hash 1313248768, now seen corresponding path program 1 times [2018-06-24 21:13:22,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:22,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:22,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:22,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:22,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:22,045 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:22,129 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:13:22,129 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:22,129 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:13:22,129 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:13:22,129 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:13:22,129 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:13:22,129 INFO ]: Start difference. First operand 35 states and 65 transitions. Second operand 4 states. [2018-06-24 21:13:22,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:22,517 INFO ]: Finished difference Result 61 states and 133 transitions. [2018-06-24 21:13:22,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:13:22,517 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:13:22,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:22,523 INFO ]: With dead ends: 61 [2018-06-24 21:13:22,524 INFO ]: Without dead ends: 61 [2018-06-24 21:13:22,524 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:13:22,524 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 21:13:22,540 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 39. [2018-06-24 21:13:22,540 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 21:13:22,541 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2018-06-24 21:13:22,541 INFO ]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 6 [2018-06-24 21:13:22,542 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:22,542 INFO ]: Abstraction has 39 states and 71 transitions. [2018-06-24 21:13:22,542 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:13:22,542 INFO ]: Start isEmpty. Operand 39 states and 71 transitions. [2018-06-24 21:13:22,543 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:13:22,543 INFO ]: Found error trace [2018-06-24 21:13:22,543 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:13:22,543 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:22,544 INFO ]: Analyzing trace with hash 1314172289, now seen corresponding path program 1 times [2018-06-24 21:13:22,544 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:22,544 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:22,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:22,545 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:22,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:22,558 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:22,654 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:13:22,654 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:22,654 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:13:22,654 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:13:22,655 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:13:22,655 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:13:22,655 INFO ]: Start difference. First operand 39 states and 71 transitions. Second operand 4 states. [2018-06-24 21:13:22,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:22,930 INFO ]: Finished difference Result 61 states and 130 transitions. [2018-06-24 21:13:22,931 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:13:22,931 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:13:22,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:22,936 INFO ]: With dead ends: 61 [2018-06-24 21:13:22,936 INFO ]: Without dead ends: 61 [2018-06-24 21:13:22,937 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:13:22,937 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 21:13:22,949 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 38. [2018-06-24 21:13:22,949 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 21:13:22,950 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2018-06-24 21:13:22,950 INFO ]: Start accepts. Automaton has 38 states and 69 transitions. Word has length 6 [2018-06-24 21:13:22,950 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:22,950 INFO ]: Abstraction has 38 states and 69 transitions. [2018-06-24 21:13:22,950 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:13:22,950 INFO ]: Start isEmpty. Operand 38 states and 69 transitions. [2018-06-24 21:13:22,953 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:13:22,953 INFO ]: Found error trace [2018-06-24 21:13:22,953 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:22,953 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:22,953 INFO ]: Analyzing trace with hash -1862562753, now seen corresponding path program 1 times [2018-06-24 21:13:22,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:22,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:22,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:22,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:22,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:22,961 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:23,019 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:13:23,019 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:23,019 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:23,020 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:23,020 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:23,020 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:23,020 INFO ]: Start difference. First operand 38 states and 69 transitions. Second operand 3 states. [2018-06-24 21:13:23,519 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:23,519 INFO ]: Finished difference Result 49 states and 92 transitions. [2018-06-24 21:13:23,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:23,520 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 21:13:23,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:23,521 INFO ]: With dead ends: 49 [2018-06-24 21:13:23,521 INFO ]: Without dead ends: 49 [2018-06-24 21:13:23,521 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:13:23,521 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 21:13:23,529 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-24 21:13:23,529 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 21:13:23,531 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 92 transitions. [2018-06-24 21:13:23,531 INFO ]: Start accepts. Automaton has 49 states and 92 transitions. Word has length 11 [2018-06-24 21:13:23,531 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:23,531 INFO ]: Abstraction has 49 states and 92 transitions. [2018-06-24 21:13:23,531 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:23,531 INFO ]: Start isEmpty. Operand 49 states and 92 transitions. [2018-06-24 21:13:23,536 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:13:23,536 INFO ]: Found error trace [2018-06-24 21:13:23,537 INFO ]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:23,537 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:23,537 INFO ]: Analyzing trace with hash 837068681, now seen corresponding path program 1 times [2018-06-24 21:13:23,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:23,537 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:23,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:23,538 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:23,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:23,573 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:23,690 INFO ]: Checked inductivity of 21 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:13:23,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:23,690 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:13:23,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:23,768 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:23,775 INFO ]: Computing forward predicates... [2018-06-24 21:13:23,864 INFO ]: Checked inductivity of 21 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:13:23,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:23,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 6 [2018-06-24 21:13:23,885 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:13:23,886 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:13:23,886 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:13:23,886 INFO ]: Start difference. First operand 49 states and 92 transitions. Second operand 6 states. [2018-06-24 21:13:25,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:25,303 INFO ]: Finished difference Result 142 states and 364 transitions. [2018-06-24 21:13:25,304 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:13:25,304 INFO ]: Start accepts. Automaton has 6 states. Word has length 22 [2018-06-24 21:13:25,304 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:25,323 INFO ]: With dead ends: 142 [2018-06-24 21:13:25,323 INFO ]: Without dead ends: 135 [2018-06-24 21:13:25,324 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:13:25,324 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-24 21:13:25,373 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 75. [2018-06-24 21:13:25,373 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-24 21:13:25,375 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 139 transitions. [2018-06-24 21:13:25,375 INFO ]: Start accepts. Automaton has 75 states and 139 transitions. Word has length 22 [2018-06-24 21:13:25,375 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:25,376 INFO ]: Abstraction has 75 states and 139 transitions. [2018-06-24 21:13:25,376 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:13:25,376 INFO ]: Start isEmpty. Operand 75 states and 139 transitions. [2018-06-24 21:13:25,379 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:13:25,379 INFO ]: Found error trace [2018-06-24 21:13:25,379 INFO ]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:25,379 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:25,380 INFO ]: Analyzing trace with hash -1809121070, now seen corresponding path program 1 times [2018-06-24 21:13:25,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:25,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:25,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:25,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:25,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:25,424 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:25,525 INFO ]: Checked inductivity of 50 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:13:25,525 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:25,525 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:13:25,538 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:25,593 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:25,597 INFO ]: Computing forward predicates... [2018-06-24 21:13:25,868 INFO ]: Checked inductivity of 50 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:13:25,888 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:25,888 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2018-06-24 21:13:25,888 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:13:25,889 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:13:25,889 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:13:25,889 INFO ]: Start difference. First operand 75 states and 139 transitions. Second operand 13 states. [2018-06-24 21:13:27,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:27,885 INFO ]: Finished difference Result 186 states and 661 transitions. [2018-06-24 21:13:27,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:13:27,885 INFO ]: Start accepts. Automaton has 13 states. Word has length 32 [2018-06-24 21:13:27,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:27,892 INFO ]: With dead ends: 186 [2018-06-24 21:13:27,892 INFO ]: Without dead ends: 174 [2018-06-24 21:13:27,892 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:13:27,892 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-24 21:13:27,976 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 97. [2018-06-24 21:13:27,976 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-24 21:13:27,981 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 217 transitions. [2018-06-24 21:13:27,981 INFO ]: Start accepts. Automaton has 97 states and 217 transitions. Word has length 32 [2018-06-24 21:13:27,982 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:27,982 INFO ]: Abstraction has 97 states and 217 transitions. [2018-06-24 21:13:27,982 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:13:27,982 INFO ]: Start isEmpty. Operand 97 states and 217 transitions. [2018-06-24 21:13:27,987 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 21:13:27,988 INFO ]: Found error trace [2018-06-24 21:13:27,988 INFO ]: trace histogram [6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:27,988 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:27,988 INFO ]: Analyzing trace with hash 503392915, now seen corresponding path program 1 times [2018-06-24 21:13:27,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:27,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:27,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:27,990 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:27,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:28,007 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:28,073 INFO ]: Checked inductivity of 56 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:13:28,073 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:28,073 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) [2018-06-24 21:13:28,091 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:28,154 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:28,157 INFO ]: Computing forward predicates... [2018-06-24 21:13:28,183 INFO ]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:13:28,206 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:28,206 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:13:28,206 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:28,206 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:28,206 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:28,206 INFO ]: Start difference. First operand 97 states and 217 transitions. Second operand 3 states. [2018-06-24 21:13:28,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:28,244 INFO ]: Finished difference Result 110 states and 217 transitions. [2018-06-24 21:13:28,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:28,247 INFO ]: Start accepts. Automaton has 3 states. Word has length 33 [2018-06-24 21:13:28,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:28,249 INFO ]: With dead ends: 110 [2018-06-24 21:13:28,249 INFO ]: Without dead ends: 110 [2018-06-24 21:13:28,249 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 34 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:13:28,250 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-24 21:13:28,262 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-06-24 21:13:28,262 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-24 21:13:28,264 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 199 transitions. [2018-06-24 21:13:28,264 INFO ]: Start accepts. Automaton has 105 states and 199 transitions. Word has length 33 [2018-06-24 21:13:28,264 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:28,264 INFO ]: Abstraction has 105 states and 199 transitions. [2018-06-24 21:13:28,264 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:28,264 INFO ]: Start isEmpty. Operand 105 states and 199 transitions. [2018-06-24 21:13:28,269 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-24 21:13:28,269 INFO ]: Found error trace [2018-06-24 21:13:28,269 INFO ]: trace histogram [10, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:28,269 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:28,269 INFO ]: Analyzing trace with hash 2017080643, now seen corresponding path program 1 times [2018-06-24 21:13:28,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:28,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:28,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:28,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:28,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:28,282 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:28,377 INFO ]: Checked inductivity of 154 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-06-24 21:13:28,377 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:28,399 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) [2018-06-24 21:13:28,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:28,492 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:28,497 INFO ]: Computing forward predicates... [2018-06-24 21:13:28,505 INFO ]: Checked inductivity of 154 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-24 21:13:28,536 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:28,536 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:13:28,537 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:28,537 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:28,537 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:28,537 INFO ]: Start difference. First operand 105 states and 199 transitions. Second operand 3 states. [2018-06-24 21:13:28,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:28,641 INFO ]: Finished difference Result 118 states and 221 transitions. [2018-06-24 21:13:28,643 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:28,643 INFO ]: Start accepts. Automaton has 3 states. Word has length 53 [2018-06-24 21:13:28,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:28,645 INFO ]: With dead ends: 118 [2018-06-24 21:13:28,645 INFO ]: Without dead ends: 118 [2018-06-24 21:13:28,646 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 54 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:13:28,646 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-24 21:13:28,657 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-06-24 21:13:28,657 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-24 21:13:28,660 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 221 transitions. [2018-06-24 21:13:28,660 INFO ]: Start accepts. Automaton has 118 states and 221 transitions. Word has length 53 [2018-06-24 21:13:28,660 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:28,660 INFO ]: Abstraction has 118 states and 221 transitions. [2018-06-24 21:13:28,660 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:28,660 INFO ]: Start isEmpty. Operand 118 states and 221 transitions. [2018-06-24 21:13:28,666 INFO ]: Finished isEmpty. Found accepting run of length 111 [2018-06-24 21:13:28,666 INFO ]: Found error trace [2018-06-24 21:13:28,666 INFO ]: trace histogram [21, 8, 8, 7, 7, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:28,666 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:28,666 INFO ]: Analyzing trace with hash -1021088783, now seen corresponding path program 1 times [2018-06-24 21:13:28,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:28,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:28,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:28,667 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:28,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:28,681 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:28,799 INFO ]: Checked inductivity of 738 backedges. 66 proven. 14 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2018-06-24 21:13:28,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:28,800 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:13:28,807 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:28,985 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:28,994 INFO ]: Computing forward predicates... [2018-06-24 21:13:29,018 INFO ]: Checked inductivity of 738 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-06-24 21:13:29,038 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:29,038 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:13:29,038 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:29,038 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:29,039 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:29,039 INFO ]: Start difference. First operand 118 states and 221 transitions. Second operand 3 states. [2018-06-24 21:13:29,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:29,191 INFO ]: Finished difference Result 131 states and 247 transitions. [2018-06-24 21:13:29,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:29,191 INFO ]: Start accepts. Automaton has 3 states. Word has length 110 [2018-06-24 21:13:29,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:29,194 INFO ]: With dead ends: 131 [2018-06-24 21:13:29,194 INFO ]: Without dead ends: 131 [2018-06-24 21:13:29,194 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 111 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:13:29,195 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-24 21:13:29,205 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-06-24 21:13:29,205 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-24 21:13:29,208 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 247 transitions. [2018-06-24 21:13:29,208 INFO ]: Start accepts. Automaton has 131 states and 247 transitions. Word has length 110 [2018-06-24 21:13:29,208 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:29,208 INFO ]: Abstraction has 131 states and 247 transitions. [2018-06-24 21:13:29,208 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:29,208 INFO ]: Start isEmpty. Operand 131 states and 247 transitions. [2018-06-24 21:13:29,214 INFO ]: Finished isEmpty. Found accepting run of length 153 [2018-06-24 21:13:29,214 INFO ]: Found error trace [2018-06-24 21:13:29,214 INFO ]: trace histogram [29, 11, 10, 10, 10, 10, 10, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:29,214 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:29,214 INFO ]: Analyzing trace with hash 1952352253, now seen corresponding path program 1 times [2018-06-24 21:13:29,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:29,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:29,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:29,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:29,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:29,306 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:29,838 INFO ]: Checked inductivity of 1432 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2018-06-24 21:13:29,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:29,838 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:13:29,853 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:30,062 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:30,082 INFO ]: Computing forward predicates... [2018-06-24 21:13:30,407 INFO ]: Checked inductivity of 1432 backedges. 640 proven. 139 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2018-06-24 21:13:30,427 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:30,427 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 11 [2018-06-24 21:13:30,428 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:13:30,428 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:13:30,428 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:13:30,428 INFO ]: Start difference. First operand 131 states and 247 transitions. Second operand 11 states. [2018-06-24 21:13:32,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:32,282 INFO ]: Finished difference Result 309 states and 930 transitions. [2018-06-24 21:13:32,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:13:32,282 INFO ]: Start accepts. Automaton has 11 states. Word has length 152 [2018-06-24 21:13:32,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:32,288 INFO ]: With dead ends: 309 [2018-06-24 21:13:32,288 INFO ]: Without dead ends: 219 [2018-06-24 21:13:32,289 INFO ]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:13:32,289 INFO ]: Start minimizeSevpa. Operand 219 states. [2018-06-24 21:13:32,323 INFO ]: Finished minimizeSevpa. Reduced states from 219 to 124. [2018-06-24 21:13:32,323 INFO ]: Start removeUnreachable. Operand 124 states. [2018-06-24 21:13:32,326 INFO ]: Finished removeUnreachable. Reduced from 124 states to 124 states and 228 transitions. [2018-06-24 21:13:32,327 INFO ]: Start accepts. Automaton has 124 states and 228 transitions. Word has length 152 [2018-06-24 21:13:32,327 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:32,327 INFO ]: Abstraction has 124 states and 228 transitions. [2018-06-24 21:13:32,327 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:13:32,327 INFO ]: Start isEmpty. Operand 124 states and 228 transitions. [2018-06-24 21:13:32,333 INFO ]: Finished isEmpty. Found accepting run of length 153 [2018-06-24 21:13:32,333 INFO ]: Found error trace [2018-06-24 21:13:32,333 INFO ]: trace histogram [29, 11, 10, 10, 10, 10, 10, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:32,333 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:32,333 INFO ]: Analyzing trace with hash 112466621, now seen corresponding path program 2 times [2018-06-24 21:13:32,333 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:32,333 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:32,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:32,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:32,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:32,413 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:32,751 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2018-06-24 21:13:33,211 INFO ]: Checked inductivity of 1432 backedges. 172 proven. 273 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2018-06-24 21:13:33,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:33,211 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:13:33,228 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:13:33,470 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:13:33,470 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:33,478 INFO ]: Computing forward predicates... [2018-06-24 21:13:33,601 INFO ]: Checked inductivity of 1432 backedges. 359 proven. 101 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2018-06-24 21:13:33,622 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:33,622 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-06-24 21:13:33,623 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:13:33,623 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:13:33,623 INFO ]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:13:33,623 INFO ]: Start difference. First operand 124 states and 228 transitions. Second operand 19 states. [2018-06-24 21:13:34,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:34,658 INFO ]: Finished difference Result 168 states and 301 transitions. [2018-06-24 21:13:34,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 21:13:34,659 INFO ]: Start accepts. Automaton has 19 states. Word has length 152 [2018-06-24 21:13:34,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:34,659 INFO ]: With dead ends: 168 [2018-06-24 21:13:34,659 INFO ]: Without dead ends: 0 [2018-06-24 21:13:34,660 INFO ]: 0 DeclaredPredicates, 206 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 21:13:34,660 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:13:34,660 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:13:34,660 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:13:34,660 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:13:34,660 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2018-06-24 21:13:34,660 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:34,660 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:13:34,660 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:13:34,660 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:13:34,660 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:13:34,662 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:13:34,663 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:13:34 BasicIcfg [2018-06-24 21:13:34,663 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:13:34,664 INFO ]: Toolchain (without parser) took 14596.45 ms. Allocated memory was 300.4 MB in the beginning and 608.7 MB in the end (delta: 308.3 MB). Free memory was 249.8 MB in the beginning and 523.0 MB in the end (delta: -273.2 MB). Peak memory consumption was 35.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:34,672 INFO ]: SmtParser took 0.12 ms. Allocated memory is still 300.4 MB. Free memory is still 263.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:13:34,672 INFO ]: ChcToBoogie took 71.24 ms. Allocated memory is still 300.4 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:34,672 INFO ]: Boogie Preprocessor took 44.57 ms. Allocated memory is still 300.4 MB. Free memory was 246.8 MB in the beginning and 244.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:34,673 INFO ]: RCFGBuilder took 475.02 ms. Allocated memory is still 300.4 MB. Free memory was 244.8 MB in the beginning and 228.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:34,673 INFO ]: BlockEncodingV2 took 343.31 ms. Allocated memory is still 300.4 MB. Free memory was 228.8 MB in the beginning and 215.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:34,673 INFO ]: TraceAbstraction took 13653.56 ms. Allocated memory was 300.4 MB in the beginning and 608.7 MB in the end (delta: 308.3 MB). Free memory was 215.8 MB in the beginning and 523.0 MB in the end (delta: -307.2 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:13:34,676 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 44 locations, 63 edges - StatisticsResult: Encoded RCFG 25 locations, 45 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.12 ms. Allocated memory is still 300.4 MB. Free memory is still 263.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 71.24 ms. Allocated memory is still 300.4 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.57 ms. Allocated memory is still 300.4 MB. Free memory was 246.8 MB in the beginning and 244.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 475.02 ms. Allocated memory is still 300.4 MB. Free memory was 244.8 MB in the beginning and 228.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 343.31 ms. Allocated memory is still 300.4 MB. Free memory was 228.8 MB in the beginning and 215.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 13653.56 ms. Allocated memory was 300.4 MB in the beginning and 608.7 MB in the end (delta: 308.3 MB). Free memory was 215.8 MB in the beginning and 523.0 MB in the end (delta: -307.2 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. SAFE Result, 13.5s OverallTime, 12 OverallIterations, 29 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 860 SDtfs, 447 SDslu, 2084 SDs, 0 SdLazy, 4474 SolverSat, 1083 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 721 GetRequests, 597 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 282 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1143 NumberOfCodeBlocks, 1143 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1124 ConstructedInterpolants, 0 QuantifiedInterpolants, 162276 SizeOfPredicates, 28 NumberOfNonLiveVariables, 5739 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 7166/7769 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-13-34-686.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-13-34-686.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-13-34-686.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-13-34-686.csv Received shutdown request...