java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:48:11,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:48:11,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:48:11,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:48:11,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:48:11,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:48:11,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:48:11,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:48:11,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:48:11,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:48:11,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:48:11,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:48:11,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:48:11,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:48:11,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:48:11,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:48:11,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:48:11,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:48:11,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:48:11,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:48:11,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:48:11,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:48:11,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:48:11,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:48:11,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:48:11,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:48:11,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:48:11,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:48:11,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:48:11,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:48:11,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:48:11,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:48:11,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:48:11,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:48:11,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:48:11,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:48:11,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:48:11,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:48:11,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:48:11,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:48:11,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:48:11,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:48:11,334 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:48:11,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:48:11,335 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:48:11,335 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:48:11,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:48:11,336 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:48:11,336 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:48:11,337 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:48:11,337 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:48:11,337 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:48:11,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:48:11,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:48:11,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:48:11,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:48:11,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:48:11,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:48:11,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:48:11,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:48:11,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:48:11,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:48:11,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:48:11,342 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:48:11,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:48:11,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:48:11,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:48:11,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:48:11,343 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:48:11,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:48:11,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:48:11,343 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:48:11,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:48:11,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:48:11,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:48:11,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:48:11,418 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:48:11,419 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-10 06:48:11,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a3d46ee/c4249dd011a447a6bfc157de5379d0d9/FLAG86aea0d16 [2019-09-10 06:48:12,095 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:48:12,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-10 06:48:12,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a3d46ee/c4249dd011a447a6bfc157de5379d0d9/FLAG86aea0d16 [2019-09-10 06:48:12,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a3d46ee/c4249dd011a447a6bfc157de5379d0d9 [2019-09-10 06:48:12,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:48:12,360 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:48:12,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:48:12,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:48:12,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:48:12,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:48:12" (1/1) ... [2019-09-10 06:48:12,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f0e126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:12, skipping insertion in model container [2019-09-10 06:48:12,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:48:12" (1/1) ... [2019-09-10 06:48:12,377 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:48:12,453 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:48:12,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:48:12,996 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:48:13,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:48:13,458 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:48:13,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:13 WrapperNode [2019-09-10 06:48:13,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:48:13,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:48:13,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:48:13,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:48:13,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:13" (1/1) ... [2019-09-10 06:48:13,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:13" (1/1) ... [2019-09-10 06:48:13,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:13" (1/1) ... [2019-09-10 06:48:13,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:13" (1/1) ... [2019-09-10 06:48:13,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:13" (1/1) ... [2019-09-10 06:48:13,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:13" (1/1) ... [2019-09-10 06:48:13,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:13" (1/1) ... [2019-09-10 06:48:13,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:48:13,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:48:13,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:48:13,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:48:13,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-10 06:48:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:48:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:48:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:48:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:48:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:48:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:48:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:48:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:48:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:48:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:48:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:48:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:48:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:48:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:48:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:48:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:48:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:48:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:48:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:48:15,218 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:48:15,219 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:48:15,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:48:15 BoogieIcfgContainer [2019-09-10 06:48:15,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:48:15,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:48:15,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:48:15,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:48:15,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:48:12" (1/3) ... [2019-09-10 06:48:15,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756b4926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:48:15, skipping insertion in model container [2019-09-10 06:48:15,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:13" (2/3) ... [2019-09-10 06:48:15,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756b4926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:48:15, skipping insertion in model container [2019-09-10 06:48:15,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:48:15" (3/3) ... [2019-09-10 06:48:15,228 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-10 06:48:15,238 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:48:15,246 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:48:15,262 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:48:15,288 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:48:15,289 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:48:15,289 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:48:15,289 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:48:15,289 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:48:15,289 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:48:15,289 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:48:15,290 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:48:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states. [2019-09-10 06:48:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:48:15,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:15,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:15,343 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:15,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash -718035537, now seen corresponding path program 1 times [2019-09-10 06:48:15,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:15,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:15,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:15,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:15,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:15,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:15,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:48:15,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:15,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:48:15,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:48:15,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:48:15,836 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 4 states. [2019-09-10 06:48:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:16,035 INFO L93 Difference]: Finished difference Result 435 states and 702 transitions. [2019-09-10 06:48:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:16,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 06:48:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:16,055 INFO L225 Difference]: With dead ends: 435 [2019-09-10 06:48:16,056 INFO L226 Difference]: Without dead ends: 425 [2019-09-10 06:48:16,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-09-10 06:48:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2019-09-10 06:48:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-10 06:48:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 660 transitions. [2019-09-10 06:48:16,128 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 660 transitions. Word has length 111 [2019-09-10 06:48:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:16,129 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 660 transitions. [2019-09-10 06:48:16,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:48:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 660 transitions. [2019-09-10 06:48:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 06:48:16,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:16,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:16,134 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1172631640, now seen corresponding path program 1 times [2019-09-10 06:48:16,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:16,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:16,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:16,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:16,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:16,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:16,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:16,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:16,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:16,390 INFO L87 Difference]: Start difference. First operand 425 states and 660 transitions. Second operand 3 states. [2019-09-10 06:48:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:16,461 INFO L93 Difference]: Finished difference Result 669 states and 1043 transitions. [2019-09-10 06:48:16,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:16,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-09-10 06:48:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:16,467 INFO L225 Difference]: With dead ends: 669 [2019-09-10 06:48:16,468 INFO L226 Difference]: Without dead ends: 669 [2019-09-10 06:48:16,468 INFO L628 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 [2019-09-10 06:48:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-09-10 06:48:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 667. [2019-09-10 06:48:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-09-10 06:48:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1042 transitions. [2019-09-10 06:48:16,513 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1042 transitions. Word has length 134 [2019-09-10 06:48:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:16,513 INFO L475 AbstractCegarLoop]: Abstraction has 667 states and 1042 transitions. [2019-09-10 06:48:16,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1042 transitions. [2019-09-10 06:48:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 06:48:16,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:16,517 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:16,517 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:16,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:16,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1255398106, now seen corresponding path program 1 times [2019-09-10 06:48:16,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:16,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:16,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:16,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:16,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:16,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:16,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:16,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:16,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:16,650 INFO L87 Difference]: Start difference. First operand 667 states and 1042 transitions. Second operand 3 states. [2019-09-10 06:48:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:16,709 INFO L93 Difference]: Finished difference Result 1074 states and 1678 transitions. [2019-09-10 06:48:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:16,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-10 06:48:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:16,721 INFO L225 Difference]: With dead ends: 1074 [2019-09-10 06:48:16,721 INFO L226 Difference]: Without dead ends: 1074 [2019-09-10 06:48:16,721 INFO L628 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 [2019-09-10 06:48:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-09-10 06:48:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1072. [2019-09-10 06:48:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2019-09-10 06:48:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1677 transitions. [2019-09-10 06:48:16,764 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1677 transitions. Word has length 137 [2019-09-10 06:48:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:16,765 INFO L475 AbstractCegarLoop]: Abstraction has 1072 states and 1677 transitions. [2019-09-10 06:48:16,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1677 transitions. [2019-09-10 06:48:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 06:48:16,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:16,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:16,775 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:16,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1981911143, now seen corresponding path program 1 times [2019-09-10 06:48:16,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:16,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:16,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:16,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:16,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:16,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:16,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:16,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:16,889 INFO L87 Difference]: Start difference. First operand 1072 states and 1677 transitions. Second operand 3 states. [2019-09-10 06:48:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:16,978 INFO L93 Difference]: Finished difference Result 1721 states and 2680 transitions. [2019-09-10 06:48:16,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:16,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-10 06:48:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:16,989 INFO L225 Difference]: With dead ends: 1721 [2019-09-10 06:48:16,989 INFO L226 Difference]: Without dead ends: 1721 [2019-09-10 06:48:16,989 INFO L628 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 [2019-09-10 06:48:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-09-10 06:48:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1719. [2019-09-10 06:48:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-09-10 06:48:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2679 transitions. [2019-09-10 06:48:17,037 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2679 transitions. Word has length 140 [2019-09-10 06:48:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:17,038 INFO L475 AbstractCegarLoop]: Abstraction has 1719 states and 2679 transitions. [2019-09-10 06:48:17,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2679 transitions. [2019-09-10 06:48:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 06:48:17,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:17,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:17,044 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:17,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1296832615, now seen corresponding path program 1 times [2019-09-10 06:48:17,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:17,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:17,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:17,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:17,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:17,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:17,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:17,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:17,130 INFO L87 Difference]: Start difference. First operand 1719 states and 2679 transitions. Second operand 3 states. [2019-09-10 06:48:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:17,191 INFO L93 Difference]: Finished difference Result 2684 states and 4138 transitions. [2019-09-10 06:48:17,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:17,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-10 06:48:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:17,206 INFO L225 Difference]: With dead ends: 2684 [2019-09-10 06:48:17,206 INFO L226 Difference]: Without dead ends: 2684 [2019-09-10 06:48:17,206 INFO L628 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 [2019-09-10 06:48:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-09-10 06:48:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2682. [2019-09-10 06:48:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-09-10 06:48:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 4137 transitions. [2019-09-10 06:48:17,279 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 4137 transitions. Word has length 143 [2019-09-10 06:48:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:17,280 INFO L475 AbstractCegarLoop]: Abstraction has 2682 states and 4137 transitions. [2019-09-10 06:48:17,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 4137 transitions. [2019-09-10 06:48:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 06:48:17,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:17,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:17,289 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:17,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:17,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2024634528, now seen corresponding path program 1 times [2019-09-10 06:48:17,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:17,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:17,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:17,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:17,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:17,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:17,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:17,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:17,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:17,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:17,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:17,434 INFO L87 Difference]: Start difference. First operand 2682 states and 4137 transitions. Second operand 6 states. [2019-09-10 06:48:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:17,870 INFO L93 Difference]: Finished difference Result 11427 states and 17471 transitions. [2019-09-10 06:48:17,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:48:17,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-09-10 06:48:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:17,950 INFO L225 Difference]: With dead ends: 11427 [2019-09-10 06:48:17,950 INFO L226 Difference]: Without dead ends: 11427 [2019-09-10 06:48:17,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11427 states. [2019-09-10 06:48:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11427 to 5192. [2019-09-10 06:48:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5192 states. [2019-09-10 06:48:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5192 states to 5192 states and 7894 transitions. [2019-09-10 06:48:18,251 INFO L78 Accepts]: Start accepts. Automaton has 5192 states and 7894 transitions. Word has length 146 [2019-09-10 06:48:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:18,252 INFO L475 AbstractCegarLoop]: Abstraction has 5192 states and 7894 transitions. [2019-09-10 06:48:18,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5192 states and 7894 transitions. [2019-09-10 06:48:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 06:48:18,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:18,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:18,274 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:18,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:18,280 INFO L82 PathProgramCache]: Analyzing trace with hash -84299595, now seen corresponding path program 1 times [2019-09-10 06:48:18,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:18,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:18,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:18,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:18,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:18,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:18,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:18,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:18,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:18,397 INFO L87 Difference]: Start difference. First operand 5192 states and 7894 transitions. Second operand 3 states. [2019-09-10 06:48:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:18,518 INFO L93 Difference]: Finished difference Result 9735 states and 14654 transitions. [2019-09-10 06:48:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:18,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 06:48:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:18,589 INFO L225 Difference]: With dead ends: 9735 [2019-09-10 06:48:18,589 INFO L226 Difference]: Without dead ends: 9735 [2019-09-10 06:48:18,590 INFO L628 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 [2019-09-10 06:48:18,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2019-09-10 06:48:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9733. [2019-09-10 06:48:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9733 states. [2019-09-10 06:48:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14653 transitions. [2019-09-10 06:48:18,959 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14653 transitions. Word has length 150 [2019-09-10 06:48:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:18,959 INFO L475 AbstractCegarLoop]: Abstraction has 9733 states and 14653 transitions. [2019-09-10 06:48:18,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14653 transitions. [2019-09-10 06:48:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 06:48:18,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:18,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:18,994 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1868339546, now seen corresponding path program 1 times [2019-09-10 06:48:18,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:18,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:18,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:18,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:19,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:19,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:19,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:19,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:19,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:19,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:19,122 INFO L87 Difference]: Start difference. First operand 9733 states and 14653 transitions. Second operand 3 states. [2019-09-10 06:48:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:19,262 INFO L93 Difference]: Finished difference Result 17928 states and 26580 transitions. [2019-09-10 06:48:19,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:19,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 06:48:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:19,303 INFO L225 Difference]: With dead ends: 17928 [2019-09-10 06:48:19,303 INFO L226 Difference]: Without dead ends: 17928 [2019-09-10 06:48:19,304 INFO L628 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 [2019-09-10 06:48:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17928 states. [2019-09-10 06:48:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17928 to 17926. [2019-09-10 06:48:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17926 states. [2019-09-10 06:48:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17926 states to 17926 states and 26579 transitions. [2019-09-10 06:48:19,782 INFO L78 Accepts]: Start accepts. Automaton has 17926 states and 26579 transitions. Word has length 150 [2019-09-10 06:48:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:19,783 INFO L475 AbstractCegarLoop]: Abstraction has 17926 states and 26579 transitions. [2019-09-10 06:48:19,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 17926 states and 26579 transitions. [2019-09-10 06:48:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 06:48:19,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:19,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:19,831 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1275894777, now seen corresponding path program 1 times [2019-09-10 06:48:19,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:19,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:19,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:19,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:19,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:19,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:19,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:19,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:19,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:19,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:19,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:19,923 INFO L87 Difference]: Start difference. First operand 17926 states and 26579 transitions. Second operand 3 states. [2019-09-10 06:48:20,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:20,100 INFO L93 Difference]: Finished difference Result 33166 states and 48378 transitions. [2019-09-10 06:48:20,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:20,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 06:48:20,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:20,177 INFO L225 Difference]: With dead ends: 33166 [2019-09-10 06:48:20,177 INFO L226 Difference]: Without dead ends: 33166 [2019-09-10 06:48:20,178 INFO L628 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 [2019-09-10 06:48:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33166 states. [2019-09-10 06:48:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33166 to 33164. [2019-09-10 06:48:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33164 states. [2019-09-10 06:48:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33164 states to 33164 states and 48377 transitions. [2019-09-10 06:48:21,651 INFO L78 Accepts]: Start accepts. Automaton has 33164 states and 48377 transitions. Word has length 150 [2019-09-10 06:48:21,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:21,652 INFO L475 AbstractCegarLoop]: Abstraction has 33164 states and 48377 transitions. [2019-09-10 06:48:21,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 33164 states and 48377 transitions. [2019-09-10 06:48:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 06:48:21,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:21,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:21,727 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:21,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:21,727 INFO L82 PathProgramCache]: Analyzing trace with hash -185662702, now seen corresponding path program 1 times [2019-09-10 06:48:21,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:21,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:21,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:21,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:21,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:21,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:21,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:21,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:21,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:21,817 INFO L87 Difference]: Start difference. First operand 33164 states and 48377 transitions. Second operand 3 states. [2019-09-10 06:48:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:22,033 INFO L93 Difference]: Finished difference Result 61072 states and 87501 transitions. [2019-09-10 06:48:22,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:22,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 06:48:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:22,162 INFO L225 Difference]: With dead ends: 61072 [2019-09-10 06:48:22,162 INFO L226 Difference]: Without dead ends: 61072 [2019-09-10 06:48:22,163 INFO L628 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 [2019-09-10 06:48:22,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61072 states. [2019-09-10 06:48:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61072 to 61070. [2019-09-10 06:48:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61070 states. [2019-09-10 06:48:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61070 states to 61070 states and 87500 transitions. [2019-09-10 06:48:23,400 INFO L78 Accepts]: Start accepts. Automaton has 61070 states and 87500 transitions. Word has length 150 [2019-09-10 06:48:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:23,401 INFO L475 AbstractCegarLoop]: Abstraction has 61070 states and 87500 transitions. [2019-09-10 06:48:23,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 61070 states and 87500 transitions. [2019-09-10 06:48:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 06:48:24,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:24,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:24,562 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:24,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:24,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1973566562, now seen corresponding path program 1 times [2019-09-10 06:48:24,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:24,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:24,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:24,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:24,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:24,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:24,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:24,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:24,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:24,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:24,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:24,879 INFO L87 Difference]: Start difference. First operand 61070 states and 87500 transitions. Second operand 6 states. [2019-09-10 06:48:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:25,622 INFO L93 Difference]: Finished difference Result 71229 states and 101220 transitions. [2019-09-10 06:48:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:48:25,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-09-10 06:48:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:25,732 INFO L225 Difference]: With dead ends: 71229 [2019-09-10 06:48:25,732 INFO L226 Difference]: Without dead ends: 67928 [2019-09-10 06:48:25,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67928 states. [2019-09-10 06:48:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67928 to 61613. [2019-09-10 06:48:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61613 states. [2019-09-10 06:48:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61613 states to 61613 states and 88134 transitions. [2019-09-10 06:48:26,667 INFO L78 Accepts]: Start accepts. Automaton has 61613 states and 88134 transitions. Word has length 151 [2019-09-10 06:48:26,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:26,667 INFO L475 AbstractCegarLoop]: Abstraction has 61613 states and 88134 transitions. [2019-09-10 06:48:26,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 61613 states and 88134 transitions. [2019-09-10 06:48:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 06:48:26,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:26,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:26,726 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:26,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:26,726 INFO L82 PathProgramCache]: Analyzing trace with hash -472115874, now seen corresponding path program 1 times [2019-09-10 06:48:26,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:26,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:26,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:26,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:26,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:26,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:26,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:26,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:26,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:26,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:26,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:26,820 INFO L87 Difference]: Start difference. First operand 61613 states and 88134 transitions. Second operand 3 states. [2019-09-10 06:48:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:27,233 INFO L93 Difference]: Finished difference Result 58284 states and 82679 transitions. [2019-09-10 06:48:27,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:27,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-10 06:48:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:27,301 INFO L225 Difference]: With dead ends: 58284 [2019-09-10 06:48:27,301 INFO L226 Difference]: Without dead ends: 58284 [2019-09-10 06:48:27,302 INFO L628 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 [2019-09-10 06:48:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58284 states. [2019-09-10 06:48:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58284 to 58282. [2019-09-10 06:48:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58282 states. [2019-09-10 06:48:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58282 states to 58282 states and 82678 transitions. [2019-09-10 06:48:27,882 INFO L78 Accepts]: Start accepts. Automaton has 58282 states and 82678 transitions. Word has length 152 [2019-09-10 06:48:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:27,883 INFO L475 AbstractCegarLoop]: Abstraction has 58282 states and 82678 transitions. [2019-09-10 06:48:27,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 58282 states and 82678 transitions. [2019-09-10 06:48:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 06:48:27,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:27,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:27,931 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:27,932 INFO L82 PathProgramCache]: Analyzing trace with hash -415740174, now seen corresponding path program 1 times [2019-09-10 06:48:27,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:27,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:28,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:28,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:28,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:28,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:28,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:28,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:28,077 INFO L87 Difference]: Start difference. First operand 58282 states and 82678 transitions. Second operand 3 states. [2019-09-10 06:48:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:28,393 INFO L93 Difference]: Finished difference Result 57284 states and 80533 transitions. [2019-09-10 06:48:28,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:28,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-10 06:48:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:28,454 INFO L225 Difference]: With dead ends: 57284 [2019-09-10 06:48:28,455 INFO L226 Difference]: Without dead ends: 57284 [2019-09-10 06:48:28,455 INFO L628 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 [2019-09-10 06:48:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57284 states. [2019-09-10 06:48:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57284 to 57282. [2019-09-10 06:48:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57282 states. [2019-09-10 06:48:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57282 states to 57282 states and 80532 transitions. [2019-09-10 06:48:28,996 INFO L78 Accepts]: Start accepts. Automaton has 57282 states and 80532 transitions. Word has length 154 [2019-09-10 06:48:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:28,996 INFO L475 AbstractCegarLoop]: Abstraction has 57282 states and 80532 transitions. [2019-09-10 06:48:28,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 57282 states and 80532 transitions. [2019-09-10 06:48:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 06:48:29,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:29,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:29,038 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:29,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1753293239, now seen corresponding path program 1 times [2019-09-10 06:48:29,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:29,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:29,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:29,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:29,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:29,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:29,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:29,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:29,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:29,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:29,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:29,159 INFO L87 Difference]: Start difference. First operand 57282 states and 80532 transitions. Second operand 3 states. [2019-09-10 06:48:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:29,487 INFO L93 Difference]: Finished difference Result 57204 states and 79647 transitions. [2019-09-10 06:48:29,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:29,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-10 06:48:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:29,543 INFO L225 Difference]: With dead ends: 57204 [2019-09-10 06:48:29,543 INFO L226 Difference]: Without dead ends: 57204 [2019-09-10 06:48:29,543 INFO L628 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 [2019-09-10 06:48:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57204 states. [2019-09-10 06:48:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57204 to 57202. [2019-09-10 06:48:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57202 states. [2019-09-10 06:48:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57202 states to 57202 states and 79646 transitions. [2019-09-10 06:48:30,163 INFO L78 Accepts]: Start accepts. Automaton has 57202 states and 79646 transitions. Word has length 154 [2019-09-10 06:48:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:30,163 INFO L475 AbstractCegarLoop]: Abstraction has 57202 states and 79646 transitions. [2019-09-10 06:48:30,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 57202 states and 79646 transitions. [2019-09-10 06:48:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:48:30,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:30,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:30,206 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:30,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash -801073396, now seen corresponding path program 1 times [2019-09-10 06:48:30,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:30,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:30,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:30,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:30,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:30,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:30,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:30,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:30,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:30,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:30,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:30,305 INFO L87 Difference]: Start difference. First operand 57202 states and 79646 transitions. Second operand 5 states. [2019-09-10 06:48:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:31,359 INFO L93 Difference]: Finished difference Result 108210 states and 149645 transitions. [2019-09-10 06:48:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:31,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-10 06:48:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:31,453 INFO L225 Difference]: With dead ends: 108210 [2019-09-10 06:48:31,453 INFO L226 Difference]: Without dead ends: 108210 [2019-09-10 06:48:31,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:48:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108210 states. [2019-09-10 06:48:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108210 to 107984. [2019-09-10 06:48:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107984 states. [2019-09-10 06:48:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107984 states to 107984 states and 149420 transitions. [2019-09-10 06:48:33,828 INFO L78 Accepts]: Start accepts. Automaton has 107984 states and 149420 transitions. Word has length 156 [2019-09-10 06:48:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:33,828 INFO L475 AbstractCegarLoop]: Abstraction has 107984 states and 149420 transitions. [2019-09-10 06:48:33,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 107984 states and 149420 transitions. [2019-09-10 06:48:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:48:33,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:33,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:33,920 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash 822620583, now seen corresponding path program 1 times [2019-09-10 06:48:33,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:33,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:33,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:33,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:33,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:34,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:34,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:48:34,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:34,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:48:34,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:48:34,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:48:34,058 INFO L87 Difference]: Start difference. First operand 107984 states and 149420 transitions. Second operand 7 states. [2019-09-10 06:48:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:35,851 INFO L93 Difference]: Finished difference Result 229740 states and 315901 transitions. [2019-09-10 06:48:35,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:48:35,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-10 06:48:35,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:36,104 INFO L225 Difference]: With dead ends: 229740 [2019-09-10 06:48:36,104 INFO L226 Difference]: Without dead ends: 229740 [2019-09-10 06:48:36,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:48:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229740 states. [2019-09-10 06:48:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229740 to 108036. [2019-09-10 06:48:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108036 states. [2019-09-10 06:48:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108036 states to 108036 states and 149484 transitions. [2019-09-10 06:48:40,466 INFO L78 Accepts]: Start accepts. Automaton has 108036 states and 149484 transitions. Word has length 156 [2019-09-10 06:48:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:40,466 INFO L475 AbstractCegarLoop]: Abstraction has 108036 states and 149484 transitions. [2019-09-10 06:48:40,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:48:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 108036 states and 149484 transitions. [2019-09-10 06:48:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:48:40,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:40,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:40,555 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2091961504, now seen corresponding path program 1 times [2019-09-10 06:48:40,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:40,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:40,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:40,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:40,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:40,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:40,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:40,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:40,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:40,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:40,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:40,649 INFO L87 Difference]: Start difference. First operand 108036 states and 149484 transitions. Second operand 3 states. [2019-09-10 06:48:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:41,718 INFO L93 Difference]: Finished difference Result 214557 states and 294531 transitions. [2019-09-10 06:48:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:41,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-10 06:48:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:42,598 INFO L225 Difference]: With dead ends: 214557 [2019-09-10 06:48:42,598 INFO L226 Difference]: Without dead ends: 214557 [2019-09-10 06:48:42,599 INFO L628 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 [2019-09-10 06:48:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214557 states. [2019-09-10 06:48:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214557 to 213898. [2019-09-10 06:48:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213898 states. [2019-09-10 06:48:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213898 states to 213898 states and 293873 transitions. [2019-09-10 06:48:47,397 INFO L78 Accepts]: Start accepts. Automaton has 213898 states and 293873 transitions. Word has length 156 [2019-09-10 06:48:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:47,397 INFO L475 AbstractCegarLoop]: Abstraction has 213898 states and 293873 transitions. [2019-09-10 06:48:47,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 213898 states and 293873 transitions. [2019-09-10 06:48:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:48:47,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:47,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:47,574 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:47,575 INFO L82 PathProgramCache]: Analyzing trace with hash -43501509, now seen corresponding path program 1 times [2019-09-10 06:48:47,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:47,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:47,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:47,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:47,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:47,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:47,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:47,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:47,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:47,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:47,689 INFO L87 Difference]: Start difference. First operand 213898 states and 293873 transitions. Second operand 6 states. [2019-09-10 06:48:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:49,620 INFO L93 Difference]: Finished difference Result 269059 states and 368535 transitions. [2019-09-10 06:48:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:49,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-09-10 06:48:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:49,904 INFO L225 Difference]: With dead ends: 269059 [2019-09-10 06:48:49,904 INFO L226 Difference]: Without dead ends: 268835 [2019-09-10 06:48:49,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:48:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268835 states. [2019-09-10 06:48:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268835 to 267939. [2019-09-10 06:48:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267939 states. [2019-09-10 06:48:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267939 states to 267939 states and 367417 transitions. [2019-09-10 06:48:56,495 INFO L78 Accepts]: Start accepts. Automaton has 267939 states and 367417 transitions. Word has length 156 [2019-09-10 06:48:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:56,495 INFO L475 AbstractCegarLoop]: Abstraction has 267939 states and 367417 transitions. [2019-09-10 06:48:56,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 267939 states and 367417 transitions. [2019-09-10 06:48:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:48:56,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:56,704 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:56,705 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:56,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:56,705 INFO L82 PathProgramCache]: Analyzing trace with hash -873781056, now seen corresponding path program 1 times [2019-09-10 06:48:56,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:56,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:56,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:56,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:57,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:57,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:48:57,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:57,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:48:57,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:48:57,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:48:57,605 INFO L87 Difference]: Start difference. First operand 267939 states and 367417 transitions. Second operand 7 states. [2019-09-10 06:49:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:00,597 INFO L93 Difference]: Finished difference Result 680388 states and 925019 transitions. [2019-09-10 06:49:00,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:49:00,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-10 06:49:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:01,485 INFO L225 Difference]: With dead ends: 680388 [2019-09-10 06:49:01,485 INFO L226 Difference]: Without dead ends: 680388 [2019-09-10 06:49:01,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:49:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680388 states. [2019-09-10 06:49:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680388 to 268138. [2019-09-10 06:49:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268138 states. [2019-09-10 06:49:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268138 states to 268138 states and 367680 transitions. [2019-09-10 06:49:13,647 INFO L78 Accepts]: Start accepts. Automaton has 268138 states and 367680 transitions. Word has length 156 [2019-09-10 06:49:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:13,647 INFO L475 AbstractCegarLoop]: Abstraction has 268138 states and 367680 transitions. [2019-09-10 06:49:13,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:49:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 268138 states and 367680 transitions. [2019-09-10 06:49:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:49:13,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:13,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:13,878 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:13,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1822023326, now seen corresponding path program 1 times [2019-09-10 06:49:13,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:13,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:13,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:13,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:13,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:13,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:49:13,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:13,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:49:13,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:49:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:49:13,985 INFO L87 Difference]: Start difference. First operand 268138 states and 367680 transitions. Second operand 6 states. [2019-09-10 06:49:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:20,612 INFO L93 Difference]: Finished difference Result 587179 states and 798131 transitions. [2019-09-10 06:49:20,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:20,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-09-10 06:49:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:21,302 INFO L225 Difference]: With dead ends: 587179 [2019-09-10 06:49:21,302 INFO L226 Difference]: Without dead ends: 587179 [2019-09-10 06:49:21,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:49:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587179 states. [2019-09-10 06:49:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587179 to 584479. [2019-09-10 06:49:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584479 states. [2019-09-10 06:49:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584479 states to 584479 states and 795433 transitions. [2019-09-10 06:49:36,107 INFO L78 Accepts]: Start accepts. Automaton has 584479 states and 795433 transitions. Word has length 156 [2019-09-10 06:49:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:36,107 INFO L475 AbstractCegarLoop]: Abstraction has 584479 states and 795433 transitions. [2019-09-10 06:49:36,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:49:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 584479 states and 795433 transitions. [2019-09-10 06:49:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:49:36,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:36,758 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:36,758 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:36,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1384854969, now seen corresponding path program 1 times [2019-09-10 06:49:36,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:36,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:36,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:36,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:36,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:36,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:36,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:49:36,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:36,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:49:36,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:49:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:49:36,870 INFO L87 Difference]: Start difference. First operand 584479 states and 795433 transitions. Second operand 7 states. [2019-09-10 06:49:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:53,036 INFO L93 Difference]: Finished difference Result 1328806 states and 1793800 transitions. [2019-09-10 06:49:53,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:49:53,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-10 06:49:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:54,866 INFO L225 Difference]: With dead ends: 1328806 [2019-09-10 06:49:54,866 INFO L226 Difference]: Without dead ends: 1328806 [2019-09-10 06:49:54,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:49:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328806 states. [2019-09-10 06:50:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328806 to 585052. [2019-09-10 06:50:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585052 states. [2019-09-10 06:50:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585052 states to 585052 states and 796187 transitions. [2019-09-10 06:50:15,461 INFO L78 Accepts]: Start accepts. Automaton has 585052 states and 796187 transitions. Word has length 156 [2019-09-10 06:50:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:15,461 INFO L475 AbstractCegarLoop]: Abstraction has 585052 states and 796187 transitions. [2019-09-10 06:50:15,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:50:15,461 INFO L276 IsEmpty]: Start isEmpty. Operand 585052 states and 796187 transitions. [2019-09-10 06:50:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:50:16,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:16,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:16,000 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:16,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash 521371508, now seen corresponding path program 1 times [2019-09-10 06:50:16,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:16,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:16,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:16,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:16,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:50:16,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:16,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:50:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:50:16,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:50:16,078 INFO L87 Difference]: Start difference. First operand 585052 states and 796187 transitions. Second operand 3 states. [2019-09-10 06:50:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:25,565 INFO L93 Difference]: Finished difference Result 1159516 states and 1561147 transitions. [2019-09-10 06:50:25,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:50:25,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-10 06:50:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:27,262 INFO L225 Difference]: With dead ends: 1159516 [2019-09-10 06:50:27,263 INFO L226 Difference]: Without dead ends: 1159516 [2019-09-10 06:50:27,263 INFO L628 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 [2019-09-10 06:50:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159516 states. [2019-09-10 06:50:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159516 to 1155052. [2019-09-10 06:50:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155052 states. [2019-09-10 06:51:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155052 states to 1155052 states and 1556684 transitions. [2019-09-10 06:51:06,118 INFO L78 Accepts]: Start accepts. Automaton has 1155052 states and 1556684 transitions. Word has length 156 [2019-09-10 06:51:06,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:06,119 INFO L475 AbstractCegarLoop]: Abstraction has 1155052 states and 1556684 transitions. [2019-09-10 06:51:06,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:51:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1155052 states and 1556684 transitions. [2019-09-10 06:51:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:51:09,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:09,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:09,932 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:09,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:09,932 INFO L82 PathProgramCache]: Analyzing trace with hash -30697964, now seen corresponding path program 1 times [2019-09-10 06:51:09,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:09,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:09,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:09,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:09,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:10,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:10,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:51:10,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:10,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:51:10,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:51:10,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:51:10,080 INFO L87 Difference]: Start difference. First operand 1155052 states and 1556684 transitions. Second operand 7 states. [2019-09-10 06:51:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:33,103 INFO L93 Difference]: Finished difference Result 2608919 states and 3482768 transitions. [2019-09-10 06:51:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:51:33,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-10 06:51:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:38,510 INFO L225 Difference]: With dead ends: 2608919 [2019-09-10 06:51:38,511 INFO L226 Difference]: Without dead ends: 2608919 [2019-09-10 06:51:38,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:51:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608919 states. [2019-09-10 06:52:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608919 to 1158648. [2019-09-10 06:52:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158648 states. [2019-09-10 06:52:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158648 states to 1158648 states and 1561654 transitions. [2019-09-10 06:52:42,245 INFO L78 Accepts]: Start accepts. Automaton has 1158648 states and 1561654 transitions. Word has length 156 [2019-09-10 06:52:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:42,245 INFO L475 AbstractCegarLoop]: Abstraction has 1158648 states and 1561654 transitions. [2019-09-10 06:52:42,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:52:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1158648 states and 1561654 transitions.