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/bcopy5.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:13:39,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:13:39,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:13:39,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:13:39,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:13:39,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:13:39,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:13:39,431 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:13:39,432 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:13:39,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:13:39,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:13:39,435 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:13:39,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:13:39,436 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:13:39,440 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:13:39,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:13:39,442 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:13:39,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:13:39,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:13:39,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:13:39,458 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:13:39,460 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:13:39,460 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:13:39,460 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:13:39,461 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:13:39,462 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:13:39,462 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:13:39,463 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:13:39,464 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:13:39,464 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:13:39,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:13:39,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:13:39,466 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:13:39,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:13:39,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:13:39,467 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:39,492 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:13:39,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:13:39,493 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:13:39,493 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:13:39,494 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:13:39,494 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:13:39,495 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:13:39,496 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:13:39,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:13:39,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:13:39,496 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:13:39,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:13:39,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:13:39,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:13:39,497 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:13:39,497 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:13:39,497 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:13:39,498 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:13:39,498 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:13:39,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:13:39,498 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:13:39,501 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:13:39,501 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:13:39,552 INFO ]: Repository-Root is: /tmp [2018-06-24 21:13:39,565 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:13:39,568 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:13:39,573 INFO ]: Initializing SmtParser... [2018-06-24 21:13:39,574 INFO ]: SmtParser initialized [2018-06-24 21:13:39,574 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/bcopy5.smt2 [2018-06-24 21:13:39,575 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:39,667 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/bcopy5.smt2 unknown [2018-06-24 21:13:40,067 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/bcopy5.smt2 [2018-06-24 21:13:40,071 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:13:40,079 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:13:40,080 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:13:40,080 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:13:40,080 INFO ]: ChcToBoogie initialized [2018-06-24 21:13:40,083 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:13:40" (1/1) ... [2018-06-24 21:13:40,152 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:40 Unit [2018-06-24 21:13:40,152 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:13:40,153 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:13:40,153 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:13:40,153 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:13:40,175 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:40" (1/1) ... [2018-06-24 21:13:40,175 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:40" (1/1) ... [2018-06-24 21:13:40,184 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:40" (1/1) ... [2018-06-24 21:13:40,184 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:40" (1/1) ... [2018-06-24 21:13:40,199 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:40" (1/1) ... [2018-06-24 21:13:40,209 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:40" (1/1) ... [2018-06-24 21:13:40,211 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:40" (1/1) ... [2018-06-24 21:13:40,214 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:13:40,214 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:13:40,214 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:13:40,214 INFO ]: RCFGBuilder initialized [2018-06-24 21:13:40,215 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:40" (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:40,228 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:13:40,229 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:13:40,229 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:13:40,229 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:13:40,229 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:13:40,229 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:40,876 INFO ]: Using library mode [2018-06-24 21:13:40,876 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:40 BoogieIcfgContainer [2018-06-24 21:13:40,876 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:13:40,878 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:13:40,878 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:13:40,879 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:13:40,879 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:40" (1/1) ... [2018-06-24 21:13:40,904 INFO ]: Initial Icfg 74 locations, 115 edges [2018-06-24 21:13:40,905 INFO ]: Using Remove infeasible edges [2018-06-24 21:13:40,906 INFO ]: Using Maximize final states [2018-06-24 21:13:40,906 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:13:40,906 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:13:40,908 INFO ]: Using Remove sink states [2018-06-24 21:13:40,909 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:13:40,909 INFO ]: Using Use SBE [2018-06-24 21:13:40,959 INFO ]: SBE split 1 edges [2018-06-24 21:13:40,968 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:13:40,971 INFO ]: 0 new accepting states [2018-06-24 21:13:41,384 INFO ]: Removed 90 edges and 27 locations by large block encoding [2018-06-24 21:13:41,386 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:13:41,389 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:13:41,389 INFO ]: 0 new accepting states [2018-06-24 21:13:41,390 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:13:41,390 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:13:41,391 INFO ]: Encoded RCFG 45 locations, 87 edges [2018-06-24 21:13:41,391 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:13:41 BasicIcfg [2018-06-24 21:13:41,391 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:13:41,394 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:13:41,394 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:13:41,398 INFO ]: TraceAbstraction initialized [2018-06-24 21:13:41,398 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:13:40" (1/4) ... [2018-06-24 21:13:41,399 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fda384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:13:41, skipping insertion in model container [2018-06-24 21:13:41,399 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:13:40" (2/4) ... [2018-06-24 21:13:41,399 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fda384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:13:41, skipping insertion in model container [2018-06-24 21:13:41,399 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:13:40" (3/4) ... [2018-06-24 21:13:41,399 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fda384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:13:41, skipping insertion in model container [2018-06-24 21:13:41,400 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:13:41" (4/4) ... [2018-06-24 21:13:41,402 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:13:41,412 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:13:41,420 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:13:41,477 INFO ]: Using default assertion order modulation [2018-06-24 21:13:41,478 INFO ]: Interprodecural is true [2018-06-24 21:13:41,478 INFO ]: Hoare is false [2018-06-24 21:13:41,478 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:13:41,478 INFO ]: Backedges is TWOTRACK [2018-06-24 21:13:41,478 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:13:41,478 INFO ]: Difference is false [2018-06-24 21:13:41,478 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:13:41,478 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:13:41,488 INFO ]: Start isEmpty. Operand 45 states. [2018-06-24 21:13:41,503 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:13:41,503 INFO ]: Found error trace [2018-06-24 21:13:41,504 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:13:41,504 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:41,508 INFO ]: Analyzing trace with hash 89216458, now seen corresponding path program 1 times [2018-06-24 21:13:41,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:41,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:41,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:41,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:41,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:41,591 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:41,648 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:41,650 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:41,650 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:41,651 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:41,681 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:41,681 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:41,684 INFO ]: Start difference. First operand 45 states. Second operand 3 states. [2018-06-24 21:13:42,756 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:42,756 INFO ]: Finished difference Result 56 states and 117 transitions. [2018-06-24 21:13:42,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:42,757 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:13:42,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:42,772 INFO ]: With dead ends: 56 [2018-06-24 21:13:42,772 INFO ]: Without dead ends: 56 [2018-06-24 21:13:42,774 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:42,790 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-24 21:13:42,828 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-24 21:13:42,830 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-24 21:13:42,834 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 117 transitions. [2018-06-24 21:13:42,836 INFO ]: Start accepts. Automaton has 56 states and 117 transitions. Word has length 5 [2018-06-24 21:13:42,836 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:42,836 INFO ]: Abstraction has 56 states and 117 transitions. [2018-06-24 21:13:42,836 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:42,837 INFO ]: Start isEmpty. Operand 56 states and 117 transitions. [2018-06-24 21:13:42,842 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:13:42,842 INFO ]: Found error trace [2018-06-24 21:13:42,842 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:13:42,842 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:42,843 INFO ]: Analyzing trace with hash -1522058394, now seen corresponding path program 1 times [2018-06-24 21:13:42,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:42,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:42,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:42,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:42,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:42,858 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:43,001 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:43,001 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:43,001 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:13:43,003 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:13:43,003 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:13:43,003 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:13:43,003 INFO ]: Start difference. First operand 56 states and 117 transitions. Second operand 4 states. [2018-06-24 21:13:43,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:43,361 INFO ]: Finished difference Result 86 states and 203 transitions. [2018-06-24 21:13:43,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:13:43,362 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:13:43,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:43,372 INFO ]: With dead ends: 86 [2018-06-24 21:13:43,372 INFO ]: Without dead ends: 86 [2018-06-24 21:13:43,373 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:13:43,373 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-24 21:13:43,397 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-06-24 21:13:43,397 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 21:13:43,400 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 123 transitions. [2018-06-24 21:13:43,400 INFO ]: Start accepts. Automaton has 60 states and 123 transitions. Word has length 6 [2018-06-24 21:13:43,400 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:43,400 INFO ]: Abstraction has 60 states and 123 transitions. [2018-06-24 21:13:43,400 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:13:43,400 INFO ]: Start isEmpty. Operand 60 states and 123 transitions. [2018-06-24 21:13:43,403 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:13:43,403 INFO ]: Found error trace [2018-06-24 21:13:43,403 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:13:43,403 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:43,403 INFO ]: Analyzing trace with hash -1520211352, now seen corresponding path program 1 times [2018-06-24 21:13:43,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:43,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:43,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:43,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:43,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:43,421 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:43,487 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:43,487 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:43,487 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:43,488 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:43,488 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:43,488 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:43,488 INFO ]: Start difference. First operand 60 states and 123 transitions. Second operand 3 states. [2018-06-24 21:13:43,561 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:43,561 INFO ]: Finished difference Result 81 states and 189 transitions. [2018-06-24 21:13:43,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:43,562 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:13:43,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:43,566 INFO ]: With dead ends: 81 [2018-06-24 21:13:43,566 INFO ]: Without dead ends: 81 [2018-06-24 21:13:43,567 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:43,567 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-24 21:13:43,584 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 61. [2018-06-24 21:13:43,585 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-24 21:13:43,587 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 123 transitions. [2018-06-24 21:13:43,587 INFO ]: Start accepts. Automaton has 61 states and 123 transitions. Word has length 6 [2018-06-24 21:13:43,588 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:43,588 INFO ]: Abstraction has 61 states and 123 transitions. [2018-06-24 21:13:43,588 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:43,588 INFO ]: Start isEmpty. Operand 61 states and 123 transitions. [2018-06-24 21:13:43,593 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:13:43,593 INFO ]: Found error trace [2018-06-24 21:13:43,593 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:43,593 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:43,593 INFO ]: Analyzing trace with hash -318116218, now seen corresponding path program 1 times [2018-06-24 21:13:43,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:43,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:43,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:43,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:43,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:43,641 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:43,753 INFO ]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:13:43,753 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:13:43,753 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:13:43,754 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:43,754 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:43,754 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:43,754 INFO ]: Start difference. First operand 61 states and 123 transitions. Second operand 3 states. [2018-06-24 21:13:44,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:44,236 INFO ]: Finished difference Result 74 states and 133 transitions. [2018-06-24 21:13:44,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:44,237 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 21:13:44,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:44,239 INFO ]: With dead ends: 74 [2018-06-24 21:13:44,239 INFO ]: Without dead ends: 74 [2018-06-24 21:13:44,239 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:44,239 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-24 21:13:44,249 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-24 21:13:44,249 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 21:13:44,255 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 133 transitions. [2018-06-24 21:13:44,255 INFO ]: Start accepts. Automaton has 74 states and 133 transitions. Word has length 17 [2018-06-24 21:13:44,255 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:44,255 INFO ]: Abstraction has 74 states and 133 transitions. [2018-06-24 21:13:44,255 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:44,255 INFO ]: Start isEmpty. Operand 74 states and 133 transitions. [2018-06-24 21:13:44,258 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:13:44,258 INFO ]: Found error trace [2018-06-24 21:13:44,258 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:44,258 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:44,259 INFO ]: Analyzing trace with hash -1175485652, now seen corresponding path program 1 times [2018-06-24 21:13:44,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:44,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:44,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:44,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:44,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:44,290 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:44,437 INFO ]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:13:44,437 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:44,437 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:44,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:44,499 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:44,507 INFO ]: Computing forward predicates... [2018-06-24 21:13:44,647 INFO ]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:13:44,681 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:44,681 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 21:13:44,681 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:13:44,681 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:13:44,681 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:13:44,682 INFO ]: Start difference. First operand 74 states and 133 transitions. Second operand 9 states. [2018-06-24 21:13:47,324 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:47,324 INFO ]: Finished difference Result 156 states and 380 transitions. [2018-06-24 21:13:47,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:13:47,325 INFO ]: Start accepts. Automaton has 9 states. Word has length 18 [2018-06-24 21:13:47,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:47,330 INFO ]: With dead ends: 156 [2018-06-24 21:13:47,330 INFO ]: Without dead ends: 116 [2018-06-24 21:13:47,330 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:13:47,330 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-24 21:13:47,369 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 68. [2018-06-24 21:13:47,369 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-24 21:13:47,371 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 123 transitions. [2018-06-24 21:13:47,371 INFO ]: Start accepts. Automaton has 68 states and 123 transitions. Word has length 18 [2018-06-24 21:13:47,371 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:47,371 INFO ]: Abstraction has 68 states and 123 transitions. [2018-06-24 21:13:47,371 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:13:47,371 INFO ]: Start isEmpty. Operand 68 states and 123 transitions. [2018-06-24 21:13:47,378 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:13:47,378 INFO ]: Found error trace [2018-06-24 21:13:47,378 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:47,378 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:47,378 INFO ]: Analyzing trace with hash -532395987, now seen corresponding path program 1 times [2018-06-24 21:13:47,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:47,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:47,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:47,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:47,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:47,427 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:47,501 INFO ]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:13:47,501 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:47,501 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:47,506 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:47,553 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:47,556 INFO ]: Computing forward predicates... [2018-06-24 21:13:47,721 INFO ]: Checked inductivity of 21 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:13:47,740 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:47,740 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 6 [2018-06-24 21:13:47,741 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:13:47,741 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:13:47,741 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:13:47,741 INFO ]: Start difference. First operand 68 states and 123 transitions. Second operand 6 states. [2018-06-24 21:13:48,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:48,318 INFO ]: Finished difference Result 128 states and 281 transitions. [2018-06-24 21:13:48,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:13:48,319 INFO ]: Start accepts. Automaton has 6 states. Word has length 22 [2018-06-24 21:13:48,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:48,322 INFO ]: With dead ends: 128 [2018-06-24 21:13:48,322 INFO ]: Without dead ends: 128 [2018-06-24 21:13:48,322 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:48,322 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-24 21:13:48,339 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 79. [2018-06-24 21:13:48,339 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 21:13:48,341 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 143 transitions. [2018-06-24 21:13:48,341 INFO ]: Start accepts. Automaton has 79 states and 143 transitions. Word has length 22 [2018-06-24 21:13:48,342 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:48,342 INFO ]: Abstraction has 79 states and 143 transitions. [2018-06-24 21:13:48,342 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:13:48,342 INFO ]: Start isEmpty. Operand 79 states and 143 transitions. [2018-06-24 21:13:48,347 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:13:48,347 INFO ]: Found error trace [2018-06-24 21:13:48,347 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:48,347 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:48,347 INFO ]: Analyzing trace with hash -463176007, now seen corresponding path program 1 times [2018-06-24 21:13:48,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:48,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:48,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:48,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:48,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:48,387 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:48,504 INFO ]: Checked inductivity of 50 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-24 21:13:48,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:48,504 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:13:48,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:48,570 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:48,574 INFO ]: Computing forward predicates... [2018-06-24 21:13:48,698 INFO ]: Checked inductivity of 50 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 21:13:48,727 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:48,727 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-06-24 21:13:48,727 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:13:48,727 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:13:48,727 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:13:48,728 INFO ]: Start difference. First operand 79 states and 143 transitions. Second operand 12 states. [2018-06-24 21:13:49,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:49,686 INFO ]: Finished difference Result 157 states and 405 transitions. [2018-06-24 21:13:49,686 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:13:49,686 INFO ]: Start accepts. Automaton has 12 states. Word has length 32 [2018-06-24 21:13:49,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:49,692 INFO ]: With dead ends: 157 [2018-06-24 21:13:49,692 INFO ]: Without dead ends: 157 [2018-06-24 21:13:49,693 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:13:49,693 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-24 21:13:49,721 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 112. [2018-06-24 21:13:49,721 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-24 21:13:49,724 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 254 transitions. [2018-06-24 21:13:49,725 INFO ]: Start accepts. Automaton has 112 states and 254 transitions. Word has length 32 [2018-06-24 21:13:49,725 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:49,725 INFO ]: Abstraction has 112 states and 254 transitions. [2018-06-24 21:13:49,725 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:13:49,725 INFO ]: Start isEmpty. Operand 112 states and 254 transitions. [2018-06-24 21:13:49,732 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:13:49,732 INFO ]: Found error trace [2018-06-24 21:13:49,732 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:49,732 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:49,732 INFO ]: Analyzing trace with hash 238423867, now seen corresponding path program 1 times [2018-06-24 21:13:49,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:49,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:49,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:49,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:49,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:49,757 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:50,045 INFO ]: Checked inductivity of 50 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:13:50,045 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:50,046 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:13:50,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:50,111 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:50,115 INFO ]: Computing forward predicates... [2018-06-24 21:13:50,307 INFO ]: Checked inductivity of 50 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:13:50,326 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:50,326 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2018-06-24 21:13:50,326 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:13:50,326 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:13:50,326 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:13:50,326 INFO ]: Start difference. First operand 112 states and 254 transitions. Second operand 13 states. [2018-06-24 21:13:52,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:52,742 INFO ]: Finished difference Result 190 states and 571 transitions. [2018-06-24 21:13:52,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 21:13:52,742 INFO ]: Start accepts. Automaton has 13 states. Word has length 32 [2018-06-24 21:13:52,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:52,748 INFO ]: With dead ends: 190 [2018-06-24 21:13:52,748 INFO ]: Without dead ends: 190 [2018-06-24 21:13:52,748 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:13:52,749 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-24 21:13:52,795 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 112. [2018-06-24 21:13:52,795 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-24 21:13:52,798 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-06-24 21:13:52,800 INFO ]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 32 [2018-06-24 21:13:52,800 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:52,800 INFO ]: Abstraction has 112 states and 252 transitions. [2018-06-24 21:13:52,800 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:13:52,800 INFO ]: Start isEmpty. Operand 112 states and 252 transitions. [2018-06-24 21:13:52,807 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 21:13:52,807 INFO ]: Found error trace [2018-06-24 21:13:52,807 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:52,807 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:52,809 INFO ]: Analyzing trace with hash 1480019830, now seen corresponding path program 1 times [2018-06-24 21:13:52,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:52,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:52,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:52,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:52,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:52,829 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:52,909 INFO ]: Checked inductivity of 50 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-24 21:13:52,909 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:52,909 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:52,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:52,972 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:52,975 INFO ]: Computing forward predicates... [2018-06-24 21:13:52,980 INFO ]: Checked inductivity of 50 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 21:13:53,000 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:53,000 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:13:53,000 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:53,001 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:53,001 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:53,001 INFO ]: Start difference. First operand 112 states and 252 transitions. Second operand 3 states. [2018-06-24 21:13:53,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:53,067 INFO ]: Finished difference Result 128 states and 281 transitions. [2018-06-24 21:13:53,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:53,067 INFO ]: Start accepts. Automaton has 3 states. Word has length 32 [2018-06-24 21:13:53,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:53,070 INFO ]: With dead ends: 128 [2018-06-24 21:13:53,070 INFO ]: Without dead ends: 128 [2018-06-24 21:13:53,070 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 33 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:53,070 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-24 21:13:53,083 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-06-24 21:13:53,083 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-24 21:13:53,086 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 281 transitions. [2018-06-24 21:13:53,086 INFO ]: Start accepts. Automaton has 128 states and 281 transitions. Word has length 32 [2018-06-24 21:13:53,087 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:53,087 INFO ]: Abstraction has 128 states and 281 transitions. [2018-06-24 21:13:53,088 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:53,088 INFO ]: Start isEmpty. Operand 128 states and 281 transitions. [2018-06-24 21:13:53,102 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-24 21:13:53,102 INFO ]: Found error trace [2018-06-24 21:13:53,102 INFO ]: trace histogram [10, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:53,103 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:53,104 INFO ]: Analyzing trace with hash -1072699323, now seen corresponding path program 1 times [2018-06-24 21:13:53,104 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:53,104 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:53,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:53,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:53,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:53,280 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:53,538 INFO ]: Checked inductivity of 180 backedges. 79 proven. 22 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 21:13:53,538 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:53,538 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:53,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:53,614 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:53,618 INFO ]: Computing forward predicates... [2018-06-24 21:13:53,820 INFO ]: Checked inductivity of 180 backedges. 71 proven. 42 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-24 21:13:53,839 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:53,839 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2018-06-24 21:13:53,839 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:13:53,839 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:13:53,839 INFO ]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:13:53,840 INFO ]: Start difference. First operand 128 states and 281 transitions. Second operand 18 states. [2018-06-24 21:13:56,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:56,216 INFO ]: Finished difference Result 288 states and 1001 transitions. [2018-06-24 21:13:56,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 21:13:56,216 INFO ]: Start accepts. Automaton has 18 states. Word has length 56 [2018-06-24 21:13:56,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:56,228 INFO ]: With dead ends: 288 [2018-06-24 21:13:56,228 INFO ]: Without dead ends: 288 [2018-06-24 21:13:56,229 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:13:56,229 INFO ]: Start minimizeSevpa. Operand 288 states. [2018-06-24 21:13:56,298 INFO ]: Finished minimizeSevpa. Reduced states from 288 to 166. [2018-06-24 21:13:56,298 INFO ]: Start removeUnreachable. Operand 166 states. [2018-06-24 21:13:56,302 INFO ]: Finished removeUnreachable. Reduced from 166 states to 166 states and 387 transitions. [2018-06-24 21:13:56,302 INFO ]: Start accepts. Automaton has 166 states and 387 transitions. Word has length 56 [2018-06-24 21:13:56,303 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:56,303 INFO ]: Abstraction has 166 states and 387 transitions. [2018-06-24 21:13:56,303 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:13:56,303 INFO ]: Start isEmpty. Operand 166 states and 387 transitions. [2018-06-24 21:13:56,315 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-24 21:13:56,315 INFO ]: Found error trace [2018-06-24 21:13:56,315 INFO ]: trace histogram [9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:56,315 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:56,315 INFO ]: Analyzing trace with hash 1687112398, now seen corresponding path program 1 times [2018-06-24 21:13:56,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:56,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:56,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:56,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:56,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:56,328 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:56,408 INFO ]: Checked inductivity of 120 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-24 21:13:56,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:56,408 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) [2018-06-24 21:13:56,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:56,507 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:56,511 INFO ]: Computing forward predicates... [2018-06-24 21:13:56,520 INFO ]: Checked inductivity of 120 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-24 21:13:56,541 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:56,541 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:13:56,541 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:56,541 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:56,541 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:56,541 INFO ]: Start difference. First operand 166 states and 387 transitions. Second operand 3 states. [2018-06-24 21:13:56,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:56,633 INFO ]: Finished difference Result 191 states and 435 transitions. [2018-06-24 21:13:56,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:56,635 INFO ]: Start accepts. Automaton has 3 states. Word has length 47 [2018-06-24 21:13:56,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:56,639 INFO ]: With dead ends: 191 [2018-06-24 21:13:56,639 INFO ]: Without dead ends: 191 [2018-06-24 21:13:56,639 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 48 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:56,639 INFO ]: Start minimizeSevpa. Operand 191 states. [2018-06-24 21:13:56,669 INFO ]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-06-24 21:13:56,669 INFO ]: Start removeUnreachable. Operand 191 states. [2018-06-24 21:13:56,675 INFO ]: Finished removeUnreachable. Reduced from 191 states to 191 states and 435 transitions. [2018-06-24 21:13:56,675 INFO ]: Start accepts. Automaton has 191 states and 435 transitions. Word has length 47 [2018-06-24 21:13:56,675 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:56,675 INFO ]: Abstraction has 191 states and 435 transitions. [2018-06-24 21:13:56,675 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:56,675 INFO ]: Start isEmpty. Operand 191 states and 435 transitions. [2018-06-24 21:13:56,685 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-24 21:13:56,685 INFO ]: Found error trace [2018-06-24 21:13:56,686 INFO ]: trace histogram [9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:56,686 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:56,686 INFO ]: Analyzing trace with hash -1148011855, now seen corresponding path program 1 times [2018-06-24 21:13:56,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:56,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:56,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:56,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:56,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:56,699 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:56,757 INFO ]: Checked inductivity of 123 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-24 21:13:56,757 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:56,757 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:13:56,763 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:56,827 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:56,829 INFO ]: Computing forward predicates... [2018-06-24 21:13:56,836 INFO ]: Checked inductivity of 123 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-24 21:13:56,855 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:56,855 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:13:56,855 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:56,856 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:56,856 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:56,856 INFO ]: Start difference. First operand 191 states and 435 transitions. Second operand 3 states. [2018-06-24 21:13:56,976 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:56,976 INFO ]: Finished difference Result 212 states and 483 transitions. [2018-06-24 21:13:56,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:56,976 INFO ]: Start accepts. Automaton has 3 states. Word has length 47 [2018-06-24 21:13:56,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:56,980 INFO ]: With dead ends: 212 [2018-06-24 21:13:56,980 INFO ]: Without dead ends: 212 [2018-06-24 21:13:56,980 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 48 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:56,980 INFO ]: Start minimizeSevpa. Operand 212 states. [2018-06-24 21:13:57,001 INFO ]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-06-24 21:13:57,001 INFO ]: Start removeUnreachable. Operand 212 states. [2018-06-24 21:13:57,007 INFO ]: Finished removeUnreachable. Reduced from 212 states to 212 states and 483 transitions. [2018-06-24 21:13:57,007 INFO ]: Start accepts. Automaton has 212 states and 483 transitions. Word has length 47 [2018-06-24 21:13:57,007 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:57,007 INFO ]: Abstraction has 212 states and 483 transitions. [2018-06-24 21:13:57,007 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:57,007 INFO ]: Start isEmpty. Operand 212 states and 483 transitions. [2018-06-24 21:13:57,020 INFO ]: Finished isEmpty. Found accepting run of length 96 [2018-06-24 21:13:57,020 INFO ]: Found error trace [2018-06-24 21:13:57,021 INFO ]: trace histogram [18, 7, 7, 6, 6, 6, 6, 2, 2, 2, 2, 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] [2018-06-24 21:13:57,021 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:57,021 INFO ]: Analyzing trace with hash 817339053, now seen corresponding path program 1 times [2018-06-24 21:13:57,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:57,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:57,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:57,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:57,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:57,036 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:57,141 INFO ]: Checked inductivity of 540 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2018-06-24 21:13:57,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:57,141 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:13:57,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:57,300 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:57,306 INFO ]: Computing forward predicates... [2018-06-24 21:13:57,320 INFO ]: Checked inductivity of 540 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2018-06-24 21:13:57,346 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:57,346 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:13:57,346 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:57,347 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:57,347 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:57,347 INFO ]: Start difference. First operand 212 states and 483 transitions. Second operand 3 states. [2018-06-24 21:13:57,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:57,446 INFO ]: Finished difference Result 234 states and 519 transitions. [2018-06-24 21:13:57,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:57,447 INFO ]: Start accepts. Automaton has 3 states. Word has length 95 [2018-06-24 21:13:57,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:57,454 INFO ]: With dead ends: 234 [2018-06-24 21:13:57,454 INFO ]: Without dead ends: 234 [2018-06-24 21:13:57,454 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 96 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:57,455 INFO ]: Start minimizeSevpa. Operand 234 states. [2018-06-24 21:13:57,477 INFO ]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-06-24 21:13:57,477 INFO ]: Start removeUnreachable. Operand 234 states. [2018-06-24 21:13:57,483 INFO ]: Finished removeUnreachable. Reduced from 234 states to 234 states and 519 transitions. [2018-06-24 21:13:57,483 INFO ]: Start accepts. Automaton has 234 states and 519 transitions. Word has length 95 [2018-06-24 21:13:57,484 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:57,484 INFO ]: Abstraction has 234 states and 519 transitions. [2018-06-24 21:13:57,484 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:57,486 INFO ]: Start isEmpty. Operand 234 states and 519 transitions. [2018-06-24 21:13:57,499 INFO ]: Finished isEmpty. Found accepting run of length 145 [2018-06-24 21:13:57,499 INFO ]: Found error trace [2018-06-24 21:13:57,499 INFO ]: trace histogram [28, 10, 10, 9, 9, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-06-24 21:13:57,499 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:57,499 INFO ]: Analyzing trace with hash 907265888, now seen corresponding path program 1 times [2018-06-24 21:13:57,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:57,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:57,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:57,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:57,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:57,524 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:57,677 INFO ]: Checked inductivity of 1282 backedges. 160 proven. 42 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2018-06-24 21:13:57,677 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:57,677 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) [2018-06-24 21:13:57,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:57,958 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:57,971 INFO ]: Computing forward predicates... [2018-06-24 21:13:58,002 INFO ]: Checked inductivity of 1282 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-06-24 21:13:58,036 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:13:58,036 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:13:58,036 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:13:58,037 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:13:58,037 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:13:58,037 INFO ]: Start difference. First operand 234 states and 519 transitions. Second operand 3 states. [2018-06-24 21:13:58,267 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:13:58,267 INFO ]: Finished difference Result 253 states and 556 transitions. [2018-06-24 21:13:58,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:13:58,270 INFO ]: Start accepts. Automaton has 3 states. Word has length 144 [2018-06-24 21:13:58,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:13:58,275 INFO ]: With dead ends: 253 [2018-06-24 21:13:58,275 INFO ]: Without dead ends: 253 [2018-06-24 21:13:58,275 INFO ]: 0 DeclaredPredicates, 146 GetRequests, 145 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:58,276 INFO ]: Start minimizeSevpa. Operand 253 states. [2018-06-24 21:13:58,297 INFO ]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-06-24 21:13:58,297 INFO ]: Start removeUnreachable. Operand 253 states. [2018-06-24 21:13:58,301 INFO ]: Finished removeUnreachable. Reduced from 253 states to 253 states and 556 transitions. [2018-06-24 21:13:58,301 INFO ]: Start accepts. Automaton has 253 states and 556 transitions. Word has length 144 [2018-06-24 21:13:58,301 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:13:58,301 INFO ]: Abstraction has 253 states and 556 transitions. [2018-06-24 21:13:58,301 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:13:58,301 INFO ]: Start isEmpty. Operand 253 states and 556 transitions. [2018-06-24 21:13:58,314 INFO ]: Finished isEmpty. Found accepting run of length 287 [2018-06-24 21:13:58,314 INFO ]: Found error trace [2018-06-24 21:13:58,314 INFO ]: trace histogram [56, 21, 21, 19, 16, 16, 16, 9, 9, 9, 7, 5, 5, 5, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:13:58,314 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:13:58,315 INFO ]: Analyzing trace with hash 137161978, now seen corresponding path program 1 times [2018-06-24 21:13:58,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:13:58,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:13:58,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:58,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:13:58,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:13:58,391 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:58,640 INFO ]: Checked inductivity of 5207 backedges. 423 proven. 258 refuted. 0 times theorem prover too weak. 4526 trivial. 0 not checked. [2018-06-24 21:13:58,640 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:13:58,640 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:13:58,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:13:59,156 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:13:59,176 INFO ]: Computing forward predicates... [2018-06-24 21:13:59,370 INFO ]: Checked inductivity of 5207 backedges. 538 proven. 563 refuted. 0 times theorem prover too weak. 4106 trivial. 0 not checked. [2018-06-24 21:13:59,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:13:59,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2018-06-24 21:13:59,393 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:13:59,393 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:13:59,393 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:13:59,393 INFO ]: Start difference. First operand 253 states and 556 transitions. Second operand 13 states. [2018-06-24 21:14:01,315 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:14:01,315 INFO ]: Finished difference Result 437 states and 1205 transitions. [2018-06-24 21:14:01,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 21:14:01,315 INFO ]: Start accepts. Automaton has 13 states. Word has length 286 [2018-06-24 21:14:01,315 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:14:01,322 INFO ]: With dead ends: 437 [2018-06-24 21:14:01,322 INFO ]: Without dead ends: 437 [2018-06-24 21:14:01,322 INFO ]: 0 DeclaredPredicates, 331 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=1343, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 21:14:01,323 INFO ]: Start minimizeSevpa. Operand 437 states. [2018-06-24 21:14:01,371 INFO ]: Finished minimizeSevpa. Reduced states from 437 to 321. [2018-06-24 21:14:01,371 INFO ]: Start removeUnreachable. Operand 321 states. [2018-06-24 21:14:01,377 INFO ]: Finished removeUnreachable. Reduced from 321 states to 321 states and 706 transitions. [2018-06-24 21:14:01,377 INFO ]: Start accepts. Automaton has 321 states and 706 transitions. Word has length 286 [2018-06-24 21:14:01,377 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:14:01,377 INFO ]: Abstraction has 321 states and 706 transitions. [2018-06-24 21:14:01,377 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:14:01,377 INFO ]: Start isEmpty. Operand 321 states and 706 transitions. [2018-06-24 21:14:01,396 INFO ]: Finished isEmpty. Found accepting run of length 410 [2018-06-24 21:14:01,396 INFO ]: Found error trace [2018-06-24 21:14:01,396 INFO ]: trace histogram [77, 30, 30, 28, 28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 7, 5, 5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:14:01,396 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:14:01,397 INFO ]: Analyzing trace with hash -468361860, now seen corresponding path program 1 times [2018-06-24 21:14:01,397 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:14:01,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:14:01,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:01,397 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:14:01,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:01,445 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:02,732 INFO ]: Checked inductivity of 10916 backedges. 560 proven. 999 refuted. 0 times theorem prover too weak. 9357 trivial. 0 not checked. [2018-06-24 21:14:02,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:14:02,732 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:14:02,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:14:03,273 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:03,298 INFO ]: Computing forward predicates... [2018-06-24 21:14:03,654 INFO ]: Checked inductivity of 10916 backedges. 804 proven. 1056 refuted. 0 times theorem prover too weak. 9056 trivial. 0 not checked. [2018-06-24 21:14:03,677 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:14:03,766 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 25 [2018-06-24 21:14:03,766 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:14:03,767 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:14:03,767 INFO ]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:14:03,767 INFO ]: Start difference. First operand 321 states and 706 transitions. Second operand 25 states. [2018-06-24 21:14:08,242 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:14:08,242 INFO ]: Finished difference Result 613 states and 1830 transitions. [2018-06-24 21:14:08,243 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-24 21:14:08,243 INFO ]: Start accepts. Automaton has 25 states. Word has length 409 [2018-06-24 21:14:08,243 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:14:08,254 INFO ]: With dead ends: 613 [2018-06-24 21:14:08,254 INFO ]: Without dead ends: 613 [2018-06-24 21:14:08,255 INFO ]: 0 DeclaredPredicates, 471 GetRequests, 406 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=447, Invalid=3459, Unknown=0, NotChecked=0, Total=3906 [2018-06-24 21:14:08,255 INFO ]: Start minimizeSevpa. Operand 613 states. [2018-06-24 21:14:08,338 INFO ]: Finished minimizeSevpa. Reduced states from 613 to 391. [2018-06-24 21:14:08,338 INFO ]: Start removeUnreachable. Operand 391 states. [2018-06-24 21:14:08,346 INFO ]: Finished removeUnreachable. Reduced from 391 states to 391 states and 894 transitions. [2018-06-24 21:14:08,346 INFO ]: Start accepts. Automaton has 391 states and 894 transitions. Word has length 409 [2018-06-24 21:14:08,346 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:14:08,346 INFO ]: Abstraction has 391 states and 894 transitions. [2018-06-24 21:14:08,346 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:14:08,346 INFO ]: Start isEmpty. Operand 391 states and 894 transitions. [2018-06-24 21:14:08,370 INFO ]: Finished isEmpty. Found accepting run of length 386 [2018-06-24 21:14:08,370 INFO ]: Found error trace [2018-06-24 21:14:08,370 INFO ]: trace histogram [73, 28, 28, 26, 26, 26, 26, 9, 9, 9, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:14:08,370 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:14:08,370 INFO ]: Analyzing trace with hash -981359324, now seen corresponding path program 2 times [2018-06-24 21:14:08,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:14:08,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:14:08,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:08,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:14:08,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:08,429 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:08,783 INFO ]: Checked inductivity of 9630 backedges. 601 proven. 886 refuted. 0 times theorem prover too weak. 8143 trivial. 0 not checked. [2018-06-24 21:14:08,783 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:14:08,783 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:14:08,788 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:14:09,320 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:14:09,320 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:09,345 INFO ]: Computing forward predicates... [2018-06-24 21:14:11,301 INFO ]: Checked inductivity of 9630 backedges. 773 proven. 1216 refuted. 0 times theorem prover too weak. 7641 trivial. 0 not checked. [2018-06-24 21:14:11,324 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:14:11,324 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2018-06-24 21:14:11,324 INFO ]: Interpolant automaton has 31 states [2018-06-24 21:14:11,325 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 21:14:11,325 INFO ]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:14:11,325 INFO ]: Start difference. First operand 391 states and 894 transitions. Second operand 31 states. [2018-06-24 21:14:19,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:14:19,968 INFO ]: Finished difference Result 758 states and 2304 transitions. [2018-06-24 21:14:19,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-06-24 21:14:19,968 INFO ]: Start accepts. Automaton has 31 states. Word has length 385 [2018-06-24 21:14:19,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:14:19,988 INFO ]: With dead ends: 758 [2018-06-24 21:14:19,988 INFO ]: Without dead ends: 757 [2018-06-24 21:14:19,991 INFO ]: 0 DeclaredPredicates, 492 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3390 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1122, Invalid=11088, Unknown=0, NotChecked=0, Total=12210 [2018-06-24 21:14:19,992 INFO ]: Start minimizeSevpa. Operand 757 states. [2018-06-24 21:14:20,074 INFO ]: Finished minimizeSevpa. Reduced states from 757 to 447. [2018-06-24 21:14:20,074 INFO ]: Start removeUnreachable. Operand 447 states. [2018-06-24 21:14:20,083 INFO ]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1027 transitions. [2018-06-24 21:14:20,083 INFO ]: Start accepts. Automaton has 447 states and 1027 transitions. Word has length 385 [2018-06-24 21:14:20,083 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:14:20,083 INFO ]: Abstraction has 447 states and 1027 transitions. [2018-06-24 21:14:20,083 INFO ]: Interpolant automaton has 31 states. [2018-06-24 21:14:20,083 INFO ]: Start isEmpty. Operand 447 states and 1027 transitions. [2018-06-24 21:14:20,107 INFO ]: Finished isEmpty. Found accepting run of length 653 [2018-06-24 21:14:20,107 INFO ]: Found error trace [2018-06-24 21:14:20,108 INFO ]: trace histogram [120, 49, 49, 47, 47, 47, 47, 23, 23, 23, 23, 11, 11, 11, 9, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 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:14:20,108 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:14:20,108 INFO ]: Analyzing trace with hash -773160214, now seen corresponding path program 1 times [2018-06-24 21:14:20,108 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:14:20,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:14:20,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:20,109 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:14:20,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:20,318 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:20,961 INFO ]: Checked inductivity of 28511 backedges. 1305 proven. 466 refuted. 0 times theorem prover too weak. 26740 trivial. 0 not checked. [2018-06-24 21:14:20,962 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:14:20,962 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:14:20,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:14:21,836 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:21,882 INFO ]: Computing forward predicates... [2018-06-24 21:14:22,236 INFO ]: Checked inductivity of 28511 backedges. 1399 proven. 754 refuted. 0 times theorem prover too weak. 26358 trivial. 0 not checked. [2018-06-24 21:14:22,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:14:22,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 11] total 12 [2018-06-24 21:14:22,277 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:14:22,278 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:14:22,278 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:14:22,278 INFO ]: Start difference. First operand 447 states and 1027 transitions. Second operand 12 states. [2018-06-24 21:14:23,496 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:14:23,496 INFO ]: Finished difference Result 670 states and 1934 transitions. [2018-06-24 21:14:23,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:14:23,496 INFO ]: Start accepts. Automaton has 12 states. Word has length 652 [2018-06-24 21:14:23,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:14:23,507 INFO ]: With dead ends: 670 [2018-06-24 21:14:23,507 INFO ]: Without dead ends: 670 [2018-06-24 21:14:23,507 INFO ]: 0 DeclaredPredicates, 674 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:14:23,507 INFO ]: Start minimizeSevpa. Operand 670 states. [2018-06-24 21:14:23,560 INFO ]: Finished minimizeSevpa. Reduced states from 670 to 488. [2018-06-24 21:14:23,560 INFO ]: Start removeUnreachable. Operand 488 states. [2018-06-24 21:14:23,568 INFO ]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1191 transitions. [2018-06-24 21:14:23,569 INFO ]: Start accepts. Automaton has 488 states and 1191 transitions. Word has length 652 [2018-06-24 21:14:23,571 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:14:23,571 INFO ]: Abstraction has 488 states and 1191 transitions. [2018-06-24 21:14:23,571 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:14:23,572 INFO ]: Start isEmpty. Operand 488 states and 1191 transitions. [2018-06-24 21:14:23,586 INFO ]: Finished isEmpty. Found accepting run of length 263 [2018-06-24 21:14:23,586 INFO ]: Found error trace [2018-06-24 21:14:23,586 INFO ]: trace histogram [50, 19, 19, 17, 17, 17, 17, 7, 7, 7, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2018-06-24 21:14:23,586 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:14:23,586 INFO ]: Analyzing trace with hash -1243893027, now seen corresponding path program 1 times [2018-06-24 21:14:23,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:14:23,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:14:23,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:23,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:14:23,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:23,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:24,054 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-06-24 21:14:24,462 INFO ]: Checked inductivity of 4362 backedges. 394 proven. 380 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2018-06-24 21:14:24,462 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:14:24,462 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:14:24,469 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:14:24,805 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:24,816 INFO ]: Computing forward predicates... [2018-06-24 21:14:25,163 INFO ]: Checked inductivity of 4362 backedges. 535 proven. 492 refuted. 0 times theorem prover too weak. 3335 trivial. 0 not checked. [2018-06-24 21:14:25,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:14:25,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-06-24 21:14:25,198 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:14:25,198 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:14:25,198 INFO ]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:14:25,199 INFO ]: Start difference. First operand 488 states and 1191 transitions. Second operand 22 states. [2018-06-24 21:14:26,708 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:14:26,708 INFO ]: Finished difference Result 741 states and 2016 transitions. [2018-06-24 21:14:26,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:14:26,708 INFO ]: Start accepts. Automaton has 22 states. Word has length 262 [2018-06-24 21:14:26,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:14:26,721 INFO ]: With dead ends: 741 [2018-06-24 21:14:26,721 INFO ]: Without dead ends: 741 [2018-06-24 21:14:26,721 INFO ]: 0 DeclaredPredicates, 300 GetRequests, 259 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=188, Invalid=1452, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:14:26,722 INFO ]: Start minimizeSevpa. Operand 741 states. [2018-06-24 21:14:26,782 INFO ]: Finished minimizeSevpa. Reduced states from 741 to 661. [2018-06-24 21:14:26,782 INFO ]: Start removeUnreachable. Operand 661 states. [2018-06-24 21:14:26,790 INFO ]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1787 transitions. [2018-06-24 21:14:26,790 INFO ]: Start accepts. Automaton has 661 states and 1787 transitions. Word has length 262 [2018-06-24 21:14:26,791 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:14:26,791 INFO ]: Abstraction has 661 states and 1787 transitions. [2018-06-24 21:14:26,791 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:14:26,791 INFO ]: Start isEmpty. Operand 661 states and 1787 transitions. [2018-06-24 21:14:26,801 INFO ]: Finished isEmpty. Found accepting run of length 395 [2018-06-24 21:14:26,801 INFO ]: Found error trace [2018-06-24 21:14:26,802 INFO ]: trace histogram [72, 30, 30, 28, 28, 28, 28, 14, 14, 14, 14, 7, 7, 7, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2018-06-24 21:14:26,802 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:14:26,802 INFO ]: Analyzing trace with hash -1278315827, now seen corresponding path program 1 times [2018-06-24 21:14:26,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:14:26,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:14:26,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:26,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:14:26,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:26,893 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:27,220 INFO ]: Checked inductivity of 10236 backedges. 717 proven. 650 refuted. 0 times theorem prover too weak. 8869 trivial. 0 not checked. [2018-06-24 21:14:27,220 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:14:27,220 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:14:27,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:14:27,758 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:27,773 INFO ]: Computing forward predicates... [2018-06-24 21:14:28,034 INFO ]: Checked inductivity of 10236 backedges. 850 proven. 815 refuted. 0 times theorem prover too weak. 8571 trivial. 0 not checked. [2018-06-24 21:14:28,058 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:14:28,058 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2018-06-24 21:14:28,058 INFO ]: Interpolant automaton has 23 states [2018-06-24 21:14:28,059 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 21:14:28,059 INFO ]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:14:28,059 INFO ]: Start difference. First operand 661 states and 1787 transitions. Second operand 23 states. [2018-06-24 21:14:29,250 WARN ]: Spent 209.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-06-24 21:14:33,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:14:33,413 INFO ]: Finished difference Result 1316 states and 3810 transitions. [2018-06-24 21:14:33,416 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-06-24 21:14:33,416 INFO ]: Start accepts. Automaton has 23 states. Word has length 394 [2018-06-24 21:14:33,416 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:14:33,443 INFO ]: With dead ends: 1316 [2018-06-24 21:14:33,443 INFO ]: Without dead ends: 1125 [2018-06-24 21:14:33,446 INFO ]: 0 DeclaredPredicates, 513 GetRequests, 399 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3809 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1225, Invalid=11431, Unknown=0, NotChecked=0, Total=12656 [2018-06-24 21:14:33,446 INFO ]: Start minimizeSevpa. Operand 1125 states. [2018-06-24 21:14:33,536 INFO ]: Finished minimizeSevpa. Reduced states from 1125 to 844. [2018-06-24 21:14:33,536 INFO ]: Start removeUnreachable. Operand 844 states. [2018-06-24 21:14:33,547 INFO ]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2447 transitions. [2018-06-24 21:14:33,547 INFO ]: Start accepts. Automaton has 844 states and 2447 transitions. Word has length 394 [2018-06-24 21:14:33,548 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:14:33,548 INFO ]: Abstraction has 844 states and 2447 transitions. [2018-06-24 21:14:33,548 INFO ]: Interpolant automaton has 23 states. [2018-06-24 21:14:33,548 INFO ]: Start isEmpty. Operand 844 states and 2447 transitions. [2018-06-24 21:14:33,564 INFO ]: Finished isEmpty. Found accepting run of length 359 [2018-06-24 21:14:33,564 INFO ]: Found error trace [2018-06-24 21:14:33,564 INFO ]: trace histogram [66, 27, 27, 25, 25, 25, 25, 11, 11, 11, 11, 7, 7, 7, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2018-06-24 21:14:33,564 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:14:33,564 INFO ]: Analyzing trace with hash 263973907, now seen corresponding path program 2 times [2018-06-24 21:14:33,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:14:33,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:14:33,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:33,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:14:33,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:14:33,713 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:14:34,075 WARN ]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 Received shutdown request... [2018-06-24 21:14:34,667 WARN ]: Verification canceled [2018-06-24 21:14:34,669 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:14:34,670 WARN ]: Timeout [2018-06-24 21:14:34,670 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:14:34 BasicIcfg [2018-06-24 21:14:34,670 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:14:34,671 INFO ]: Toolchain (without parser) took 54598.91 ms. Allocated memory was 304.1 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 252.5 MB in the beginning and 722.4 MB in the end (delta: -469.9 MB). Peak memory consumption was 628.5 MB. Max. memory is 3.6 GB. [2018-06-24 21:14:34,672 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:14:34,672 INFO ]: ChcToBoogie took 72.41 ms. Allocated memory is still 304.1 MB. Free memory was 252.5 MB in the beginning and 249.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:14:34,672 INFO ]: Boogie Preprocessor took 61.17 ms. Allocated memory is still 304.1 MB. Free memory was 249.5 MB in the beginning and 247.5 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:14:34,673 INFO ]: RCFGBuilder took 662.15 ms. Allocated memory is still 304.1 MB. Free memory was 247.5 MB in the beginning and 222.4 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:14:34,673 INFO ]: BlockEncodingV2 took 513.52 ms. Allocated memory is still 304.1 MB. Free memory was 222.4 MB in the beginning and 197.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:14:34,673 INFO ]: TraceAbstraction took 53276.31 ms. Allocated memory was 304.1 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 196.4 MB in the beginning and 722.4 MB in the end (delta: -525.9 MB). Peak memory consumption was 572.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:14:34,678 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 74 locations, 115 edges - StatisticsResult: Encoded RCFG 45 locations, 87 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 72.41 ms. Allocated memory is still 304.1 MB. Free memory was 252.5 MB in the beginning and 249.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 61.17 ms. Allocated memory is still 304.1 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 662.15 ms. Allocated memory is still 304.1 MB. Free memory was 247.5 MB in the beginning and 222.4 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 513.52 ms. Allocated memory is still 304.1 MB. Free memory was 222.4 MB in the beginning and 197.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53276.31 ms. Allocated memory was 304.1 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 196.4 MB in the beginning and 722.4 MB in the end (delta: -525.9 MB). Peak memory consumption was 572.4 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 359 with TraceHistMax 66, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. TIMEOUT Result, 53.2s OverallTime, 21 OverallIterations, 120 TraceHistogramMax, 34.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2684 SDtfs, 1682 SDslu, 12249 SDs, 0 SdLazy, 33968 SolverSat, 3964 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3463 GetRequests, 2943 SyntacticMatches, 9 SemanticMatches, 511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9249 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred 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: 0.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 1579 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 5860 NumberOfCodeBlocks, 5860 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 5824 ConstructedInterpolants, 0 QuantifiedInterpolants, 2654925 SizeOfPredicates, 167 NumberOfNonLiveVariables, 33715 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 36 InterpolantComputations, 9 PerfectInterpolantSequences, 133909/142594 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/bcopy5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-14-34-691.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-14-34-691.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-14-34-691.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bcopy5.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-14-34-691.csv Completed graceful shutdown