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/vmt-chc-benchmarks/cav12/mem_slave_tlm.4.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 23:53:49,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 23:53:49,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 23:53:49,786 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 23:53:49,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 23:53:49,787 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 23:53:49,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 23:53:49,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 23:53:49,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 23:53:49,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 23:53:49,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 23:53:49,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 23:53:49,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 23:53:49,797 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 23:53:49,798 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 23:53:49,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 23:53:49,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 23:53:49,811 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 23:53:49,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 23:53:49,814 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 23:53:49,815 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 23:53:49,817 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 23:53:49,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 23:53:49,817 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 23:53:49,818 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 23:53:49,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 23:53:49,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 23:53:49,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 23:53:49,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 23:53:49,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 23:53:49,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 23:53:49,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 23:53:49,829 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 23:53:49,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 23:53:49,834 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 23:53:49,834 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 23:53:49,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 23:53:49,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 23:53:49,854 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 23:53:49,854 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 23:53:49,858 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 23:53:49,859 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 23:53:49,859 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 23:53:49,859 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 23:53:49,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 23:53:49,860 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 23:53:49,860 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 23:53:49,860 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 23:53:49,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:53:49,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 23:53:49,860 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 23:53:49,861 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 23:53:49,861 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 23:53:49,861 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 23:53:49,861 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 23:53:49,861 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 23:53:49,862 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 23:53:49,864 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 23:53:49,865 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 23:53:49,913 INFO ]: Repository-Root is: /tmp [2018-06-24 23:53:49,932 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 23:53:49,938 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 23:53:49,940 INFO ]: Initializing SmtParser... [2018-06-24 23:53:49,940 INFO ]: SmtParser initialized [2018-06-24 23:53:49,940 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.4.smt2 [2018-06-24 23:53:49,942 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 23:53:50,029 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.4.smt2 unknown [2018-06-24 23:53:50,950 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.4.smt2 [2018-06-24 23:53:50,955 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 23:53:50,960 INFO ]: Walking toolchain with 5 elements. [2018-06-24 23:53:50,960 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 23:53:50,960 INFO ]: Initializing ChcToBoogie... [2018-06-24 23:53:50,970 INFO ]: ChcToBoogie initialized [2018-06-24 23:53:50,973 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:53:50" (1/1) ... [2018-06-24 23:53:51,123 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:51 Unit [2018-06-24 23:53:51,123 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 23:53:51,124 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 23:53:51,124 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 23:53:51,124 INFO ]: Boogie Preprocessor initialized [2018-06-24 23:53:51,143 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:51" (1/1) ... [2018-06-24 23:53:51,143 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:51" (1/1) ... [2018-06-24 23:53:51,169 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:51" (1/1) ... [2018-06-24 23:53:51,169 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:51" (1/1) ... [2018-06-24 23:53:51,196 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:51" (1/1) ... [2018-06-24 23:53:51,197 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:51" (1/1) ... [2018-06-24 23:53:51,202 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:51" (1/1) ... [2018-06-24 23:53:51,208 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 23:53:51,209 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 23:53:51,209 INFO ]: Initializing RCFGBuilder... [2018-06-24 23:53:51,209 INFO ]: RCFGBuilder initialized [2018-06-24 23:53:51,210 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:51" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:53:51,223 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 23:53:51,223 INFO ]: Found specification of procedure gotoProc [2018-06-24 23:53:51,223 INFO ]: Found implementation of procedure gotoProc [2018-06-24 23:53:51,223 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 23:53:51,223 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 23:53:51,223 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 23:53:51,976 INFO ]: Using library mode [2018-06-24 23:53:51,976 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:53:51 BoogieIcfgContainer [2018-06-24 23:53:51,977 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 23:53:51,977 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 23:53:51,977 INFO ]: Initializing BlockEncodingV2... [2018-06-24 23:53:51,978 INFO ]: BlockEncodingV2 initialized [2018-06-24 23:53:51,978 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:53:51" (1/1) ... [2018-06-24 23:53:52,000 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 23:53:52,002 INFO ]: Using Remove infeasible edges [2018-06-24 23:53:52,002 INFO ]: Using Maximize final states [2018-06-24 23:53:52,003 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 23:53:52,003 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 23:53:52,005 INFO ]: Using Remove sink states [2018-06-24 23:53:52,008 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 23:53:52,008 INFO ]: Using Use SBE [2018-06-24 23:53:52,074 WARN ]: expecting exponential blowup for input size 6 [2018-06-24 23:53:58,253 INFO ]: SBE split 1 edges [2018-06-24 23:53:58,264 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 23:53:58,265 INFO ]: 0 new accepting states [2018-06-24 23:53:58,320 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 23:53:58,322 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:53:58,332 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 23:53:58,332 INFO ]: 0 new accepting states [2018-06-24 23:53:58,334 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 23:53:58,334 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:53:58,340 INFO ]: Encoded RCFG 6 locations, 111 edges [2018-06-24 23:53:58,340 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:53:58 BasicIcfg [2018-06-24 23:53:58,340 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 23:53:58,341 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 23:53:58,341 INFO ]: Initializing TraceAbstraction... [2018-06-24 23:53:58,345 INFO ]: TraceAbstraction initialized [2018-06-24 23:53:58,346 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:53:50" (1/4) ... [2018-06-24 23:53:58,346 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1af825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 11:53:58, skipping insertion in model container [2018-06-24 23:53:58,346 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:51" (2/4) ... [2018-06-24 23:53:58,347 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1af825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 11:53:58, skipping insertion in model container [2018-06-24 23:53:58,348 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:53:51" (3/4) ... [2018-06-24 23:53:58,348 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1af825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:53:58, skipping insertion in model container [2018-06-24 23:53:58,348 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:53:58" (4/4) ... [2018-06-24 23:53:58,349 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 23:53:58,359 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 23:53:58,367 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 23:53:58,418 INFO ]: Using default assertion order modulation [2018-06-24 23:53:58,419 INFO ]: Interprodecural is true [2018-06-24 23:53:58,419 INFO ]: Hoare is false [2018-06-24 23:53:58,419 INFO ]: Compute interpolants for FPandBP [2018-06-24 23:53:58,419 INFO ]: Backedges is TWOTRACK [2018-06-24 23:53:58,419 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 23:53:58,419 INFO ]: Difference is false [2018-06-24 23:53:58,419 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 23:53:58,419 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 23:53:58,433 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 23:53:58,448 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 23:53:58,448 INFO ]: Found error trace [2018-06-24 23:53:58,449 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 23:53:58,449 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:58,454 INFO ]: Analyzing trace with hash 38662274, now seen corresponding path program 1 times [2018-06-24 23:53:58,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:58,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:58,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:58,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:58,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:58,581 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:58,702 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:53:58,705 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:58,705 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:58,707 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:58,722 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:58,722 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:58,725 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 23:54:00,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:00,533 INFO ]: Finished difference Result 7 states and 168 transitions. [2018-06-24 23:54:00,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:00,535 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 23:54:00,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:00,545 INFO ]: With dead ends: 7 [2018-06-24 23:54:00,545 INFO ]: Without dead ends: 7 [2018-06-24 23:54:00,546 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 23:54:00,565 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 23:54:00,584 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 23:54:00,585 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 23:54:00,586 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2018-06-24 23:54:00,587 INFO ]: Start accepts. Automaton has 7 states and 168 transitions. Word has length 5 [2018-06-24 23:54:00,588 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:00,588 INFO ]: Abstraction has 7 states and 168 transitions. [2018-06-24 23:54:00,588 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:00,588 INFO ]: Start isEmpty. Operand 7 states and 168 transitions. [2018-06-24 23:54:00,588 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:54:00,588 INFO ]: Found error trace [2018-06-24 23:54:00,588 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:54:00,588 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:00,589 INFO ]: Analyzing trace with hash 1196638444, now seen corresponding path program 1 times [2018-06-24 23:54:00,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:00,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:00,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:00,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:00,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:00,655 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:00,776 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:00,776 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:00,776 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:00,778 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:00,778 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:00,778 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:00,778 INFO ]: Start difference. First operand 7 states and 168 transitions. Second operand 3 states. [2018-06-24 23:54:01,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:01,625 INFO ]: Finished difference Result 9 states and 273 transitions. [2018-06-24 23:54:01,626 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:01,626 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:54:01,626 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:01,627 INFO ]: With dead ends: 9 [2018-06-24 23:54:01,627 INFO ]: Without dead ends: 9 [2018-06-24 23:54:01,628 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 23:54:01,628 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 23:54:01,632 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 23:54:01,632 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 23:54:01,633 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2018-06-24 23:54:01,633 INFO ]: Start accepts. Automaton has 9 states and 273 transitions. Word has length 6 [2018-06-24 23:54:01,634 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:01,634 INFO ]: Abstraction has 9 states and 273 transitions. [2018-06-24 23:54:01,634 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:01,634 INFO ]: Start isEmpty. Operand 9 states and 273 transitions. [2018-06-24 23:54:01,634 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:54:01,634 INFO ]: Found error trace [2018-06-24 23:54:01,634 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:54:01,634 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:01,634 INFO ]: Analyzing trace with hash 1197591756, now seen corresponding path program 1 times [2018-06-24 23:54:01,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:01,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:01,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:01,637 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:01,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:01,666 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:01,740 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:01,740 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:01,740 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:01,741 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:01,741 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:01,741 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:01,741 INFO ]: Start difference. First operand 9 states and 273 transitions. Second operand 3 states. [2018-06-24 23:54:02,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:02,408 INFO ]: Finished difference Result 13 states and 345 transitions. [2018-06-24 23:54:02,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:02,408 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:54:02,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:02,409 INFO ]: With dead ends: 13 [2018-06-24 23:54:02,409 INFO ]: Without dead ends: 13 [2018-06-24 23:54:02,410 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 23:54:02,410 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 23:54:02,414 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 23:54:02,414 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 23:54:02,416 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 345 transitions. [2018-06-24 23:54:02,416 INFO ]: Start accepts. Automaton has 13 states and 345 transitions. Word has length 6 [2018-06-24 23:54:02,416 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:02,416 INFO ]: Abstraction has 13 states and 345 transitions. [2018-06-24 23:54:02,416 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:02,416 INFO ]: Start isEmpty. Operand 13 states and 345 transitions. [2018-06-24 23:54:02,417 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:54:02,417 INFO ]: Found error trace [2018-06-24 23:54:02,417 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:02,417 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:02,417 INFO ]: Analyzing trace with hash -1531134114, now seen corresponding path program 1 times [2018-06-24 23:54:02,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:02,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:02,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:02,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:02,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:02,445 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:02,490 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:02,490 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:02,490 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:02,490 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:02,490 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:02,490 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:02,491 INFO ]: Start difference. First operand 13 states and 345 transitions. Second operand 3 states. [2018-06-24 23:54:03,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:03,072 INFO ]: Finished difference Result 13 states and 215 transitions. [2018-06-24 23:54:03,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:03,076 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:54:03,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:03,076 INFO ]: With dead ends: 13 [2018-06-24 23:54:03,076 INFO ]: Without dead ends: 13 [2018-06-24 23:54:03,076 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 23:54:03,076 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 23:54:03,079 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 23:54:03,080 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 23:54:03,080 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 215 transitions. [2018-06-24 23:54:03,080 INFO ]: Start accepts. Automaton has 13 states and 215 transitions. Word has length 7 [2018-06-24 23:54:03,080 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:03,080 INFO ]: Abstraction has 13 states and 215 transitions. [2018-06-24 23:54:03,080 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:03,080 INFO ]: Start isEmpty. Operand 13 states and 215 transitions. [2018-06-24 23:54:03,081 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:54:03,081 INFO ]: Found error trace [2018-06-24 23:54:03,081 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:03,081 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:03,081 INFO ]: Analyzing trace with hash -1560686786, now seen corresponding path program 1 times [2018-06-24 23:54:03,081 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:03,081 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:03,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:03,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:03,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:03,106 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:03,169 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:03,170 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:03,170 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:03,170 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:03,170 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:03,170 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:03,170 INFO ]: Start difference. First operand 13 states and 215 transitions. Second operand 3 states. [2018-06-24 23:54:03,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:03,805 INFO ]: Finished difference Result 20 states and 348 transitions. [2018-06-24 23:54:03,805 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:03,805 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:54:03,805 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:03,806 INFO ]: With dead ends: 20 [2018-06-24 23:54:03,806 INFO ]: Without dead ends: 20 [2018-06-24 23:54:03,806 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 23:54:03,806 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 23:54:03,810 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 23:54:03,810 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 23:54:03,811 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 348 transitions. [2018-06-24 23:54:03,811 INFO ]: Start accepts. Automaton has 20 states and 348 transitions. Word has length 7 [2018-06-24 23:54:03,812 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:03,812 INFO ]: Abstraction has 20 states and 348 transitions. [2018-06-24 23:54:03,812 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:03,812 INFO ]: Start isEmpty. Operand 20 states and 348 transitions. [2018-06-24 23:54:03,812 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:54:03,812 INFO ]: Found error trace [2018-06-24 23:54:03,812 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:03,812 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:03,812 INFO ]: Analyzing trace with hash -170572988, now seen corresponding path program 1 times [2018-06-24 23:54:03,813 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:03,813 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:03,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:03,814 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:03,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:03,846 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:03,924 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 23:54:03,924 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:03,924 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:03,925 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:03,925 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:03,925 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:03,925 INFO ]: Start difference. First operand 20 states and 348 transitions. Second operand 3 states. [2018-06-24 23:54:04,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:04,508 INFO ]: Finished difference Result 20 states and 215 transitions. [2018-06-24 23:54:04,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:04,509 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 23:54:04,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:04,509 INFO ]: With dead ends: 20 [2018-06-24 23:54:04,509 INFO ]: Without dead ends: 20 [2018-06-24 23:54:04,510 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 23:54:04,510 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 23:54:04,512 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 23:54:04,512 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 23:54:04,513 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 215 transitions. [2018-06-24 23:54:04,513 INFO ]: Start accepts. Automaton has 20 states and 215 transitions. Word has length 8 [2018-06-24 23:54:04,513 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:04,513 INFO ]: Abstraction has 20 states and 215 transitions. [2018-06-24 23:54:04,513 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:04,513 INFO ]: Start isEmpty. Operand 20 states and 215 transitions. [2018-06-24 23:54:04,513 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:54:04,513 INFO ]: Found error trace [2018-06-24 23:54:04,513 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:04,513 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:04,514 INFO ]: Analyzing trace with hash -421621745, now seen corresponding path program 1 times [2018-06-24 23:54:04,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:04,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:04,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:04,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:04,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:04,541 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:04,588 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 23:54:04,589 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:04,589 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:04,589 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:04,589 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:04,589 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:04,589 INFO ]: Start difference. First operand 20 states and 215 transitions. Second operand 3 states. [2018-06-24 23:54:05,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:05,153 INFO ]: Finished difference Result 31 states and 319 transitions. [2018-06-24 23:54:05,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:05,158 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 23:54:05,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:05,159 INFO ]: With dead ends: 31 [2018-06-24 23:54:05,159 INFO ]: Without dead ends: 31 [2018-06-24 23:54:05,160 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 23:54:05,160 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:54:05,163 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:54:05,163 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:54:05,164 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 319 transitions. [2018-06-24 23:54:05,165 INFO ]: Start accepts. Automaton has 31 states and 319 transitions. Word has length 8 [2018-06-24 23:54:05,174 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:05,174 INFO ]: Abstraction has 31 states and 319 transitions. [2018-06-24 23:54:05,174 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:05,174 INFO ]: Start isEmpty. Operand 31 states and 319 transitions. [2018-06-24 23:54:05,175 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 23:54:05,175 INFO ]: Found error trace [2018-06-24 23:54:05,175 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:05,175 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:05,175 INFO ]: Analyzing trace with hash 1818862857, now seen corresponding path program 1 times [2018-06-24 23:54:05,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:05,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:05,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:05,176 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:05,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:05,217 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:05,294 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 23:54:05,294 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:05,294 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:05,294 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:05,294 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:05,294 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:05,294 INFO ]: Start difference. First operand 31 states and 319 transitions. Second operand 3 states. [2018-06-24 23:54:06,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:06,275 INFO ]: Finished difference Result 31 states and 211 transitions. [2018-06-24 23:54:06,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:06,300 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 23:54:06,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:06,301 INFO ]: With dead ends: 31 [2018-06-24 23:54:06,301 INFO ]: Without dead ends: 31 [2018-06-24 23:54:06,301 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 23:54:06,302 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:54:06,305 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:54:06,305 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:54:06,306 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 211 transitions. [2018-06-24 23:54:06,306 INFO ]: Start accepts. Automaton has 31 states and 211 transitions. Word has length 9 [2018-06-24 23:54:06,306 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:06,306 INFO ]: Abstraction has 31 states and 211 transitions. [2018-06-24 23:54:06,306 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:06,306 INFO ]: Start isEmpty. Operand 31 states and 211 transitions. [2018-06-24 23:54:06,306 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 23:54:06,306 INFO ]: Found error trace [2018-06-24 23:54:06,306 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:06,306 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:06,307 INFO ]: Analyzing trace with hash 72376314, now seen corresponding path program 1 times [2018-06-24 23:54:06,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:06,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:06,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:06,307 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:06,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:06,355 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:06,473 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 23:54:06,473 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:06,473 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:06,473 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:06,473 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:06,473 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:06,473 INFO ]: Start difference. First operand 31 states and 211 transitions. Second operand 3 states. [2018-06-24 23:54:07,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:07,372 INFO ]: Finished difference Result 55 states and 367 transitions. [2018-06-24 23:54:07,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:07,372 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 23:54:07,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:07,373 INFO ]: With dead ends: 55 [2018-06-24 23:54:07,373 INFO ]: Without dead ends: 54 [2018-06-24 23:54:07,373 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 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 23:54:07,373 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 23:54:07,380 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-24 23:54:07,380 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-24 23:54:07,381 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 358 transitions. [2018-06-24 23:54:07,381 INFO ]: Start accepts. Automaton has 52 states and 358 transitions. Word has length 10 [2018-06-24 23:54:07,381 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:07,381 INFO ]: Abstraction has 52 states and 358 transitions. [2018-06-24 23:54:07,381 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:07,381 INFO ]: Start isEmpty. Operand 52 states and 358 transitions. [2018-06-24 23:54:07,382 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 23:54:07,382 INFO ]: Found error trace [2018-06-24 23:54:07,382 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:07,382 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:07,382 INFO ]: Analyzing trace with hash -1209394375, now seen corresponding path program 1 times [2018-06-24 23:54:07,382 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:07,382 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:07,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:07,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:07,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:07,405 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:07,479 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 23:54:07,479 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:07,479 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:07,480 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:07,480 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:07,480 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:07,480 INFO ]: Start difference. First operand 52 states and 358 transitions. Second operand 3 states. [2018-06-24 23:54:08,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:08,148 INFO ]: Finished difference Result 54 states and 240 transitions. [2018-06-24 23:54:08,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:08,148 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 23:54:08,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:08,149 INFO ]: With dead ends: 54 [2018-06-24 23:54:08,149 INFO ]: Without dead ends: 51 [2018-06-24 23:54:08,149 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 23:54:08,149 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 23:54:08,154 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-24 23:54:08,154 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 23:54:08,156 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 237 transitions. [2018-06-24 23:54:08,156 INFO ]: Start accepts. Automaton has 51 states and 237 transitions. Word has length 10 [2018-06-24 23:54:08,156 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:08,156 INFO ]: Abstraction has 51 states and 237 transitions. [2018-06-24 23:54:08,156 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:08,156 INFO ]: Start isEmpty. Operand 51 states and 237 transitions. [2018-06-24 23:54:08,156 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 23:54:08,156 INFO ]: Found error trace [2018-06-24 23:54:08,157 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:08,157 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:08,157 INFO ]: Analyzing trace with hash -1228944958, now seen corresponding path program 1 times [2018-06-24 23:54:08,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:08,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:08,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:08,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:08,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:08,200 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:08,308 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 23:54:08,308 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:08,308 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:08,308 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:08,308 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:08,308 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:08,308 INFO ]: Start difference. First operand 51 states and 237 transitions. Second operand 3 states. [2018-06-24 23:54:08,847 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:08,847 INFO ]: Finished difference Result 82 states and 358 transitions. [2018-06-24 23:54:08,847 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:08,847 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 23:54:08,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:08,848 INFO ]: With dead ends: 82 [2018-06-24 23:54:08,848 INFO ]: Without dead ends: 82 [2018-06-24 23:54:08,849 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 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 23:54:08,849 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-24 23:54:08,853 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 65. [2018-06-24 23:54:08,853 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-24 23:54:08,854 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 303 transitions. [2018-06-24 23:54:08,854 INFO ]: Start accepts. Automaton has 65 states and 303 transitions. Word has length 11 [2018-06-24 23:54:08,854 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:08,854 INFO ]: Abstraction has 65 states and 303 transitions. [2018-06-24 23:54:08,854 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:08,854 INFO ]: Start isEmpty. Operand 65 states and 303 transitions. [2018-06-24 23:54:08,855 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 23:54:08,855 INFO ]: Found error trace [2018-06-24 23:54:08,855 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:08,855 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:08,856 INFO ]: Analyzing trace with hash 1400631886, now seen corresponding path program 1 times [2018-06-24 23:54:08,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:08,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:08,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:08,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:08,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:08,897 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:09,038 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 23:54:09,038 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:09,038 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:09,038 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:09,038 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:09,038 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:09,038 INFO ]: Start difference. First operand 65 states and 303 transitions. Second operand 3 states. [2018-06-24 23:54:10,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:10,080 INFO ]: Finished difference Result 123 states and 523 transitions. [2018-06-24 23:54:10,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:10,081 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 23:54:10,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:10,082 INFO ]: With dead ends: 123 [2018-06-24 23:54:10,082 INFO ]: Without dead ends: 119 [2018-06-24 23:54:10,082 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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 23:54:10,082 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-24 23:54:10,094 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-06-24 23:54:10,094 INFO ]: Start removeUnreachable. Operand 117 states. [2018-06-24 23:54:10,097 INFO ]: Finished removeUnreachable. Reduced from 117 states to 117 states and 512 transitions. [2018-06-24 23:54:10,097 INFO ]: Start accepts. Automaton has 117 states and 512 transitions. Word has length 12 [2018-06-24 23:54:10,098 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:10,098 INFO ]: Abstraction has 117 states and 512 transitions. [2018-06-24 23:54:10,098 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:10,098 INFO ]: Start isEmpty. Operand 117 states and 512 transitions. [2018-06-24 23:54:10,099 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 23:54:10,099 INFO ]: Found error trace [2018-06-24 23:54:10,099 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:10,099 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:10,099 INFO ]: Analyzing trace with hash -1729249582, now seen corresponding path program 1 times [2018-06-24 23:54:10,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:10,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:10,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:10,101 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:10,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:10,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:10,300 INFO ]: Checked inductivity of 66 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 23:54:10,300 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:10,300 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:10,300 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:10,300 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:10,300 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:10,300 INFO ]: Start difference. First operand 117 states and 512 transitions. Second operand 3 states. [2018-06-24 23:54:11,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:11,294 INFO ]: Finished difference Result 206 states and 763 transitions. [2018-06-24 23:54:11,312 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:11,312 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-24 23:54:11,312 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:11,314 INFO ]: With dead ends: 206 [2018-06-24 23:54:11,314 INFO ]: Without dead ends: 206 [2018-06-24 23:54:11,315 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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 23:54:11,315 INFO ]: Start minimizeSevpa. Operand 206 states. [2018-06-24 23:54:11,341 INFO ]: Finished minimizeSevpa. Reduced states from 206 to 199. [2018-06-24 23:54:11,341 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-24 23:54:11,353 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 749 transitions. [2018-06-24 23:54:11,353 INFO ]: Start accepts. Automaton has 199 states and 749 transitions. Word has length 16 [2018-06-24 23:54:11,353 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:11,353 INFO ]: Abstraction has 199 states and 749 transitions. [2018-06-24 23:54:11,353 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:11,353 INFO ]: Start isEmpty. Operand 199 states and 749 transitions. [2018-06-24 23:54:11,355 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 23:54:11,355 INFO ]: Found error trace [2018-06-24 23:54:11,355 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:11,355 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:11,355 INFO ]: Analyzing trace with hash 1872833891, now seen corresponding path program 1 times [2018-06-24 23:54:11,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:11,355 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:11,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:11,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:11,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:11,490 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:11,839 INFO ]: Checked inductivity of 66 backedges. 29 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 23:54:11,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:11,839 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 23:54:11,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:12,363 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:12,396 INFO ]: Computing forward predicates... [2018-06-24 23:54:12,466 INFO ]: Checked inductivity of 66 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-24 23:54:12,493 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:54:12,493 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-24 23:54:12,494 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:54:12,494 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:54:12,494 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:12,494 INFO ]: Start difference. First operand 199 states and 749 transitions. Second operand 6 states. [2018-06-24 23:54:20,292 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:20,292 INFO ]: Finished difference Result 1609 states and 5549 transitions. [2018-06-24 23:54:20,292 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 23:54:20,292 INFO ]: Start accepts. Automaton has 6 states. Word has length 16 [2018-06-24 23:54:20,292 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:20,310 INFO ]: With dead ends: 1609 [2018-06-24 23:54:20,310 INFO ]: Without dead ends: 1609 [2018-06-24 23:54:20,310 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-06-24 23:54:20,311 INFO ]: Start minimizeSevpa. Operand 1609 states. [2018-06-24 23:54:20,374 INFO ]: Finished minimizeSevpa. Reduced states from 1609 to 1062. [2018-06-24 23:54:20,374 INFO ]: Start removeUnreachable. Operand 1062 states. [2018-06-24 23:54:20,385 INFO ]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 3852 transitions. [2018-06-24 23:54:20,385 INFO ]: Start accepts. Automaton has 1062 states and 3852 transitions. Word has length 16 [2018-06-24 23:54:20,385 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:20,385 INFO ]: Abstraction has 1062 states and 3852 transitions. [2018-06-24 23:54:20,385 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:54:20,385 INFO ]: Start isEmpty. Operand 1062 states and 3852 transitions. [2018-06-24 23:54:20,396 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:54:20,396 INFO ]: Found error trace [2018-06-24 23:54:20,396 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:20,397 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:20,397 INFO ]: Analyzing trace with hash -1571935272, now seen corresponding path program 1 times [2018-06-24 23:54:20,397 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:20,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:20,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:20,397 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:20,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:20,456 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:20,589 INFO ]: Checked inductivity of 78 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-24 23:54:20,589 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:20,589 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:20,589 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:20,589 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:20,589 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:20,589 INFO ]: Start difference. First operand 1062 states and 3852 transitions. Second operand 3 states. [2018-06-24 23:54:21,251 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:21,251 INFO ]: Finished difference Result 659 states and 1787 transitions. [2018-06-24 23:54:21,251 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:21,251 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:54:21,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:21,255 INFO ]: With dead ends: 659 [2018-06-24 23:54:21,255 INFO ]: Without dead ends: 562 [2018-06-24 23:54:21,256 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 23:54:21,256 INFO ]: Start minimizeSevpa. Operand 562 states. [2018-06-24 23:54:21,278 INFO ]: Finished minimizeSevpa. Reduced states from 562 to 538. [2018-06-24 23:54:21,278 INFO ]: Start removeUnreachable. Operand 538 states. [2018-06-24 23:54:21,281 INFO ]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1481 transitions. [2018-06-24 23:54:21,281 INFO ]: Start accepts. Automaton has 538 states and 1481 transitions. Word has length 17 [2018-06-24 23:54:21,281 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:21,281 INFO ]: Abstraction has 538 states and 1481 transitions. [2018-06-24 23:54:21,281 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:21,281 INFO ]: Start isEmpty. Operand 538 states and 1481 transitions. [2018-06-24 23:54:21,283 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:54:21,283 INFO ]: Found error trace [2018-06-24 23:54:21,283 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:21,283 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:21,283 INFO ]: Analyzing trace with hash -1538371481, now seen corresponding path program 1 times [2018-06-24 23:54:21,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:21,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:21,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:21,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:21,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:21,340 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:21,548 INFO ]: Checked inductivity of 78 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 23:54:21,548 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:21,548 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 23:54:21,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:22,022 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:22,040 INFO ]: Computing forward predicates... [2018-06-24 23:54:22,143 INFO ]: Checked inductivity of 78 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 23:54:22,169 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:54:22,169 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-24 23:54:22,169 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:54:22,169 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:54:22,169 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:22,169 INFO ]: Start difference. First operand 538 states and 1481 transitions. Second operand 6 states. [2018-06-24 23:54:24,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:24,345 INFO ]: Finished difference Result 1372 states and 3951 transitions. [2018-06-24 23:54:24,345 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 23:54:24,345 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-24 23:54:24,345 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:24,354 INFO ]: With dead ends: 1372 [2018-06-24 23:54:24,354 INFO ]: Without dead ends: 1369 [2018-06-24 23:54:24,355 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-24 23:54:24,355 INFO ]: Start minimizeSevpa. Operand 1369 states. [2018-06-24 23:54:24,398 INFO ]: Finished minimizeSevpa. Reduced states from 1369 to 1327. [2018-06-24 23:54:24,398 INFO ]: Start removeUnreachable. Operand 1327 states. [2018-06-24 23:54:24,404 INFO ]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 3880 transitions. [2018-06-24 23:54:24,405 INFO ]: Start accepts. Automaton has 1327 states and 3880 transitions. Word has length 17 [2018-06-24 23:54:24,405 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:24,405 INFO ]: Abstraction has 1327 states and 3880 transitions. [2018-06-24 23:54:24,405 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:54:24,405 INFO ]: Start isEmpty. Operand 1327 states and 3880 transitions. [2018-06-24 23:54:24,407 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 23:54:24,407 INFO ]: Found error trace [2018-06-24 23:54:24,407 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:24,407 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:24,408 INFO ]: Analyzing trace with hash 1489311376, now seen corresponding path program 1 times [2018-06-24 23:54:24,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:24,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:24,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:24,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:24,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:24,460 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:24,719 INFO ]: Checked inductivity of 91 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 23:54:24,719 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:24,720 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 23:54:24,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:25,307 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:25,333 INFO ]: Computing forward predicates... [2018-06-24 23:54:25,567 INFO ]: Checked inductivity of 91 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 23:54:25,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:25,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 23:54:25,602 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:54:25,602 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:54:25,602 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:25,603 INFO ]: Start difference. First operand 1327 states and 3880 transitions. Second operand 6 states. [2018-06-24 23:54:26,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:26,196 INFO ]: Finished difference Result 2115 states and 5821 transitions. [2018-06-24 23:54:26,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 23:54:26,197 INFO ]: Start accepts. Automaton has 6 states. Word has length 18 [2018-06-24 23:54:26,197 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:26,211 INFO ]: With dead ends: 2115 [2018-06-24 23:54:26,211 INFO ]: Without dead ends: 2103 [2018-06-24 23:54:26,211 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:26,212 INFO ]: Start minimizeSevpa. Operand 2103 states. [2018-06-24 23:54:26,265 INFO ]: Finished minimizeSevpa. Reduced states from 2103 to 2049. [2018-06-24 23:54:26,265 INFO ]: Start removeUnreachable. Operand 2049 states. [2018-06-24 23:54:26,273 INFO ]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 5684 transitions. [2018-06-24 23:54:26,274 INFO ]: Start accepts. Automaton has 2049 states and 5684 transitions. Word has length 18 [2018-06-24 23:54:26,274 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:26,274 INFO ]: Abstraction has 2049 states and 5684 transitions. [2018-06-24 23:54:26,274 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:54:26,274 INFO ]: Start isEmpty. Operand 2049 states and 5684 transitions. [2018-06-24 23:54:26,277 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 23:54:26,277 INFO ]: Found error trace [2018-06-24 23:54:26,277 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:26,277 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:26,278 INFO ]: Analyzing trace with hash 459599095, now seen corresponding path program 1 times [2018-06-24 23:54:26,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:26,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:26,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:26,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:26,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:26,343 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:26,502 INFO ]: Checked inductivity of 91 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 23:54:26,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:26,502 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 23:54:26,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:27,102 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:27,123 INFO ]: Computing forward predicates... [2018-06-24 23:54:27,171 INFO ]: Checked inductivity of 91 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 23:54:27,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:27,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 23:54:27,194 INFO ]: Interpolant automaton has 5 states [2018-06-24 23:54:27,194 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 23:54:27,194 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 23:54:27,194 INFO ]: Start difference. First operand 2049 states and 5684 transitions. Second operand 5 states. [2018-06-24 23:54:27,859 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:27,859 INFO ]: Finished difference Result 2024 states and 5403 transitions. [2018-06-24 23:54:27,859 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 23:54:27,859 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-24 23:54:27,859 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:27,869 INFO ]: With dead ends: 2024 [2018-06-24 23:54:27,869 INFO ]: Without dead ends: 1977 [2018-06-24 23:54:27,869 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:27,870 INFO ]: Start minimizeSevpa. Operand 1977 states. [2018-06-24 23:54:27,912 INFO ]: Finished minimizeSevpa. Reduced states from 1977 to 1286. [2018-06-24 23:54:27,912 INFO ]: Start removeUnreachable. Operand 1286 states. [2018-06-24 23:54:27,917 INFO ]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 3303 transitions. [2018-06-24 23:54:27,917 INFO ]: Start accepts. Automaton has 1286 states and 3303 transitions. Word has length 18 [2018-06-24 23:54:27,917 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:27,917 INFO ]: Abstraction has 1286 states and 3303 transitions. [2018-06-24 23:54:27,917 INFO ]: Interpolant automaton has 5 states. [2018-06-24 23:54:27,917 INFO ]: Start isEmpty. Operand 1286 states and 3303 transitions. [2018-06-24 23:54:27,920 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 23:54:27,920 INFO ]: Found error trace [2018-06-24 23:54:27,920 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:27,921 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:27,921 INFO ]: Analyzing trace with hash -1646731358, now seen corresponding path program 1 times [2018-06-24 23:54:27,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:27,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:27,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:27,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:27,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:28,001 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:28,144 INFO ]: Checked inductivity of 190 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-24 23:54:28,144 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:28,144 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:28,145 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:28,145 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:28,145 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:28,145 INFO ]: Start difference. First operand 1286 states and 3303 transitions. Second operand 3 states. [2018-06-24 23:54:28,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:28,615 INFO ]: Finished difference Result 1687 states and 4041 transitions. [2018-06-24 23:54:28,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:28,615 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-24 23:54:28,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:28,622 INFO ]: With dead ends: 1687 [2018-06-24 23:54:28,622 INFO ]: Without dead ends: 1552 [2018-06-24 23:54:28,622 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 9 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 23:54:28,623 INFO ]: Start minimizeSevpa. Operand 1552 states. [2018-06-24 23:54:28,649 INFO ]: Finished minimizeSevpa. Reduced states from 1552 to 774. [2018-06-24 23:54:28,650 INFO ]: Start removeUnreachable. Operand 774 states. [2018-06-24 23:54:28,652 INFO ]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1921 transitions. [2018-06-24 23:54:28,652 INFO ]: Start accepts. Automaton has 774 states and 1921 transitions. Word has length 24 [2018-06-24 23:54:28,653 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:28,653 INFO ]: Abstraction has 774 states and 1921 transitions. [2018-06-24 23:54:28,653 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:28,653 INFO ]: Start isEmpty. Operand 774 states and 1921 transitions. [2018-06-24 23:54:28,656 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 23:54:28,656 INFO ]: Found error trace [2018-06-24 23:54:28,656 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:28,656 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:28,656 INFO ]: Analyzing trace with hash 1653779345, now seen corresponding path program 1 times [2018-06-24 23:54:28,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:28,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:28,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:28,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:28,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:28,743 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:28,901 INFO ]: Checked inductivity of 210 backedges. 132 proven. 32 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 23:54:28,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:28,901 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 23:54:28,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:29,619 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:29,641 INFO ]: Computing forward predicates... [2018-06-24 23:54:29,659 INFO ]: Checked inductivity of 210 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-24 23:54:29,685 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:54:29,685 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-24 23:54:29,685 INFO ]: Interpolant automaton has 5 states [2018-06-24 23:54:29,685 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 23:54:29,685 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 23:54:29,686 INFO ]: Start difference. First operand 774 states and 1921 transitions. Second operand 5 states. [2018-06-24 23:54:30,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:30,376 INFO ]: Finished difference Result 1281 states and 2691 transitions. [2018-06-24 23:54:30,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 23:54:30,376 INFO ]: Start accepts. Automaton has 5 states. Word has length 25 [2018-06-24 23:54:30,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:30,378 INFO ]: With dead ends: 1281 [2018-06-24 23:54:30,378 INFO ]: Without dead ends: 725 [2018-06-24 23:54:30,379 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:30,379 INFO ]: Start minimizeSevpa. Operand 725 states. [2018-06-24 23:54:30,393 INFO ]: Finished minimizeSevpa. Reduced states from 725 to 539. [2018-06-24 23:54:30,393 INFO ]: Start removeUnreachable. Operand 539 states. [2018-06-24 23:54:30,395 INFO ]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1380 transitions. [2018-06-24 23:54:30,395 INFO ]: Start accepts. Automaton has 539 states and 1380 transitions. Word has length 25 [2018-06-24 23:54:30,395 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:30,395 INFO ]: Abstraction has 539 states and 1380 transitions. [2018-06-24 23:54:30,395 INFO ]: Interpolant automaton has 5 states. [2018-06-24 23:54:30,395 INFO ]: Start isEmpty. Operand 539 states and 1380 transitions. [2018-06-24 23:54:30,397 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 23:54:30,397 INFO ]: Found error trace [2018-06-24 23:54:30,397 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:30,397 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:30,397 INFO ]: Analyzing trace with hash 1210753715, now seen corresponding path program 1 times [2018-06-24 23:54:30,397 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:30,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:30,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:30,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:30,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:30,469 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:30,705 WARN ]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-06-24 23:54:30,707 INFO ]: Checked inductivity of 231 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-24 23:54:30,707 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:30,707 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:30,708 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:30,709 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:30,709 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:30,710 INFO ]: Start difference. First operand 539 states and 1380 transitions. Second operand 3 states. [2018-06-24 23:54:31,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:31,636 INFO ]: Finished difference Result 806 states and 2017 transitions. [2018-06-24 23:54:31,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:31,636 INFO ]: Start accepts. Automaton has 3 states. Word has length 26 [2018-06-24 23:54:31,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:31,638 INFO ]: With dead ends: 806 [2018-06-24 23:54:31,638 INFO ]: Without dead ends: 698 [2018-06-24 23:54:31,638 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:31,639 INFO ]: Start minimizeSevpa. Operand 698 states. [2018-06-24 23:54:31,649 INFO ]: Finished minimizeSevpa. Reduced states from 698 to 328. [2018-06-24 23:54:31,649 INFO ]: Start removeUnreachable. Operand 328 states. [2018-06-24 23:54:31,651 INFO ]: Finished removeUnreachable. Reduced from 328 states to 328 states and 889 transitions. [2018-06-24 23:54:31,651 INFO ]: Start accepts. Automaton has 328 states and 889 transitions. Word has length 26 [2018-06-24 23:54:31,651 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:31,651 INFO ]: Abstraction has 328 states and 889 transitions. [2018-06-24 23:54:31,651 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:31,651 INFO ]: Start isEmpty. Operand 328 states and 889 transitions. [2018-06-24 23:54:31,652 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 23:54:31,652 INFO ]: Found error trace [2018-06-24 23:54:31,652 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:31,652 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:31,652 INFO ]: Analyzing trace with hash -1479609443, now seen corresponding path program 1 times [2018-06-24 23:54:31,652 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:31,652 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:31,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:31,653 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:31,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:31,716 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:31,837 INFO ]: Checked inductivity of 435 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-24 23:54:31,838 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:31,838 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:31,838 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:31,838 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:31,838 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:31,838 INFO ]: Start difference. First operand 328 states and 889 transitions. Second operand 3 states. [2018-06-24 23:54:32,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:32,525 INFO ]: Finished difference Result 468 states and 1102 transitions. [2018-06-24 23:54:32,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:32,568 INFO ]: Start accepts. Automaton has 3 states. Word has length 34 [2018-06-24 23:54:32,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:32,570 INFO ]: With dead ends: 468 [2018-06-24 23:54:32,570 INFO ]: Without dead ends: 468 [2018-06-24 23:54:32,570 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 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 23:54:32,570 INFO ]: Start minimizeSevpa. Operand 468 states. [2018-06-24 23:54:32,579 INFO ]: Finished minimizeSevpa. Reduced states from 468 to 455. [2018-06-24 23:54:32,579 INFO ]: Start removeUnreachable. Operand 455 states. [2018-06-24 23:54:32,612 INFO ]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1086 transitions. [2018-06-24 23:54:32,612 INFO ]: Start accepts. Automaton has 455 states and 1086 transitions. Word has length 34 [2018-06-24 23:54:32,612 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:32,612 INFO ]: Abstraction has 455 states and 1086 transitions. [2018-06-24 23:54:32,612 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:32,612 INFO ]: Start isEmpty. Operand 455 states and 1086 transitions. [2018-06-24 23:54:32,613 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 23:54:32,613 INFO ]: Found error trace [2018-06-24 23:54:32,613 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:32,614 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:32,614 INFO ]: Analyzing trace with hash -968166562, now seen corresponding path program 1 times [2018-06-24 23:54:32,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:32,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:32,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:32,614 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:32,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:32,716 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:32,965 INFO ]: Checked inductivity of 435 backedges. 248 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-24 23:54:32,965 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:32,966 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 23:54:32,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:34,102 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:34,140 INFO ]: Computing forward predicates... [2018-06-24 23:54:34,166 INFO ]: Checked inductivity of 435 backedges. 248 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-24 23:54:34,205 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:34,205 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 23:54:34,205 INFO ]: Interpolant automaton has 4 states [2018-06-24 23:54:34,205 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 23:54:34,205 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 23:54:34,206 INFO ]: Start difference. First operand 455 states and 1086 transitions. Second operand 4 states. [2018-06-24 23:54:34,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:34,735 INFO ]: Finished difference Result 673 states and 1479 transitions. [2018-06-24 23:54:34,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 23:54:34,736 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-24 23:54:34,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:34,737 INFO ]: With dead ends: 673 [2018-06-24 23:54:34,737 INFO ]: Without dead ends: 664 [2018-06-24 23:54:34,737 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 23:54:34,738 INFO ]: Start minimizeSevpa. Operand 664 states. [2018-06-24 23:54:34,749 INFO ]: Finished minimizeSevpa. Reduced states from 664 to 455. [2018-06-24 23:54:34,749 INFO ]: Start removeUnreachable. Operand 455 states. [2018-06-24 23:54:34,751 INFO ]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1086 transitions. [2018-06-24 23:54:34,751 INFO ]: Start accepts. Automaton has 455 states and 1086 transitions. Word has length 34 [2018-06-24 23:54:34,751 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:34,751 INFO ]: Abstraction has 455 states and 1086 transitions. [2018-06-24 23:54:34,751 INFO ]: Interpolant automaton has 4 states. [2018-06-24 23:54:34,751 INFO ]: Start isEmpty. Operand 455 states and 1086 transitions. [2018-06-24 23:54:34,752 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 23:54:34,752 INFO ]: Found error trace [2018-06-24 23:54:34,752 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:34,752 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:34,753 INFO ]: Analyzing trace with hash -316209362, now seen corresponding path program 1 times [2018-06-24 23:54:34,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:34,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:34,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:34,753 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:34,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:34,858 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:35,330 INFO ]: Checked inductivity of 435 backedges. 152 proven. 233 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-24 23:54:35,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:35,330 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 23:54:35,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:36,332 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:36,363 INFO ]: Computing forward predicates... [2018-06-24 23:54:36,378 INFO ]: Checked inductivity of 435 backedges. 131 proven. 213 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-24 23:54:36,413 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:36,414 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2018-06-24 23:54:36,414 INFO ]: Interpolant automaton has 10 states [2018-06-24 23:54:36,414 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 23:54:36,414 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 23:54:36,414 INFO ]: Start difference. First operand 455 states and 1086 transitions. Second operand 10 states. [2018-06-24 23:54:37,913 WARN ]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 23:54:39,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:39,167 INFO ]: Finished difference Result 1419 states and 3084 transitions. [2018-06-24 23:54:39,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 23:54:39,167 INFO ]: Start accepts. Automaton has 10 states. Word has length 34 [2018-06-24 23:54:39,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:39,171 INFO ]: With dead ends: 1419 [2018-06-24 23:54:39,171 INFO ]: Without dead ends: 1402 [2018-06-24 23:54:39,171 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-06-24 23:54:39,172 INFO ]: Start minimizeSevpa. Operand 1402 states. [2018-06-24 23:54:39,189 INFO ]: Finished minimizeSevpa. Reduced states from 1402 to 700. [2018-06-24 23:54:39,189 INFO ]: Start removeUnreachable. Operand 700 states. [2018-06-24 23:54:39,192 INFO ]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1713 transitions. [2018-06-24 23:54:39,192 INFO ]: Start accepts. Automaton has 700 states and 1713 transitions. Word has length 34 [2018-06-24 23:54:39,192 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:39,192 INFO ]: Abstraction has 700 states and 1713 transitions. [2018-06-24 23:54:39,192 INFO ]: Interpolant automaton has 10 states. [2018-06-24 23:54:39,192 INFO ]: Start isEmpty. Operand 700 states and 1713 transitions. [2018-06-24 23:54:39,194 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-24 23:54:39,194 INFO ]: Found error trace [2018-06-24 23:54:39,194 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:39,194 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:39,194 INFO ]: Analyzing trace with hash 1384307676, now seen corresponding path program 1 times [2018-06-24 23:54:39,194 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:39,194 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:39,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:39,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:39,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:39,312 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:39,510 INFO ]: Checked inductivity of 903 backedges. 572 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-06-24 23:54:39,510 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:39,510 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:39,510 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:39,510 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:39,510 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:39,510 INFO ]: Start difference. First operand 700 states and 1713 transitions. Second operand 3 states. [2018-06-24 23:54:40,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:40,126 INFO ]: Finished difference Result 820 states and 1942 transitions. [2018-06-24 23:54:40,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:40,127 INFO ]: Start accepts. Automaton has 3 states. Word has length 47 [2018-06-24 23:54:40,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:40,129 INFO ]: With dead ends: 820 [2018-06-24 23:54:40,129 INFO ]: Without dead ends: 818 [2018-06-24 23:54:40,129 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 11 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 23:54:40,130 INFO ]: Start minimizeSevpa. Operand 818 states. [2018-06-24 23:54:40,146 INFO ]: Finished minimizeSevpa. Reduced states from 818 to 802. [2018-06-24 23:54:40,146 INFO ]: Start removeUnreachable. Operand 802 states. [2018-06-24 23:54:40,149 INFO ]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1910 transitions. [2018-06-24 23:54:40,149 INFO ]: Start accepts. Automaton has 802 states and 1910 transitions. Word has length 47 [2018-06-24 23:54:40,149 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:40,149 INFO ]: Abstraction has 802 states and 1910 transitions. [2018-06-24 23:54:40,149 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:40,149 INFO ]: Start isEmpty. Operand 802 states and 1910 transitions. [2018-06-24 23:54:40,151 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-24 23:54:40,151 INFO ]: Found error trace [2018-06-24 23:54:40,151 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:40,151 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:40,151 INFO ]: Analyzing trace with hash 1162796058, now seen corresponding path program 1 times [2018-06-24 23:54:40,151 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:40,151 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:40,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:40,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:40,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:40,265 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:40,440 INFO ]: Checked inductivity of 990 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-06-24 23:54:40,440 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:40,440 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:40,440 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:40,440 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:40,440 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:40,440 INFO ]: Start difference. First operand 802 states and 1910 transitions. Second operand 3 states. [2018-06-24 23:54:41,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:41,072 INFO ]: Finished difference Result 843 states and 1957 transitions. [2018-06-24 23:54:41,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:41,072 INFO ]: Start accepts. Automaton has 3 states. Word has length 49 [2018-06-24 23:54:41,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:41,074 INFO ]: With dead ends: 843 [2018-06-24 23:54:41,074 INFO ]: Without dead ends: 818 [2018-06-24 23:54:41,074 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 9 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 23:54:41,075 INFO ]: Start minimizeSevpa. Operand 818 states. [2018-06-24 23:54:41,087 INFO ]: Finished minimizeSevpa. Reduced states from 818 to 776. [2018-06-24 23:54:41,087 INFO ]: Start removeUnreachable. Operand 776 states. [2018-06-24 23:54:41,090 INFO ]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1801 transitions. [2018-06-24 23:54:41,090 INFO ]: Start accepts. Automaton has 776 states and 1801 transitions. Word has length 49 [2018-06-24 23:54:41,090 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:41,090 INFO ]: Abstraction has 776 states and 1801 transitions. [2018-06-24 23:54:41,090 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:41,090 INFO ]: Start isEmpty. Operand 776 states and 1801 transitions. [2018-06-24 23:54:41,092 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-24 23:54:41,092 INFO ]: Found error trace [2018-06-24 23:54:41,092 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:41,092 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:41,092 INFO ]: Analyzing trace with hash -476646295, now seen corresponding path program 1 times [2018-06-24 23:54:41,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:41,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:41,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:41,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:41,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:41,247 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:42,031 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 5 [2018-06-24 23:54:42,080 INFO ]: Checked inductivity of 1035 backedges. 571 proven. 214 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-06-24 23:54:42,080 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:42,080 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 23:54:42,087 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:43,652 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:43,710 INFO ]: Computing forward predicates... [2018-06-24 23:54:44,092 INFO ]: Checked inductivity of 1035 backedges. 631 proven. 154 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-06-24 23:54:44,122 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:44,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-24 23:54:44,122 INFO ]: Interpolant automaton has 13 states [2018-06-24 23:54:44,122 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 23:54:44,122 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-24 23:54:44,122 INFO ]: Start difference. First operand 776 states and 1801 transitions. Second operand 13 states. [2018-06-24 23:54:46,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:46,660 INFO ]: Finished difference Result 2081 states and 4386 transitions. [2018-06-24 23:54:46,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 23:54:46,660 INFO ]: Start accepts. Automaton has 13 states. Word has length 50 [2018-06-24 23:54:46,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:46,667 INFO ]: With dead ends: 2081 [2018-06-24 23:54:46,667 INFO ]: Without dead ends: 2081 [2018-06-24 23:54:46,667 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-06-24 23:54:46,668 INFO ]: Start minimizeSevpa. Operand 2081 states. [2018-06-24 23:54:46,689 INFO ]: Finished minimizeSevpa. Reduced states from 2081 to 822. [2018-06-24 23:54:46,689 INFO ]: Start removeUnreachable. Operand 822 states. [2018-06-24 23:54:46,693 INFO ]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1966 transitions. [2018-06-24 23:54:46,694 INFO ]: Start accepts. Automaton has 822 states and 1966 transitions. Word has length 50 [2018-06-24 23:54:46,694 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:46,694 INFO ]: Abstraction has 822 states and 1966 transitions. [2018-06-24 23:54:46,694 INFO ]: Interpolant automaton has 13 states. [2018-06-24 23:54:46,694 INFO ]: Start isEmpty. Operand 822 states and 1966 transitions. [2018-06-24 23:54:46,697 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-24 23:54:46,697 INFO ]: Found error trace [2018-06-24 23:54:46,697 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:46,697 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:46,697 INFO ]: Analyzing trace with hash -320406287, now seen corresponding path program 1 times [2018-06-24 23:54:46,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:46,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:46,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:46,698 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:46,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:46,895 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:47,334 WARN ]: Spent 176.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 Received shutdown request... [2018-06-24 23:54:47,868 WARN ]: Verification canceled [2018-06-24 23:54:47,871 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 23:54:47,873 WARN ]: Timeout [2018-06-24 23:54:47,873 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:54:47 BasicIcfg [2018-06-24 23:54:47,873 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 23:54:47,876 INFO ]: Toolchain (without parser) took 56920.66 ms. Allocated memory was 307.8 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 191.4 MB in the beginning and 873.4 MB in the end (delta: -682.1 MB). Peak memory consumption was 320.9 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:47,877 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 23:54:47,877 INFO ]: ChcToBoogie took 162.78 ms. Allocated memory was 307.8 MB in the beginning and 324.0 MB in the end (delta: 16.3 MB). Free memory was 190.4 MB in the beginning and 295.4 MB in the end (delta: -105.0 MB). Peak memory consumption was 5.7 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:47,877 INFO ]: Boogie Preprocessor took 84.89 ms. Allocated memory is still 324.0 MB. Free memory was 295.4 MB in the beginning and 292.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:47,878 INFO ]: RCFGBuilder took 767.65 ms. Allocated memory is still 324.0 MB. Free memory was 292.3 MB in the beginning and 215.4 MB in the end (delta: 76.9 MB). Peak memory consumption was 76.9 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:47,878 INFO ]: BlockEncodingV2 took 6363.54 ms. Allocated memory was 324.0 MB in the beginning and 362.8 MB in the end (delta: 38.8 MB). Free memory was 215.4 MB in the beginning and 243.7 MB in the end (delta: -28.3 MB). Peak memory consumption was 53.9 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:47,878 INFO ]: TraceAbstraction took 49531.89 ms. Allocated memory was 362.8 MB in the beginning and 1.3 GB in the end (delta: 947.9 MB). Free memory was 243.7 MB in the beginning and 873.4 MB in the end (delta: -629.7 MB). Peak memory consumption was 318.2 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:47,887 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 111 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 162.78 ms. Allocated memory was 307.8 MB in the beginning and 324.0 MB in the end (delta: 16.3 MB). Free memory was 190.4 MB in the beginning and 295.4 MB in the end (delta: -105.0 MB). Peak memory consumption was 5.7 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 84.89 ms. Allocated memory is still 324.0 MB. Free memory was 295.4 MB in the beginning and 292.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 767.65 ms. Allocated memory is still 324.0 MB. Free memory was 292.3 MB in the beginning and 215.4 MB in the end (delta: 76.9 MB). Peak memory consumption was 76.9 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 6363.54 ms. Allocated memory was 324.0 MB in the beginning and 362.8 MB in the end (delta: 38.8 MB). Free memory was 215.4 MB in the beginning and 243.7 MB in the end (delta: -28.3 MB). Peak memory consumption was 53.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49531.89 ms. Allocated memory was 362.8 MB in the beginning and 1.3 GB in the end (delta: 947.9 MB). Free memory was 243.7 MB in the beginning and 873.4 MB in the end (delta: -629.7 MB). Peak memory consumption was 318.2 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 67 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 49.4s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 32.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 131 SDtfs, 5 SDslu, 198 SDs, 0 SdLazy, 14001 SolverSat, 3626 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 372 SyntacticMatches, 21 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2049occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 4961 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 2.8s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 736 NumberOfCodeBlocks, 736 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 701 ConstructedInterpolants, 0 QuantifiedInterpolants, 49775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 50103 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 35 InterpolantComputations, 22 PerfectInterpolantSequences, 6902/7884 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/mem_slave_tlm.4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_23-54-47-902.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_23-54-47-902.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_23-54-47-902.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_23-54-47-902.csv Completed graceful shutdown