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/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:58:52,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:58:52,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:58:52,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:58:52,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:58:52,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:58:52,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:58:52,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:58:52,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:58:52,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:58:52,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:58:52,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:58:52,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:58:52,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:58:52,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:58:52,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:58:52,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:58:52,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:58:52,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:58:52,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:58:52,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:58:52,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:58:52,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:58:52,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:58:52,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:58:52,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:58:52,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:58:52,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:58:52,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:58:52,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:58:52,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:58:52,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:58:52,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:58:52,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:58:52,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:58:52,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:58:52,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:58:52,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:58:52,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:58:52,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:58:52,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:58:52,329 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 04:58:52,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:58:52,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:58:52,351 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:58:52,354 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:58:52,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:58:52,355 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:58:52,356 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:58:52,356 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:58:52,356 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:58:52,356 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:58:52,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:58:52,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:58:52,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:58:52,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:58:52,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:58:52,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:58:52,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:58:52,359 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:58:52,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:58:52,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:58:52,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:58:52,362 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:58:52,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:58:52,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:58:52,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:58:52,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:58:52,363 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:58:52,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:58:52,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:58:52,364 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:58:52,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:58:52,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:58:52,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:58:52,443 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:58:52,444 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:58:52,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2019-09-10 04:58:52,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd75ce2c1/6d97ac60c38e4e25b6a7e3685890bd13/FLAG230497796 [2019-09-10 04:58:53,039 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:58:53,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2019-09-10 04:58:53,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd75ce2c1/6d97ac60c38e4e25b6a7e3685890bd13/FLAG230497796 [2019-09-10 04:58:53,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd75ce2c1/6d97ac60c38e4e25b6a7e3685890bd13 [2019-09-10 04:58:53,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:58:53,395 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:58:53,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:58:53,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:58:53,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:58:53,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:53,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405b959d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:53, skipping insertion in model container [2019-09-10 04:58:53,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:58:53" (1/1) ... [2019-09-10 04:58:53,415 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:58:53,481 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:58:53,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:58:53,947 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:58:54,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:58:54,111 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:58:54,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:54 WrapperNode [2019-09-10 04:58:54,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:58:54,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:58:54,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:58:54,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:58:54,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:54" (1/1) ... [2019-09-10 04:58:54,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:54" (1/1) ... [2019-09-10 04:58:54,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:54" (1/1) ... [2019-09-10 04:58:54,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:54" (1/1) ... [2019-09-10 04:58:54,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:54" (1/1) ... [2019-09-10 04:58:54,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:54" (1/1) ... [2019-09-10 04:58:54,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:54" (1/1) ... [2019-09-10 04:58:54,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:58:54,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:58:54,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:58:54,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:58:54,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:54" (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 04:58:54,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:58:54,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:58:54,312 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:58:54,312 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:58:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:58:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:58:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:58:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:58:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:58:54,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:58:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:58:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:58:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:58:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:58:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:58:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:58:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:58:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:58:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:58:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:58:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:58:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:58:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:58:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:58:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:58:54,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:58:55,917 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:58:55,917 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:58:55,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:58:55 BoogieIcfgContainer [2019-09-10 04:58:55,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:58:55,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:58:55,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:58:55,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:58:55,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:58:53" (1/3) ... [2019-09-10 04:58:55,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2a3cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:58:55, skipping insertion in model container [2019-09-10 04:58:55,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:54" (2/3) ... [2019-09-10 04:58:55,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2a3cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:58:55, skipping insertion in model container [2019-09-10 04:58:55,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:58:55" (3/3) ... [2019-09-10 04:58:55,929 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c [2019-09-10 04:58:55,938 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:58:55,949 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:58:55,965 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:58:56,010 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:58:56,010 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:58:56,010 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:58:56,010 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:58:56,011 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:58:56,011 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:58:56,011 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:58:56,011 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:58:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states. [2019-09-10 04:58:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 04:58:56,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:56,091 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] [2019-09-10 04:58:56,094 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2107138659, now seen corresponding path program 1 times [2019-09-10 04:58:56,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:56,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:56,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:56,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:56,675 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 04:58:56,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:56,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:58:56,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:56,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:58:56,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:58:56,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:58:56,702 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 5 states. [2019-09-10 04:58:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:56,892 INFO L93 Difference]: Finished difference Result 356 states and 610 transitions. [2019-09-10 04:58:56,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:58:56,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 04:58:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:56,932 INFO L225 Difference]: With dead ends: 356 [2019-09-10 04:58:56,932 INFO L226 Difference]: Without dead ends: 347 [2019-09-10 04:58:56,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:58:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-10 04:58:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-09-10 04:58:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-10 04:58:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 556 transitions. [2019-09-10 04:58:57,052 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 556 transitions. Word has length 102 [2019-09-10 04:58:57,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:57,053 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 556 transitions. [2019-09-10 04:58:57,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:58:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 556 transitions. [2019-09-10 04:58:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 04:58:57,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:57,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:58:57,063 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:57,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:57,065 INFO L82 PathProgramCache]: Analyzing trace with hash 149921471, now seen corresponding path program 1 times [2019-09-10 04:58:57,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:57,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:57,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:57,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:57,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:57,370 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 04:58:57,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:57,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:58:57,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:57,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:58:57,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:58:57,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:58:57,377 INFO L87 Difference]: Start difference. First operand 347 states and 556 transitions. Second operand 5 states. [2019-09-10 04:58:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:58,692 INFO L93 Difference]: Finished difference Result 491 states and 775 transitions. [2019-09-10 04:58:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:58:58,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-10 04:58:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:58,707 INFO L225 Difference]: With dead ends: 491 [2019-09-10 04:58:58,707 INFO L226 Difference]: Without dead ends: 491 [2019-09-10 04:58:58,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:58:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-10 04:58:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 483. [2019-09-10 04:58:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-10 04:58:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 768 transitions. [2019-09-10 04:58:58,752 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 768 transitions. Word has length 147 [2019-09-10 04:58:58,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:58,753 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 768 transitions. [2019-09-10 04:58:58,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:58:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 768 transitions. [2019-09-10 04:58:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 04:58:58,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:58,758 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:58:58,759 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:58,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash -849632732, now seen corresponding path program 1 times [2019-09-10 04:58:58,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:58,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:58,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:58,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:58,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:58,996 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 04:58:58,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:58,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:58:58,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:58,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:58:58,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:58:58,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:58:58,998 INFO L87 Difference]: Start difference. First operand 483 states and 768 transitions. Second operand 5 states. [2019-09-10 04:59:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:00,340 INFO L93 Difference]: Finished difference Result 754 states and 1188 transitions. [2019-09-10 04:59:00,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:59:00,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 04:59:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:00,346 INFO L225 Difference]: With dead ends: 754 [2019-09-10 04:59:00,347 INFO L226 Difference]: Without dead ends: 754 [2019-09-10 04:59:00,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:59:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-10 04:59:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 746. [2019-09-10 04:59:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-10 04:59:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1181 transitions. [2019-09-10 04:59:00,383 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1181 transitions. Word has length 150 [2019-09-10 04:59:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:00,384 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1181 transitions. [2019-09-10 04:59:00,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:59:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1181 transitions. [2019-09-10 04:59:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:59:00,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:00,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:00,389 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:00,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:00,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1519039157, now seen corresponding path program 1 times [2019-09-10 04:59:00,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:00,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:00,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:00,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:00,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:00,596 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 04:59:00,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:00,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:59:00,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:00,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:59:00,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:59:00,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:59:00,600 INFO L87 Difference]: Start difference. First operand 746 states and 1181 transitions. Second operand 5 states. [2019-09-10 04:59:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:01,933 INFO L93 Difference]: Finished difference Result 1270 states and 1988 transitions. [2019-09-10 04:59:01,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:59:01,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 04:59:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:01,940 INFO L225 Difference]: With dead ends: 1270 [2019-09-10 04:59:01,941 INFO L226 Difference]: Without dead ends: 1270 [2019-09-10 04:59:01,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:59:01,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-09-10 04:59:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1256. [2019-09-10 04:59:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-10 04:59:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1975 transitions. [2019-09-10 04:59:02,011 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1975 transitions. Word has length 153 [2019-09-10 04:59:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:02,012 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1975 transitions. [2019-09-10 04:59:02,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:59:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1975 transitions. [2019-09-10 04:59:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 04:59:02,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:02,017 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:02,017 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:02,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:02,018 INFO L82 PathProgramCache]: Analyzing trace with hash -409144026, now seen corresponding path program 1 times [2019-09-10 04:59:02,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:02,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:02,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:02,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:02,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:02,195 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 04:59:02,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:02,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:59:02,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:02,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:59:02,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:59:02,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:59:02,198 INFO L87 Difference]: Start difference. First operand 1256 states and 1975 transitions. Second operand 5 states. [2019-09-10 04:59:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:03,444 INFO L93 Difference]: Finished difference Result 2270 states and 3524 transitions. [2019-09-10 04:59:03,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:59:03,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-10 04:59:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:03,460 INFO L225 Difference]: With dead ends: 2270 [2019-09-10 04:59:03,460 INFO L226 Difference]: Without dead ends: 2270 [2019-09-10 04:59:03,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-09-10 04:59:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2244. [2019-09-10 04:59:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-09-10 04:59:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3499 transitions. [2019-09-10 04:59:03,565 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3499 transitions. Word has length 156 [2019-09-10 04:59:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:03,565 INFO L475 AbstractCegarLoop]: Abstraction has 2244 states and 3499 transitions. [2019-09-10 04:59:03,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:59:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3499 transitions. [2019-09-10 04:59:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 04:59:03,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:03,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:03,571 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:03,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:03,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1622684031, now seen corresponding path program 1 times [2019-09-10 04:59:03,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:03,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:03,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:03,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:03,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:03,858 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 04:59:03,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:03,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:59:03,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:03,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:59:03,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:59:03,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:59:03,860 INFO L87 Difference]: Start difference. First operand 2244 states and 3499 transitions. Second operand 11 states. [2019-09-10 04:59:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:10,629 INFO L93 Difference]: Finished difference Result 10219 states and 16280 transitions. [2019-09-10 04:59:10,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 04:59:10,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2019-09-10 04:59:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:10,686 INFO L225 Difference]: With dead ends: 10219 [2019-09-10 04:59:10,687 INFO L226 Difference]: Without dead ends: 10219 [2019-09-10 04:59:10,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 04:59:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10219 states. [2019-09-10 04:59:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10219 to 8745. [2019-09-10 04:59:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8745 states. [2019-09-10 04:59:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8745 states to 8745 states and 13789 transitions. [2019-09-10 04:59:11,027 INFO L78 Accepts]: Start accepts. Automaton has 8745 states and 13789 transitions. Word has length 159 [2019-09-10 04:59:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:11,029 INFO L475 AbstractCegarLoop]: Abstraction has 8745 states and 13789 transitions. [2019-09-10 04:59:11,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:59:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 8745 states and 13789 transitions. [2019-09-10 04:59:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 04:59:11,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:11,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:11,049 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:11,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:11,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1757376658, now seen corresponding path program 1 times [2019-09-10 04:59:11,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:11,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:11,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:11,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 04:59:11,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:11,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:59:11,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:11,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:59:11,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:59:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:11,268 INFO L87 Difference]: Start difference. First operand 8745 states and 13789 transitions. Second operand 6 states. [2019-09-10 04:59:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:14,010 INFO L93 Difference]: Finished difference Result 17374 states and 27371 transitions. [2019-09-10 04:59:14,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:59:14,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-10 04:59:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:14,088 INFO L225 Difference]: With dead ends: 17374 [2019-09-10 04:59:14,089 INFO L226 Difference]: Without dead ends: 17374 [2019-09-10 04:59:14,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17374 states. [2019-09-10 04:59:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17374 to 17218. [2019-09-10 04:59:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17218 states. [2019-09-10 04:59:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17218 states to 17218 states and 27183 transitions. [2019-09-10 04:59:14,534 INFO L78 Accepts]: Start accepts. Automaton has 17218 states and 27183 transitions. Word has length 160 [2019-09-10 04:59:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:14,535 INFO L475 AbstractCegarLoop]: Abstraction has 17218 states and 27183 transitions. [2019-09-10 04:59:14,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 17218 states and 27183 transitions. [2019-09-10 04:59:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 04:59:14,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:14,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:14,545 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:14,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:14,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2069872805, now seen corresponding path program 1 times [2019-09-10 04:59:14,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:14,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:14,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:14,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:14,793 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 04:59:14,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:14,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:59:14,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:14,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:59:14,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:59:14,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:59:14,795 INFO L87 Difference]: Start difference. First operand 17218 states and 27183 transitions. Second operand 11 states. [2019-09-10 04:59:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:22,689 INFO L93 Difference]: Finished difference Result 28770 states and 45862 transitions. [2019-09-10 04:59:22,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 04:59:22,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-10 04:59:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:22,791 INFO L225 Difference]: With dead ends: 28770 [2019-09-10 04:59:22,792 INFO L226 Difference]: Without dead ends: 28770 [2019-09-10 04:59:22,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 04:59:22,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-09-10 04:59:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 25974. [2019-09-10 04:59:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25974 states. [2019-09-10 04:59:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25974 states to 25974 states and 41015 transitions. [2019-09-10 04:59:23,368 INFO L78 Accepts]: Start accepts. Automaton has 25974 states and 41015 transitions. Word has length 161 [2019-09-10 04:59:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:23,368 INFO L475 AbstractCegarLoop]: Abstraction has 25974 states and 41015 transitions. [2019-09-10 04:59:23,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:59:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states and 41015 transitions. [2019-09-10 04:59:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 04:59:23,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:23,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:23,380 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:23,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:23,381 INFO L82 PathProgramCache]: Analyzing trace with hash -671538649, now seen corresponding path program 1 times [2019-09-10 04:59:23,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:23,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:23,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:23,635 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 04:59:23,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:23,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:59:23,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:23,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:59:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:59:23,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:59:23,637 INFO L87 Difference]: Start difference. First operand 25974 states and 41015 transitions. Second operand 11 states. [2019-09-10 04:59:32,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:32,758 INFO L93 Difference]: Finished difference Result 40876 states and 65240 transitions. [2019-09-10 04:59:32,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 04:59:32,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-10 04:59:32,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:32,885 INFO L225 Difference]: With dead ends: 40876 [2019-09-10 04:59:32,886 INFO L226 Difference]: Without dead ends: 40876 [2019-09-10 04:59:32,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 04:59:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40876 states. [2019-09-10 04:59:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40876 to 35896. [2019-09-10 04:59:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35896 states. [2019-09-10 04:59:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35896 states to 35896 states and 56891 transitions. [2019-09-10 04:59:33,708 INFO L78 Accepts]: Start accepts. Automaton has 35896 states and 56891 transitions. Word has length 161 [2019-09-10 04:59:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:33,709 INFO L475 AbstractCegarLoop]: Abstraction has 35896 states and 56891 transitions. [2019-09-10 04:59:33,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:59:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 35896 states and 56891 transitions. [2019-09-10 04:59:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 04:59:33,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:33,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:33,721 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:33,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1699484185, now seen corresponding path program 1 times [2019-09-10 04:59:33,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:33,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:33,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:33,970 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 04:59:33,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:33,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:59:33,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:33,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:59:33,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:59:33,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:59:33,973 INFO L87 Difference]: Start difference. First operand 35896 states and 56891 transitions. Second operand 11 states. [2019-09-10 04:59:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:43,446 INFO L93 Difference]: Finished difference Result 51464 states and 82135 transitions. [2019-09-10 04:59:43,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 04:59:43,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-10 04:59:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:43,588 INFO L225 Difference]: With dead ends: 51464 [2019-09-10 04:59:43,588 INFO L226 Difference]: Without dead ends: 51464 [2019-09-10 04:59:43,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=625, Invalid=2567, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 04:59:43,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51464 states. [2019-09-10 04:59:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51464 to 46484. [2019-09-10 04:59:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46484 states. [2019-09-10 04:59:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46484 states to 46484 states and 73741 transitions. [2019-09-10 04:59:44,654 INFO L78 Accepts]: Start accepts. Automaton has 46484 states and 73741 transitions. Word has length 161 [2019-09-10 04:59:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:44,656 INFO L475 AbstractCegarLoop]: Abstraction has 46484 states and 73741 transitions. [2019-09-10 04:59:44,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:59:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 46484 states and 73741 transitions. [2019-09-10 04:59:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 04:59:44,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:44,673 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:44,673 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:44,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:44,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1689565736, now seen corresponding path program 1 times [2019-09-10 04:59:44,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:44,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:44,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:44,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:44,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:44,867 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 04:59:44,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:44,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:59:44,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:44,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:59:44,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:59:44,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:44,869 INFO L87 Difference]: Start difference. First operand 46484 states and 73741 transitions. Second operand 6 states. [2019-09-10 04:59:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:47,549 INFO L93 Difference]: Finished difference Result 92556 states and 146663 transitions. [2019-09-10 04:59:47,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:59:47,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-10 04:59:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:49,127 INFO L225 Difference]: With dead ends: 92556 [2019-09-10 04:59:49,127 INFO L226 Difference]: Without dead ends: 92556 [2019-09-10 04:59:49,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92556 states. [2019-09-10 04:59:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92556 to 91932. [2019-09-10 04:59:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91932 states. [2019-09-10 04:59:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91932 states to 91932 states and 145795 transitions. [2019-09-10 04:59:50,430 INFO L78 Accepts]: Start accepts. Automaton has 91932 states and 145795 transitions. Word has length 161 [2019-09-10 04:59:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:50,431 INFO L475 AbstractCegarLoop]: Abstraction has 91932 states and 145795 transitions. [2019-09-10 04:59:50,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 91932 states and 145795 transitions. [2019-09-10 04:59:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 04:59:50,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:50,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:50,445 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:50,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:50,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1523949593, now seen corresponding path program 1 times [2019-09-10 04:59:50,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:50,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:50,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:50,929 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 04:59:50,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:50,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:59:50,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:50,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:59:50,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:59:50,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:50,931 INFO L87 Difference]: Start difference. First operand 91932 states and 145795 transitions. Second operand 6 states. [2019-09-10 04:59:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:52,613 INFO L93 Difference]: Finished difference Result 97374 states and 154932 transitions. [2019-09-10 04:59:52,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:59:52,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-10 04:59:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:53,014 INFO L225 Difference]: With dead ends: 97374 [2019-09-10 04:59:53,015 INFO L226 Difference]: Without dead ends: 97374 [2019-09-10 04:59:53,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:59:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97374 states. [2019-09-10 04:59:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97374 to 92164. [2019-09-10 04:59:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92164 states. [2019-09-10 04:59:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92164 states to 92164 states and 145795 transitions. [2019-09-10 04:59:54,653 INFO L78 Accepts]: Start accepts. Automaton has 92164 states and 145795 transitions. Word has length 161 [2019-09-10 04:59:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:54,654 INFO L475 AbstractCegarLoop]: Abstraction has 92164 states and 145795 transitions. [2019-09-10 04:59:54,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 92164 states and 145795 transitions. [2019-09-10 04:59:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 04:59:54,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:54,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:54,667 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:54,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1042735562, now seen corresponding path program 1 times [2019-09-10 04:59:54,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:54,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:54,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:54,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:54,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:54,888 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 04:59:54,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:54,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 04:59:54,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:54,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:59:54,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:59:54,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:54,891 INFO L87 Difference]: Start difference. First operand 92164 states and 145795 transitions. Second operand 12 states. [2019-09-10 04:59:58,704 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-09-10 05:00:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:06,207 INFO L93 Difference]: Finished difference Result 210983 states and 341568 transitions. [2019-09-10 05:00:06,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 05:00:06,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 162 [2019-09-10 05:00:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:06,900 INFO L225 Difference]: With dead ends: 210983 [2019-09-10 05:00:06,900 INFO L226 Difference]: Without dead ends: 210911 [2019-09-10 05:00:06,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 05:00:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210911 states. [2019-09-10 05:00:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210911 to 197653. [2019-09-10 05:00:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197653 states. [2019-09-10 05:00:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197653 states to 197653 states and 318002 transitions. [2019-09-10 05:00:12,367 INFO L78 Accepts]: Start accepts. Automaton has 197653 states and 318002 transitions. Word has length 162 [2019-09-10 05:00:12,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:12,367 INFO L475 AbstractCegarLoop]: Abstraction has 197653 states and 318002 transitions. [2019-09-10 05:00:12,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 05:00:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 197653 states and 318002 transitions. [2019-09-10 05:00:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 05:00:12,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:12,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:00:12,380 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:12,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:12,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1395823944, now seen corresponding path program 1 times [2019-09-10 05:00:12,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:12,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:12,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:12,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:12,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:13,366 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 05:00:13,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:13,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 05:00:13,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:13,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 05:00:13,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 05:00:13,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:00:13,368 INFO L87 Difference]: Start difference. First operand 197653 states and 318002 transitions. Second operand 7 states. [2019-09-10 05:00:15,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:15,820 INFO L93 Difference]: Finished difference Result 201112 states and 324014 transitions. [2019-09-10 05:00:15,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:15,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 162 [2019-09-10 05:00:15,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:16,347 INFO L225 Difference]: With dead ends: 201112 [2019-09-10 05:00:16,348 INFO L226 Difference]: Without dead ends: 201112 [2019-09-10 05:00:16,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201112 states. [2019-09-10 05:00:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201112 to 200682. [2019-09-10 05:00:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200682 states. [2019-09-10 05:00:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200682 states to 200682 states and 323223 transitions. [2019-09-10 05:00:22,484 INFO L78 Accepts]: Start accepts. Automaton has 200682 states and 323223 transitions. Word has length 162 [2019-09-10 05:00:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:22,485 INFO L475 AbstractCegarLoop]: Abstraction has 200682 states and 323223 transitions. [2019-09-10 05:00:22,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 05:00:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 200682 states and 323223 transitions. [2019-09-10 05:00:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 05:00:22,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:22,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:00:22,496 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:22,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:22,497 INFO L82 PathProgramCache]: Analyzing trace with hash 360887909, now seen corresponding path program 1 times [2019-09-10 05:00:22,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:22,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:22,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:22,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:22,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:22,623 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 05:00:22,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:22,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:22,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:22,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:22,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:22,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:22,625 INFO L87 Difference]: Start difference. First operand 200682 states and 323223 transitions. Second operand 6 states. [2019-09-10 05:00:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:27,150 INFO L93 Difference]: Finished difference Result 400795 states and 645097 transitions. [2019-09-10 05:00:27,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:27,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-10 05:00:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:28,340 INFO L225 Difference]: With dead ends: 400795 [2019-09-10 05:00:28,341 INFO L226 Difference]: Without dead ends: 400795 [2019-09-10 05:00:28,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:28,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400795 states. [2019-09-10 05:00:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400795 to 398140. [2019-09-10 05:00:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398140 states. [2019-09-10 05:00:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398140 states to 398140 states and 641235 transitions. [2019-09-10 05:00:39,422 INFO L78 Accepts]: Start accepts. Automaton has 398140 states and 641235 transitions. Word has length 162 [2019-09-10 05:00:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:39,423 INFO L475 AbstractCegarLoop]: Abstraction has 398140 states and 641235 transitions. [2019-09-10 05:00:39,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 398140 states and 641235 transitions. [2019-09-10 05:00:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 05:00:39,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:39,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:00:39,433 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:39,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash 232594251, now seen corresponding path program 1 times [2019-09-10 05:00:39,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:39,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:39,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:39,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:39,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:39,667 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 05:00:39,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:39,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:39,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:39,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:39,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:39,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:39,669 INFO L87 Difference]: Start difference. First operand 398140 states and 641235 transitions. Second operand 6 states. [2019-09-10 05:00:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:50,020 INFO L93 Difference]: Finished difference Result 435769 states and 730812 transitions. [2019-09-10 05:00:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:00:50,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-10 05:00:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:51,307 INFO L225 Difference]: With dead ends: 435769 [2019-09-10 05:00:51,307 INFO L226 Difference]: Without dead ends: 435765 [2019-09-10 05:00:51,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 05:00:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435765 states. [2019-09-10 05:00:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435765 to 363529. [2019-09-10 05:00:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363529 states. [2019-09-10 05:00:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363529 states to 363529 states and 585177 transitions. [2019-09-10 05:00:59,474 INFO L78 Accepts]: Start accepts. Automaton has 363529 states and 585177 transitions. Word has length 163 [2019-09-10 05:00:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:59,474 INFO L475 AbstractCegarLoop]: Abstraction has 363529 states and 585177 transitions. [2019-09-10 05:00:59,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 363529 states and 585177 transitions. [2019-09-10 05:00:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 05:00:59,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:59,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:00:59,480 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:59,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1818161165, now seen corresponding path program 1 times [2019-09-10 05:00:59,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:59,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:59,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:59,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:59,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:59,716 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 05:00:59,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:59,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:59,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:59,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:59,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:59,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:59,718 INFO L87 Difference]: Start difference. First operand 363529 states and 585177 transitions. Second operand 6 states. [2019-09-10 05:01:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:09,482 INFO L93 Difference]: Finished difference Result 397281 states and 664588 transitions. [2019-09-10 05:01:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:01:09,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-10 05:01:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:10,665 INFO L225 Difference]: With dead ends: 397281 [2019-09-10 05:01:10,665 INFO L226 Difference]: Without dead ends: 397273 [2019-09-10 05:01:10,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 05:01:10,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397273 states. [2019-09-10 05:01:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397273 to 366387. [2019-09-10 05:01:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366387 states. [2019-09-10 05:01:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366387 states to 366387 states and 589279 transitions. [2019-09-10 05:01:17,095 INFO L78 Accepts]: Start accepts. Automaton has 366387 states and 589279 transitions. Word has length 163 [2019-09-10 05:01:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:17,096 INFO L475 AbstractCegarLoop]: Abstraction has 366387 states and 589279 transitions. [2019-09-10 05:01:17,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:01:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 366387 states and 589279 transitions. [2019-09-10 05:01:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 05:01:17,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:17,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:01:17,100 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -551243473, now seen corresponding path program 1 times [2019-09-10 05:01:17,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:17,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:17,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:17,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:17,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:23,869 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 05:01:23,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:23,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:01:23,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:23,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:01:23,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:01:23,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:01:23,871 INFO L87 Difference]: Start difference. First operand 366387 states and 589279 transitions. Second operand 6 states. [2019-09-10 05:01:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:29,056 INFO L93 Difference]: Finished difference Result 894020 states and 1442636 transitions. [2019-09-10 05:01:29,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:01:29,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-10 05:01:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:37,970 INFO L225 Difference]: With dead ends: 894020 [2019-09-10 05:01:37,970 INFO L226 Difference]: Without dead ends: 894020 [2019-09-10 05:01:37,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:01:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894020 states. [2019-09-10 05:01:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894020 to 684916. [2019-09-10 05:01:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684916 states. [2019-09-10 05:02:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684916 states to 684916 states and 1106365 transitions. [2019-09-10 05:02:01,370 INFO L78 Accepts]: Start accepts. Automaton has 684916 states and 1106365 transitions. Word has length 163 [2019-09-10 05:02:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:02:01,371 INFO L475 AbstractCegarLoop]: Abstraction has 684916 states and 1106365 transitions. [2019-09-10 05:02:01,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:02:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 684916 states and 1106365 transitions. [2019-09-10 05:02:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 05:02:01,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:02:01,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:02:01,376 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:02:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:02:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1283695039, now seen corresponding path program 1 times [2019-09-10 05:02:01,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:02:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:01,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:02:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:01,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:02:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:02:01,479 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 05:02:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:02:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:02:01,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:02:01,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:02:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:02:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:02:01,481 INFO L87 Difference]: Start difference. First operand 684916 states and 1106365 transitions. Second operand 5 states. [2019-09-10 05:02:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:02:19,155 INFO L93 Difference]: Finished difference Result 1190718 states and 1935875 transitions. [2019-09-10 05:02:19,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 05:02:19,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-09-10 05:02:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:02:23,568 INFO L225 Difference]: With dead ends: 1190718 [2019-09-10 05:02:23,568 INFO L226 Difference]: Without dead ends: 1190718 [2019-09-10 05:02:23,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:02:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190718 states. [2019-09-10 05:03:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190718 to 1182730. [2019-09-10 05:03:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182730 states. [2019-09-10 05:03:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182730 states to 1182730 states and 1919450 transitions. [2019-09-10 05:03:18,463 INFO L78 Accepts]: Start accepts. Automaton has 1182730 states and 1919450 transitions. Word has length 164 [2019-09-10 05:03:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:18,463 INFO L475 AbstractCegarLoop]: Abstraction has 1182730 states and 1919450 transitions. [2019-09-10 05:03:18,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:03:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1182730 states and 1919450 transitions. [2019-09-10 05:03:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 05:03:18,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:18,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:03:18,467 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:18,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1625068863, now seen corresponding path program 1 times [2019-09-10 05:03:18,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:18,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:18,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:18,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:18,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:20,762 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 05:03:20,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:20,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 05:03:20,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:20,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 05:03:20,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 05:03:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:03:20,764 INFO L87 Difference]: Start difference. First operand 1182730 states and 1919450 transitions. Second operand 12 states. [2019-09-10 05:03:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:56,225 INFO L93 Difference]: Finished difference Result 2018678 states and 3287278 transitions. [2019-09-10 05:03:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 05:03:56,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-09-10 05:03:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:04:03,673 INFO L225 Difference]: With dead ends: 2018678 [2019-09-10 05:04:03,673 INFO L226 Difference]: Without dead ends: 2018678 [2019-09-10 05:04:03,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 05:04:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018678 states.