java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_net_1_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 21:08:17,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 21:08:17,039 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 21:08:17,053 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 21:08:17,053 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 21:08:17,054 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 21:08:17,056 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 21:08:17,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 21:08:17,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 21:08:17,060 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 21:08:17,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 21:08:17,061 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 21:08:17,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 21:08:17,063 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 21:08:17,064 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 21:08:17,065 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 21:08:17,066 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 21:08:17,068 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 21:08:17,070 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 21:08:17,072 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 21:08:17,073 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 21:08:17,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 21:08:17,077 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 21:08:17,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 21:08:17,077 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 21:08:17,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 21:08:17,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 21:08:17,080 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 21:08:17,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 21:08:17,082 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 21:08:17,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 21:08:17,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 21:08:17,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 21:08:17,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 21:08:17,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 21:08:17,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 21:08:17,086 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 21:08:17,107 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 21:08:17,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 21:08:17,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 21:08:17,110 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 21:08:17,112 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 21:08:17,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 21:08:17,113 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 21:08:17,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 21:08:17,115 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 21:08:17,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 21:08:17,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 21:08:17,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 21:08:17,116 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 21:08:17,116 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 21:08:17,116 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 21:08:17,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 21:08:17,117 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 21:08:17,117 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 21:08:17,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 21:08:17,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 21:08:17,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 21:08:17,119 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 21:08:17,119 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 21:08:17,120 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 21:08:17,120 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 21:08:17,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 21:08:17,120 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 21:08:17,120 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 21:08:17,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 21:08:17,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 21:08:17,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 21:08:17,187 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 21:08:17,187 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 21:08:17,188 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_net_1_false-unreach-call_false-termination.c [2018-10-23 21:08:17,242 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dc5b774ba/eda24cf1536d43e08cf96859c30c52e7/FLAG108528f3e [2018-10-23 21:08:18,465 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 21:08:18,466 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_net_1_false-unreach-call_false-termination.c [2018-10-23 21:08:18,604 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dc5b774ba/eda24cf1536d43e08cf96859c30c52e7/FLAG108528f3e [2018-10-23 21:08:18,625 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dc5b774ba/eda24cf1536d43e08cf96859c30c52e7 [2018-10-23 21:08:18,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 21:08:18,640 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 21:08:18,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 21:08:18,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 21:08:18,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 21:08:18,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:08:18" (1/1) ... [2018-10-23 21:08:18,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5906cc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:18, skipping insertion in model container [2018-10-23 21:08:18,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:08:18" (1/1) ... [2018-10-23 21:08:18,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 21:08:19,258 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 21:08:21,003 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 21:08:21,009 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 21:08:22,273 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 21:08:22,292 INFO L193 MainTranslator]: Completed translation [2018-10-23 21:08:22,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22 WrapperNode [2018-10-23 21:08:22,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 21:08:22,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 21:08:22,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 21:08:22,294 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 21:08:22,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (1/1) ... [2018-10-23 21:08:22,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (1/1) ... [2018-10-23 21:08:23,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 21:08:23,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 21:08:23,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 21:08:23,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 21:08:23,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (1/1) ... [2018-10-23 21:08:23,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (1/1) ... [2018-10-23 21:08:23,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (1/1) ... [2018-10-23 21:08:23,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (1/1) ... [2018-10-23 21:08:24,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (1/1) ... [2018-10-23 21:08:24,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (1/1) ... [2018-10-23 21:08:24,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (1/1) ... [2018-10-23 21:08:24,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 21:08:24,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 21:08:24,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 21:08:24,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 21:08:24,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 21:08:24,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 21:08:24,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 21:08:52,730 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 21:08:52,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:08:52 BoogieIcfgContainer [2018-10-23 21:08:52,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 21:08:52,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 21:08:52,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 21:08:52,736 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 21:08:52,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:08:18" (1/3) ... [2018-10-23 21:08:52,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772225f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:08:52, skipping insertion in model container [2018-10-23 21:08:52,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:08:22" (2/3) ... [2018-10-23 21:08:52,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772225f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:08:52, skipping insertion in model container [2018-10-23 21:08:52,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:08:52" (3/3) ... [2018-10-23 21:08:52,740 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_net_1_false-unreach-call_false-termination.c [2018-10-23 21:08:52,750 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 21:08:52,765 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 21:08:52,783 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 21:08:52,854 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 21:08:52,854 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 21:08:52,855 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 21:08:52,855 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 21:08:52,855 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 21:08:52,855 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 21:08:52,855 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 21:08:52,856 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 21:08:52,856 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 21:08:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states. [2018-10-23 21:08:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-23 21:08:52,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:08:52,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:08:52,988 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:08:52,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:08:52,995 INFO L82 PathProgramCache]: Analyzing trace with hash 382202501, now seen corresponding path program 1 times [2018-10-23 21:08:52,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:08:52,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:08:53,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:08:53,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:08:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:08:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:08:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:08:53,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:08:53,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 21:08:53,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-23 21:08:53,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-23 21:08:53,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-23 21:08:53,321 INFO L87 Difference]: Start difference. First operand 9211 states. Second operand 2 states. [2018-10-23 21:08:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:08:53,585 INFO L93 Difference]: Finished difference Result 17698 states and 35380 transitions. [2018-10-23 21:08:53,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-23 21:08:53,587 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-10-23 21:08:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:08:53,669 INFO L225 Difference]: With dead ends: 17698 [2018-10-23 21:08:53,670 INFO L226 Difference]: Without dead ends: 8280 [2018-10-23 21:08:53,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-23 21:08:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2018-10-23 21:08:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8280. [2018-10-23 21:08:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8280 states. [2018-10-23 21:08:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 12997 transitions. [2018-10-23 21:08:53,986 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 12997 transitions. Word has length 9 [2018-10-23 21:08:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:08:53,987 INFO L481 AbstractCegarLoop]: Abstraction has 8280 states and 12997 transitions. [2018-10-23 21:08:53,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-23 21:08:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 12997 transitions. [2018-10-23 21:08:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-23 21:08:53,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:08:53,988 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:08:53,989 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:08:53,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:08:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -505562890, now seen corresponding path program 1 times [2018-10-23 21:08:53,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:08:53,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:08:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:08:53,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:08:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:08:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:08:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:08:54,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:08:54,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:08:54,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:08:54,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:08:54,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:08:54,159 INFO L87 Difference]: Start difference. First operand 8280 states and 12997 transitions. Second operand 3 states. [2018-10-23 21:08:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:08:58,402 INFO L93 Difference]: Finished difference Result 16561 states and 25996 transitions. [2018-10-23 21:08:58,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:08:58,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-23 21:08:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:08:58,449 INFO L225 Difference]: With dead ends: 16561 [2018-10-23 21:08:58,449 INFO L226 Difference]: Without dead ends: 8283 [2018-10-23 21:08:58,460 INFO L605 BasicCegarLoop]: 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-10-23 21:08:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2018-10-23 21:08:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283. [2018-10-23 21:08:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8283 states. [2018-10-23 21:08:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 13000 transitions. [2018-10-23 21:08:58,636 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 13000 transitions. Word has length 10 [2018-10-23 21:08:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:08:58,636 INFO L481 AbstractCegarLoop]: Abstraction has 8283 states and 13000 transitions. [2018-10-23 21:08:58,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:08:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 13000 transitions. [2018-10-23 21:08:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-23 21:08:58,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:08:58,638 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:08:58,638 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:08:58,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:08:58,639 INFO L82 PathProgramCache]: Analyzing trace with hash -353858872, now seen corresponding path program 1 times [2018-10-23 21:08:58,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:08:58,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:08:58,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:08:58,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:08:58,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:08:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:08:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:08:58,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:08:58,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:08:58,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:08:58,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:08:58,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:08:58,835 INFO L87 Difference]: Start difference. First operand 8283 states and 13000 transitions. Second operand 3 states. [2018-10-23 21:09:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:09:01,801 INFO L93 Difference]: Finished difference Result 16456 states and 25845 transitions. [2018-10-23 21:09:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:09:01,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-23 21:09:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:09:01,845 INFO L225 Difference]: With dead ends: 16456 [2018-10-23 21:09:01,845 INFO L226 Difference]: Without dead ends: 8176 [2018-10-23 21:09:01,858 INFO L605 BasicCegarLoop]: 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-10-23 21:09:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2018-10-23 21:09:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8176. [2018-10-23 21:09:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8176 states. [2018-10-23 21:09:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8176 states to 8176 states and 12846 transitions. [2018-10-23 21:09:02,011 INFO L78 Accepts]: Start accepts. Automaton has 8176 states and 12846 transitions. Word has length 15 [2018-10-23 21:09:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:09:02,012 INFO L481 AbstractCegarLoop]: Abstraction has 8176 states and 12846 transitions. [2018-10-23 21:09:02,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:09:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 8176 states and 12846 transitions. [2018-10-23 21:09:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-23 21:09:02,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:09:02,013 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:09:02,013 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:09:02,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:09:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash -308800459, now seen corresponding path program 1 times [2018-10-23 21:09:02,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:09:02,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:09:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:02,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:09:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:09:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:09:02,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:09:02,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:09:02,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:09:02,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:09:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:09:02,117 INFO L87 Difference]: Start difference. First operand 8176 states and 12846 transitions. Second operand 3 states. [2018-10-23 21:09:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:09:07,700 INFO L93 Difference]: Finished difference Result 16264 states and 25563 transitions. [2018-10-23 21:09:07,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:09:07,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-23 21:09:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:09:07,732 INFO L225 Difference]: With dead ends: 16264 [2018-10-23 21:09:07,732 INFO L226 Difference]: Without dead ends: 8056 [2018-10-23 21:09:07,741 INFO L605 BasicCegarLoop]: 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-10-23 21:09:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2018-10-23 21:09:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 8056. [2018-10-23 21:09:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2018-10-23 21:09:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 12226 transitions. [2018-10-23 21:09:07,895 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 12226 transitions. Word has length 19 [2018-10-23 21:09:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:09:07,895 INFO L481 AbstractCegarLoop]: Abstraction has 8056 states and 12226 transitions. [2018-10-23 21:09:07,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:09:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 12226 transitions. [2018-10-23 21:09:07,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-23 21:09:07,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:09:07,898 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:09:07,899 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:09:07,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:09:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2047414700, now seen corresponding path program 1 times [2018-10-23 21:09:07,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:09:07,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:09:07,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:07,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:09:07,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:09:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:09:08,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:09:08,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:09:08,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:09:08,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:09:08,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:09:08,007 INFO L87 Difference]: Start difference. First operand 8056 states and 12226 transitions. Second operand 3 states. [2018-10-23 21:09:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:09:10,014 INFO L93 Difference]: Finished difference Result 16110 states and 24449 transitions. [2018-10-23 21:09:10,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:09:10,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-23 21:09:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:09:10,030 INFO L225 Difference]: With dead ends: 16110 [2018-10-23 21:09:10,030 INFO L226 Difference]: Without dead ends: 8062 [2018-10-23 21:09:10,040 INFO L605 BasicCegarLoop]: 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-10-23 21:09:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2018-10-23 21:09:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 8060. [2018-10-23 21:09:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8060 states. [2018-10-23 21:09:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8060 states to 8060 states and 12230 transitions. [2018-10-23 21:09:10,158 INFO L78 Accepts]: Start accepts. Automaton has 8060 states and 12230 transitions. Word has length 22 [2018-10-23 21:09:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:09:10,158 INFO L481 AbstractCegarLoop]: Abstraction has 8060 states and 12230 transitions. [2018-10-23 21:09:10,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:09:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 8060 states and 12230 transitions. [2018-10-23 21:09:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-23 21:09:10,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:09:10,159 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:09:10,159 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:09:10,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:09:10,160 INFO L82 PathProgramCache]: Analyzing trace with hash 986032085, now seen corresponding path program 1 times [2018-10-23 21:09:10,160 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:09:10,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:09:10,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:10,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:09:10,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:09:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:09:10,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:09:10,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:09:10,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:09:10,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:09:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:09:10,266 INFO L87 Difference]: Start difference. First operand 8060 states and 12230 transitions. Second operand 3 states. [2018-10-23 21:09:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:09:14,846 INFO L93 Difference]: Finished difference Result 24164 states and 36672 transitions. [2018-10-23 21:09:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:09:14,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-23 21:09:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:09:14,885 INFO L225 Difference]: With dead ends: 24164 [2018-10-23 21:09:14,885 INFO L226 Difference]: Without dead ends: 16064 [2018-10-23 21:09:14,899 INFO L605 BasicCegarLoop]: 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-10-23 21:09:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16064 states. [2018-10-23 21:09:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16064 to 14806. [2018-10-23 21:09:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14806 states. [2018-10-23 21:09:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14806 states to 14806 states and 23042 transitions. [2018-10-23 21:09:15,166 INFO L78 Accepts]: Start accepts. Automaton has 14806 states and 23042 transitions. Word has length 23 [2018-10-23 21:09:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:09:15,167 INFO L481 AbstractCegarLoop]: Abstraction has 14806 states and 23042 transitions. [2018-10-23 21:09:15,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:09:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 14806 states and 23042 transitions. [2018-10-23 21:09:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-23 21:09:15,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:09:15,168 INFO L375 BasicCegarLoop]: 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] [2018-10-23 21:09:15,168 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:09:15,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:09:15,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1288932026, now seen corresponding path program 1 times [2018-10-23 21:09:15,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:09:15,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:09:15,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:15,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:09:15,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:09:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:09:15,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:09:15,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:09:15,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:09:15,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:09:15,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:09:15,331 INFO L87 Difference]: Start difference. First operand 14806 states and 23042 transitions. Second operand 3 states. [2018-10-23 21:09:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:09:22,925 INFO L93 Difference]: Finished difference Result 37336 states and 57904 transitions. [2018-10-23 21:09:22,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:09:22,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-23 21:09:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:09:22,963 INFO L225 Difference]: With dead ends: 37336 [2018-10-23 21:09:22,963 INFO L226 Difference]: Without dead ends: 22266 [2018-10-23 21:09:22,985 INFO L605 BasicCegarLoop]: 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-10-23 21:09:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22266 states. [2018-10-23 21:09:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22266 to 21072. [2018-10-23 21:09:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21072 states. [2018-10-23 21:09:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21072 states to 21072 states and 32684 transitions. [2018-10-23 21:09:23,324 INFO L78 Accepts]: Start accepts. Automaton has 21072 states and 32684 transitions. Word has length 25 [2018-10-23 21:09:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:09:23,325 INFO L481 AbstractCegarLoop]: Abstraction has 21072 states and 32684 transitions. [2018-10-23 21:09:23,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:09:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 21072 states and 32684 transitions. [2018-10-23 21:09:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-23 21:09:23,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:09:23,326 INFO L375 BasicCegarLoop]: 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, 1, 1, 1, 1] [2018-10-23 21:09:23,326 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:09:23,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:09:23,327 INFO L82 PathProgramCache]: Analyzing trace with hash -850520380, now seen corresponding path program 1 times [2018-10-23 21:09:23,327 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:09:23,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:09:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:23,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:09:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:09:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:09:23,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:09:23,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:09:23,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:09:23,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:09:23,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:09:23,457 INFO L87 Difference]: Start difference. First operand 21072 states and 32684 transitions. Second operand 3 states. [2018-10-23 21:09:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:09:31,167 INFO L93 Difference]: Finished difference Result 63170 states and 97974 transitions. [2018-10-23 21:09:31,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:09:31,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-23 21:09:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:09:31,259 INFO L225 Difference]: With dead ends: 63170 [2018-10-23 21:09:31,260 INFO L226 Difference]: Without dead ends: 42106 [2018-10-23 21:09:31,287 INFO L605 BasicCegarLoop]: 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-10-23 21:09:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42106 states. [2018-10-23 21:09:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42106 to 40080. [2018-10-23 21:09:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40080 states. [2018-10-23 21:09:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40080 states to 40080 states and 63058 transitions. [2018-10-23 21:09:32,451 INFO L78 Accepts]: Start accepts. Automaton has 40080 states and 63058 transitions. Word has length 30 [2018-10-23 21:09:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:09:32,451 INFO L481 AbstractCegarLoop]: Abstraction has 40080 states and 63058 transitions. [2018-10-23 21:09:32,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:09:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 40080 states and 63058 transitions. [2018-10-23 21:09:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-23 21:09:32,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:09:32,456 INFO L375 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:09:32,456 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:09:32,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:09:32,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1737047031, now seen corresponding path program 1 times [2018-10-23 21:09:32,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:09:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:09:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:32,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:09:32,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:09:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:09:32,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:09:32,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:09:32,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:09:32,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:09:32,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:09:32,587 INFO L87 Difference]: Start difference. First operand 40080 states and 63058 transitions. Second operand 3 states. [2018-10-23 21:09:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:09:37,238 INFO L93 Difference]: Finished difference Result 107942 states and 170044 transitions. [2018-10-23 21:09:37,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:09:37,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-23 21:09:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:09:37,356 INFO L225 Difference]: With dead ends: 107942 [2018-10-23 21:09:37,357 INFO L226 Difference]: Without dead ends: 67822 [2018-10-23 21:09:37,402 INFO L605 BasicCegarLoop]: 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-10-23 21:09:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67822 states. [2018-10-23 21:09:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67822 to 66148. [2018-10-23 21:09:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66148 states. [2018-10-23 21:09:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66148 states to 66148 states and 104778 transitions. [2018-10-23 21:09:38,257 INFO L78 Accepts]: Start accepts. Automaton has 66148 states and 104778 transitions. Word has length 39 [2018-10-23 21:09:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:09:38,257 INFO L481 AbstractCegarLoop]: Abstraction has 66148 states and 104778 transitions. [2018-10-23 21:09:38,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:09:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 66148 states and 104778 transitions. [2018-10-23 21:09:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-23 21:09:38,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:09:38,259 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:09:38,259 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:09:38,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:09:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash -751694899, now seen corresponding path program 1 times [2018-10-23 21:09:38,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:09:38,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:09:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:38,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:09:38,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:09:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 21:09:38,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:09:38,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:09:38,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:09:38,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:09:38,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:09:38,373 INFO L87 Difference]: Start difference. First operand 66148 states and 104778 transitions. Second operand 3 states. [2018-10-23 21:09:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:09:40,756 INFO L93 Difference]: Finished difference Result 132340 states and 209618 transitions. [2018-10-23 21:09:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:09:40,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-23 21:09:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:09:40,852 INFO L225 Difference]: With dead ends: 132340 [2018-10-23 21:09:40,852 INFO L226 Difference]: Without dead ends: 66200 [2018-10-23 21:09:40,902 INFO L605 BasicCegarLoop]: 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-10-23 21:09:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66200 states. [2018-10-23 21:09:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66200 to 66198. [2018-10-23 21:09:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66198 states. [2018-10-23 21:09:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66198 states to 66198 states and 104828 transitions. [2018-10-23 21:09:42,452 INFO L78 Accepts]: Start accepts. Automaton has 66198 states and 104828 transitions. Word has length 43 [2018-10-23 21:09:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:09:42,453 INFO L481 AbstractCegarLoop]: Abstraction has 66198 states and 104828 transitions. [2018-10-23 21:09:42,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:09:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 66198 states and 104828 transitions. [2018-10-23 21:09:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-23 21:09:42,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:09:42,454 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:09:42,455 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:09:42,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:09:42,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1571673310, now seen corresponding path program 1 times [2018-10-23 21:09:42,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:09:42,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:09:42,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:42,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:09:42,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:09:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:09:42,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:09:42,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 21:09:42,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 21:09:42,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 21:09:42,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 21:09:42,579 INFO L87 Difference]: Start difference. First operand 66198 states and 104828 transitions. Second operand 4 states. [2018-10-23 21:09:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:09:50,907 INFO L93 Difference]: Finished difference Result 126785 states and 200685 transitions. [2018-10-23 21:09:50,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 21:09:50,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-10-23 21:09:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:09:51,002 INFO L225 Difference]: With dead ends: 126785 [2018-10-23 21:09:51,002 INFO L226 Difference]: Without dead ends: 66492 [2018-10-23 21:09:51,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 21:09:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66492 states. [2018-10-23 21:09:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66492 to 63918. [2018-10-23 21:09:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63918 states. [2018-10-23 21:09:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63918 states to 63918 states and 99848 transitions. [2018-10-23 21:09:52,949 INFO L78 Accepts]: Start accepts. Automaton has 63918 states and 99848 transitions. Word has length 52 [2018-10-23 21:09:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:09:52,949 INFO L481 AbstractCegarLoop]: Abstraction has 63918 states and 99848 transitions. [2018-10-23 21:09:52,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 21:09:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 63918 states and 99848 transitions. [2018-10-23 21:09:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-23 21:09:52,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:09:52,950 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:09:52,951 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:09:52,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:09:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1501422595, now seen corresponding path program 1 times [2018-10-23 21:09:52,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:09:52,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:09:52,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:52,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:09:52,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:09:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 21:09:53,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:09:53,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:09:53,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:09:53,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:09:53,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:09:53,052 INFO L87 Difference]: Start difference. First operand 63918 states and 99848 transitions. Second operand 3 states. [2018-10-23 21:09:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:09:55,140 INFO L93 Difference]: Finished difference Result 127890 states and 199778 transitions. [2018-10-23 21:09:55,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:09:55,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-10-23 21:09:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:09:55,220 INFO L225 Difference]: With dead ends: 127890 [2018-10-23 21:09:55,220 INFO L226 Difference]: Without dead ends: 63980 [2018-10-23 21:09:55,257 INFO L605 BasicCegarLoop]: 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-10-23 21:09:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63980 states. [2018-10-23 21:09:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63980 to 63978. [2018-10-23 21:09:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63978 states. [2018-10-23 21:09:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63978 states to 63978 states and 99908 transitions. [2018-10-23 21:09:55,823 INFO L78 Accepts]: Start accepts. Automaton has 63978 states and 99908 transitions. Word has length 53 [2018-10-23 21:09:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:09:55,823 INFO L481 AbstractCegarLoop]: Abstraction has 63978 states and 99908 transitions. [2018-10-23 21:09:55,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:09:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 63978 states and 99908 transitions. [2018-10-23 21:09:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-23 21:09:55,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:09:55,825 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:09:55,825 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:09:55,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:09:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash 202272896, now seen corresponding path program 1 times [2018-10-23 21:09:55,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:09:55,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:09:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:55,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:09:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:09:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:09:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 21:09:55,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:09:55,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 21:09:55,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 21:09:55,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 21:09:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 21:09:55,925 INFO L87 Difference]: Start difference. First operand 63978 states and 99908 transitions. Second operand 4 states. [2018-10-23 21:10:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:02,347 INFO L93 Difference]: Finished difference Result 116798 states and 181838 transitions. [2018-10-23 21:10:02,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:02,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-10-23 21:10:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:02,456 INFO L225 Difference]: With dead ends: 116798 [2018-10-23 21:10:02,456 INFO L226 Difference]: Without dead ends: 64988 [2018-10-23 21:10:02,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 21:10:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64988 states. [2018-10-23 21:10:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64988 to 63722. [2018-10-23 21:10:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63722 states. [2018-10-23 21:10:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63722 states to 63722 states and 98884 transitions. [2018-10-23 21:10:03,217 INFO L78 Accepts]: Start accepts. Automaton has 63722 states and 98884 transitions. Word has length 58 [2018-10-23 21:10:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:03,218 INFO L481 AbstractCegarLoop]: Abstraction has 63722 states and 98884 transitions. [2018-10-23 21:10:03,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 21:10:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 63722 states and 98884 transitions. [2018-10-23 21:10:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-23 21:10:03,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:03,219 INFO L375 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:03,219 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:03,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1537843893, now seen corresponding path program 1 times [2018-10-23 21:10:03,220 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:03,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:03,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:03,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:10:03,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:03,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:03,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:03,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:03,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:03,355 INFO L87 Difference]: Start difference. First operand 63722 states and 98884 transitions. Second operand 3 states. [2018-10-23 21:10:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:09,887 INFO L93 Difference]: Finished difference Result 129850 states and 200364 transitions. [2018-10-23 21:10:09,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:09,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-10-23 21:10:09,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:09,970 INFO L225 Difference]: With dead ends: 129850 [2018-10-23 21:10:09,971 INFO L226 Difference]: Without dead ends: 66096 [2018-10-23 21:10:10,014 INFO L605 BasicCegarLoop]: 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-10-23 21:10:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66096 states. [2018-10-23 21:10:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66096 to 63402. [2018-10-23 21:10:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63402 states. [2018-10-23 21:10:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63402 states to 63402 states and 98164 transitions. [2018-10-23 21:10:10,650 INFO L78 Accepts]: Start accepts. Automaton has 63402 states and 98164 transitions. Word has length 64 [2018-10-23 21:10:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:10,651 INFO L481 AbstractCegarLoop]: Abstraction has 63402 states and 98164 transitions. [2018-10-23 21:10:10,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 63402 states and 98164 transitions. [2018-10-23 21:10:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-23 21:10:10,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:10,652 INFO L375 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:10,653 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:10,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash -106919386, now seen corresponding path program 1 times [2018-10-23 21:10:10,653 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:10,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:10,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:10,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:10,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:10:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:10,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:10,835 INFO L87 Difference]: Start difference. First operand 63402 states and 98164 transitions. Second operand 3 states. [2018-10-23 21:10:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:17,782 INFO L93 Difference]: Finished difference Result 91358 states and 140318 transitions. [2018-10-23 21:10:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:17,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-10-23 21:10:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:17,855 INFO L225 Difference]: With dead ends: 91358 [2018-10-23 21:10:17,855 INFO L226 Difference]: Without dead ends: 64708 [2018-10-23 21:10:17,882 INFO L605 BasicCegarLoop]: 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-10-23 21:10:17,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64708 states. [2018-10-23 21:10:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64708 to 63410. [2018-10-23 21:10:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63410 states. [2018-10-23 21:10:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63410 states to 63410 states and 98092 transitions. [2018-10-23 21:10:18,448 INFO L78 Accepts]: Start accepts. Automaton has 63410 states and 98092 transitions. Word has length 74 [2018-10-23 21:10:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:18,448 INFO L481 AbstractCegarLoop]: Abstraction has 63410 states and 98092 transitions. [2018-10-23 21:10:18,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 63410 states and 98092 transitions. [2018-10-23 21:10:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-23 21:10:18,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:18,450 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:18,450 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:18,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:18,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1408861189, now seen corresponding path program 1 times [2018-10-23 21:10:18,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:18,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:18,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:18,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:18,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 21:10:18,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:18,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:18,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:18,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:18,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:18,573 INFO L87 Difference]: Start difference. First operand 63410 states and 98092 transitions. Second operand 3 states. [2018-10-23 21:10:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:20,147 INFO L93 Difference]: Finished difference Result 121045 states and 187238 transitions. [2018-10-23 21:10:20,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:20,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-10-23 21:10:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:20,223 INFO L225 Difference]: With dead ends: 121045 [2018-10-23 21:10:20,224 INFO L226 Difference]: Without dead ends: 57643 [2018-10-23 21:10:20,268 INFO L605 BasicCegarLoop]: 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-10-23 21:10:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57643 states. [2018-10-23 21:10:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57643 to 57641. [2018-10-23 21:10:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57641 states. [2018-10-23 21:10:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57641 states to 57641 states and 89114 transitions. [2018-10-23 21:10:21,161 INFO L78 Accepts]: Start accepts. Automaton has 57641 states and 89114 transitions. Word has length 81 [2018-10-23 21:10:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:21,161 INFO L481 AbstractCegarLoop]: Abstraction has 57641 states and 89114 transitions. [2018-10-23 21:10:21,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 57641 states and 89114 transitions. [2018-10-23 21:10:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-23 21:10:21,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:21,162 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:21,163 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:21,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1579885087, now seen corresponding path program 1 times [2018-10-23 21:10:21,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:21,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:21,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:21,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:21,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 21:10:21,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:21,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:21,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:21,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:21,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:21,279 INFO L87 Difference]: Start difference. First operand 57641 states and 89114 transitions. Second operand 3 states. [2018-10-23 21:10:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:23,487 INFO L93 Difference]: Finished difference Result 114966 states and 177748 transitions. [2018-10-23 21:10:23,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:23,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-23 21:10:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:23,564 INFO L225 Difference]: With dead ends: 114966 [2018-10-23 21:10:23,564 INFO L226 Difference]: Without dead ends: 57723 [2018-10-23 21:10:23,600 INFO L605 BasicCegarLoop]: 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-10-23 21:10:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57723 states. [2018-10-23 21:10:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57723 to 57721. [2018-10-23 21:10:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57721 states. [2018-10-23 21:10:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57721 states to 57721 states and 89194 transitions. [2018-10-23 21:10:24,178 INFO L78 Accepts]: Start accepts. Automaton has 57721 states and 89194 transitions. Word has length 84 [2018-10-23 21:10:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:24,178 INFO L481 AbstractCegarLoop]: Abstraction has 57721 states and 89194 transitions. [2018-10-23 21:10:24,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 57721 states and 89194 transitions. [2018-10-23 21:10:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-23 21:10:24,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:24,180 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:24,180 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:24,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash 134709906, now seen corresponding path program 1 times [2018-10-23 21:10:24,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:24,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:24,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:24,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:24,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:10:24,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:24,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 21:10:24,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 21:10:24,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 21:10:24,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 21:10:24,540 INFO L87 Difference]: Start difference. First operand 57721 states and 89194 transitions. Second operand 4 states. [2018-10-23 21:10:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:31,774 INFO L93 Difference]: Finished difference Result 82679 states and 126797 transitions. [2018-10-23 21:10:31,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 21:10:31,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-10-23 21:10:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:31,817 INFO L225 Difference]: With dead ends: 82679 [2018-10-23 21:10:31,817 INFO L226 Difference]: Without dead ends: 36250 [2018-10-23 21:10:31,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 21:10:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36250 states. [2018-10-23 21:10:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36250 to 35099. [2018-10-23 21:10:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35099 states. [2018-10-23 21:10:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35099 states to 35099 states and 53383 transitions. [2018-10-23 21:10:32,165 INFO L78 Accepts]: Start accepts. Automaton has 35099 states and 53383 transitions. Word has length 88 [2018-10-23 21:10:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:32,165 INFO L481 AbstractCegarLoop]: Abstraction has 35099 states and 53383 transitions. [2018-10-23 21:10:32,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 21:10:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 35099 states and 53383 transitions. [2018-10-23 21:10:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-23 21:10:32,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:32,167 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:32,167 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:32,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:32,167 INFO L82 PathProgramCache]: Analyzing trace with hash 961940546, now seen corresponding path program 1 times [2018-10-23 21:10:32,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:32,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:32,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:32,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:32,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:32,364 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-23 21:10:32,527 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-23 21:10:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:10:32,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:32,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 21:10:32,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 21:10:32,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 21:10:32,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 21:10:32,556 INFO L87 Difference]: Start difference. First operand 35099 states and 53383 transitions. Second operand 4 states. [2018-10-23 21:10:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:39,540 INFO L93 Difference]: Finished difference Result 48617 states and 72988 transitions. [2018-10-23 21:10:39,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 21:10:39,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-10-23 21:10:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:39,569 INFO L225 Difference]: With dead ends: 48617 [2018-10-23 21:10:39,569 INFO L226 Difference]: Without dead ends: 24950 [2018-10-23 21:10:39,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 21:10:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24950 states. [2018-10-23 21:10:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24950 to 23799. [2018-10-23 21:10:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23799 states. [2018-10-23 21:10:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23799 states to 23799 states and 35861 transitions. [2018-10-23 21:10:39,795 INFO L78 Accepts]: Start accepts. Automaton has 23799 states and 35861 transitions. Word has length 90 [2018-10-23 21:10:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:39,795 INFO L481 AbstractCegarLoop]: Abstraction has 23799 states and 35861 transitions. [2018-10-23 21:10:39,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 21:10:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 23799 states and 35861 transitions. [2018-10-23 21:10:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-23 21:10:39,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:39,797 INFO L375 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:39,797 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:39,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:39,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1610003192, now seen corresponding path program 1 times [2018-10-23 21:10:39,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:39,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:39,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:39,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 21:10:39,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:39,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:39,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:39,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:39,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:39,901 INFO L87 Difference]: Start difference. First operand 23799 states and 35861 transitions. Second operand 3 states. [2018-10-23 21:10:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:41,304 INFO L93 Difference]: Finished difference Result 24574 states and 36974 transitions. [2018-10-23 21:10:41,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:41,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-23 21:10:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:41,334 INFO L225 Difference]: With dead ends: 24574 [2018-10-23 21:10:41,334 INFO L226 Difference]: Without dead ends: 24572 [2018-10-23 21:10:41,342 INFO L605 BasicCegarLoop]: 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-10-23 21:10:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24572 states. [2018-10-23 21:10:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24572 to 24570. [2018-10-23 21:10:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24570 states. [2018-10-23 21:10:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24570 states to 24570 states and 36964 transitions. [2018-10-23 21:10:41,576 INFO L78 Accepts]: Start accepts. Automaton has 24570 states and 36964 transitions. Word has length 98 [2018-10-23 21:10:41,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:41,576 INFO L481 AbstractCegarLoop]: Abstraction has 24570 states and 36964 transitions. [2018-10-23 21:10:41,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 24570 states and 36964 transitions. [2018-10-23 21:10:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-23 21:10:41,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:41,579 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:41,579 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:41,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:41,579 INFO L82 PathProgramCache]: Analyzing trace with hash 651727635, now seen corresponding path program 1 times [2018-10-23 21:10:41,579 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:41,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:41,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:41,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:41,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 21:10:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:41,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:41,698 INFO L87 Difference]: Start difference. First operand 24570 states and 36964 transitions. Second operand 3 states. [2018-10-23 21:10:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:43,908 INFO L93 Difference]: Finished difference Result 42966 states and 64448 transitions. [2018-10-23 21:10:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:43,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-10-23 21:10:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:43,928 INFO L225 Difference]: With dead ends: 42966 [2018-10-23 21:10:43,928 INFO L226 Difference]: Without dead ends: 19565 [2018-10-23 21:10:43,942 INFO L605 BasicCegarLoop]: 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-10-23 21:10:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19565 states. [2018-10-23 21:10:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19565 to 19563. [2018-10-23 21:10:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19563 states. [2018-10-23 21:10:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19563 states to 19563 states and 29149 transitions. [2018-10-23 21:10:44,106 INFO L78 Accepts]: Start accepts. Automaton has 19563 states and 29149 transitions. Word has length 114 [2018-10-23 21:10:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:44,107 INFO L481 AbstractCegarLoop]: Abstraction has 19563 states and 29149 transitions. [2018-10-23 21:10:44,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 19563 states and 29149 transitions. [2018-10-23 21:10:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-23 21:10:44,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:44,110 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:44,110 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:44,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1517850476, now seen corresponding path program 1 times [2018-10-23 21:10:44,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:44,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:44,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-23 21:10:44,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:44,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:44,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:44,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:44,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:44,224 INFO L87 Difference]: Start difference. First operand 19563 states and 29149 transitions. Second operand 3 states. [2018-10-23 21:10:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:45,468 INFO L93 Difference]: Finished difference Result 36148 states and 53944 transitions. [2018-10-23 21:10:45,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:45,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-23 21:10:45,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:45,495 INFO L225 Difference]: With dead ends: 36148 [2018-10-23 21:10:45,495 INFO L226 Difference]: Without dead ends: 17944 [2018-10-23 21:10:45,508 INFO L605 BasicCegarLoop]: 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-10-23 21:10:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17944 states. [2018-10-23 21:10:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17944 to 17942. [2018-10-23 21:10:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17942 states. [2018-10-23 21:10:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17942 states to 17942 states and 26733 transitions. [2018-10-23 21:10:45,661 INFO L78 Accepts]: Start accepts. Automaton has 17942 states and 26733 transitions. Word has length 136 [2018-10-23 21:10:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:45,661 INFO L481 AbstractCegarLoop]: Abstraction has 17942 states and 26733 transitions. [2018-10-23 21:10:45,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 17942 states and 26733 transitions. [2018-10-23 21:10:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-23 21:10:45,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:45,664 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:45,665 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:45,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1952452209, now seen corresponding path program 1 times [2018-10-23 21:10:45,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:45,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:45,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:45,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:45,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-23 21:10:45,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:45,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:45,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:45,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:45,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:45,795 INFO L87 Difference]: Start difference. First operand 17942 states and 26733 transitions. Second operand 3 states. [2018-10-23 21:10:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:46,939 INFO L93 Difference]: Finished difference Result 29250 states and 43528 transitions. [2018-10-23 21:10:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:46,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-23 21:10:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:46,955 INFO L225 Difference]: With dead ends: 29250 [2018-10-23 21:10:46,955 INFO L226 Difference]: Without dead ends: 13058 [2018-10-23 21:10:46,968 INFO L605 BasicCegarLoop]: 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-10-23 21:10:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13058 states. [2018-10-23 21:10:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13058 to 13056. [2018-10-23 21:10:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13056 states. [2018-10-23 21:10:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13056 states to 13056 states and 19298 transitions. [2018-10-23 21:10:47,090 INFO L78 Accepts]: Start accepts. Automaton has 13056 states and 19298 transitions. Word has length 138 [2018-10-23 21:10:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:47,090 INFO L481 AbstractCegarLoop]: Abstraction has 13056 states and 19298 transitions. [2018-10-23 21:10:47,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 13056 states and 19298 transitions. [2018-10-23 21:10:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-23 21:10:47,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:47,093 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:47,093 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:47,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:47,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1040592206, now seen corresponding path program 1 times [2018-10-23 21:10:47,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:47,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:47,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-23 21:10:47,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:47,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:47,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:47,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:47,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:47,244 INFO L87 Difference]: Start difference. First operand 13056 states and 19298 transitions. Second operand 3 states. [2018-10-23 21:10:48,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:48,717 INFO L93 Difference]: Finished difference Result 23526 states and 34853 transitions. [2018-10-23 21:10:48,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:48,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-10-23 21:10:48,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:48,730 INFO L225 Difference]: With dead ends: 23526 [2018-10-23 21:10:48,730 INFO L226 Difference]: Without dead ends: 12415 [2018-10-23 21:10:48,740 INFO L605 BasicCegarLoop]: 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-10-23 21:10:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12415 states. [2018-10-23 21:10:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12415 to 12413. [2018-10-23 21:10:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12413 states. [2018-10-23 21:10:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 18332 transitions. [2018-10-23 21:10:48,839 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 18332 transitions. Word has length 144 [2018-10-23 21:10:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:48,839 INFO L481 AbstractCegarLoop]: Abstraction has 12413 states and 18332 transitions. [2018-10-23 21:10:48,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 18332 transitions. [2018-10-23 21:10:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-23 21:10:48,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:48,841 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:48,842 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:48,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:48,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1253431981, now seen corresponding path program 1 times [2018-10-23 21:10:48,842 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:48,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:48,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:48,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:48,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-23 21:10:48,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:48,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:48,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:48,976 INFO L87 Difference]: Start difference. First operand 12413 states and 18332 transitions. Second operand 3 states. [2018-10-23 21:10:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:50,136 INFO L93 Difference]: Finished difference Result 22913 states and 33911 transitions. [2018-10-23 21:10:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:50,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-23 21:10:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:50,149 INFO L225 Difference]: With dead ends: 22913 [2018-10-23 21:10:50,149 INFO L226 Difference]: Without dead ends: 12445 [2018-10-23 21:10:50,157 INFO L605 BasicCegarLoop]: 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-10-23 21:10:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12445 states. [2018-10-23 21:10:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12445 to 12443. [2018-10-23 21:10:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12443 states. [2018-10-23 21:10:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12443 states to 12443 states and 18362 transitions. [2018-10-23 21:10:50,258 INFO L78 Accepts]: Start accepts. Automaton has 12443 states and 18362 transitions. Word has length 148 [2018-10-23 21:10:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:50,259 INFO L481 AbstractCegarLoop]: Abstraction has 12443 states and 18362 transitions. [2018-10-23 21:10:50,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 12443 states and 18362 transitions. [2018-10-23 21:10:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-23 21:10:50,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:50,261 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:50,262 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:50,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:50,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1776030124, now seen corresponding path program 1 times [2018-10-23 21:10:50,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:50,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:50,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:50,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:50,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-23 21:10:50,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:50,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:50,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:50,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:50,403 INFO L87 Difference]: Start difference. First operand 12443 states and 18362 transitions. Second operand 3 states. [2018-10-23 21:10:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:51,290 INFO L93 Difference]: Finished difference Result 20615 states and 30499 transitions. [2018-10-23 21:10:51,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:51,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-10-23 21:10:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:51,300 INFO L225 Difference]: With dead ends: 20615 [2018-10-23 21:10:51,300 INFO L226 Difference]: Without dead ends: 10117 [2018-10-23 21:10:51,308 INFO L605 BasicCegarLoop]: 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-10-23 21:10:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2018-10-23 21:10:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 10115. [2018-10-23 21:10:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10115 states. [2018-10-23 21:10:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10115 states to 10115 states and 14912 transitions. [2018-10-23 21:10:51,392 INFO L78 Accepts]: Start accepts. Automaton has 10115 states and 14912 transitions. Word has length 178 [2018-10-23 21:10:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:51,392 INFO L481 AbstractCegarLoop]: Abstraction has 10115 states and 14912 transitions. [2018-10-23 21:10:51,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 10115 states and 14912 transitions. [2018-10-23 21:10:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-23 21:10:51,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:51,395 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:51,395 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:51,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1547707242, now seen corresponding path program 1 times [2018-10-23 21:10:51,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:51,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:51,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 21:10:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-23 21:10:51,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 21:10:51,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 21:10:51,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 21:10:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 21:10:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 21:10:51,534 INFO L87 Difference]: Start difference. First operand 10115 states and 14912 transitions. Second operand 3 states. [2018-10-23 21:10:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 21:10:51,897 INFO L93 Difference]: Finished difference Result 10521 states and 15481 transitions. [2018-10-23 21:10:51,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 21:10:51,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-23 21:10:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 21:10:51,900 INFO L225 Difference]: With dead ends: 10521 [2018-10-23 21:10:51,900 INFO L226 Difference]: Without dead ends: 2357 [2018-10-23 21:10:51,904 INFO L605 BasicCegarLoop]: 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-10-23 21:10:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2018-10-23 21:10:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2355. [2018-10-23 21:10:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2018-10-23 21:10:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3359 transitions. [2018-10-23 21:10:51,923 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3359 transitions. Word has length 183 [2018-10-23 21:10:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 21:10:51,923 INFO L481 AbstractCegarLoop]: Abstraction has 2355 states and 3359 transitions. [2018-10-23 21:10:51,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 21:10:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3359 transitions. [2018-10-23 21:10:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-23 21:10:51,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 21:10:51,926 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 21:10:51,926 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 21:10:51,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 21:10:51,926 INFO L82 PathProgramCache]: Analyzing trace with hash -554518260, now seen corresponding path program 1 times [2018-10-23 21:10:51,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 21:10:51,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 21:10:51,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:51,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 21:10:51,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 21:10:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-23 21:10:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-23 21:10:52,255 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-23 21:10:52,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:10:52 BoogieIcfgContainer [2018-10-23 21:10:52,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 21:10:52,476 INFO L168 Benchmark]: Toolchain (without parser) took 153836.70 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -240.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-23 21:10:52,476 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 21:10:52,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3652.05 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 478.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -425.3 MB). Peak memory consumption was 708.4 MB. Max. memory is 7.1 GB. [2018-10-23 21:10:52,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 1453.73 ms. Allocated memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: 581.4 MB). Free memory was 1.8 GB in the beginning and 2.3 GB in the end (delta: -514.8 MB). Peak memory consumption was 154.7 MB. Max. memory is 7.1 GB. [2018-10-23 21:10:52,479 INFO L168 Benchmark]: Boogie Preprocessor took 977.17 ms. Allocated memory is still 2.6 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 134.9 MB). Peak memory consumption was 134.9 MB. Max. memory is 7.1 GB. [2018-10-23 21:10:52,481 INFO L168 Benchmark]: RCFGBuilder took 28006.48 ms. Allocated memory was 2.6 GB in the beginning and 3.3 GB in the end (delta: 667.9 MB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -601.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-23 21:10:52,484 INFO L168 Benchmark]: TraceAbstraction took 119742.14 ms. Allocated memory was 3.3 GB in the beginning and 3.5 GB in the end (delta: 277.9 MB). Free memory was 2.8 GB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-23 21:10:52,491 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3652.05 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 478.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -425.3 MB). Peak memory consumption was 708.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 1453.73 ms. Allocated memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: 581.4 MB). Free memory was 1.8 GB in the beginning and 2.3 GB in the end (delta: -514.8 MB). Peak memory consumption was 154.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 977.17 ms. Allocated memory is still 2.6 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 134.9 MB). Peak memory consumption was 134.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 28006.48 ms. Allocated memory was 2.6 GB in the beginning and 3.3 GB in the end (delta: 667.9 MB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -601.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * TraceAbstraction took 119742.14 ms. Allocated memory was 3.3 GB in the beginning and 3.5 GB in the end (delta: 277.9 MB). Free memory was 2.8 GB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 49138]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_getInetAddress = 1; [L6] int m_getOOBInline = 2; [L7] int m_getLocalPort = 3; [L8] int m_isInputShutdown = 4; [L9] int m_setTcpNoDelay = 5; [L10] int m_isConnected = 6; [L11] int m_getKeepAlive = 7; [L12] int m_getLocalAddress = 8; [L13] int m_bind = 9; [L14] int m_getChannel = 10; [L15] int m_getSoLinger = 11; [L16] int m_getImpl = 12; [L17] int m_getTcpNoDelay = 13; [L18] int m_getSoTimeout = 14; [L19] int m_isOutputShutdown = 15; [L20] int m_postAccept = 16; [L21] int m_close = 17; [L22] int m_setOOBInline = 18; [L23] int m_getLocalSocketAddress = 19; [L24] int m_getReceiveBufferSize = 20; [L25] int m_setReuseAddress = 21; [L26] int m_getTrafficClass = 22; [L27] int m_getReuseAddress = 23; [L28] int m_createImpl = 24; [L29] int m_setCreated = 25; [L30] int m_setKeepAlive = 26; [L31] int m_getInputStream = 27; [L32] int m_shutdownOutput = 28; [L33] int m_shutdownInput = 29; [L34] int m_setPerformancePreferences = 30; [L35] int m_getPort = 31; [L36] int m_sendUrgentData = 32; [L37] int m_isClosed = 33; [L38] int m_isBound = 34; [L39] int m_setBound = 35; [L40] int m_getSendBufferSize = 36; [L41] int m_getOutputStream = 37; [L42] int m_setConnected = 38; [L43] int m_Socket = 39; [L44] int m_getRemoteSocketAddress = 40; [L45] int m_setReceiveBufferSize_1 = 41; [L46] int m_setReceiveBufferSize_2 = 42; [L47] int m_connect2_1 = 43; [L48] int m_connect2_2 = 44; [L49] int m_setSoLinger_1 = 45; [L50] int m_setSoLinger_2 = 46; [L51] int m_connect1_1 = 47; [L52] int m_connect1_2 = 48; [L53] int m_setTrafficClass_1 = 49; [L54] int m_setTrafficClass_2 = 50; [L55] int m_setSoTimeout_1 = 51; [L56] int m_setSoTimeout_2 = 52; [L57] int m_setSendBufferSize_1 = 53; [L58] int m_setSendBufferSize_2 = 54; [L59] int m_setSocketImplFactory_1 = 55; [L60] int m_setSocketImplFactory_2 = 56; VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L65] int q = 0; [L66] int method_id; [L69] int this_oldImpl = 0; [L70] int this_factory = 0; [L71] int this_shutOut = 0; [L72] int this_created = 0; [L73] int this_shutIn = 0; [L74] int this_closed = 0; [L75] int this_bound = 0; [L76] int this_impl = 1; [L77] int this_connected = 0; VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND TRUE q == 0 [L117] COND TRUE __VERIFIER_nondet_int() [L119] COND TRUE 1 [L121] method_id = 39 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L123] COND FALSE !(0) [L127] q = 2 [L129] this_factory=0 [L129] this_shutIn=0 [L129] this_connected=0 [L129] this_closed=0 [L129] this_shutOut=0 [L129] this_created=0 [L129] this_impl=1 [L129] this_bound=0 [L129] this_oldImpl=0 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND FALSE !(__VERIFIER_nondet_int()) [L2077] COND TRUE __VERIFIER_nondet_int() [L2079] COND TRUE !(P1 != 0) [L2081] method_id = 56 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L2083] COND FALSE !(((this_factory != 0) && !(P30 != 0))) [L2087] q = 2 [L2089] this_factory=P30 [L2089] this_shutIn=this_shutIn [L2089] this_connected=this_connected [L2089] this_closed=this_closed [L2089] this_shutOut=this_shutOut [L2089] this_created=this_created [L2089] this_impl=this_impl [L2089] this_bound=this_bound [L2089] this_oldImpl=this_oldImpl VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND TRUE __VERIFIER_nondet_int() [L2063] COND TRUE (P1 != 0) [L2065] method_id = 55 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L2067] COND TRUE ((this_factory != 0) && (P29 != 0)) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L49138] __VERIFIER_error() VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9211 locations, 1 error locations. UNSAFE Result, 119.6s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 102.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 310220 SDtfs, 209653 SDslu, 202611 SDs, 0 SdLazy, 56858 SolverSat, 21884 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66198occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 12.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 16312 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2206 NumberOfCodeBlocks, 2206 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1991 ConstructedInterpolants, 0 QuantifiedInterpolants, 502323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 214/214 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...