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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:06:50,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:06:50,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:06:50,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:06:50,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:06:50,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:06:50,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:06:50,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:06:50,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:06:50,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:06:50,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:06:50,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:06:50,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:06:50,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:06:50,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:06:50,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:06:50,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:06:50,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:06:50,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:06:50,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:06:50,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:06:50,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:06:50,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:06:50,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:06:50,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:06:50,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:06:50,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:06:50,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:06:50,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:06:50,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:06:50,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:06:50,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:06:50,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:06:50,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:06:50,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:06:50,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:06:50,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:06:50,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:06:50,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:06:50,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:06:50,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:06:50,325 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 07:06:50,341 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:06:50,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:06:50,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:06:50,342 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:06:50,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:06:50,343 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:06:50,344 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:06:50,344 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:06:50,344 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:06:50,344 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:06:50,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:06:50,345 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:06:50,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:06:50,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:06:50,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:06:50,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:06:50,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:06:50,346 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:06:50,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:06:50,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:06:50,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:06:50,347 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:06:50,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:06:50,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:06:50,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:06:50,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:06:50,348 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:06:50,348 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:06:50,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:06:50,349 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:06:50,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:06:50,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:06:50,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:06:50,405 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:06:50,406 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:06:50,407 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:06:50,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90940bbd3/5a497d2695bc4d79b0235befe03a4c56/FLAGae1034da8 [2019-09-10 07:06:51,385 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:06:51,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:06:51,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90940bbd3/5a497d2695bc4d79b0235befe03a4c56/FLAGae1034da8 [2019-09-10 07:06:51,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90940bbd3/5a497d2695bc4d79b0235befe03a4c56 [2019-09-10 07:06:51,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:06:51,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:06:51,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:06:51,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:06:51,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:06:51,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:06:51" (1/1) ... [2019-09-10 07:06:51,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a187b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:51, skipping insertion in model container [2019-09-10 07:06:51,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:06:51" (1/1) ... [2019-09-10 07:06:51,984 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:06:52,390 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:06:54,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:06:54,724 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:06:55,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:06:55,947 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:06:55,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:55 WrapperNode [2019-09-10 07:06:55,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:06:55,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:06:55,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:06:55,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:06:55,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:55" (1/1) ... [2019-09-10 07:06:55,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:55" (1/1) ... [2019-09-10 07:06:56,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:55" (1/1) ... [2019-09-10 07:06:56,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:55" (1/1) ... [2019-09-10 07:06:56,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:55" (1/1) ... [2019-09-10 07:06:56,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:55" (1/1) ... [2019-09-10 07:06:56,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:55" (1/1) ... [2019-09-10 07:06:56,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:06:56,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:06:56,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:06:56,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:06:56,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:55" (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 07:06:56,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:06:56,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:06:56,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:06:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:06:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:06:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:06:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:06:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:06:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:06:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:06:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:06:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:06:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:06:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:06:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:06:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:06:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:06:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:06:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:06:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:06:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:07:04,634 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:07:04,635 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:07:04,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:07:04 BoogieIcfgContainer [2019-09-10 07:07:04,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:07:04,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:07:04,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:07:04,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:07:04,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:06:51" (1/3) ... [2019-09-10 07:07:04,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79955171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:07:04, skipping insertion in model container [2019-09-10 07:07:04,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:55" (2/3) ... [2019-09-10 07:07:04,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79955171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:07:04, skipping insertion in model container [2019-09-10 07:07:04,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:07:04" (3/3) ... [2019-09-10 07:07:04,646 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:07:04,656 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:07:04,666 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:07:04,682 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:07:04,705 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:07:04,705 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:07:04,706 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:07:04,706 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:07:04,706 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:07:04,706 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:07:04,706 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:07:04,706 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:07:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states. [2019-09-10 07:07:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:07:04,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:04,860 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] [2019-09-10 07:07:04,862 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:04,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:04,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1674437233, now seen corresponding path program 1 times [2019-09-10 07:07:04,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:04,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:04,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:04,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:04,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:05,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 07:07:05,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:05,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:05,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:05,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:05,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:05,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:05,907 INFO L87 Difference]: Start difference. First operand 2873 states. Second operand 5 states. [2019-09-10 07:07:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:08,441 INFO L93 Difference]: Finished difference Result 2281 states and 4257 transitions. [2019-09-10 07:07:08,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:08,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 07:07:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:08,486 INFO L225 Difference]: With dead ends: 2281 [2019-09-10 07:07:08,487 INFO L226 Difference]: Without dead ends: 2269 [2019-09-10 07:07:08,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2019-09-10 07:07:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 2267. [2019-09-10 07:07:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-09-10 07:07:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 2958 transitions. [2019-09-10 07:07:08,644 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 2958 transitions. Word has length 82 [2019-09-10 07:07:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:08,645 INFO L475 AbstractCegarLoop]: Abstraction has 2267 states and 2958 transitions. [2019-09-10 07:07:08,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 2958 transitions. [2019-09-10 07:07:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:07:08,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:08,656 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] [2019-09-10 07:07:08,656 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:08,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:08,657 INFO L82 PathProgramCache]: Analyzing trace with hash -239959712, now seen corresponding path program 1 times [2019-09-10 07:07:08,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:08,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:08,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:08,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:09,018 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 07:07:09,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:09,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:09,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:09,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:09,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:09,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:09,029 INFO L87 Difference]: Start difference. First operand 2267 states and 2958 transitions. Second operand 3 states. [2019-09-10 07:07:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:09,144 INFO L93 Difference]: Finished difference Result 3531 states and 4640 transitions. [2019-09-10 07:07:09,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:09,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:07:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:09,168 INFO L225 Difference]: With dead ends: 3531 [2019-09-10 07:07:09,168 INFO L226 Difference]: Without dead ends: 3531 [2019-09-10 07:07:09,169 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 07:07:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2019-09-10 07:07:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3528. [2019-09-10 07:07:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3528 states. [2019-09-10 07:07:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 4638 transitions. [2019-09-10 07:07:09,280 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 4638 transitions. Word has length 83 [2019-09-10 07:07:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:09,284 INFO L475 AbstractCegarLoop]: Abstraction has 3528 states and 4638 transitions. [2019-09-10 07:07:09,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 4638 transitions. [2019-09-10 07:07:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:07:09,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:09,294 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] [2019-09-10 07:07:09,295 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1850342947, now seen corresponding path program 1 times [2019-09-10 07:07:09,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:09,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:09,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:09,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:09,656 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 07:07:09,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:09,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:07:09,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:09,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:07:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:07:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:07:09,662 INFO L87 Difference]: Start difference. First operand 3528 states and 4638 transitions. Second operand 6 states. [2019-09-10 07:07:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:11,306 INFO L93 Difference]: Finished difference Result 4066 states and 5668 transitions. [2019-09-10 07:07:11,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:11,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 07:07:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:11,326 INFO L225 Difference]: With dead ends: 4066 [2019-09-10 07:07:11,326 INFO L226 Difference]: Without dead ends: 4066 [2019-09-10 07:07:11,327 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 07:07:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4066 states. [2019-09-10 07:07:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4066 to 4062. [2019-09-10 07:07:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-09-10 07:07:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5666 transitions. [2019-09-10 07:07:11,462 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5666 transitions. Word has length 83 [2019-09-10 07:07:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:11,462 INFO L475 AbstractCegarLoop]: Abstraction has 4062 states and 5666 transitions. [2019-09-10 07:07:11,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:07:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5666 transitions. [2019-09-10 07:07:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:07:11,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:11,471 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] [2019-09-10 07:07:11,471 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2021095196, now seen corresponding path program 1 times [2019-09-10 07:07:11,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:11,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:11,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:11,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:11,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:11,783 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 07:07:11,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:11,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:11,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:11,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:11,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:11,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:11,785 INFO L87 Difference]: Start difference. First operand 4062 states and 5666 transitions. Second operand 3 states. [2019-09-10 07:07:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:11,900 INFO L93 Difference]: Finished difference Result 5872 states and 8165 transitions. [2019-09-10 07:07:11,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:11,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:07:11,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:11,939 INFO L225 Difference]: With dead ends: 5872 [2019-09-10 07:07:11,940 INFO L226 Difference]: Without dead ends: 5872 [2019-09-10 07:07:11,941 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 07:07:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5872 states. [2019-09-10 07:07:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5872 to 5862. [2019-09-10 07:07:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5862 states. [2019-09-10 07:07:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5862 states to 5862 states and 8156 transitions. [2019-09-10 07:07:12,155 INFO L78 Accepts]: Start accepts. Automaton has 5862 states and 8156 transitions. Word has length 84 [2019-09-10 07:07:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:12,156 INFO L475 AbstractCegarLoop]: Abstraction has 5862 states and 8156 transitions. [2019-09-10 07:07:12,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5862 states and 8156 transitions. [2019-09-10 07:07:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:07:12,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:12,175 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] [2019-09-10 07:07:12,176 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash 226289808, now seen corresponding path program 1 times [2019-09-10 07:07:12,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:12,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:12,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:12,453 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 07:07:12,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:12,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:12,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:12,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:12,458 INFO L87 Difference]: Start difference. First operand 5862 states and 8156 transitions. Second operand 3 states. [2019-09-10 07:07:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:12,589 INFO L93 Difference]: Finished difference Result 8396 states and 11874 transitions. [2019-09-10 07:07:12,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:12,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:07:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:12,630 INFO L225 Difference]: With dead ends: 8396 [2019-09-10 07:07:12,631 INFO L226 Difference]: Without dead ends: 8396 [2019-09-10 07:07:12,631 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 07:07:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8396 states. [2019-09-10 07:07:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8396 to 8394. [2019-09-10 07:07:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8394 states. [2019-09-10 07:07:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8394 states to 8394 states and 11873 transitions. [2019-09-10 07:07:12,830 INFO L78 Accepts]: Start accepts. Automaton has 8394 states and 11873 transitions. Word has length 84 [2019-09-10 07:07:12,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:12,831 INFO L475 AbstractCegarLoop]: Abstraction has 8394 states and 11873 transitions. [2019-09-10 07:07:12,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 8394 states and 11873 transitions. [2019-09-10 07:07:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:07:12,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:12,845 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] [2019-09-10 07:07:12,845 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:12,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1845113359, now seen corresponding path program 1 times [2019-09-10 07:07:12,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:12,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:12,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:13,137 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 07:07:13,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:13,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:13,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:13,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:13,139 INFO L87 Difference]: Start difference. First operand 8394 states and 11873 transitions. Second operand 5 states. [2019-09-10 07:07:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:14,581 INFO L93 Difference]: Finished difference Result 11773 states and 16735 transitions. [2019-09-10 07:07:14,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:14,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 07:07:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:14,616 INFO L225 Difference]: With dead ends: 11773 [2019-09-10 07:07:14,617 INFO L226 Difference]: Without dead ends: 11773 [2019-09-10 07:07:14,617 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 07:07:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11773 states. [2019-09-10 07:07:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11773 to 11771. [2019-09-10 07:07:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11771 states. [2019-09-10 07:07:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11771 states to 11771 states and 16734 transitions. [2019-09-10 07:07:14,860 INFO L78 Accepts]: Start accepts. Automaton has 11771 states and 16734 transitions. Word has length 84 [2019-09-10 07:07:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:14,863 INFO L475 AbstractCegarLoop]: Abstraction has 11771 states and 16734 transitions. [2019-09-10 07:07:14,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 11771 states and 16734 transitions. [2019-09-10 07:07:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:07:14,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:14,883 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] [2019-09-10 07:07:14,891 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:14,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:14,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1476634066, now seen corresponding path program 1 times [2019-09-10 07:07:14,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:14,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:14,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:14,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:14,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:15,141 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 07:07:15,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:15,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:15,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:15,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:15,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:15,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:15,143 INFO L87 Difference]: Start difference. First operand 11771 states and 16734 transitions. Second operand 3 states. [2019-09-10 07:07:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:15,394 INFO L93 Difference]: Finished difference Result 16342 states and 23153 transitions. [2019-09-10 07:07:15,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:15,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:07:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:15,430 INFO L225 Difference]: With dead ends: 16342 [2019-09-10 07:07:15,430 INFO L226 Difference]: Without dead ends: 16342 [2019-09-10 07:07:15,431 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 07:07:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16342 states. [2019-09-10 07:07:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16342 to 16300. [2019-09-10 07:07:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16300 states. [2019-09-10 07:07:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16300 states to 16300 states and 23112 transitions. [2019-09-10 07:07:15,719 INFO L78 Accepts]: Start accepts. Automaton has 16300 states and 23112 transitions. Word has length 84 [2019-09-10 07:07:15,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:15,720 INFO L475 AbstractCegarLoop]: Abstraction has 16300 states and 23112 transitions. [2019-09-10 07:07:15,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 16300 states and 23112 transitions. [2019-09-10 07:07:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:07:15,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:15,739 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] [2019-09-10 07:07:15,739 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:15,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:15,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1323398100, now seen corresponding path program 1 times [2019-09-10 07:07:15,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:15,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:15,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:15,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:15,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:16,213 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 07:07:16,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:16,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:16,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:16,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:16,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:16,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:16,216 INFO L87 Difference]: Start difference. First operand 16300 states and 23112 transitions. Second operand 5 states. [2019-09-10 07:07:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:17,372 INFO L93 Difference]: Finished difference Result 26846 states and 38576 transitions. [2019-09-10 07:07:17,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:17,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 07:07:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:17,437 INFO L225 Difference]: With dead ends: 26846 [2019-09-10 07:07:17,438 INFO L226 Difference]: Without dead ends: 26846 [2019-09-10 07:07:17,438 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 07:07:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26846 states. [2019-09-10 07:07:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26846 to 26844. [2019-09-10 07:07:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26844 states. [2019-09-10 07:07:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26844 states to 26844 states and 38575 transitions. [2019-09-10 07:07:17,915 INFO L78 Accepts]: Start accepts. Automaton has 26844 states and 38575 transitions. Word has length 84 [2019-09-10 07:07:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:17,915 INFO L475 AbstractCegarLoop]: Abstraction has 26844 states and 38575 transitions. [2019-09-10 07:07:17,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26844 states and 38575 transitions. [2019-09-10 07:07:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:07:17,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:17,938 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] [2019-09-10 07:07:17,938 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1115536880, now seen corresponding path program 1 times [2019-09-10 07:07:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:17,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:17,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:17,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:18,153 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 07:07:18,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:18,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:18,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:18,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:18,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:18,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:18,155 INFO L87 Difference]: Start difference. First operand 26844 states and 38575 transitions. Second operand 3 states. [2019-09-10 07:07:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:18,314 INFO L93 Difference]: Finished difference Result 37451 states and 53014 transitions. [2019-09-10 07:07:18,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:18,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:07:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:18,399 INFO L225 Difference]: With dead ends: 37451 [2019-09-10 07:07:18,399 INFO L226 Difference]: Without dead ends: 37451 [2019-09-10 07:07:18,400 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 07:07:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37451 states. [2019-09-10 07:07:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37451 to 37329. [2019-09-10 07:07:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37329 states. [2019-09-10 07:07:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37329 states to 37329 states and 52893 transitions. [2019-09-10 07:07:19,098 INFO L78 Accepts]: Start accepts. Automaton has 37329 states and 52893 transitions. Word has length 85 [2019-09-10 07:07:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:19,098 INFO L475 AbstractCegarLoop]: Abstraction has 37329 states and 52893 transitions. [2019-09-10 07:07:19,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 37329 states and 52893 transitions. [2019-09-10 07:07:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:07:19,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:19,131 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] [2019-09-10 07:07:19,132 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:19,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:19,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398392, now seen corresponding path program 1 times [2019-09-10 07:07:19,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:19,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:19,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:19,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:19,367 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 07:07:19,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:19,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:19,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:19,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:19,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:19,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:19,370 INFO L87 Difference]: Start difference. First operand 37329 states and 52893 transitions. Second operand 5 states. [2019-09-10 07:07:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:20,355 INFO L93 Difference]: Finished difference Result 51528 states and 72823 transitions. [2019-09-10 07:07:20,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:20,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:07:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:20,430 INFO L225 Difference]: With dead ends: 51528 [2019-09-10 07:07:20,430 INFO L226 Difference]: Without dead ends: 51528 [2019-09-10 07:07:20,431 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 07:07:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51528 states. [2019-09-10 07:07:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51528 to 51346. [2019-09-10 07:07:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51346 states. [2019-09-10 07:07:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51346 states to 51346 states and 72642 transitions. [2019-09-10 07:07:22,324 INFO L78 Accepts]: Start accepts. Automaton has 51346 states and 72642 transitions. Word has length 86 [2019-09-10 07:07:22,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:22,324 INFO L475 AbstractCegarLoop]: Abstraction has 51346 states and 72642 transitions. [2019-09-10 07:07:22,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 51346 states and 72642 transitions. [2019-09-10 07:07:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:07:22,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:22,352 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] [2019-09-10 07:07:22,352 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:22,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1541878014, now seen corresponding path program 1 times [2019-09-10 07:07:22,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:22,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:22,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:22,612 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 07:07:22,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:22,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:22,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:22,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:22,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:22,614 INFO L87 Difference]: Start difference. First operand 51346 states and 72642 transitions. Second operand 7 states. [2019-09-10 07:07:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:25,550 INFO L93 Difference]: Finished difference Result 261383 states and 376028 transitions. [2019-09-10 07:07:25,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:25,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-10 07:07:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:25,976 INFO L225 Difference]: With dead ends: 261383 [2019-09-10 07:07:25,976 INFO L226 Difference]: Without dead ends: 261383 [2019-09-10 07:07:25,978 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 07:07:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261383 states. [2019-09-10 07:07:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261383 to 51482. [2019-09-10 07:07:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51482 states. [2019-09-10 07:07:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51482 states to 51482 states and 72818 transitions. [2019-09-10 07:07:30,064 INFO L78 Accepts]: Start accepts. Automaton has 51482 states and 72818 transitions. Word has length 87 [2019-09-10 07:07:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:30,064 INFO L475 AbstractCegarLoop]: Abstraction has 51482 states and 72818 transitions. [2019-09-10 07:07:30,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 51482 states and 72818 transitions. [2019-09-10 07:07:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:07:30,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:30,078 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] [2019-09-10 07:07:30,078 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash -623000750, now seen corresponding path program 1 times [2019-09-10 07:07:30,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:30,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:30,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:30,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:30,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:30,296 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 07:07:30,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:30,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:30,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:30,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:30,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:30,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:30,300 INFO L87 Difference]: Start difference. First operand 51482 states and 72818 transitions. Second operand 7 states. [2019-09-10 07:07:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:32,892 INFO L93 Difference]: Finished difference Result 217523 states and 312328 transitions. [2019-09-10 07:07:32,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:32,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-10 07:07:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:33,211 INFO L225 Difference]: With dead ends: 217523 [2019-09-10 07:07:33,211 INFO L226 Difference]: Without dead ends: 217523 [2019-09-10 07:07:33,212 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 07:07:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217523 states. [2019-09-10 07:07:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217523 to 51794. [2019-09-10 07:07:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51794 states. [2019-09-10 07:07:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51794 states to 51794 states and 73230 transitions. [2019-09-10 07:07:36,673 INFO L78 Accepts]: Start accepts. Automaton has 51794 states and 73230 transitions. Word has length 87 [2019-09-10 07:07:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:36,673 INFO L475 AbstractCegarLoop]: Abstraction has 51794 states and 73230 transitions. [2019-09-10 07:07:36,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 51794 states and 73230 transitions. [2019-09-10 07:07:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:07:36,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:36,689 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] [2019-09-10 07:07:36,689 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1810714729, now seen corresponding path program 1 times [2019-09-10 07:07:36,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:36,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:36,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:36,900 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 07:07:36,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:36,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:36,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:36,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:36,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:36,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:36,902 INFO L87 Difference]: Start difference. First operand 51794 states and 73230 transitions. Second operand 7 states. [2019-09-10 07:07:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:39,392 INFO L93 Difference]: Finished difference Result 213281 states and 306126 transitions. [2019-09-10 07:07:39,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:39,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-10 07:07:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:39,665 INFO L225 Difference]: With dead ends: 213281 [2019-09-10 07:07:39,665 INFO L226 Difference]: Without dead ends: 213281 [2019-09-10 07:07:39,665 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 07:07:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213281 states. [2019-09-10 07:07:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213281 to 52492. [2019-09-10 07:07:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52492 states. [2019-09-10 07:07:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52492 states to 52492 states and 74158 transitions. [2019-09-10 07:07:41,629 INFO L78 Accepts]: Start accepts. Automaton has 52492 states and 74158 transitions. Word has length 87 [2019-09-10 07:07:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:41,629 INFO L475 AbstractCegarLoop]: Abstraction has 52492 states and 74158 transitions. [2019-09-10 07:07:41,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 52492 states and 74158 transitions. [2019-09-10 07:07:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:07:41,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:41,650 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] [2019-09-10 07:07:41,650 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash -691120451, now seen corresponding path program 1 times [2019-09-10 07:07:41,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:41,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:41,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:41,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:41,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:41,916 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 07:07:41,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:41,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:41,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:41,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:41,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:41,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:41,918 INFO L87 Difference]: Start difference. First operand 52492 states and 74158 transitions. Second operand 7 states. [2019-09-10 07:07:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:44,089 INFO L93 Difference]: Finished difference Result 167324 states and 239558 transitions. [2019-09-10 07:07:44,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:44,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-10 07:07:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:44,303 INFO L225 Difference]: With dead ends: 167324 [2019-09-10 07:07:44,304 INFO L226 Difference]: Without dead ends: 167324 [2019-09-10 07:07:44,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:07:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167324 states. [2019-09-10 07:07:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167324 to 52576. [2019-09-10 07:07:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52576 states. [2019-09-10 07:07:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52576 states to 52576 states and 74266 transitions. [2019-09-10 07:07:47,560 INFO L78 Accepts]: Start accepts. Automaton has 52576 states and 74266 transitions. Word has length 87 [2019-09-10 07:07:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:47,560 INFO L475 AbstractCegarLoop]: Abstraction has 52576 states and 74266 transitions. [2019-09-10 07:07:47,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 52576 states and 74266 transitions. [2019-09-10 07:07:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:07:47,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:47,581 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] [2019-09-10 07:07:47,581 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:47,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:47,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2084664816, now seen corresponding path program 1 times [2019-09-10 07:07:47,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:47,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:47,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:47,837 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 07:07:47,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:47,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:47,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:47,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:47,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:47,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:47,839 INFO L87 Difference]: Start difference. First operand 52576 states and 74266 transitions. Second operand 7 states. [2019-09-10 07:07:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:50,246 INFO L93 Difference]: Finished difference Result 187514 states and 268983 transitions. [2019-09-10 07:07:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:50,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-09-10 07:07:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:50,481 INFO L225 Difference]: With dead ends: 187514 [2019-09-10 07:07:50,482 INFO L226 Difference]: Without dead ends: 187514 [2019-09-10 07:07:50,482 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 07:07:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187514 states. [2019-09-10 07:07:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187514 to 52867. [2019-09-10 07:07:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52867 states. [2019-09-10 07:07:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52867 states to 52867 states and 74667 transitions. [2019-09-10 07:07:52,021 INFO L78 Accepts]: Start accepts. Automaton has 52867 states and 74667 transitions. Word has length 87 [2019-09-10 07:07:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:52,021 INFO L475 AbstractCegarLoop]: Abstraction has 52867 states and 74667 transitions. [2019-09-10 07:07:52,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 52867 states and 74667 transitions. [2019-09-10 07:07:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:07:52,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:52,037 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] [2019-09-10 07:07:52,037 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:52,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash 577704581, now seen corresponding path program 1 times [2019-09-10 07:07:52,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:52,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:52,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:52,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:52,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:52,266 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 07:07:52,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:52,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:52,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:52,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:52,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:52,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:52,270 INFO L87 Difference]: Start difference. First operand 52867 states and 74667 transitions. Second operand 7 states. [2019-09-10 07:07:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:54,585 INFO L93 Difference]: Finished difference Result 187746 states and 269287 transitions. [2019-09-10 07:07:54,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:07:54,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:07:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:54,797 INFO L225 Difference]: With dead ends: 187746 [2019-09-10 07:07:54,798 INFO L226 Difference]: Without dead ends: 187746 [2019-09-10 07:07:54,798 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 07:07:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187746 states. [2019-09-10 07:07:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187746 to 53282. [2019-09-10 07:07:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53282 states. [2019-09-10 07:07:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53282 states to 53282 states and 75253 transitions. [2019-09-10 07:07:56,525 INFO L78 Accepts]: Start accepts. Automaton has 53282 states and 75253 transitions. Word has length 88 [2019-09-10 07:07:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:56,525 INFO L475 AbstractCegarLoop]: Abstraction has 53282 states and 75253 transitions. [2019-09-10 07:07:56,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 53282 states and 75253 transitions. [2019-09-10 07:07:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:07:56,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:56,542 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] [2019-09-10 07:07:56,542 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1288112849, now seen corresponding path program 1 times [2019-09-10 07:07:56,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:56,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:56,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:56,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:56,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:56,940 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 07:07:56,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:56,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:07:56,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:56,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:07:56,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:07:56,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:56,942 INFO L87 Difference]: Start difference. First operand 53282 states and 75253 transitions. Second operand 9 states. [2019-09-10 07:08:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:00,870 INFO L93 Difference]: Finished difference Result 193905 states and 279225 transitions. [2019-09-10 07:08:00,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:08:00,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 07:08:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:01,085 INFO L225 Difference]: With dead ends: 193905 [2019-09-10 07:08:01,085 INFO L226 Difference]: Without dead ends: 193905 [2019-09-10 07:08:01,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:08:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193905 states. [2019-09-10 07:08:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193905 to 53250. [2019-09-10 07:08:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53250 states. [2019-09-10 07:08:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53250 states to 53250 states and 75189 transitions. [2019-09-10 07:08:02,437 INFO L78 Accepts]: Start accepts. Automaton has 53250 states and 75189 transitions. Word has length 88 [2019-09-10 07:08:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:02,438 INFO L475 AbstractCegarLoop]: Abstraction has 53250 states and 75189 transitions. [2019-09-10 07:08:02,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:08:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 53250 states and 75189 transitions. [2019-09-10 07:08:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:08:02,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:02,455 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] [2019-09-10 07:08:02,456 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:02,456 INFO L82 PathProgramCache]: Analyzing trace with hash 54769048, now seen corresponding path program 1 times [2019-09-10 07:08:02,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:02,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:02,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:02,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:02,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:02,729 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 07:08:02,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:02,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:08:02,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:02,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:08:02,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:08:02,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:08:02,731 INFO L87 Difference]: Start difference. First operand 53250 states and 75189 transitions. Second operand 8 states. [2019-09-10 07:08:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:05,865 INFO L93 Difference]: Finished difference Result 164334 states and 236698 transitions. [2019-09-10 07:08:05,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:08:05,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-09-10 07:08:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:06,067 INFO L225 Difference]: With dead ends: 164334 [2019-09-10 07:08:06,068 INFO L226 Difference]: Without dead ends: 164334 [2019-09-10 07:08:06,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:08:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164334 states. [2019-09-10 07:08:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164334 to 51669. [2019-09-10 07:08:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51669 states. [2019-09-10 07:08:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51669 states to 51669 states and 72997 transitions. [2019-09-10 07:08:07,189 INFO L78 Accepts]: Start accepts. Automaton has 51669 states and 72997 transitions. Word has length 88 [2019-09-10 07:08:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:07,189 INFO L475 AbstractCegarLoop]: Abstraction has 51669 states and 72997 transitions. [2019-09-10 07:08:07,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:08:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 51669 states and 72997 transitions. [2019-09-10 07:08:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:08:07,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:07,208 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] [2019-09-10 07:08:07,208 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:07,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:07,208 INFO L82 PathProgramCache]: Analyzing trace with hash 222147475, now seen corresponding path program 1 times [2019-09-10 07:08:07,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:07,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:07,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:07,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:07,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:07,419 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 07:08:07,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:07,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:08:07,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:07,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:08:07,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:08:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:08:07,420 INFO L87 Difference]: Start difference. First operand 51669 states and 72997 transitions. Second operand 7 states. [2019-09-10 07:08:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:09,741 INFO L93 Difference]: Finished difference Result 215304 states and 309509 transitions. [2019-09-10 07:08:09,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:08:09,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:08:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:10,032 INFO L225 Difference]: With dead ends: 215304 [2019-09-10 07:08:10,032 INFO L226 Difference]: Without dead ends: 215304 [2019-09-10 07:08:10,033 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 07:08:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215304 states. [2019-09-10 07:08:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215304 to 51744. [2019-09-10 07:08:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51744 states. [2019-09-10 07:08:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51744 states to 51744 states and 73097 transitions. [2019-09-10 07:08:11,597 INFO L78 Accepts]: Start accepts. Automaton has 51744 states and 73097 transitions. Word has length 88 [2019-09-10 07:08:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:11,597 INFO L475 AbstractCegarLoop]: Abstraction has 51744 states and 73097 transitions. [2019-09-10 07:08:11,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:08:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 51744 states and 73097 transitions. [2019-09-10 07:08:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:08:11,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:11,611 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] [2019-09-10 07:08:11,611 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:11,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash -249843814, now seen corresponding path program 1 times [2019-09-10 07:08:11,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:11,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:11,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:11,825 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 07:08:11,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:11,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:08:11,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:11,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:08:11,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:08:11,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:08:11,826 INFO L87 Difference]: Start difference. First operand 51744 states and 73097 transitions. Second operand 7 states. [2019-09-10 07:08:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:14,265 INFO L93 Difference]: Finished difference Result 210923 states and 303164 transitions. [2019-09-10 07:08:14,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:08:14,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:08:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:14,559 INFO L225 Difference]: With dead ends: 210923 [2019-09-10 07:08:14,559 INFO L226 Difference]: Without dead ends: 210923 [2019-09-10 07:08:14,559 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 07:08:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210923 states. [2019-09-10 07:08:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210923 to 51892. [2019-09-10 07:08:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51892 states. [2019-09-10 07:08:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51892 states to 51892 states and 73295 transitions. [2019-09-10 07:08:16,593 INFO L78 Accepts]: Start accepts. Automaton has 51892 states and 73295 transitions. Word has length 88 [2019-09-10 07:08:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:16,593 INFO L475 AbstractCegarLoop]: Abstraction has 51892 states and 73295 transitions. [2019-09-10 07:08:16,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:08:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 51892 states and 73295 transitions. [2019-09-10 07:08:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:08:16,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:16,610 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] [2019-09-10 07:08:16,610 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:16,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1973720315, now seen corresponding path program 1 times [2019-09-10 07:08:16,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:16,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:16,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:16,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:16,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:16,877 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 07:08:16,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:16,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:08:16,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:16,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:08:16,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:08:16,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:08:16,879 INFO L87 Difference]: Start difference. First operand 51892 states and 73295 transitions. Second operand 9 states. [2019-09-10 07:08:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:20,136 INFO L93 Difference]: Finished difference Result 177997 states and 256429 transitions. [2019-09-10 07:08:20,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:08:20,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 07:08:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:20,360 INFO L225 Difference]: With dead ends: 177997 [2019-09-10 07:08:20,361 INFO L226 Difference]: Without dead ends: 177997 [2019-09-10 07:08:20,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:08:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177997 states. [2019-09-10 07:08:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177997 to 51321. [2019-09-10 07:08:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51321 states. [2019-09-10 07:08:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51321 states to 51321 states and 72515 transitions. [2019-09-10 07:08:22,079 INFO L78 Accepts]: Start accepts. Automaton has 51321 states and 72515 transitions. Word has length 88 [2019-09-10 07:08:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:22,080 INFO L475 AbstractCegarLoop]: Abstraction has 51321 states and 72515 transitions. [2019-09-10 07:08:22,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:08:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51321 states and 72515 transitions. [2019-09-10 07:08:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:08:22,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:22,095 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] [2019-09-10 07:08:22,096 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1702801037, now seen corresponding path program 1 times [2019-09-10 07:08:22,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:22,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:22,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:22,363 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 07:08:22,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:22,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:08:22,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:22,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:08:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:08:22,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:08:22,365 INFO L87 Difference]: Start difference. First operand 51321 states and 72515 transitions. Second operand 9 states. [2019-09-10 07:08:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:25,638 INFO L93 Difference]: Finished difference Result 192163 states and 276964 transitions. [2019-09-10 07:08:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:08:25,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 07:08:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:25,879 INFO L225 Difference]: With dead ends: 192163 [2019-09-10 07:08:25,880 INFO L226 Difference]: Without dead ends: 192163 [2019-09-10 07:08:25,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:08:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192163 states. [2019-09-10 07:08:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192163 to 51262. [2019-09-10 07:08:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51262 states. [2019-09-10 07:08:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51262 states to 51262 states and 72426 transitions. [2019-09-10 07:08:27,805 INFO L78 Accepts]: Start accepts. Automaton has 51262 states and 72426 transitions. Word has length 88 [2019-09-10 07:08:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:27,806 INFO L475 AbstractCegarLoop]: Abstraction has 51262 states and 72426 transitions. [2019-09-10 07:08:27,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:08:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 51262 states and 72426 transitions. [2019-09-10 07:08:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:08:27,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:27,824 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] [2019-09-10 07:08:27,824 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:27,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:27,825 INFO L82 PathProgramCache]: Analyzing trace with hash -958979885, now seen corresponding path program 1 times [2019-09-10 07:08:27,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:27,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:27,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:27,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:27,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:28,090 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 07:08:28,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:28,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:08:28,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:28,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:08:28,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:08:28,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:08:28,092 INFO L87 Difference]: Start difference. First operand 51262 states and 72426 transitions. Second operand 9 states. [2019-09-10 07:08:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:31,718 INFO L93 Difference]: Finished difference Result 192961 states and 280230 transitions. [2019-09-10 07:08:31,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:08:31,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 07:08:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:31,971 INFO L225 Difference]: With dead ends: 192961 [2019-09-10 07:08:31,971 INFO L226 Difference]: Without dead ends: 192961 [2019-09-10 07:08:31,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:08:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192961 states. [2019-09-10 07:08:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192961 to 51179. [2019-09-10 07:08:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51179 states. [2019-09-10 07:08:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51179 states to 51179 states and 72305 transitions. [2019-09-10 07:08:33,831 INFO L78 Accepts]: Start accepts. Automaton has 51179 states and 72305 transitions. Word has length 88 [2019-09-10 07:08:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:33,831 INFO L475 AbstractCegarLoop]: Abstraction has 51179 states and 72305 transitions. [2019-09-10 07:08:33,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:08:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 51179 states and 72305 transitions. [2019-09-10 07:08:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:08:33,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:33,849 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] [2019-09-10 07:08:33,849 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:33,850 INFO L82 PathProgramCache]: Analyzing trace with hash -121832170, now seen corresponding path program 1 times [2019-09-10 07:08:33,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:33,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:33,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:34,060 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 07:08:34,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:34,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:08:34,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:34,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:08:34,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:08:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:08:34,066 INFO L87 Difference]: Start difference. First operand 51179 states and 72305 transitions. Second operand 7 states. [2019-09-10 07:08:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:36,344 INFO L93 Difference]: Finished difference Result 210104 states and 302037 transitions. [2019-09-10 07:08:36,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:08:36,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:08:36,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:36,668 INFO L225 Difference]: With dead ends: 210104 [2019-09-10 07:08:36,668 INFO L226 Difference]: Without dead ends: 210104 [2019-09-10 07:08:36,668 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 07:08:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210104 states. [2019-09-10 07:08:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210104 to 51284. [2019-09-10 07:08:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51284 states. [2019-09-10 07:08:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51284 states to 51284 states and 72445 transitions. [2019-09-10 07:08:38,128 INFO L78 Accepts]: Start accepts. Automaton has 51284 states and 72445 transitions. Word has length 88 [2019-09-10 07:08:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:38,129 INFO L475 AbstractCegarLoop]: Abstraction has 51284 states and 72445 transitions. [2019-09-10 07:08:38,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:08:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 51284 states and 72445 transitions. [2019-09-10 07:08:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:38,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:38,145 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] [2019-09-10 07:08:38,146 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:38,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:38,146 INFO L82 PathProgramCache]: Analyzing trace with hash 946074357, now seen corresponding path program 1 times [2019-09-10 07:08:38,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:38,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:38,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:38,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:38,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:38,681 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 12 [2019-09-10 07:08:38,989 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 07:08:38,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:38,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:08:38,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:38,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:08:38,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:08:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:08:38,991 INFO L87 Difference]: Start difference. First operand 51284 states and 72445 transitions. Second operand 12 states. [2019-09-10 07:08:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:42,560 INFO L93 Difference]: Finished difference Result 259765 states and 376703 transitions. [2019-09-10 07:08:42,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:08:42,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-10 07:08:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:42,976 INFO L225 Difference]: With dead ends: 259765 [2019-09-10 07:08:42,977 INFO L226 Difference]: Without dead ends: 259765 [2019-09-10 07:08:42,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:08:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259765 states. [2019-09-10 07:08:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259765 to 49507. [2019-09-10 07:08:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49507 states. [2019-09-10 07:08:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49507 states to 49507 states and 70119 transitions. [2019-09-10 07:08:44,632 INFO L78 Accepts]: Start accepts. Automaton has 49507 states and 70119 transitions. Word has length 89 [2019-09-10 07:08:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:44,633 INFO L475 AbstractCegarLoop]: Abstraction has 49507 states and 70119 transitions. [2019-09-10 07:08:44,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:08:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 49507 states and 70119 transitions. [2019-09-10 07:08:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:44,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:44,651 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] [2019-09-10 07:08:44,651 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:44,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:44,651 INFO L82 PathProgramCache]: Analyzing trace with hash -196813656, now seen corresponding path program 1 times [2019-09-10 07:08:44,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:44,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:44,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:44,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:44,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:45,591 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 07:08:45,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:45,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:08:45,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:45,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:08:45,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:08:45,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:08:45,594 INFO L87 Difference]: Start difference. First operand 49507 states and 70119 transitions. Second operand 15 states. [2019-09-10 07:08:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:52,265 INFO L93 Difference]: Finished difference Result 422853 states and 615103 transitions. [2019-09-10 07:08:52,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:08:52,266 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2019-09-10 07:08:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:53,022 INFO L225 Difference]: With dead ends: 422853 [2019-09-10 07:08:53,022 INFO L226 Difference]: Without dead ends: 422853 [2019-09-10 07:08:53,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:08:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422853 states. [2019-09-10 07:08:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422853 to 49471. [2019-09-10 07:08:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49471 states. [2019-09-10 07:08:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49471 states to 49471 states and 70047 transitions. [2019-09-10 07:08:56,545 INFO L78 Accepts]: Start accepts. Automaton has 49471 states and 70047 transitions. Word has length 89 [2019-09-10 07:08:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:56,546 INFO L475 AbstractCegarLoop]: Abstraction has 49471 states and 70047 transitions. [2019-09-10 07:08:56,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:08:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 49471 states and 70047 transitions. [2019-09-10 07:08:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:56,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:56,563 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] [2019-09-10 07:08:56,563 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1827210487, now seen corresponding path program 1 times [2019-09-10 07:08:56,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:56,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:56,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:57,060 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 07:08:57,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:57,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:08:57,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:57,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:08:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:08:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:08:57,062 INFO L87 Difference]: Start difference. First operand 49471 states and 70047 transitions. Second operand 12 states. [2019-09-10 07:09:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:01,368 INFO L93 Difference]: Finished difference Result 274693 states and 399293 transitions. [2019-09-10 07:09:01,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:09:01,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-10 07:09:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:01,712 INFO L225 Difference]: With dead ends: 274693 [2019-09-10 07:09:01,713 INFO L226 Difference]: Without dead ends: 274693 [2019-09-10 07:09:01,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:09:01,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274693 states. [2019-09-10 07:09:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274693 to 49507. [2019-09-10 07:09:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49507 states. [2019-09-10 07:09:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49507 states to 49507 states and 70101 transitions. [2019-09-10 07:09:03,845 INFO L78 Accepts]: Start accepts. Automaton has 49507 states and 70101 transitions. Word has length 89 [2019-09-10 07:09:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:03,845 INFO L475 AbstractCegarLoop]: Abstraction has 49507 states and 70101 transitions. [2019-09-10 07:09:03,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:09:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 49507 states and 70101 transitions. [2019-09-10 07:09:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:09:03,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:03,861 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] [2019-09-10 07:09:03,862 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:03,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:03,862 INFO L82 PathProgramCache]: Analyzing trace with hash 468511826, now seen corresponding path program 1 times [2019-09-10 07:09:03,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:03,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:03,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:03,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:03,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:04,097 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 07:09:04,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:04,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:09:04,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:04,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:09:04,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:09:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:09:04,099 INFO L87 Difference]: Start difference. First operand 49507 states and 70101 transitions. Second operand 9 states. [2019-09-10 07:09:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:07,513 INFO L93 Difference]: Finished difference Result 190866 states and 277455 transitions. [2019-09-10 07:09:07,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:09:07,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:09:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:07,806 INFO L225 Difference]: With dead ends: 190866 [2019-09-10 07:09:07,806 INFO L226 Difference]: Without dead ends: 190866 [2019-09-10 07:09:07,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:09:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190866 states. [2019-09-10 07:09:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190866 to 49084. [2019-09-10 07:09:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49084 states. [2019-09-10 07:09:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49084 states to 49084 states and 69530 transitions. [2019-09-10 07:09:09,715 INFO L78 Accepts]: Start accepts. Automaton has 49084 states and 69530 transitions. Word has length 89 [2019-09-10 07:09:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:09,716 INFO L475 AbstractCegarLoop]: Abstraction has 49084 states and 69530 transitions. [2019-09-10 07:09:09,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:09:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 49084 states and 69530 transitions. [2019-09-10 07:09:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:09:09,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:09,731 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] [2019-09-10 07:09:09,732 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1866836331, now seen corresponding path program 1 times [2019-09-10 07:09:09,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:09,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:09,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:10,244 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 07:09:10,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:10,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:09:10,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:10,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:09:10,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:09:10,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:09:10,247 INFO L87 Difference]: Start difference. First operand 49084 states and 69530 transitions. Second operand 12 states. [2019-09-10 07:09:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:12,388 INFO L93 Difference]: Finished difference Result 169130 states and 244438 transitions. [2019-09-10 07:09:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:09:12,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-10 07:09:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:12,592 INFO L225 Difference]: With dead ends: 169130 [2019-09-10 07:09:12,592 INFO L226 Difference]: Without dead ends: 169130 [2019-09-10 07:09:12,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:09:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169130 states. [2019-09-10 07:09:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169130 to 47903. [2019-09-10 07:09:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47903 states. [2019-09-10 07:09:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47903 states to 47903 states and 67991 transitions. [2019-09-10 07:09:14,286 INFO L78 Accepts]: Start accepts. Automaton has 47903 states and 67991 transitions. Word has length 89 [2019-09-10 07:09:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:14,286 INFO L475 AbstractCegarLoop]: Abstraction has 47903 states and 67991 transitions. [2019-09-10 07:09:14,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:09:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 47903 states and 67991 transitions. [2019-09-10 07:09:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:09:14,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:14,301 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] [2019-09-10 07:09:14,301 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1928980355, now seen corresponding path program 1 times [2019-09-10 07:09:14,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:14,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:14,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:14,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:14,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:14,909 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 07:09:14,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:14,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:09:14,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:14,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:09:14,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:09:14,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:09:14,911 INFO L87 Difference]: Start difference. First operand 47903 states and 67991 transitions. Second operand 12 states. [2019-09-10 07:09:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:17,175 INFO L93 Difference]: Finished difference Result 171285 states and 248546 transitions. [2019-09-10 07:09:17,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:09:17,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-10 07:09:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:17,422 INFO L225 Difference]: With dead ends: 171285 [2019-09-10 07:09:17,422 INFO L226 Difference]: Without dead ends: 171285 [2019-09-10 07:09:17,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:09:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171285 states. [2019-09-10 07:09:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171285 to 47647. [2019-09-10 07:09:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47647 states. [2019-09-10 07:09:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47647 states to 47647 states and 67626 transitions. [2019-09-10 07:09:18,602 INFO L78 Accepts]: Start accepts. Automaton has 47647 states and 67626 transitions. Word has length 89 [2019-09-10 07:09:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:18,603 INFO L475 AbstractCegarLoop]: Abstraction has 47647 states and 67626 transitions. [2019-09-10 07:09:18,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:09:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 47647 states and 67626 transitions. [2019-09-10 07:09:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:09:18,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:18,621 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] [2019-09-10 07:09:18,621 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:18,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:18,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1312600918, now seen corresponding path program 1 times [2019-09-10 07:09:18,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:18,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:18,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:18,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:18,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:18,904 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 07:09:18,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:18,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:09:18,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:18,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:09:18,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:09:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:09:18,906 INFO L87 Difference]: Start difference. First operand 47647 states and 67626 transitions. Second operand 9 states. [2019-09-10 07:09:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:21,832 INFO L93 Difference]: Finished difference Result 137542 states and 198183 transitions. [2019-09-10 07:09:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:09:21,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-10 07:09:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:21,994 INFO L225 Difference]: With dead ends: 137542 [2019-09-10 07:09:21,994 INFO L226 Difference]: Without dead ends: 137542 [2019-09-10 07:09:21,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:09:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137542 states. [2019-09-10 07:09:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137542 to 47629. [2019-09-10 07:09:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47629 states. [2019-09-10 07:09:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47629 states to 47629 states and 67590 transitions. [2019-09-10 07:09:22,991 INFO L78 Accepts]: Start accepts. Automaton has 47629 states and 67590 transitions. Word has length 90 [2019-09-10 07:09:22,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:22,992 INFO L475 AbstractCegarLoop]: Abstraction has 47629 states and 67590 transitions. [2019-09-10 07:09:22,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:09:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 47629 states and 67590 transitions. [2019-09-10 07:09:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:09:23,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:23,010 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] [2019-09-10 07:09:23,010 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:23,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2008428361, now seen corresponding path program 1 times [2019-09-10 07:09:23,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:23,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:23,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:23,173 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 07:09:23,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:23,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:23,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:23,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:23,175 INFO L87 Difference]: Start difference. First operand 47629 states and 67590 transitions. Second operand 3 states. [2019-09-10 07:09:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:23,333 INFO L93 Difference]: Finished difference Result 47631 states and 67097 transitions. [2019-09-10 07:09:23,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:23,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:09:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:23,389 INFO L225 Difference]: With dead ends: 47631 [2019-09-10 07:09:23,389 INFO L226 Difference]: Without dead ends: 47631 [2019-09-10 07:09:23,390 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 07:09:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47631 states. [2019-09-10 07:09:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47631 to 47629. [2019-09-10 07:09:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47629 states. [2019-09-10 07:09:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47629 states to 47629 states and 67096 transitions. [2019-09-10 07:09:23,888 INFO L78 Accepts]: Start accepts. Automaton has 47629 states and 67096 transitions. Word has length 90 [2019-09-10 07:09:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:23,889 INFO L475 AbstractCegarLoop]: Abstraction has 47629 states and 67096 transitions. [2019-09-10 07:09:23,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 47629 states and 67096 transitions. [2019-09-10 07:09:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:09:23,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:23,908 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] [2019-09-10 07:09:23,908 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1716495285, now seen corresponding path program 1 times [2019-09-10 07:09:23,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:23,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:23,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:23,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:23,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:24,063 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 07:09:24,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:24,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:24,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:24,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:24,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:24,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:24,065 INFO L87 Difference]: Start difference. First operand 47629 states and 67096 transitions. Second operand 3 states. [2019-09-10 07:09:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:24,302 INFO L93 Difference]: Finished difference Result 47631 states and 66518 transitions. [2019-09-10 07:09:24,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:24,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 07:09:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:24,357 INFO L225 Difference]: With dead ends: 47631 [2019-09-10 07:09:24,357 INFO L226 Difference]: Without dead ends: 47631 [2019-09-10 07:09:24,358 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 07:09:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47631 states. [2019-09-10 07:09:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47631 to 47629. [2019-09-10 07:09:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47629 states. [2019-09-10 07:09:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47629 states to 47629 states and 66517 transitions. [2019-09-10 07:09:25,270 INFO L78 Accepts]: Start accepts. Automaton has 47629 states and 66517 transitions. Word has length 91 [2019-09-10 07:09:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:25,270 INFO L475 AbstractCegarLoop]: Abstraction has 47629 states and 66517 transitions. [2019-09-10 07:09:25,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 47629 states and 66517 transitions. [2019-09-10 07:09:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:09:25,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:25,287 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] [2019-09-10 07:09:25,287 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -403572756, now seen corresponding path program 1 times [2019-09-10 07:09:25,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:25,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:25,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:25,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:25,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:25,398 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 07:09:25,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:25,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:25,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:25,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:25,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:25,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:25,400 INFO L87 Difference]: Start difference. First operand 47629 states and 66517 transitions. Second operand 3 states. [2019-09-10 07:09:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:25,647 INFO L93 Difference]: Finished difference Result 72236 states and 101832 transitions. [2019-09-10 07:09:25,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:25,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 07:09:25,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:25,717 INFO L225 Difference]: With dead ends: 72236 [2019-09-10 07:09:25,718 INFO L226 Difference]: Without dead ends: 72236 [2019-09-10 07:09:25,718 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 07:09:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72236 states. [2019-09-10 07:09:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72236 to 72054. [2019-09-10 07:09:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72054 states. [2019-09-10 07:09:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72054 states to 72054 states and 101651 transitions. [2019-09-10 07:09:26,347 INFO L78 Accepts]: Start accepts. Automaton has 72054 states and 101651 transitions. Word has length 91 [2019-09-10 07:09:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:26,347 INFO L475 AbstractCegarLoop]: Abstraction has 72054 states and 101651 transitions. [2019-09-10 07:09:26,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 72054 states and 101651 transitions. [2019-09-10 07:09:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:09:26,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:26,365 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] [2019-09-10 07:09:26,365 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:26,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:26,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1537024361, now seen corresponding path program 1 times [2019-09-10 07:09:26,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:26,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:26,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:26,492 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 07:09:26,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:26,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:26,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:26,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:26,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:26,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:26,493 INFO L87 Difference]: Start difference. First operand 72054 states and 101651 transitions. Second operand 3 states. [2019-09-10 07:09:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:26,826 INFO L93 Difference]: Finished difference Result 106609 states and 151647 transitions. [2019-09-10 07:09:26,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:26,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 07:09:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:26,947 INFO L225 Difference]: With dead ends: 106609 [2019-09-10 07:09:26,947 INFO L226 Difference]: Without dead ends: 106609 [2019-09-10 07:09:26,948 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 07:09:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106609 states. [2019-09-10 07:09:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106609 to 71264. [2019-09-10 07:09:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71264 states. [2019-09-10 07:09:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71264 states to 71264 states and 100463 transitions. [2019-09-10 07:09:27,699 INFO L78 Accepts]: Start accepts. Automaton has 71264 states and 100463 transitions. Word has length 91 [2019-09-10 07:09:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:27,699 INFO L475 AbstractCegarLoop]: Abstraction has 71264 states and 100463 transitions. [2019-09-10 07:09:27,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 71264 states and 100463 transitions. [2019-09-10 07:09:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:09:27,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:27,718 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] [2019-09-10 07:09:27,718 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:27,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:27,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1025042122, now seen corresponding path program 1 times [2019-09-10 07:09:27,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:27,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:27,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:27,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:27,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:27,931 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 07:09:27,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:27,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:09:27,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:27,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:09:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:09:27,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:09:27,933 INFO L87 Difference]: Start difference. First operand 71264 states and 100463 transitions. Second operand 9 states. [2019-09-10 07:09:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:30,887 INFO L93 Difference]: Finished difference Result 215029 states and 306010 transitions. [2019-09-10 07:09:30,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:09:30,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:09:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:31,143 INFO L225 Difference]: With dead ends: 215029 [2019-09-10 07:09:31,143 INFO L226 Difference]: Without dead ends: 215029 [2019-09-10 07:09:31,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:09:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215029 states. [2019-09-10 07:09:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215029 to 71230. [2019-09-10 07:09:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71230 states. [2019-09-10 07:09:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71230 states to 71230 states and 100413 transitions. [2019-09-10 07:09:32,467 INFO L78 Accepts]: Start accepts. Automaton has 71230 states and 100413 transitions. Word has length 92 [2019-09-10 07:09:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:32,467 INFO L475 AbstractCegarLoop]: Abstraction has 71230 states and 100413 transitions. [2019-09-10 07:09:32,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:09:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 71230 states and 100413 transitions. [2019-09-10 07:09:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:09:32,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:32,486 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] [2019-09-10 07:09:32,486 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:32,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:32,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1152523495, now seen corresponding path program 1 times [2019-09-10 07:09:32,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:32,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:32,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:32,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:32,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:33,262 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 07:09:33,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:33,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:09:33,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:33,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:09:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:09:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:09:33,264 INFO L87 Difference]: Start difference. First operand 71230 states and 100413 transitions. Second operand 17 states. [2019-09-10 07:09:33,869 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:09:35,929 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-09-10 07:09:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:37,988 INFO L93 Difference]: Finished difference Result 230776 states and 329985 transitions. [2019-09-10 07:09:37,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:09:37,988 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2019-09-10 07:09:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:38,329 INFO L225 Difference]: With dead ends: 230776 [2019-09-10 07:09:38,329 INFO L226 Difference]: Without dead ends: 230776 [2019-09-10 07:09:38,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:09:38,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230776 states. [2019-09-10 07:09:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230776 to 71230. [2019-09-10 07:09:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71230 states. [2019-09-10 07:09:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71230 states to 71230 states and 100395 transitions. [2019-09-10 07:09:39,966 INFO L78 Accepts]: Start accepts. Automaton has 71230 states and 100395 transitions. Word has length 93 [2019-09-10 07:09:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:39,966 INFO L475 AbstractCegarLoop]: Abstraction has 71230 states and 100395 transitions. [2019-09-10 07:09:39,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:09:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 71230 states and 100395 transitions. [2019-09-10 07:09:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:09:39,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:39,989 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] [2019-09-10 07:09:39,989 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:39,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2124089038, now seen corresponding path program 1 times [2019-09-10 07:09:39,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:39,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:39,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:39,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:39,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:40,115 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 07:09:40,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:40,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:40,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:40,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:40,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:40,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:40,117 INFO L87 Difference]: Start difference. First operand 71230 states and 100395 transitions. Second operand 3 states. [2019-09-10 07:09:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:40,534 INFO L93 Difference]: Finished difference Result 90741 states and 128188 transitions. [2019-09-10 07:09:40,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:40,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 07:09:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:40,647 INFO L225 Difference]: With dead ends: 90741 [2019-09-10 07:09:40,648 INFO L226 Difference]: Without dead ends: 90741 [2019-09-10 07:09:40,648 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 07:09:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90741 states. [2019-09-10 07:09:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90741 to 68909. [2019-09-10 07:09:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68909 states. [2019-09-10 07:09:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68909 states to 68909 states and 97257 transitions. [2019-09-10 07:09:41,736 INFO L78 Accepts]: Start accepts. Automaton has 68909 states and 97257 transitions. Word has length 93 [2019-09-10 07:09:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:41,736 INFO L475 AbstractCegarLoop]: Abstraction has 68909 states and 97257 transitions. [2019-09-10 07:09:41,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 68909 states and 97257 transitions. [2019-09-10 07:09:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:09:41,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:41,755 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] [2019-09-10 07:09:41,755 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:41,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:41,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1084564597, now seen corresponding path program 1 times [2019-09-10 07:09:41,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:41,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:41,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:41,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:41,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:42,360 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 07:09:42,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:42,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:09:42,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:42,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:09:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:09:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:09:42,362 INFO L87 Difference]: Start difference. First operand 68909 states and 97257 transitions. Second operand 16 states. [2019-09-10 07:09:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:44,944 INFO L93 Difference]: Finished difference Result 108997 states and 154868 transitions. [2019-09-10 07:09:44,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:09:44,944 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2019-09-10 07:09:44,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:45,102 INFO L225 Difference]: With dead ends: 108997 [2019-09-10 07:09:45,102 INFO L226 Difference]: Without dead ends: 108997 [2019-09-10 07:09:45,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:09:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108997 states. [2019-09-10 07:09:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108997 to 68616. [2019-09-10 07:09:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2019-09-10 07:09:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 96890 transitions. [2019-09-10 07:09:45,973 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 96890 transitions. Word has length 93 [2019-09-10 07:09:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:45,973 INFO L475 AbstractCegarLoop]: Abstraction has 68616 states and 96890 transitions. [2019-09-10 07:09:45,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:09:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 96890 transitions. [2019-09-10 07:09:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:09:45,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:45,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] [2019-09-10 07:09:45,994 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:45,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:45,994 INFO L82 PathProgramCache]: Analyzing trace with hash 233260879, now seen corresponding path program 1 times [2019-09-10 07:09:45,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:45,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:45,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:45,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:45,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:46,504 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 07:09:46,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:46,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:09:46,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:46,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:09:46,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:09:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:09:46,506 INFO L87 Difference]: Start difference. First operand 68616 states and 96890 transitions. Second operand 10 states. [2019-09-10 07:09:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:48,265 INFO L93 Difference]: Finished difference Result 149348 states and 212988 transitions. [2019-09-10 07:09:48,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:09:48,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 07:09:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:48,478 INFO L225 Difference]: With dead ends: 149348 [2019-09-10 07:09:48,478 INFO L226 Difference]: Without dead ends: 149348 [2019-09-10 07:09:48,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:09:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149348 states. [2019-09-10 07:09:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149348 to 68038. [2019-09-10 07:09:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68038 states. [2019-09-10 07:09:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68038 states to 68038 states and 96183 transitions. [2019-09-10 07:09:49,424 INFO L78 Accepts]: Start accepts. Automaton has 68038 states and 96183 transitions. Word has length 94 [2019-09-10 07:09:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:49,425 INFO L475 AbstractCegarLoop]: Abstraction has 68038 states and 96183 transitions. [2019-09-10 07:09:49,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:09:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 68038 states and 96183 transitions. [2019-09-10 07:09:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:09:49,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:49,472 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] [2019-09-10 07:09:49,472 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:49,472 INFO L82 PathProgramCache]: Analyzing trace with hash 29060056, now seen corresponding path program 1 times [2019-09-10 07:09:49,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:49,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:49,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:49,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:49,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:49,639 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 07:09:49,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:49,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:49,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:49,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:49,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:49,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:49,641 INFO L87 Difference]: Start difference. First operand 68038 states and 96183 transitions. Second operand 3 states. [2019-09-10 07:09:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:50,000 INFO L93 Difference]: Finished difference Result 125565 states and 177409 transitions. [2019-09-10 07:09:50,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:50,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 07:09:50,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:50,186 INFO L225 Difference]: With dead ends: 125565 [2019-09-10 07:09:50,186 INFO L226 Difference]: Without dead ends: 125565 [2019-09-10 07:09:50,187 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 07:09:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125565 states. [2019-09-10 07:09:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125565 to 125563. [2019-09-10 07:09:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125563 states. [2019-09-10 07:09:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125563 states to 125563 states and 177408 transitions. [2019-09-10 07:09:52,421 INFO L78 Accepts]: Start accepts. Automaton has 125563 states and 177408 transitions. Word has length 107 [2019-09-10 07:09:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:52,422 INFO L475 AbstractCegarLoop]: Abstraction has 125563 states and 177408 transitions. [2019-09-10 07:09:52,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 125563 states and 177408 transitions. [2019-09-10 07:09:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:09:52,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:52,495 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] [2019-09-10 07:09:52,495 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:52,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash 240482102, now seen corresponding path program 1 times [2019-09-10 07:09:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:52,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:52,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:52,798 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 07:09:52,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:52,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:52,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:52,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:52,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:52,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:52,800 INFO L87 Difference]: Start difference. First operand 125563 states and 177408 transitions. Second operand 7 states. [2019-09-10 07:09:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:53,982 INFO L93 Difference]: Finished difference Result 238262 states and 335316 transitions. [2019-09-10 07:09:53,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:09:53,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2019-09-10 07:09:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:54,416 INFO L225 Difference]: With dead ends: 238262 [2019-09-10 07:09:54,417 INFO L226 Difference]: Without dead ends: 237698 [2019-09-10 07:09:54,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237698 states. [2019-09-10 07:09:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237698 to 184473. [2019-09-10 07:09:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184473 states. [2019-09-10 07:10:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184473 states to 184473 states and 260564 transitions. [2019-09-10 07:10:00,191 INFO L78 Accepts]: Start accepts. Automaton has 184473 states and 260564 transitions. Word has length 108 [2019-09-10 07:10:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:00,191 INFO L475 AbstractCegarLoop]: Abstraction has 184473 states and 260564 transitions. [2019-09-10 07:10:00,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 184473 states and 260564 transitions. [2019-09-10 07:10:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:10:00,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:00,281 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] [2019-09-10 07:10:00,281 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:00,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1168427203, now seen corresponding path program 1 times [2019-09-10 07:10:00,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:00,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:00,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:00,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:00,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:00,463 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 07:10:00,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:00,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:10:00,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:00,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:10:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:10:00,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:10:00,466 INFO L87 Difference]: Start difference. First operand 184473 states and 260564 transitions. Second operand 6 states. [2019-09-10 07:10:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:01,642 INFO L93 Difference]: Finished difference Result 414663 states and 581237 transitions. [2019-09-10 07:10:01,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:10:01,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-09-10 07:10:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:02,363 INFO L225 Difference]: With dead ends: 414663 [2019-09-10 07:10:02,363 INFO L226 Difference]: Without dead ends: 414663 [2019-09-10 07:10:02,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:10:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414663 states. [2019-09-10 07:10:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414663 to 188823. [2019-09-10 07:10:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188823 states. [2019-09-10 07:10:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188823 states to 188823 states and 264914 transitions. [2019-09-10 07:10:13,477 INFO L78 Accepts]: Start accepts. Automaton has 188823 states and 264914 transitions. Word has length 109 [2019-09-10 07:10:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:13,477 INFO L475 AbstractCegarLoop]: Abstraction has 188823 states and 264914 transitions. [2019-09-10 07:10:13,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:10:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 188823 states and 264914 transitions. [2019-09-10 07:10:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:10:13,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:13,598 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] [2019-09-10 07:10:13,598 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2046569191, now seen corresponding path program 1 times [2019-09-10 07:10:13,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:13,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:13,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:13,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:13,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:13,752 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 07:10:13,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:13,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:10:13,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:13,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:10:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:10:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:10:13,754 INFO L87 Difference]: Start difference. First operand 188823 states and 264914 transitions. Second operand 3 states. [2019-09-10 07:10:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:14,648 INFO L93 Difference]: Finished difference Result 353059 states and 490551 transitions. [2019-09-10 07:10:14,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:10:14,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 07:10:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:15,164 INFO L225 Difference]: With dead ends: 353059 [2019-09-10 07:10:15,165 INFO L226 Difference]: Without dead ends: 353059 [2019-09-10 07:10:15,165 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 07:10:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353059 states. [2019-09-10 07:10:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353059 to 350157. [2019-09-10 07:10:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350157 states. [2019-09-10 07:10:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350157 states to 350157 states and 487650 transitions. [2019-09-10 07:10:20,603 INFO L78 Accepts]: Start accepts. Automaton has 350157 states and 487650 transitions. Word has length 110 [2019-09-10 07:10:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:20,604 INFO L475 AbstractCegarLoop]: Abstraction has 350157 states and 487650 transitions. [2019-09-10 07:10:20,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:10:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 350157 states and 487650 transitions. [2019-09-10 07:10:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:10:20,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:20,781 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 07:10:20,781 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:20,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1583806390, now seen corresponding path program 1 times [2019-09-10 07:10:20,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:20,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:20,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:20,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:20,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:20,934 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 07:10:20,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:20,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:10:20,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:20,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:10:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:10:20,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:10:20,936 INFO L87 Difference]: Start difference. First operand 350157 states and 487650 transitions. Second operand 5 states. [2019-09-10 07:10:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:34,912 INFO L93 Difference]: Finished difference Result 1213804 states and 1668495 transitions. [2019-09-10 07:10:34,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:10:34,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-10 07:10:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:36,993 INFO L225 Difference]: With dead ends: 1213804 [2019-09-10 07:10:36,993 INFO L226 Difference]: Without dead ends: 1213804 [2019-09-10 07:10:36,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:10:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213804 states. [2019-09-10 07:10:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213804 to 620308. [2019-09-10 07:10:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620308 states. [2019-09-10 07:10:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620308 states to 620308 states and 853654 transitions. [2019-09-10 07:10:54,428 INFO L78 Accepts]: Start accepts. Automaton has 620308 states and 853654 transitions. Word has length 111 [2019-09-10 07:10:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:54,428 INFO L475 AbstractCegarLoop]: Abstraction has 620308 states and 853654 transitions. [2019-09-10 07:10:54,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:10:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 620308 states and 853654 transitions. [2019-09-10 07:11:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:11:02,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:02,708 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 07:11:02,708 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash 608015089, now seen corresponding path program 1 times [2019-09-10 07:11:02,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:02,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:02,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:02,856 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 07:11:02,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:02,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:02,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:02,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:02,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:02,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:02,857 INFO L87 Difference]: Start difference. First operand 620308 states and 853654 transitions. Second operand 3 states. [2019-09-10 07:11:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:06,891 INFO L93 Difference]: Finished difference Result 1142023 states and 1558013 transitions. [2019-09-10 07:11:06,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:06,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 07:11:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:09,279 INFO L225 Difference]: With dead ends: 1142023 [2019-09-10 07:11:09,279 INFO L226 Difference]: Without dead ends: 1142023 [2019-09-10 07:11:09,279 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 07:11:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142023 states. [2019-09-10 07:11:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142023 to 1049229. [2019-09-10 07:11:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049229 states. [2019-09-10 07:11:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049229 states to 1049229 states and 1434079 transitions. [2019-09-10 07:11:45,173 INFO L78 Accepts]: Start accepts. Automaton has 1049229 states and 1434079 transitions. Word has length 111 [2019-09-10 07:11:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:45,174 INFO L475 AbstractCegarLoop]: Abstraction has 1049229 states and 1434079 transitions. [2019-09-10 07:11:45,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1049229 states and 1434079 transitions. [2019-09-10 07:11:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:11:45,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:45,338 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] [2019-09-10 07:11:45,338 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:45,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash 651131666, now seen corresponding path program 1 times [2019-09-10 07:11:45,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:45,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:45,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:45,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:45,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:45,529 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 07:11:45,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:45,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:45,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:45,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:45,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:45,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:45,532 INFO L87 Difference]: Start difference. First operand 1049229 states and 1434079 transitions. Second operand 3 states. [2019-09-10 07:12:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:03,816 INFO L93 Difference]: Finished difference Result 1925901 states and 2595268 transitions. [2019-09-10 07:12:03,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:12:03,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 07:12:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:06,881 INFO L225 Difference]: With dead ends: 1925901 [2019-09-10 07:12:06,882 INFO L226 Difference]: Without dead ends: 1925901 [2019-09-10 07:12:06,882 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 07:12:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925901 states. [2019-09-10 07:12:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925901 to 1408411. [2019-09-10 07:12:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408411 states.