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/enc-zip_unzip.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:18:02,288 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:18:02,291 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:18:02,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:18:02,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:18:02,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:18:02,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:18:02,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:18:02,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:18:02,309 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:18:02,310 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:18:02,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:18:02,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:18:02,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:18:02,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:18:02,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:18:02,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:18:02,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:18:02,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:18:02,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:18:02,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:18:02,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:18:02,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:18:02,323 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:18:02,324 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:18:02,325 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:18:02,326 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:18:02,326 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:18:02,331 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:18:02,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:18:02,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:18:02,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:18:02,333 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:18:02,334 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:18:02,334 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:18:02,335 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:18:02,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:18:02,349 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:18:02,350 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:18:02,350 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:18:02,351 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:18:02,351 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:18:02,351 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:18:02,351 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:18:02,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:18:02,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:18:02,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:18:02,352 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:18:02,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:18:02,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:18:02,353 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:18:02,353 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:18:02,353 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:18:02,353 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:18:02,353 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:18:02,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:18:02,354 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:18:02,355 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:18:02,355 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:18:02,403 INFO ]: Repository-Root is: /tmp [2018-06-24 21:18:02,423 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:18:02,430 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:18:02,431 INFO ]: Initializing SmtParser... [2018-06-24 21:18:02,431 INFO ]: SmtParser initialized [2018-06-24 21:18:02,432 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 [2018-06-24 21:18:02,433 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:18:02,524 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 unknown [2018-06-24 21:18:02,813 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-zip_unzip.smt2 [2018-06-24 21:18:02,817 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:18:02,824 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:18:02,824 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:18:02,824 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:18:02,824 INFO ]: ChcToBoogie initialized [2018-06-24 21:18:02,827 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:18:02" (1/1) ... [2018-06-24 21:18:02,881 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:02 Unit [2018-06-24 21:18:02,881 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:18:02,882 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:18:02,882 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:18:02,882 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:18:02,903 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:02" (1/1) ... [2018-06-24 21:18:02,903 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:02" (1/1) ... [2018-06-24 21:18:02,912 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:02" (1/1) ... [2018-06-24 21:18:02,912 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:02" (1/1) ... [2018-06-24 21:18:02,916 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:02" (1/1) ... [2018-06-24 21:18:02,919 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:02" (1/1) ... [2018-06-24 21:18:02,920 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:02" (1/1) ... [2018-06-24 21:18:02,929 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:18:02,929 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:18:02,929 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:18:02,929 INFO ]: RCFGBuilder initialized [2018-06-24 21:18:02,930 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:02" (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:18:02,949 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:18:02,949 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:18:02,949 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:18:02,949 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:18:02,949 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:18:02,949 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:18:03,280 INFO ]: Using library mode [2018-06-24 21:18:03,280 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:18:03 BoogieIcfgContainer [2018-06-24 21:18:03,280 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:18:03,281 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:18:03,281 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:18:03,282 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:18:03,282 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:18:03" (1/1) ... [2018-06-24 21:18:03,297 INFO ]: Initial Icfg 20 locations, 28 edges [2018-06-24 21:18:03,298 INFO ]: Using Remove infeasible edges [2018-06-24 21:18:03,299 INFO ]: Using Maximize final states [2018-06-24 21:18:03,299 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:18:03,299 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:18:03,301 INFO ]: Using Remove sink states [2018-06-24 21:18:03,302 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:18:03,302 INFO ]: Using Use SBE [2018-06-24 21:18:03,311 INFO ]: SBE split 0 edges [2018-06-24 21:18:03,316 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:18:03,317 INFO ]: 0 new accepting states [2018-06-24 21:18:03,431 INFO ]: Removed 19 edges and 7 locations by large block encoding [2018-06-24 21:18:03,433 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:18:03,434 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:18:03,434 INFO ]: 0 new accepting states [2018-06-24 21:18:03,435 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:18:03,435 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:18:03,435 INFO ]: Encoded RCFG 11 locations, 19 edges [2018-06-24 21:18:03,436 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:18:03 BasicIcfg [2018-06-24 21:18:03,436 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:18:03,437 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:18:03,437 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:18:03,440 INFO ]: TraceAbstraction initialized [2018-06-24 21:18:03,440 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:18:02" (1/4) ... [2018-06-24 21:18:03,441 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aaa2951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:18:03, skipping insertion in model container [2018-06-24 21:18:03,441 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:18:02" (2/4) ... [2018-06-24 21:18:03,441 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aaa2951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:18:03, skipping insertion in model container [2018-06-24 21:18:03,441 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:18:03" (3/4) ... [2018-06-24 21:18:03,442 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aaa2951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:18:03, skipping insertion in model container [2018-06-24 21:18:03,442 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:18:03" (4/4) ... [2018-06-24 21:18:03,444 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:18:03,455 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:18:03,472 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:18:03,514 INFO ]: Using default assertion order modulation [2018-06-24 21:18:03,515 INFO ]: Interprodecural is true [2018-06-24 21:18:03,515 INFO ]: Hoare is false [2018-06-24 21:18:03,515 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:18:03,515 INFO ]: Backedges is TWOTRACK [2018-06-24 21:18:03,515 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:18:03,515 INFO ]: Difference is false [2018-06-24 21:18:03,515 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:18:03,515 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:18:03,524 INFO ]: Start isEmpty. Operand 11 states. [2018-06-24 21:18:03,534 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:18:03,534 INFO ]: Found error trace [2018-06-24 21:18:03,534 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:18:03,535 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:03,541 INFO ]: Analyzing trace with hash 36175751, now seen corresponding path program 1 times [2018-06-24 21:18:03,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:03,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:03,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:03,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:03,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:03,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:03,661 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:18:03,662 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:03,662 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:18:03,664 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:18:03,677 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:18:03,677 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:18:03,680 INFO ]: Start difference. First operand 11 states. Second operand 3 states. [2018-06-24 21:18:03,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:03,790 INFO ]: Finished difference Result 17 states and 32 transitions. [2018-06-24 21:18:03,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:18:03,792 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:18:03,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:03,800 INFO ]: With dead ends: 17 [2018-06-24 21:18:03,800 INFO ]: Without dead ends: 17 [2018-06-24 21:18:03,802 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:18:03,813 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:18:03,843 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 21:18:03,844 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:18:03,845 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2018-06-24 21:18:03,847 INFO ]: Start accepts. Automaton has 17 states and 32 transitions. Word has length 5 [2018-06-24 21:18:03,848 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:03,848 INFO ]: Abstraction has 17 states and 32 transitions. [2018-06-24 21:18:03,848 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:18:03,848 INFO ]: Start isEmpty. Operand 17 states and 32 transitions. [2018-06-24 21:18:03,849 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:18:03,849 INFO ]: Found error trace [2018-06-24 21:18:03,849 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:18:03,849 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:03,851 INFO ]: Analyzing trace with hash 1124113280, now seen corresponding path program 1 times [2018-06-24 21:18:03,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:03,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:03,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:03,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:03,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:03,864 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:03,945 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:18:03,945 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:03,945 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:18:03,946 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:18:03,946 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:18:03,946 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:18:03,947 INFO ]: Start difference. First operand 17 states and 32 transitions. Second operand 3 states. [2018-06-24 21:18:04,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:04,041 INFO ]: Finished difference Result 27 states and 52 transitions. [2018-06-24 21:18:04,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:18:04,043 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:18:04,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:04,046 INFO ]: With dead ends: 27 [2018-06-24 21:18:04,046 INFO ]: Without dead ends: 27 [2018-06-24 21:18:04,046 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:18:04,047 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 21:18:04,055 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-06-24 21:18:04,055 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:18:04,056 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-06-24 21:18:04,056 INFO ]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 6 [2018-06-24 21:18:04,056 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:04,056 INFO ]: Abstraction has 19 states and 36 transitions. [2018-06-24 21:18:04,056 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:18:04,057 INFO ]: Start isEmpty. Operand 19 states and 36 transitions. [2018-06-24 21:18:04,059 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:18:04,059 INFO ]: Found error trace [2018-06-24 21:18:04,059 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:18:04,059 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:04,059 INFO ]: Analyzing trace with hash 1125036801, now seen corresponding path program 1 times [2018-06-24 21:18:04,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:04,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:04,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:04,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:04,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:04,074 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:04,173 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:18:04,173 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:04,173 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:18:04,173 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:18:04,173 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:18:04,173 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:18:04,173 INFO ]: Start difference. First operand 19 states and 36 transitions. Second operand 3 states. [2018-06-24 21:18:04,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:04,248 INFO ]: Finished difference Result 29 states and 54 transitions. [2018-06-24 21:18:04,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:18:04,250 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:18:04,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:04,251 INFO ]: With dead ends: 29 [2018-06-24 21:18:04,251 INFO ]: Without dead ends: 29 [2018-06-24 21:18:04,251 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:18:04,251 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:18:04,259 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-06-24 21:18:04,259 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:18:04,260 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-06-24 21:18:04,260 INFO ]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 6 [2018-06-24 21:18:04,260 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:04,260 INFO ]: Abstraction has 17 states and 30 transitions. [2018-06-24 21:18:04,260 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:18:04,260 INFO ]: Start isEmpty. Operand 17 states and 30 transitions. [2018-06-24 21:18:04,261 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:18:04,261 INFO ]: Found error trace [2018-06-24 21:18:04,261 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:04,261 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:04,261 INFO ]: Analyzing trace with hash 463781513, now seen corresponding path program 1 times [2018-06-24 21:18:04,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:04,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:04,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:04,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:04,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:04,273 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:04,481 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:18:04,481 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:04,481 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:18:04,481 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:18:04,481 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:18:04,481 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:18:04,481 INFO ]: Start difference. First operand 17 states and 30 transitions. Second operand 5 states. [2018-06-24 21:18:04,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:04,904 INFO ]: Finished difference Result 33 states and 65 transitions. [2018-06-24 21:18:04,904 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:18:04,904 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-24 21:18:04,904 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:04,906 INFO ]: With dead ends: 33 [2018-06-24 21:18:04,906 INFO ]: Without dead ends: 29 [2018-06-24 21:18:04,906 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:18:04,906 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:18:04,915 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-06-24 21:18:04,915 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:18:04,916 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 41 transitions. [2018-06-24 21:18:04,916 INFO ]: Start accepts. Automaton has 23 states and 41 transitions. Word has length 11 [2018-06-24 21:18:04,916 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:04,916 INFO ]: Abstraction has 23 states and 41 transitions. [2018-06-24 21:18:04,916 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:18:04,916 INFO ]: Start isEmpty. Operand 23 states and 41 transitions. [2018-06-24 21:18:04,917 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:18:04,917 INFO ]: Found error trace [2018-06-24 21:18:04,917 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:04,918 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:04,918 INFO ]: Analyzing trace with hash 267268008, now seen corresponding path program 1 times [2018-06-24 21:18:04,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:04,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:04,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:04,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:04,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:04,931 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:04,968 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:18:04,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:04,968 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:18:04,968 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:18:04,968 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:18:04,968 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:18:04,968 INFO ]: Start difference. First operand 23 states and 41 transitions. Second operand 3 states. [2018-06-24 21:18:05,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:05,032 INFO ]: Finished difference Result 31 states and 54 transitions. [2018-06-24 21:18:05,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:18:05,032 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 21:18:05,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:05,033 INFO ]: With dead ends: 31 [2018-06-24 21:18:05,034 INFO ]: Without dead ends: 31 [2018-06-24 21:18:05,034 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:18:05,034 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 21:18:05,038 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-06-24 21:18:05,038 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:18:05,038 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 39 transitions. [2018-06-24 21:18:05,038 INFO ]: Start accepts. Automaton has 23 states and 39 transitions. Word has length 11 [2018-06-24 21:18:05,039 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:05,039 INFO ]: Abstraction has 23 states and 39 transitions. [2018-06-24 21:18:05,039 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:18:05,039 INFO ]: Start isEmpty. Operand 23 states and 39 transitions. [2018-06-24 21:18:05,039 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:18:05,039 INFO ]: Found error trace [2018-06-24 21:18:05,040 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:05,040 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:05,040 INFO ]: Analyzing trace with hash 854237953, now seen corresponding path program 1 times [2018-06-24 21:18:05,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:05,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:05,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:05,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:05,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:05,056 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:05,227 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:05,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:05,227 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:18:05,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:05,257 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:05,264 INFO ]: Computing forward predicates... [2018-06-24 21:18:05,314 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:05,339 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:18:05,339 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2018-06-24 21:18:05,339 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:18:05,339 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:18:05,339 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:18:05,339 INFO ]: Start difference. First operand 23 states and 39 transitions. Second operand 8 states. [2018-06-24 21:18:06,017 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:06,017 INFO ]: Finished difference Result 45 states and 85 transitions. [2018-06-24 21:18:06,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:18:06,017 INFO ]: Start accepts. Automaton has 8 states. Word has length 16 [2018-06-24 21:18:06,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:06,018 INFO ]: With dead ends: 45 [2018-06-24 21:18:06,018 INFO ]: Without dead ends: 45 [2018-06-24 21:18:06,019 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:18:06,019 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 21:18:06,029 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-06-24 21:18:06,029 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:18:06,030 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. [2018-06-24 21:18:06,030 INFO ]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 16 [2018-06-24 21:18:06,030 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:06,030 INFO ]: Abstraction has 34 states and 60 transitions. [2018-06-24 21:18:06,030 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:18:06,030 INFO ]: Start isEmpty. Operand 34 states and 60 transitions. [2018-06-24 21:18:06,032 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:18:06,032 INFO ]: Found error trace [2018-06-24 21:18:06,032 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:06,032 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:06,032 INFO ]: Analyzing trace with hash -1933177534, now seen corresponding path program 1 times [2018-06-24 21:18:06,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:06,032 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:06,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:06,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:06,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:06,060 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:06,203 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:06,203 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:18:06,203 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-24 21:18:06,203 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:18:06,203 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:18:06,203 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:18:06,204 INFO ]: Start difference. First operand 34 states and 60 transitions. Second operand 7 states. [2018-06-24 21:18:06,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:06,411 INFO ]: Finished difference Result 51 states and 103 transitions. [2018-06-24 21:18:06,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:18:06,414 INFO ]: Start accepts. Automaton has 7 states. Word has length 16 [2018-06-24 21:18:06,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:06,416 INFO ]: With dead ends: 51 [2018-06-24 21:18:06,416 INFO ]: Without dead ends: 51 [2018-06-24 21:18:06,416 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:18:06,416 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 21:18:06,443 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-06-24 21:18:06,443 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:18:06,444 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. [2018-06-24 21:18:06,444 INFO ]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 16 [2018-06-24 21:18:06,445 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:06,445 INFO ]: Abstraction has 34 states and 60 transitions. [2018-06-24 21:18:06,445 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:18:06,445 INFO ]: Start isEmpty. Operand 34 states and 60 transitions. [2018-06-24 21:18:06,446 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:18:06,446 INFO ]: Found error trace [2018-06-24 21:18:06,446 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:06,446 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:06,447 INFO ]: Analyzing trace with hash -1308794292, now seen corresponding path program 1 times [2018-06-24 21:18:06,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:06,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:06,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:06,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:06,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:06,460 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:06,602 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:06,602 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:06,602 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:18:06,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:06,640 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:06,643 INFO ]: Computing forward predicates... [2018-06-24 21:18:06,775 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:06,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:06,797 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 21:18:06,797 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:18:06,797 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:18:06,797 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:18:06,798 INFO ]: Start difference. First operand 34 states and 60 transitions. Second operand 8 states. [2018-06-24 21:18:07,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:07,334 INFO ]: Finished difference Result 70 states and 154 transitions. [2018-06-24 21:18:07,367 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:18:07,367 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-24 21:18:07,367 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:07,369 INFO ]: With dead ends: 70 [2018-06-24 21:18:07,369 INFO ]: Without dead ends: 70 [2018-06-24 21:18:07,369 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:18:07,369 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 21:18:07,390 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 37. [2018-06-24 21:18:07,390 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 21:18:07,391 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2018-06-24 21:18:07,391 INFO ]: Start accepts. Automaton has 37 states and 66 transitions. Word has length 17 [2018-06-24 21:18:07,392 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:07,392 INFO ]: Abstraction has 37 states and 66 transitions. [2018-06-24 21:18:07,392 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:18:07,392 INFO ]: Start isEmpty. Operand 37 states and 66 transitions. [2018-06-24 21:18:07,393 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:18:07,393 INFO ]: Found error trace [2018-06-24 21:18:07,393 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:07,393 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:07,393 INFO ]: Analyzing trace with hash -1819328469, now seen corresponding path program 1 times [2018-06-24 21:18:07,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:07,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:07,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:07,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:07,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:07,406 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:07,488 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:07,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:07,488 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:18:07,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:07,518 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:07,520 INFO ]: Computing forward predicates... [2018-06-24 21:18:07,555 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:18:07,585 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:07,585 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 21:18:07,585 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:18:07,585 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:18:07,585 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:18:07,585 INFO ]: Start difference. First operand 37 states and 66 transitions. Second operand 8 states. [2018-06-24 21:18:07,871 WARN ]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 21:18:08,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:08,259 INFO ]: Finished difference Result 73 states and 157 transitions. [2018-06-24 21:18:08,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:18:08,260 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-24 21:18:08,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:08,261 INFO ]: With dead ends: 73 [2018-06-24 21:18:08,262 INFO ]: Without dead ends: 73 [2018-06-24 21:18:08,262 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:18:08,262 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-24 21:18:08,269 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 29. [2018-06-24 21:18:08,270 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:18:08,270 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. [2018-06-24 21:18:08,270 INFO ]: Start accepts. Automaton has 29 states and 48 transitions. Word has length 17 [2018-06-24 21:18:08,270 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:08,270 INFO ]: Abstraction has 29 states and 48 transitions. [2018-06-24 21:18:08,271 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:18:08,271 INFO ]: Start isEmpty. Operand 29 states and 48 transitions. [2018-06-24 21:18:08,272 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:18:08,272 INFO ]: Found error trace [2018-06-24 21:18:08,272 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:08,272 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:08,272 INFO ]: Analyzing trace with hash -162569980, now seen corresponding path program 1 times [2018-06-24 21:18:08,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:08,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:08,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:08,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:08,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:08,286 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:08,382 INFO ]: Checked inductivity of 34 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:08,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:08,382 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:18:08,390 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:08,424 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:08,427 INFO ]: Computing forward predicates... [2018-06-24 21:18:08,585 INFO ]: Checked inductivity of 34 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:08,604 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:08,604 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 21:18:08,604 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:18:08,605 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:18:08,605 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:18:08,605 INFO ]: Start difference. First operand 29 states and 48 transitions. Second operand 10 states. [2018-06-24 21:18:08,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:08,811 INFO ]: Finished difference Result 58 states and 106 transitions. [2018-06-24 21:18:08,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:18:08,812 INFO ]: Start accepts. Automaton has 10 states. Word has length 26 [2018-06-24 21:18:08,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:08,813 INFO ]: With dead ends: 58 [2018-06-24 21:18:08,813 INFO ]: Without dead ends: 58 [2018-06-24 21:18:08,814 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:18:08,814 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 21:18:08,821 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 41. [2018-06-24 21:18:08,821 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 21:18:08,822 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 71 transitions. [2018-06-24 21:18:08,822 INFO ]: Start accepts. Automaton has 41 states and 71 transitions. Word has length 26 [2018-06-24 21:18:08,823 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:08,823 INFO ]: Abstraction has 41 states and 71 transitions. [2018-06-24 21:18:08,823 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:18:08,823 INFO ]: Start isEmpty. Operand 41 states and 71 transitions. [2018-06-24 21:18:08,824 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:18:08,824 INFO ]: Found error trace [2018-06-24 21:18:08,824 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:08,824 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:08,825 INFO ]: Analyzing trace with hash 2055187973, now seen corresponding path program 1 times [2018-06-24 21:18:08,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:08,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:08,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:08,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:08,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:08,840 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:08,939 INFO ]: Checked inductivity of 34 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:08,939 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:08,939 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:18:08,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:08,995 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:08,998 INFO ]: Computing forward predicates... [2018-06-24 21:18:09,027 INFO ]: Checked inductivity of 34 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:09,058 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:09,058 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 21:18:09,058 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:18:09,058 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:18:09,058 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:18:09,058 INFO ]: Start difference. First operand 41 states and 71 transitions. Second operand 9 states. [2018-06-24 21:18:09,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:09,389 INFO ]: Finished difference Result 64 states and 124 transitions. [2018-06-24 21:18:09,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:18:09,390 INFO ]: Start accepts. Automaton has 9 states. Word has length 26 [2018-06-24 21:18:09,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:09,390 INFO ]: With dead ends: 64 [2018-06-24 21:18:09,391 INFO ]: Without dead ends: 64 [2018-06-24 21:18:09,391 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:18:09,391 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-24 21:18:09,403 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 41. [2018-06-24 21:18:09,403 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 21:18:09,404 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 71 transitions. [2018-06-24 21:18:09,404 INFO ]: Start accepts. Automaton has 41 states and 71 transitions. Word has length 26 [2018-06-24 21:18:09,404 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:09,404 INFO ]: Abstraction has 41 states and 71 transitions. [2018-06-24 21:18:09,404 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:18:09,404 INFO ]: Start isEmpty. Operand 41 states and 71 transitions. [2018-06-24 21:18:09,405 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:18:09,405 INFO ]: Found error trace [2018-06-24 21:18:09,405 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:09,405 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:09,405 INFO ]: Analyzing trace with hash -2025865585, now seen corresponding path program 1 times [2018-06-24 21:18:09,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:09,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:09,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:09,406 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:09,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:09,417 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:09,494 INFO ]: Checked inductivity of 35 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:09,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:09,494 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:18:09,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:09,544 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:09,548 INFO ]: Computing forward predicates... [2018-06-24 21:18:09,634 INFO ]: Checked inductivity of 35 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:09,664 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:09,664 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 21:18:09,665 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:18:09,665 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:18:09,665 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:18:09,665 INFO ]: Start difference. First operand 41 states and 71 transitions. Second operand 11 states. [2018-06-24 21:18:09,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:09,981 INFO ]: Finished difference Result 79 states and 166 transitions. [2018-06-24 21:18:09,981 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:18:09,981 INFO ]: Start accepts. Automaton has 11 states. Word has length 27 [2018-06-24 21:18:09,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:09,982 INFO ]: With dead ends: 79 [2018-06-24 21:18:09,982 INFO ]: Without dead ends: 79 [2018-06-24 21:18:09,983 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:18:09,983 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-24 21:18:09,991 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 44. [2018-06-24 21:18:09,991 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 21:18:09,992 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 77 transitions. [2018-06-24 21:18:09,992 INFO ]: Start accepts. Automaton has 44 states and 77 transitions. Word has length 27 [2018-06-24 21:18:09,992 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:09,992 INFO ]: Abstraction has 44 states and 77 transitions. [2018-06-24 21:18:09,992 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:18:09,993 INFO ]: Start isEmpty. Operand 44 states and 77 transitions. [2018-06-24 21:18:09,994 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:18:09,994 INFO ]: Found error trace [2018-06-24 21:18:09,994 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:09,994 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:09,994 INFO ]: Analyzing trace with hash -1994845778, now seen corresponding path program 1 times [2018-06-24 21:18:09,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:09,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:09,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:09,995 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:09,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:10,005 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:10,072 INFO ]: Checked inductivity of 35 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:10,072 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:10,072 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:10,078 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:10,097 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:10,099 INFO ]: Computing forward predicates... [2018-06-24 21:18:10,125 INFO ]: Checked inductivity of 35 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:10,144 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:10,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 21:18:10,144 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:18:10,145 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:18:10,145 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:18:10,145 INFO ]: Start difference. First operand 44 states and 77 transitions. Second operand 10 states. [2018-06-24 21:18:10,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:10,438 INFO ]: Finished difference Result 82 states and 172 transitions. [2018-06-24 21:18:10,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:18:10,438 INFO ]: Start accepts. Automaton has 10 states. Word has length 27 [2018-06-24 21:18:10,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:10,439 INFO ]: With dead ends: 82 [2018-06-24 21:18:10,439 INFO ]: Without dead ends: 82 [2018-06-24 21:18:10,440 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:18:10,440 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-24 21:18:10,450 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 44. [2018-06-24 21:18:10,450 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 21:18:10,451 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 77 transitions. [2018-06-24 21:18:10,451 INFO ]: Start accepts. Automaton has 44 states and 77 transitions. Word has length 27 [2018-06-24 21:18:10,451 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:10,451 INFO ]: Abstraction has 44 states and 77 transitions. [2018-06-24 21:18:10,451 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:18:10,451 INFO ]: Start isEmpty. Operand 44 states and 77 transitions. [2018-06-24 21:18:10,452 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 21:18:10,452 INFO ]: Found error trace [2018-06-24 21:18:10,452 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:10,452 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:10,452 INFO ]: Analyzing trace with hash 341512804, now seen corresponding path program 2 times [2018-06-24 21:18:10,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:10,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:10,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:10,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:10,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:10,467 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:10,607 INFO ]: Checked inductivity of 37 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:10,607 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:10,607 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:18:10,614 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:18:10,639 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:18:10,639 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:10,642 INFO ]: Computing forward predicates... [2018-06-24 21:18:10,699 INFO ]: Checked inductivity of 37 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:10,718 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:10,718 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 21:18:10,719 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:18:10,719 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:18:10,719 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:18:10,719 INFO ]: Start difference. First operand 44 states and 77 transitions. Second operand 11 states. [2018-06-24 21:18:11,312 WARN ]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-24 21:18:12,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:12,113 INFO ]: Finished difference Result 115 states and 282 transitions. [2018-06-24 21:18:12,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:18:12,114 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-24 21:18:12,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:12,116 INFO ]: With dead ends: 115 [2018-06-24 21:18:12,116 INFO ]: Without dead ends: 115 [2018-06-24 21:18:12,116 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:18:12,116 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-24 21:18:12,134 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 62. [2018-06-24 21:18:12,134 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-24 21:18:12,135 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 115 transitions. [2018-06-24 21:18:12,135 INFO ]: Start accepts. Automaton has 62 states and 115 transitions. Word has length 28 [2018-06-24 21:18:12,135 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:12,135 INFO ]: Abstraction has 62 states and 115 transitions. [2018-06-24 21:18:12,135 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:18:12,135 INFO ]: Start isEmpty. Operand 62 states and 115 transitions. [2018-06-24 21:18:12,137 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 21:18:12,137 INFO ]: Found error trace [2018-06-24 21:18:12,137 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:12,137 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:12,137 INFO ]: Analyzing trace with hash 1303126821, now seen corresponding path program 2 times [2018-06-24 21:18:12,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:12,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:12,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:12,138 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:12,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:12,147 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:12,298 INFO ]: Checked inductivity of 37 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:12,299 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:12,299 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:12,304 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:18:12,323 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:18:12,323 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:12,325 INFO ]: Computing forward predicates... [2018-06-24 21:18:12,374 INFO ]: Checked inductivity of 37 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 21:18:12,399 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:12,399 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 21:18:12,399 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:18:12,399 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:18:12,399 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:18:12,399 INFO ]: Start difference. First operand 62 states and 115 transitions. Second operand 11 states. [2018-06-24 21:18:13,209 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:13,209 INFO ]: Finished difference Result 121 states and 309 transitions. [2018-06-24 21:18:13,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:18:13,209 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-24 21:18:13,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:13,210 INFO ]: With dead ends: 121 [2018-06-24 21:18:13,210 INFO ]: Without dead ends: 121 [2018-06-24 21:18:13,211 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:18:13,211 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-24 21:18:13,229 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 50. [2018-06-24 21:18:13,229 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 21:18:13,229 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2018-06-24 21:18:13,229 INFO ]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 28 [2018-06-24 21:18:13,230 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:13,230 INFO ]: Abstraction has 50 states and 85 transitions. [2018-06-24 21:18:13,230 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:18:13,230 INFO ]: Start isEmpty. Operand 50 states and 85 transitions. [2018-06-24 21:18:13,231 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 21:18:13,231 INFO ]: Found error trace [2018-06-24 21:18:13,231 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:13,231 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:13,231 INFO ]: Analyzing trace with hash 1500637095, now seen corresponding path program 3 times [2018-06-24 21:18:13,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:13,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:13,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:13,232 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:13,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:13,243 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:13,335 INFO ]: Checked inductivity of 78 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 21:18:13,335 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:13,335 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:13,341 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:18:13,371 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:18:13,371 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:13,374 INFO ]: Computing forward predicates... [2018-06-24 21:18:13,458 INFO ]: Checked inductivity of 78 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 21:18:13,479 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:13,479 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 21:18:13,479 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:18:13,479 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:18:13,479 INFO ]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:18:13,479 INFO ]: Start difference. First operand 50 states and 85 transitions. Second operand 13 states. [2018-06-24 21:18:13,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:13,837 INFO ]: Finished difference Result 103 states and 228 transitions. [2018-06-24 21:18:13,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:18:13,838 INFO ]: Start accepts. Automaton has 13 states. Word has length 38 [2018-06-24 21:18:13,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:13,839 INFO ]: With dead ends: 103 [2018-06-24 21:18:13,839 INFO ]: Without dead ends: 103 [2018-06-24 21:18:13,840 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:18:13,840 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-24 21:18:13,851 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 53. [2018-06-24 21:18:13,851 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 21:18:13,852 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 91 transitions. [2018-06-24 21:18:13,852 INFO ]: Start accepts. Automaton has 53 states and 91 transitions. Word has length 38 [2018-06-24 21:18:13,852 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:13,852 INFO ]: Abstraction has 53 states and 91 transitions. [2018-06-24 21:18:13,852 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:18:13,852 INFO ]: Start isEmpty. Operand 53 states and 91 transitions. [2018-06-24 21:18:13,854 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 21:18:13,854 INFO ]: Found error trace [2018-06-24 21:18:13,854 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:13,854 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:13,854 INFO ]: Analyzing trace with hash 1830402856, now seen corresponding path program 3 times [2018-06-24 21:18:13,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:13,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:13,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:13,855 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:13,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:13,868 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:14,086 INFO ]: Checked inductivity of 78 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 21:18:14,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:14,086 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:14,099 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:18:14,128 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:18:14,128 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:14,131 INFO ]: Computing forward predicates... [2018-06-24 21:18:14,165 INFO ]: Checked inductivity of 78 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 21:18:14,200 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:14,200 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 21:18:14,200 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:18:14,200 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:18:14,200 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:18:14,200 INFO ]: Start difference. First operand 53 states and 91 transitions. Second operand 12 states. [2018-06-24 21:18:14,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:14,473 INFO ]: Finished difference Result 106 states and 234 transitions. [2018-06-24 21:18:14,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:18:14,473 INFO ]: Start accepts. Automaton has 12 states. Word has length 38 [2018-06-24 21:18:14,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:14,475 INFO ]: With dead ends: 106 [2018-06-24 21:18:14,475 INFO ]: Without dead ends: 106 [2018-06-24 21:18:14,475 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:18:14,475 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-24 21:18:14,485 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 53. [2018-06-24 21:18:14,485 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 21:18:14,486 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 91 transitions. [2018-06-24 21:18:14,486 INFO ]: Start accepts. Automaton has 53 states and 91 transitions. Word has length 38 [2018-06-24 21:18:14,486 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:14,486 INFO ]: Abstraction has 53 states and 91 transitions. [2018-06-24 21:18:14,486 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:18:14,486 INFO ]: Start isEmpty. Operand 53 states and 91 transitions. [2018-06-24 21:18:14,487 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 21:18:14,487 INFO ]: Found error trace [2018-06-24 21:18:14,487 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:14,487 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:14,488 INFO ]: Analyzing trace with hash 484658354, now seen corresponding path program 4 times [2018-06-24 21:18:14,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:14,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:14,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:14,488 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:14,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:14,516 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:14,744 INFO ]: Checked inductivity of 81 backedges. 14 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 21:18:14,744 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:14,744 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:18:14,750 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:18:14,782 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:18:14,782 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:14,785 INFO ]: Computing forward predicates... [2018-06-24 21:18:14,843 INFO ]: Checked inductivity of 81 backedges. 14 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 21:18:14,863 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:14,863 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 21:18:14,863 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:18:14,863 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:18:14,863 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:18:14,863 INFO ]: Start difference. First operand 53 states and 91 transitions. Second operand 13 states. [2018-06-24 21:18:16,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:16,436 INFO ]: Finished difference Result 151 states and 416 transitions. [2018-06-24 21:18:16,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:18:16,437 INFO ]: Start accepts. Automaton has 13 states. Word has length 39 [2018-06-24 21:18:16,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:16,439 INFO ]: With dead ends: 151 [2018-06-24 21:18:16,439 INFO ]: Without dead ends: 151 [2018-06-24 21:18:16,440 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:18:16,440 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-24 21:18:16,469 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 74. [2018-06-24 21:18:16,469 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 21:18:16,470 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 135 transitions. [2018-06-24 21:18:16,470 INFO ]: Start accepts. Automaton has 74 states and 135 transitions. Word has length 39 [2018-06-24 21:18:16,470 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:16,470 INFO ]: Abstraction has 74 states and 135 transitions. [2018-06-24 21:18:16,470 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:18:16,470 INFO ]: Start isEmpty. Operand 74 states and 135 transitions. [2018-06-24 21:18:16,474 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 21:18:16,474 INFO ]: Found error trace [2018-06-24 21:18:16,474 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:16,474 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:16,474 INFO ]: Analyzing trace with hash 2117462353, now seen corresponding path program 4 times [2018-06-24 21:18:16,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:16,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:16,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:16,475 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:16,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:16,489 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:16,727 INFO ]: Checked inductivity of 81 backedges. 14 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 21:18:16,727 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:16,727 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:18:16,732 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:18:16,761 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:18:16,761 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:16,763 INFO ]: Computing forward predicates... [2018-06-24 21:18:16,844 INFO ]: Checked inductivity of 81 backedges. 14 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 21:18:16,868 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:16,868 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 21:18:16,868 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:18:16,868 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:18:16,868 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:18:16,868 INFO ]: Start difference. First operand 74 states and 135 transitions. Second operand 13 states. [2018-06-24 21:18:17,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:17,864 INFO ]: Finished difference Result 157 states and 449 transitions. [2018-06-24 21:18:17,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:18:17,865 INFO ]: Start accepts. Automaton has 13 states. Word has length 39 [2018-06-24 21:18:17,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:17,867 INFO ]: With dead ends: 157 [2018-06-24 21:18:17,867 INFO ]: Without dead ends: 157 [2018-06-24 21:18:17,868 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:18:17,868 INFO ]: Start minimizeSevpa. Operand 157 states. [2018-06-24 21:18:17,894 INFO ]: Finished minimizeSevpa. Reduced states from 157 to 59. [2018-06-24 21:18:17,894 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-24 21:18:17,895 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 99 transitions. [2018-06-24 21:18:17,895 INFO ]: Start accepts. Automaton has 59 states and 99 transitions. Word has length 39 [2018-06-24 21:18:17,895 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:17,895 INFO ]: Abstraction has 59 states and 99 transitions. [2018-06-24 21:18:17,895 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:18:17,895 INFO ]: Start isEmpty. Operand 59 states and 99 transitions. [2018-06-24 21:18:17,896 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-24 21:18:17,896 INFO ]: Found error trace [2018-06-24 21:18:17,896 INFO ]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:17,896 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:17,896 INFO ]: Analyzing trace with hash -553480331, now seen corresponding path program 5 times [2018-06-24 21:18:17,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:17,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:17,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:17,897 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:17,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:17,912 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:18,180 INFO ]: Checked inductivity of 138 backedges. 64 proven. 23 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:18:18,181 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:18,181 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:18:18,188 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:18:18,229 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 21:18:18,229 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:18,232 INFO ]: Computing forward predicates... [2018-06-24 21:18:18,293 INFO ]: Checked inductivity of 138 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:18:18,312 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:18,312 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 21:18:18,312 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:18:18,312 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:18:18,312 INFO ]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:18:18,313 INFO ]: Start difference. First operand 59 states and 99 transitions. Second operand 15 states. [2018-06-24 21:18:19,011 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:19,011 INFO ]: Finished difference Result 127 states and 296 transitions. [2018-06-24 21:18:19,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 21:18:19,011 INFO ]: Start accepts. Automaton has 15 states. Word has length 49 [2018-06-24 21:18:19,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:19,012 INFO ]: With dead ends: 127 [2018-06-24 21:18:19,012 INFO ]: Without dead ends: 127 [2018-06-24 21:18:19,013 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:18:19,013 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-24 21:18:19,025 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 62. [2018-06-24 21:18:19,025 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-24 21:18:19,026 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 105 transitions. [2018-06-24 21:18:19,026 INFO ]: Start accepts. Automaton has 62 states and 105 transitions. Word has length 49 [2018-06-24 21:18:19,026 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:19,026 INFO ]: Abstraction has 62 states and 105 transitions. [2018-06-24 21:18:19,026 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:18:19,026 INFO ]: Start isEmpty. Operand 62 states and 105 transitions. [2018-06-24 21:18:19,028 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-24 21:18:19,028 INFO ]: Found error trace [2018-06-24 21:18:19,028 INFO ]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:19,028 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:19,028 INFO ]: Analyzing trace with hash 416100692, now seen corresponding path program 5 times [2018-06-24 21:18:19,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:19,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:19,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:19,029 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:19,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:19,043 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:19,585 INFO ]: Checked inductivity of 138 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:18:19,585 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:19,585 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:18:19,599 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:18:19,650 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 21:18:19,650 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:19,653 INFO ]: Computing forward predicates... [2018-06-24 21:18:19,693 INFO ]: Checked inductivity of 138 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:18:19,725 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:19,725 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 21:18:19,725 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:18:19,725 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:18:19,725 INFO ]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:18:19,725 INFO ]: Start difference. First operand 62 states and 105 transitions. Second operand 14 states. [2018-06-24 21:18:20,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:20,194 INFO ]: Finished difference Result 130 states and 302 transitions. [2018-06-24 21:18:20,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 21:18:20,194 INFO ]: Start accepts. Automaton has 14 states. Word has length 49 [2018-06-24 21:18:20,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:20,195 INFO ]: With dead ends: 130 [2018-06-24 21:18:20,195 INFO ]: Without dead ends: 130 [2018-06-24 21:18:20,196 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:18:20,196 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-24 21:18:20,208 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 62. [2018-06-24 21:18:20,208 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-24 21:18:20,209 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 105 transitions. [2018-06-24 21:18:20,209 INFO ]: Start accepts. Automaton has 62 states and 105 transitions. Word has length 49 [2018-06-24 21:18:20,209 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:20,209 INFO ]: Abstraction has 62 states and 105 transitions. [2018-06-24 21:18:20,209 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:18:20,209 INFO ]: Start isEmpty. Operand 62 states and 105 transitions. [2018-06-24 21:18:20,211 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-24 21:18:20,211 INFO ]: Found error trace [2018-06-24 21:18:20,211 INFO ]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:20,211 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:20,211 INFO ]: Analyzing trace with hash -1512954486, now seen corresponding path program 6 times [2018-06-24 21:18:20,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:20,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:20,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:20,212 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:20,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:20,229 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:21,033 INFO ]: Checked inductivity of 142 backedges. 19 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:18:21,033 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:21,033 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:18:21,039 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:18:21,078 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 21:18:21,078 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:21,081 INFO ]: Computing forward predicates... [2018-06-24 21:18:21,178 INFO ]: Checked inductivity of 142 backedges. 19 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:18:21,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:21,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 21:18:21,198 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:18:21,198 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:18:21,198 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:18:21,198 INFO ]: Start difference. First operand 62 states and 105 transitions. Second operand 15 states. [2018-06-24 21:18:22,613 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-24 21:18:23,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:23,718 INFO ]: Finished difference Result 187 states and 574 transitions. [2018-06-24 21:18:23,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 21:18:23,719 INFO ]: Start accepts. Automaton has 15 states. Word has length 50 [2018-06-24 21:18:23,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:23,722 INFO ]: With dead ends: 187 [2018-06-24 21:18:23,722 INFO ]: Without dead ends: 187 [2018-06-24 21:18:23,722 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=368, Invalid=2182, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 21:18:23,723 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-24 21:18:23,768 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 86. [2018-06-24 21:18:23,768 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-24 21:18:23,770 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 155 transitions. [2018-06-24 21:18:23,770 INFO ]: Start accepts. Automaton has 86 states and 155 transitions. Word has length 50 [2018-06-24 21:18:23,770 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:23,770 INFO ]: Abstraction has 86 states and 155 transitions. [2018-06-24 21:18:23,770 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:18:23,770 INFO ]: Start isEmpty. Operand 86 states and 155 transitions. [2018-06-24 21:18:23,771 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-24 21:18:23,771 INFO ]: Found error trace [2018-06-24 21:18:23,771 INFO ]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:23,772 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:23,772 INFO ]: Analyzing trace with hash -1520713845, now seen corresponding path program 6 times [2018-06-24 21:18:23,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:23,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:23,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:23,772 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:23,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:23,794 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:24,490 INFO ]: Checked inductivity of 142 backedges. 19 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:18:24,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:24,490 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:24,495 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:18:24,534 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 21:18:24,534 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:24,537 INFO ]: Computing forward predicates... [2018-06-24 21:18:24,624 INFO ]: Checked inductivity of 142 backedges. 19 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:18:24,658 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:24,658 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 21:18:24,659 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:18:24,659 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:18:24,659 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:18:24,659 INFO ]: Start difference. First operand 86 states and 155 transitions. Second operand 15 states. [2018-06-24 21:18:26,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:26,271 INFO ]: Finished difference Result 193 states and 613 transitions. [2018-06-24 21:18:26,271 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 21:18:26,271 INFO ]: Start accepts. Automaton has 15 states. Word has length 50 [2018-06-24 21:18:26,271 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:26,274 INFO ]: With dead ends: 193 [2018-06-24 21:18:26,274 INFO ]: Without dead ends: 193 [2018-06-24 21:18:26,275 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 50 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=368, Invalid=2182, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 21:18:26,275 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-24 21:18:26,326 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 68. [2018-06-24 21:18:26,326 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-24 21:18:26,326 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 113 transitions. [2018-06-24 21:18:26,327 INFO ]: Start accepts. Automaton has 68 states and 113 transitions. Word has length 50 [2018-06-24 21:18:26,327 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:26,327 INFO ]: Abstraction has 68 states and 113 transitions. [2018-06-24 21:18:26,327 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:18:26,327 INFO ]: Start isEmpty. Operand 68 states and 113 transitions. [2018-06-24 21:18:26,328 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-24 21:18:26,328 INFO ]: Found error trace [2018-06-24 21:18:26,328 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:26,328 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:26,328 INFO ]: Analyzing trace with hash 18837837, now seen corresponding path program 7 times [2018-06-24 21:18:26,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:26,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:26,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:26,329 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:26,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:26,343 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:26,534 INFO ]: Checked inductivity of 215 backedges. 104 proven. 32 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 21:18:26,534 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:26,534 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:26,540 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:26,590 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:26,593 INFO ]: Computing forward predicates... [2018-06-24 21:18:26,623 INFO ]: Checked inductivity of 215 backedges. 122 proven. 14 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 21:18:26,643 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:26,643 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 21:18:26,643 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:18:26,643 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:18:26,643 INFO ]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:18:26,643 INFO ]: Start difference. First operand 68 states and 113 transitions. Second operand 17 states. [2018-06-24 21:18:27,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:27,023 INFO ]: Finished difference Result 151 states and 370 transitions. [2018-06-24 21:18:27,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 21:18:27,024 INFO ]: Start accepts. Automaton has 17 states. Word has length 60 [2018-06-24 21:18:27,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:27,025 INFO ]: With dead ends: 151 [2018-06-24 21:18:27,025 INFO ]: Without dead ends: 151 [2018-06-24 21:18:27,025 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=1486, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 21:18:27,025 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-24 21:18:27,042 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 71. [2018-06-24 21:18:27,042 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-24 21:18:27,042 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 119 transitions. [2018-06-24 21:18:27,042 INFO ]: Start accepts. Automaton has 71 states and 119 transitions. Word has length 60 [2018-06-24 21:18:27,047 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:27,047 INFO ]: Abstraction has 71 states and 119 transitions. [2018-06-24 21:18:27,047 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:18:27,047 INFO ]: Start isEmpty. Operand 71 states and 119 transitions. [2018-06-24 21:18:27,048 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-24 21:18:27,048 INFO ]: Found error trace [2018-06-24 21:18:27,048 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:27,048 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:27,048 INFO ]: Analyzing trace with hash 299187726, now seen corresponding path program 7 times [2018-06-24 21:18:27,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:27,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:27,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:27,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:27,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:27,068 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:27,612 INFO ]: Checked inductivity of 215 backedges. 122 proven. 14 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 21:18:27,612 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:27,612 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:27,618 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:27,660 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:27,662 INFO ]: Computing forward predicates... [2018-06-24 21:18:27,697 INFO ]: Checked inductivity of 215 backedges. 122 proven. 14 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 21:18:27,716 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:27,716 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-24 21:18:27,716 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:18:27,716 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:18:27,717 INFO ]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:18:27,717 INFO ]: Start difference. First operand 71 states and 119 transitions. Second operand 16 states. [2018-06-24 21:18:28,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:28,159 INFO ]: Finished difference Result 154 states and 376 transitions. [2018-06-24 21:18:28,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 21:18:28,160 INFO ]: Start accepts. Automaton has 16 states. Word has length 60 [2018-06-24 21:18:28,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:28,161 INFO ]: With dead ends: 154 [2018-06-24 21:18:28,161 INFO ]: Without dead ends: 154 [2018-06-24 21:18:28,162 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 21:18:28,162 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-24 21:18:28,178 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 71. [2018-06-24 21:18:28,178 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-24 21:18:28,179 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 119 transitions. [2018-06-24 21:18:28,179 INFO ]: Start accepts. Automaton has 71 states and 119 transitions. Word has length 60 [2018-06-24 21:18:28,179 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:28,179 INFO ]: Abstraction has 71 states and 119 transitions. [2018-06-24 21:18:28,179 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:18:28,179 INFO ]: Start isEmpty. Operand 71 states and 119 transitions. [2018-06-24 21:18:28,181 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-24 21:18:28,181 INFO ]: Found error trace [2018-06-24 21:18:28,181 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:28,181 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:28,182 INFO ]: Analyzing trace with hash -345461736, now seen corresponding path program 8 times [2018-06-24 21:18:28,182 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:28,182 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:28,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:28,182 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:28,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:28,200 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:29,095 INFO ]: Checked inductivity of 220 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 21:18:29,095 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:29,095 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:29,101 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:18:29,145 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:18:29,145 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:29,149 INFO ]: Computing forward predicates... [2018-06-24 21:18:29,728 INFO ]: Checked inductivity of 220 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 21:18:29,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:29,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 21:18:29,747 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:18:29,747 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:18:29,748 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:18:29,748 INFO ]: Start difference. First operand 71 states and 119 transitions. Second operand 17 states. [2018-06-24 21:18:30,611 WARN ]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-24 21:18:32,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:32,204 INFO ]: Finished difference Result 223 states and 756 transitions. [2018-06-24 21:18:32,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-24 21:18:32,204 INFO ]: Start accepts. Automaton has 17 states. Word has length 61 [2018-06-24 21:18:32,204 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:32,206 INFO ]: With dead ends: 223 [2018-06-24 21:18:32,206 INFO ]: Without dead ends: 223 [2018-06-24 21:18:32,207 INFO ]: 0 DeclaredPredicates, 132 GetRequests, 61 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=499, Invalid=3161, Unknown=0, NotChecked=0, Total=3660 [2018-06-24 21:18:32,207 INFO ]: Start minimizeSevpa. Operand 223 states. [2018-06-24 21:18:32,288 INFO ]: Finished minimizeSevpa. Reduced states from 223 to 98. [2018-06-24 21:18:32,288 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-24 21:18:32,289 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 175 transitions. [2018-06-24 21:18:32,289 INFO ]: Start accepts. Automaton has 98 states and 175 transitions. Word has length 61 [2018-06-24 21:18:32,289 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:32,289 INFO ]: Abstraction has 98 states and 175 transitions. [2018-06-24 21:18:32,289 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:18:32,289 INFO ]: Start isEmpty. Operand 98 states and 175 transitions. [2018-06-24 21:18:32,291 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-24 21:18:32,291 INFO ]: Found error trace [2018-06-24 21:18:32,291 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:32,291 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:32,291 INFO ]: Analyzing trace with hash -244549769, now seen corresponding path program 8 times [2018-06-24 21:18:32,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:32,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:32,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:32,292 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:32,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:32,314 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:32,729 INFO ]: Checked inductivity of 220 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 21:18:32,729 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:32,729 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:32,735 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:18:32,779 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:18:32,779 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:32,782 INFO ]: Computing forward predicates... [2018-06-24 21:18:33,031 INFO ]: Checked inductivity of 220 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 21:18:33,050 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:33,050 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-24 21:18:33,050 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:18:33,050 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:18:33,051 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:18:33,051 INFO ]: Start difference. First operand 98 states and 175 transitions. Second operand 17 states. [2018-06-24 21:18:33,444 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-24 21:18:34,096 WARN ]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-24 21:18:35,584 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:35,584 INFO ]: Finished difference Result 229 states and 801 transitions. [2018-06-24 21:18:35,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-24 21:18:35,585 INFO ]: Start accepts. Automaton has 17 states. Word has length 61 [2018-06-24 21:18:35,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:35,587 INFO ]: With dead ends: 229 [2018-06-24 21:18:35,587 INFO ]: Without dead ends: 229 [2018-06-24 21:18:35,587 INFO ]: 0 DeclaredPredicates, 132 GetRequests, 62 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=499, Invalid=3161, Unknown=0, NotChecked=0, Total=3660 [2018-06-24 21:18:35,587 INFO ]: Start minimizeSevpa. Operand 229 states. [2018-06-24 21:18:35,647 INFO ]: Finished minimizeSevpa. Reduced states from 229 to 77. [2018-06-24 21:18:35,647 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-24 21:18:35,648 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 127 transitions. [2018-06-24 21:18:35,648 INFO ]: Start accepts. Automaton has 77 states and 127 transitions. Word has length 61 [2018-06-24 21:18:35,648 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:35,648 INFO ]: Abstraction has 77 states and 127 transitions. [2018-06-24 21:18:35,648 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:18:35,648 INFO ]: Start isEmpty. Operand 77 states and 127 transitions. [2018-06-24 21:18:35,649 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-24 21:18:35,649 INFO ]: Found error trace [2018-06-24 21:18:35,650 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:35,650 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:35,650 INFO ]: Analyzing trace with hash -645819045, now seen corresponding path program 9 times [2018-06-24 21:18:35,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:35,650 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:35,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:35,650 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:35,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:35,667 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:35,850 INFO ]: Checked inductivity of 309 backedges. 154 proven. 42 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-24 21:18:35,851 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:35,851 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:35,858 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:18:35,929 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 21:18:35,929 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:35,931 INFO ]: Computing forward predicates... [2018-06-24 21:18:36,215 INFO ]: Checked inductivity of 309 backedges. 176 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-24 21:18:36,245 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:36,245 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 21:18:36,245 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:18:36,245 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:18:36,246 INFO ]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:18:36,246 INFO ]: Start difference. First operand 77 states and 127 transitions. Second operand 19 states. [2018-06-24 21:18:37,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:37,408 INFO ]: Finished difference Result 175 states and 450 transitions. [2018-06-24 21:18:37,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 21:18:37,408 INFO ]: Start accepts. Automaton has 19 states. Word has length 71 [2018-06-24 21:18:37,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:37,410 INFO ]: With dead ends: 175 [2018-06-24 21:18:37,410 INFO ]: Without dead ends: 175 [2018-06-24 21:18:37,410 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=422, Invalid=2028, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 21:18:37,410 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-24 21:18:37,432 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 80. [2018-06-24 21:18:37,432 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-24 21:18:37,433 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 133 transitions. [2018-06-24 21:18:37,433 INFO ]: Start accepts. Automaton has 80 states and 133 transitions. Word has length 71 [2018-06-24 21:18:37,433 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:37,433 INFO ]: Abstraction has 80 states and 133 transitions. [2018-06-24 21:18:37,433 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:18:37,433 INFO ]: Start isEmpty. Operand 80 states and 133 transitions. [2018-06-24 21:18:37,434 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-24 21:18:37,434 INFO ]: Found error trace [2018-06-24 21:18:37,435 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:37,435 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:37,435 INFO ]: Analyzing trace with hash 308409850, now seen corresponding path program 9 times [2018-06-24 21:18:37,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:37,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:37,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:37,435 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:37,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:37,452 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:37,659 INFO ]: Checked inductivity of 309 backedges. 176 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-24 21:18:37,659 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:37,659 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:37,664 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:18:37,855 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-24 21:18:37,855 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:37,860 INFO ]: Computing forward predicates... [2018-06-24 21:18:37,915 INFO ]: Checked inductivity of 309 backedges. 176 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-24 21:18:37,937 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:37,937 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-24 21:18:37,938 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:18:37,938 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:18:37,938 INFO ]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:18:37,938 INFO ]: Start difference. First operand 80 states and 133 transitions. Second operand 18 states. [2018-06-24 21:18:38,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:38,371 INFO ]: Finished difference Result 178 states and 456 transitions. [2018-06-24 21:18:38,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 21:18:38,372 INFO ]: Start accepts. Automaton has 18 states. Word has length 71 [2018-06-24 21:18:38,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:38,373 INFO ]: With dead ends: 178 [2018-06-24 21:18:38,373 INFO ]: Without dead ends: 178 [2018-06-24 21:18:38,374 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=1946, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 21:18:38,374 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-24 21:18:38,390 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 80. [2018-06-24 21:18:38,390 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-24 21:18:38,391 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 133 transitions. [2018-06-24 21:18:38,391 INFO ]: Start accepts. Automaton has 80 states and 133 transitions. Word has length 71 [2018-06-24 21:18:38,391 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:38,391 INFO ]: Abstraction has 80 states and 133 transitions. [2018-06-24 21:18:38,391 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:18:38,391 INFO ]: Start isEmpty. Operand 80 states and 133 transitions. [2018-06-24 21:18:38,392 INFO ]: Finished isEmpty. Found accepting run of length 73 [2018-06-24 21:18:38,392 INFO ]: Found error trace [2018-06-24 21:18:38,392 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:38,392 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:38,392 INFO ]: Analyzing trace with hash 820919728, now seen corresponding path program 10 times [2018-06-24 21:18:38,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:38,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:38,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:38,393 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:38,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:38,413 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:39,117 INFO ]: Checked inductivity of 315 backedges. 29 proven. 173 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-24 21:18:39,118 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:39,118 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:39,123 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:18:39,180 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:18:39,180 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:39,185 INFO ]: Computing forward predicates... [2018-06-24 21:18:39,317 INFO ]: Checked inductivity of 315 backedges. 29 proven. 173 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-24 21:18:39,336 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:39,336 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-24 21:18:39,336 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:18:39,336 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:18:39,336 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:18:39,336 INFO ]: Start difference. First operand 80 states and 133 transitions. Second operand 19 states. [2018-06-24 21:18:41,278 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-24 21:18:41,910 WARN ]: Spent 245.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-06-24 21:18:44,004 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:44,004 INFO ]: Finished difference Result 259 states and 962 transitions. [2018-06-24 21:18:44,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-24 21:18:44,005 INFO ]: Start accepts. Automaton has 19 states. Word has length 72 [2018-06-24 21:18:44,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:44,009 INFO ]: With dead ends: 259 [2018-06-24 21:18:44,009 INFO ]: Without dead ends: 259 [2018-06-24 21:18:44,011 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 73 SyntacticMatches, 14 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=649, Invalid=4321, Unknown=0, NotChecked=0, Total=4970 [2018-06-24 21:18:44,011 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-24 21:18:44,164 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 110. [2018-06-24 21:18:44,165 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-24 21:18:44,166 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 195 transitions. [2018-06-24 21:18:44,166 INFO ]: Start accepts. Automaton has 110 states and 195 transitions. Word has length 72 [2018-06-24 21:18:44,167 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:44,167 INFO ]: Abstraction has 110 states and 195 transitions. [2018-06-24 21:18:44,167 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:18:44,167 INFO ]: Start isEmpty. Operand 110 states and 195 transitions. [2018-06-24 21:18:44,168 INFO ]: Finished isEmpty. Found accepting run of length 73 [2018-06-24 21:18:44,168 INFO ]: Found error trace [2018-06-24 21:18:44,169 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:44,169 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:44,169 INFO ]: Analyzing trace with hash 337244401, now seen corresponding path program 10 times [2018-06-24 21:18:44,169 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:44,169 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:44,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:44,169 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:44,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:44,186 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:45,835 INFO ]: Checked inductivity of 315 backedges. 29 proven. 173 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-24 21:18:45,835 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:45,835 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:45,841 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:18:45,887 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:18:45,887 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:45,890 INFO ]: Computing forward predicates... [2018-06-24 21:18:46,051 INFO ]: Checked inductivity of 315 backedges. 29 proven. 173 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-24 21:18:46,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:46,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-24 21:18:46,070 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:18:46,070 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:18:46,070 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:18:46,070 INFO ]: Start difference. First operand 110 states and 195 transitions. Second operand 19 states. [2018-06-24 21:18:49,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:49,036 INFO ]: Finished difference Result 265 states and 1013 transitions. [2018-06-24 21:18:49,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-06-24 21:18:49,036 INFO ]: Start accepts. Automaton has 19 states. Word has length 72 [2018-06-24 21:18:49,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:49,039 INFO ]: With dead ends: 265 [2018-06-24 21:18:49,039 INFO ]: Without dead ends: 265 [2018-06-24 21:18:49,040 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 74 SyntacticMatches, 13 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=649, Invalid=4321, Unknown=0, NotChecked=0, Total=4970 [2018-06-24 21:18:49,041 INFO ]: Start minimizeSevpa. Operand 265 states. [2018-06-24 21:18:49,157 INFO ]: Finished minimizeSevpa. Reduced states from 265 to 86. [2018-06-24 21:18:49,157 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-24 21:18:49,158 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 141 transitions. [2018-06-24 21:18:49,158 INFO ]: Start accepts. Automaton has 86 states and 141 transitions. Word has length 72 [2018-06-24 21:18:49,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:49,158 INFO ]: Abstraction has 86 states and 141 transitions. [2018-06-24 21:18:49,158 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:18:49,158 INFO ]: Start isEmpty. Operand 86 states and 141 transitions. [2018-06-24 21:18:49,160 INFO ]: Finished isEmpty. Found accepting run of length 83 [2018-06-24 21:18:49,160 INFO ]: Found error trace [2018-06-24 21:18:49,160 INFO ]: trace histogram [15, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:49,160 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:49,160 INFO ]: Analyzing trace with hash 2006630387, now seen corresponding path program 11 times [2018-06-24 21:18:49,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:49,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:49,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:49,160 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:49,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:49,180 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:49,869 INFO ]: Checked inductivity of 420 backedges. 214 proven. 53 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-24 21:18:49,869 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:49,869 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:49,874 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:18:49,938 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-06-24 21:18:49,938 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:49,942 INFO ]: Computing forward predicates... [2018-06-24 21:18:49,990 INFO ]: Checked inductivity of 420 backedges. 240 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-24 21:18:50,009 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:50,009 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 21:18:50,010 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:18:50,010 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:18:50,010 INFO ]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:18:50,010 INFO ]: Start difference. First operand 86 states and 141 transitions. Second operand 21 states. [2018-06-24 21:18:50,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:50,623 INFO ]: Finished difference Result 199 states and 536 transitions. [2018-06-24 21:18:50,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-24 21:18:50,623 INFO ]: Start accepts. Automaton has 21 states. Word has length 82 [2018-06-24 21:18:50,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:50,625 INFO ]: With dead ends: 199 [2018-06-24 21:18:50,625 INFO ]: Without dead ends: 199 [2018-06-24 21:18:50,626 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=538, Invalid=2654, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 21:18:50,626 INFO ]: Start minimizeSevpa. Operand 199 states. [2018-06-24 21:18:50,647 INFO ]: Finished minimizeSevpa. Reduced states from 199 to 89. [2018-06-24 21:18:50,647 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-24 21:18:50,648 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 147 transitions. [2018-06-24 21:18:50,648 INFO ]: Start accepts. Automaton has 89 states and 147 transitions. Word has length 82 [2018-06-24 21:18:50,648 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:50,648 INFO ]: Abstraction has 89 states and 147 transitions. [2018-06-24 21:18:50,648 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:18:50,649 INFO ]: Start isEmpty. Operand 89 states and 147 transitions. [2018-06-24 21:18:50,650 INFO ]: Finished isEmpty. Found accepting run of length 83 [2018-06-24 21:18:50,650 INFO ]: Found error trace [2018-06-24 21:18:50,650 INFO ]: trace histogram [15, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:50,650 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:50,650 INFO ]: Analyzing trace with hash 1477711348, now seen corresponding path program 11 times [2018-06-24 21:18:50,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:50,650 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:50,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:50,651 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:50,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:50,673 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:51,031 INFO ]: Checked inductivity of 420 backedges. 240 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-24 21:18:51,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:51,031 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:51,040 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:18:51,107 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-06-24 21:18:51,107 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:51,111 INFO ]: Computing forward predicates... [2018-06-24 21:18:51,154 INFO ]: Checked inductivity of 420 backedges. 240 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-24 21:18:51,172 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:51,172 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-24 21:18:51,173 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:18:51,173 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:18:51,173 INFO ]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:18:51,173 INFO ]: Start difference. First operand 89 states and 147 transitions. Second operand 20 states. [2018-06-24 21:18:51,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:51,740 INFO ]: Finished difference Result 202 states and 542 transitions. [2018-06-24 21:18:51,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-24 21:18:51,740 INFO ]: Start accepts. Automaton has 20 states. Word has length 82 [2018-06-24 21:18:51,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:51,741 INFO ]: With dead ends: 202 [2018-06-24 21:18:51,741 INFO ]: Without dead ends: 202 [2018-06-24 21:18:51,742 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=520, Invalid=2560, Unknown=0, NotChecked=0, Total=3080 [2018-06-24 21:18:51,742 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-24 21:18:51,762 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 89. [2018-06-24 21:18:51,762 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-24 21:18:51,762 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 147 transitions. [2018-06-24 21:18:51,762 INFO ]: Start accepts. Automaton has 89 states and 147 transitions. Word has length 82 [2018-06-24 21:18:51,763 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:51,763 INFO ]: Abstraction has 89 states and 147 transitions. [2018-06-24 21:18:51,763 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:18:51,763 INFO ]: Start isEmpty. Operand 89 states and 147 transitions. [2018-06-24 21:18:51,764 INFO ]: Finished isEmpty. Found accepting run of length 84 [2018-06-24 21:18:51,764 INFO ]: Found error trace [2018-06-24 21:18:51,764 INFO ]: trace histogram [15, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:51,764 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:51,764 INFO ]: Analyzing trace with hash -1489960834, now seen corresponding path program 12 times [2018-06-24 21:18:51,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:51,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:51,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:51,766 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:51,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:51,792 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:52,102 INFO ]: Checked inductivity of 427 backedges. 34 proven. 240 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-24 21:18:52,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:52,102 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:52,108 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:18:52,176 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-24 21:18:52,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:52,181 INFO ]: Computing forward predicates... [2018-06-24 21:18:52,566 INFO ]: Checked inductivity of 427 backedges. 34 proven. 240 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-24 21:18:52,599 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:52,599 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-24 21:18:52,599 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:18:52,599 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:18:52,600 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:18:52,600 INFO ]: Start difference. First operand 89 states and 147 transitions. Second operand 21 states. [2018-06-24 21:18:56,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:56,561 INFO ]: Finished difference Result 295 states and 1192 transitions. [2018-06-24 21:18:56,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-24 21:18:56,561 INFO ]: Start accepts. Automaton has 21 states. Word has length 83 [2018-06-24 21:18:56,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:56,564 INFO ]: With dead ends: 295 [2018-06-24 21:18:56,564 INFO ]: Without dead ends: 295 [2018-06-24 21:18:56,565 INFO ]: 0 DeclaredPredicates, 180 GetRequests, 85 SyntacticMatches, 16 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=818, Invalid=5662, Unknown=0, NotChecked=0, Total=6480 [2018-06-24 21:18:56,565 INFO ]: Start minimizeSevpa. Operand 295 states. [2018-06-24 21:18:56,728 INFO ]: Finished minimizeSevpa. Reduced states from 295 to 122. [2018-06-24 21:18:56,728 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-24 21:18:56,728 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2018-06-24 21:18:56,729 INFO ]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 83 [2018-06-24 21:18:56,729 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:56,729 INFO ]: Abstraction has 122 states and 215 transitions. [2018-06-24 21:18:56,729 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:18:56,729 INFO ]: Start isEmpty. Operand 122 states and 215 transitions. [2018-06-24 21:18:56,730 INFO ]: Finished isEmpty. Found accepting run of length 84 [2018-06-24 21:18:56,730 INFO ]: Found error trace [2018-06-24 21:18:56,730 INFO ]: trace histogram [15, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:56,730 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:56,730 INFO ]: Analyzing trace with hash -706581859, now seen corresponding path program 12 times [2018-06-24 21:18:56,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:56,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:56,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:56,731 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:56,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:56,755 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 21:18:57,690 WARN ]: Verification canceled [2018-06-24 21:18:57,692 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:18:57,693 WARN ]: Timeout [2018-06-24 21:18:57,693 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:18:57 BasicIcfg [2018-06-24 21:18:57,693 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:18:57,694 INFO ]: Toolchain (without parser) took 54876.26 ms. Allocated memory was 309.3 MB in the beginning and 843.6 MB in the end (delta: 534.2 MB). Free memory was 261.7 MB in the beginning and 381.9 MB in the end (delta: -120.2 MB). Peak memory consumption was 414.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:57,695 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:18:57,695 INFO ]: ChcToBoogie took 57.12 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:57,696 INFO ]: Boogie Preprocessor took 47.38 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:57,696 INFO ]: RCFGBuilder took 350.82 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 247.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:57,696 INFO ]: BlockEncodingV2 took 155.31 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 241.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:57,696 INFO ]: TraceAbstraction took 54256.62 ms. Allocated memory was 309.3 MB in the beginning and 843.6 MB in the end (delta: 534.2 MB). Free memory was 241.7 MB in the beginning and 381.9 MB in the end (delta: -140.1 MB). Peak memory consumption was 394.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:57,699 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 20 locations, 28 edges - StatisticsResult: Encoded RCFG 11 locations, 19 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 57.12 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.38 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 350.82 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 247.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 155.31 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 241.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54256.62 ms. Allocated memory was 309.3 MB in the beginning and 843.6 MB in the end (delta: 534.2 MB). Free memory was 241.7 MB in the beginning and 381.9 MB in the end (delta: -140.1 MB). Peak memory consumption was 394.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 15, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 locations, 1 error locations. TIMEOUT Result, 54.1s OverallTime, 35 OverallIterations, 15 TraceHistogramMax, 35.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3908 SDtfs, 3761 SDslu, 21477 SDs, 0 SdLazy, 25555 SolverSat, 4908 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2693 GetRequests, 1468 SyntacticMatches, 118 SemanticMatches, 1107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12877 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 2370 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 2733 NumberOfCodeBlocks, 2727 NumberOfCodeBlocksAsserted, 165 NumberOfCheckSat, 2671 ConstructedInterpolants, 0 QuantifiedInterpolants, 603112 SizeOfPredicates, 380 NumberOfNonLiveVariables, 9246 ConjunctsInSsa, 1414 ConjunctsInUnsatCore, 62 InterpolantComputations, 7 PerfectInterpolantSequences, 6455/9023 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/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-18-57-711.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-18-57-711.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-18-57-711.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zip_unzip.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-18-57-711.csv Completed graceful shutdown