java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:16:03,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:16:03,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:16:03,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:16:03,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:16:03,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:16:03,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:16:03,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:16:03,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:16:03,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:16:03,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:16:03,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:16:03,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:16:03,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:16:03,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:16:03,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:16:03,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:16:03,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:16:03,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:16:03,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:16:03,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:16:03,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:16:03,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:16:03,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:16:03,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:16:03,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:16:03,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:16:03,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:16:03,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:16:03,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:16:03,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:16:03,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:16:03,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:16:03,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:16:03,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:16:03,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:16:03,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:16:03,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:16:03,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:16:03,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:16:03,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:16:03,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:16:03,391 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:16:03,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:16:03,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:16:03,395 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:16:03,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:16:03,396 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:16:03,396 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:16:03,399 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:16:03,400 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:16:03,400 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:16:03,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:16:03,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:16:03,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:16:03,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:16:03,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:16:03,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:16:03,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:16:03,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:16:03,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:16:03,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:16:03,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:16:03,405 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:16:03,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:16:03,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:16:03,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:16:03,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:16:03,406 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:16:03,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:16:03,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:16:03,407 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:16:03,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:16:03,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:16:03,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:16:03,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:16:03,461 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:16:03,462 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:16:03,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d695135/c8c795c7b2da42e7b8f378f0d5cb2147/FLAG0a6ee6bf5 [2019-09-10 07:16:04,026 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:16:04,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:16:04,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d695135/c8c795c7b2da42e7b8f378f0d5cb2147/FLAG0a6ee6bf5 [2019-09-10 07:16:04,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d695135/c8c795c7b2da42e7b8f378f0d5cb2147 [2019-09-10 07:16:04,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:16:04,381 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:16:04,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:16:04,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:16:04,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:16:04,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:16:04" (1/1) ... [2019-09-10 07:16:04,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c3f56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04, skipping insertion in model container [2019-09-10 07:16:04,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:16:04" (1/1) ... [2019-09-10 07:16:04,399 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:16:04,469 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:16:04,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:16:04,953 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:16:05,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:16:05,134 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:16:05,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:05 WrapperNode [2019-09-10 07:16:05,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:16:05,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:16:05,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:16:05,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:16:05,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:05" (1/1) ... [2019-09-10 07:16:05,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:05" (1/1) ... [2019-09-10 07:16:05,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:05" (1/1) ... [2019-09-10 07:16:05,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:05" (1/1) ... [2019-09-10 07:16:05,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:05" (1/1) ... [2019-09-10 07:16:05,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:05" (1/1) ... [2019-09-10 07:16:05,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:05" (1/1) ... [2019-09-10 07:16:05,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:16:05,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:16:05,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:16:05,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:16:05,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:16:05,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:16:05,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:16:05,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:16:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:16:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:16:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:16:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:16:05,288 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:16:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:16:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:16:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:16:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:16:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:16:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:16:05,292 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:16:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:16:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:16:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:16:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:16:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:16:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:16:06,565 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:16:06,565 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:16:06,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:16:06 BoogieIcfgContainer [2019-09-10 07:16:06,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:16:06,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:16:06,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:16:06,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:16:06,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:16:04" (1/3) ... [2019-09-10 07:16:06,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27243e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:16:06, skipping insertion in model container [2019-09-10 07:16:06,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:05" (2/3) ... [2019-09-10 07:16:06,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27243e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:16:06, skipping insertion in model container [2019-09-10 07:16:06,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:16:06" (3/3) ... [2019-09-10 07:16:06,576 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:16:06,587 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:16:06,598 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:16:06,617 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:16:06,664 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:16:06,664 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:16:06,664 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:16:06,665 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:16:06,665 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:16:06,665 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:16:06,665 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:16:06,665 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:16:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2019-09-10 07:16:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:16:06,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:06,706 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:06,708 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2015518254, now seen corresponding path program 1 times [2019-09-10 07:16:06,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:06,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:06,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:06,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:06,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:07,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:07,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:07,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:07,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:07,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:07,324 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 3 states. [2019-09-10 07:16:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:07,464 INFO L93 Difference]: Finished difference Result 340 states and 560 transitions. [2019-09-10 07:16:07,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:07,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:16:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:07,484 INFO L225 Difference]: With dead ends: 340 [2019-09-10 07:16:07,484 INFO L226 Difference]: Without dead ends: 332 [2019-09-10 07:16:07,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-10 07:16:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-09-10 07:16:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 07:16:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 494 transitions. [2019-09-10 07:16:07,558 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 494 transitions. Word has length 84 [2019-09-10 07:16:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:07,559 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 494 transitions. [2019-09-10 07:16:07,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 494 transitions. [2019-09-10 07:16:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:16:07,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:07,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:07,565 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:07,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2072558176, now seen corresponding path program 1 times [2019-09-10 07:16:07,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:07,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:07,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:07,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:07,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:16:07,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:07,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:16:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:16:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:07,840 INFO L87 Difference]: Start difference. First operand 330 states and 494 transitions. Second operand 7 states. [2019-09-10 07:16:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:08,272 INFO L93 Difference]: Finished difference Result 1170 states and 1799 transitions. [2019-09-10 07:16:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:16:08,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-10 07:16:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:08,285 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 07:16:08,286 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 07:16:08,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 07:16:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1162. [2019-09-10 07:16:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-09-10 07:16:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1795 transitions. [2019-09-10 07:16:08,363 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1795 transitions. Word has length 85 [2019-09-10 07:16:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:08,365 INFO L475 AbstractCegarLoop]: Abstraction has 1162 states and 1795 transitions. [2019-09-10 07:16:08,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:16:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1795 transitions. [2019-09-10 07:16:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:16:08,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:08,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] [2019-09-10 07:16:08,380 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1529357462, now seen corresponding path program 1 times [2019-09-10 07:16:08,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:08,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:08,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:08,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:08,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:08,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:08,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:16:08,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:08,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:16:08,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:16:08,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:16:08,553 INFO L87 Difference]: Start difference. First operand 1162 states and 1795 transitions. Second operand 6 states. [2019-09-10 07:16:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:09,020 INFO L93 Difference]: Finished difference Result 2874 states and 4492 transitions. [2019-09-10 07:16:09,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:16:09,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-10 07:16:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:09,039 INFO L225 Difference]: With dead ends: 2874 [2019-09-10 07:16:09,040 INFO L226 Difference]: Without dead ends: 2874 [2019-09-10 07:16:09,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:16:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2019-09-10 07:16:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2870. [2019-09-10 07:16:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2870 states. [2019-09-10 07:16:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 4490 transitions. [2019-09-10 07:16:09,107 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 4490 transitions. Word has length 86 [2019-09-10 07:16:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:09,108 INFO L475 AbstractCegarLoop]: Abstraction has 2870 states and 4490 transitions. [2019-09-10 07:16:09,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:16:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 4490 transitions. [2019-09-10 07:16:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:16:09,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:09,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:09,113 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash 792250185, now seen corresponding path program 1 times [2019-09-10 07:16:09,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:09,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:09,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:09,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:09,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:09,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:09,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:16:09,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:09,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:16:09,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:16:09,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:09,283 INFO L87 Difference]: Start difference. First operand 2870 states and 4490 transitions. Second operand 5 states. [2019-09-10 07:16:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:09,612 INFO L93 Difference]: Finished difference Result 5186 states and 8127 transitions. [2019-09-10 07:16:09,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:16:09,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:16:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:09,650 INFO L225 Difference]: With dead ends: 5186 [2019-09-10 07:16:09,650 INFO L226 Difference]: Without dead ends: 5186 [2019-09-10 07:16:09,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2019-09-10 07:16:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5184. [2019-09-10 07:16:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5184 states. [2019-09-10 07:16:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 8126 transitions. [2019-09-10 07:16:09,871 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 8126 transitions. Word has length 86 [2019-09-10 07:16:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:09,871 INFO L475 AbstractCegarLoop]: Abstraction has 5184 states and 8126 transitions. [2019-09-10 07:16:09,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:16:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 8126 transitions. [2019-09-10 07:16:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:16:09,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:09,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:09,883 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1699352504, now seen corresponding path program 1 times [2019-09-10 07:16:09,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:09,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:09,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:09,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:09,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:10,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:10,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:16:10,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:10,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:16:10,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:16:10,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:10,057 INFO L87 Difference]: Start difference. First operand 5184 states and 8126 transitions. Second operand 5 states. [2019-09-10 07:16:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:10,422 INFO L93 Difference]: Finished difference Result 9834 states and 15382 transitions. [2019-09-10 07:16:10,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:16:10,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:16:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:10,480 INFO L225 Difference]: With dead ends: 9834 [2019-09-10 07:16:10,480 INFO L226 Difference]: Without dead ends: 9834 [2019-09-10 07:16:10,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2019-09-10 07:16:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9832. [2019-09-10 07:16:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9832 states. [2019-09-10 07:16:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9832 states to 9832 states and 15381 transitions. [2019-09-10 07:16:10,728 INFO L78 Accepts]: Start accepts. Automaton has 9832 states and 15381 transitions. Word has length 86 [2019-09-10 07:16:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:10,728 INFO L475 AbstractCegarLoop]: Abstraction has 9832 states and 15381 transitions. [2019-09-10 07:16:10,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:16:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9832 states and 15381 transitions. [2019-09-10 07:16:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:16:10,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:10,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:10,733 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -327564249, now seen corresponding path program 1 times [2019-09-10 07:16:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:10,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:10,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:10,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:10,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:16:10,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:10,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:16:10,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:16:10,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:10,841 INFO L87 Difference]: Start difference. First operand 9832 states and 15381 transitions. Second operand 5 states. [2019-09-10 07:16:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:11,251 INFO L93 Difference]: Finished difference Result 19228 states and 29964 transitions. [2019-09-10 07:16:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:16:11,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:16:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:11,309 INFO L225 Difference]: With dead ends: 19228 [2019-09-10 07:16:11,309 INFO L226 Difference]: Without dead ends: 19228 [2019-09-10 07:16:11,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19228 states. [2019-09-10 07:16:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19228 to 19226. [2019-09-10 07:16:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19226 states. [2019-09-10 07:16:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19226 states to 19226 states and 29963 transitions. [2019-09-10 07:16:11,651 INFO L78 Accepts]: Start accepts. Automaton has 19226 states and 29963 transitions. Word has length 86 [2019-09-10 07:16:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:11,651 INFO L475 AbstractCegarLoop]: Abstraction has 19226 states and 29963 transitions. [2019-09-10 07:16:11,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:16:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 19226 states and 29963 transitions. [2019-09-10 07:16:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:16:11,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:11,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:11,658 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:11,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:11,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2020962565, now seen corresponding path program 1 times [2019-09-10 07:16:11,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:11,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:11,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:11,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:11,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:11,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:11,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:16:11,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:11,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:16:11,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:16:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:11,845 INFO L87 Difference]: Start difference. First operand 19226 states and 29963 transitions. Second operand 5 states. [2019-09-10 07:16:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:12,229 INFO L93 Difference]: Finished difference Result 34938 states and 54078 transitions. [2019-09-10 07:16:12,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:16:12,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:16:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:12,304 INFO L225 Difference]: With dead ends: 34938 [2019-09-10 07:16:12,305 INFO L226 Difference]: Without dead ends: 34938 [2019-09-10 07:16:12,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34938 states. [2019-09-10 07:16:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34938 to 34936. [2019-09-10 07:16:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34936 states. [2019-09-10 07:16:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34936 states to 34936 states and 54077 transitions. [2019-09-10 07:16:13,004 INFO L78 Accepts]: Start accepts. Automaton has 34936 states and 54077 transitions. Word has length 86 [2019-09-10 07:16:13,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:13,005 INFO L475 AbstractCegarLoop]: Abstraction has 34936 states and 54077 transitions. [2019-09-10 07:16:13,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:16:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 34936 states and 54077 transitions. [2019-09-10 07:16:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:16:13,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:13,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:13,014 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:13,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1584577227, now seen corresponding path program 1 times [2019-09-10 07:16:13,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:13,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:13,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:13,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:13,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:13,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:13,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:16:13,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:13,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:16:13,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:16:13,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:13,107 INFO L87 Difference]: Start difference. First operand 34936 states and 54077 transitions. Second operand 5 states. [2019-09-10 07:16:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:13,342 INFO L93 Difference]: Finished difference Result 65272 states and 100333 transitions. [2019-09-10 07:16:13,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:16:13,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:16:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:13,528 INFO L225 Difference]: With dead ends: 65272 [2019-09-10 07:16:13,528 INFO L226 Difference]: Without dead ends: 65272 [2019-09-10 07:16:13,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 07:16:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65272 states. [2019-09-10 07:16:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65272 to 35368. [2019-09-10 07:16:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35368 states. [2019-09-10 07:16:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35368 states to 35368 states and 54509 transitions. [2019-09-10 07:16:15,246 INFO L78 Accepts]: Start accepts. Automaton has 35368 states and 54509 transitions. Word has length 87 [2019-09-10 07:16:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:15,247 INFO L475 AbstractCegarLoop]: Abstraction has 35368 states and 54509 transitions. [2019-09-10 07:16:15,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:16:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 35368 states and 54509 transitions. [2019-09-10 07:16:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:16:15,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:15,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:15,256 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2139259668, now seen corresponding path program 1 times [2019-09-10 07:16:15,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:15,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:15,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:15,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:15,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:15,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:15,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:16:15,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:15,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:16:15,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:16:15,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:16:15,692 INFO L87 Difference]: Start difference. First operand 35368 states and 54509 transitions. Second operand 10 states. [2019-09-10 07:16:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:19,168 INFO L93 Difference]: Finished difference Result 287888 states and 443923 transitions. [2019-09-10 07:16:19,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 07:16:19,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:16:19,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:21,573 INFO L225 Difference]: With dead ends: 287888 [2019-09-10 07:16:21,573 INFO L226 Difference]: Without dead ends: 287888 [2019-09-10 07:16:21,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:16:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287888 states. [2019-09-10 07:16:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287888 to 35603. [2019-09-10 07:16:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35603 states. [2019-09-10 07:16:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35603 states to 35603 states and 54806 transitions. [2019-09-10 07:16:23,329 INFO L78 Accepts]: Start accepts. Automaton has 35603 states and 54806 transitions. Word has length 88 [2019-09-10 07:16:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:23,330 INFO L475 AbstractCegarLoop]: Abstraction has 35603 states and 54806 transitions. [2019-09-10 07:16:23,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:16:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 35603 states and 54806 transitions. [2019-09-10 07:16:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:16:23,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:23,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:23,341 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:23,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:23,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1011869172, now seen corresponding path program 1 times [2019-09-10 07:16:23,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:23,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:23,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:23,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:23,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:23,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:23,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:16:23,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:23,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:16:23,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:16:23,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:16:23,587 INFO L87 Difference]: Start difference. First operand 35603 states and 54806 transitions. Second operand 10 states. [2019-09-10 07:16:24,158 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-10 07:16:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:26,603 INFO L93 Difference]: Finished difference Result 184530 states and 282798 transitions. [2019-09-10 07:16:26,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:16:26,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:16:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:26,934 INFO L225 Difference]: With dead ends: 184530 [2019-09-10 07:16:26,935 INFO L226 Difference]: Without dead ends: 184530 [2019-09-10 07:16:26,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:16:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184530 states. [2019-09-10 07:16:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184530 to 35603. [2019-09-10 07:16:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35603 states. [2019-09-10 07:16:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35603 states to 35603 states and 54804 transitions. [2019-09-10 07:16:28,222 INFO L78 Accepts]: Start accepts. Automaton has 35603 states and 54804 transitions. Word has length 88 [2019-09-10 07:16:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:28,223 INFO L475 AbstractCegarLoop]: Abstraction has 35603 states and 54804 transitions. [2019-09-10 07:16:28,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:16:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 35603 states and 54804 transitions. [2019-09-10 07:16:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:16:28,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:28,233 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:28,233 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1484118612, now seen corresponding path program 1 times [2019-09-10 07:16:28,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:28,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:28,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:28,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:28,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:28,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:28,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:16:28,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:28,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:16:28,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:16:28,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:16:28,468 INFO L87 Difference]: Start difference. First operand 35603 states and 54804 transitions. Second operand 10 states. [2019-09-10 07:16:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:31,571 INFO L93 Difference]: Finished difference Result 108237 states and 164421 transitions. [2019-09-10 07:16:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:16:31,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:16:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:31,727 INFO L225 Difference]: With dead ends: 108237 [2019-09-10 07:16:31,728 INFO L226 Difference]: Without dead ends: 108237 [2019-09-10 07:16:31,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:16:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108237 states. [2019-09-10 07:16:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108237 to 36251. [2019-09-10 07:16:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36251 states. [2019-09-10 07:16:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36251 states to 36251 states and 55744 transitions. [2019-09-10 07:16:32,624 INFO L78 Accepts]: Start accepts. Automaton has 36251 states and 55744 transitions. Word has length 88 [2019-09-10 07:16:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:32,625 INFO L475 AbstractCegarLoop]: Abstraction has 36251 states and 55744 transitions. [2019-09-10 07:16:32,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:16:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 36251 states and 55744 transitions. [2019-09-10 07:16:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:16:32,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:32,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:32,644 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:32,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1369706164, now seen corresponding path program 1 times [2019-09-10 07:16:32,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:32,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:32,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:32,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:32,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:16:32,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:32,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:16:32,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:16:32,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:16:32,879 INFO L87 Difference]: Start difference. First operand 36251 states and 55744 transitions. Second operand 10 states. [2019-09-10 07:16:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:36,143 INFO L93 Difference]: Finished difference Result 230103 states and 351344 transitions. [2019-09-10 07:16:36,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:16:36,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:16:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:36,829 INFO L225 Difference]: With dead ends: 230103 [2019-09-10 07:16:36,830 INFO L226 Difference]: Without dead ends: 230103 [2019-09-10 07:16:36,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:16:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230103 states. [2019-09-10 07:16:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230103 to 36999. [2019-09-10 07:16:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36999 states. [2019-09-10 07:16:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36999 states to 36999 states and 56725 transitions. [2019-09-10 07:16:39,695 INFO L78 Accepts]: Start accepts. Automaton has 36999 states and 56725 transitions. Word has length 88 [2019-09-10 07:16:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:39,696 INFO L475 AbstractCegarLoop]: Abstraction has 36999 states and 56725 transitions. [2019-09-10 07:16:39,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:16:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 36999 states and 56725 transitions. [2019-09-10 07:16:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:16:39,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:39,708 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:39,708 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash -28915572, now seen corresponding path program 1 times [2019-09-10 07:16:39,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:39,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:39,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:39,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:39,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:16:39,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:39,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:16:39,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:16:39,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:16:39,939 INFO L87 Difference]: Start difference. First operand 36999 states and 56725 transitions. Second operand 10 states. [2019-09-10 07:16:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:43,513 INFO L93 Difference]: Finished difference Result 242627 states and 369269 transitions. [2019-09-10 07:16:43,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:16:43,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:16:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:43,828 INFO L225 Difference]: With dead ends: 242627 [2019-09-10 07:16:43,828 INFO L226 Difference]: Without dead ends: 242627 [2019-09-10 07:16:43,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:16:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242627 states. [2019-09-10 07:16:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242627 to 37374. [2019-09-10 07:16:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37374 states. [2019-09-10 07:16:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37374 states to 37374 states and 57159 transitions. [2019-09-10 07:16:45,843 INFO L78 Accepts]: Start accepts. Automaton has 37374 states and 57159 transitions. Word has length 88 [2019-09-10 07:16:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:45,843 INFO L475 AbstractCegarLoop]: Abstraction has 37374 states and 57159 transitions. [2019-09-10 07:16:45,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:16:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 37374 states and 57159 transitions. [2019-09-10 07:16:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:16:45,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:45,855 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:45,855 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash -849303856, now seen corresponding path program 1 times [2019-09-10 07:16:45,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:45,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:45,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:45,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:45,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:45,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:45,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:45,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:45,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:45,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:45,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:45,910 INFO L87 Difference]: Start difference. First operand 37374 states and 57159 transitions. Second operand 3 states. [2019-09-10 07:16:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:46,056 INFO L93 Difference]: Finished difference Result 47260 states and 71418 transitions. [2019-09-10 07:16:46,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:46,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:16:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:46,124 INFO L225 Difference]: With dead ends: 47260 [2019-09-10 07:16:46,124 INFO L226 Difference]: Without dead ends: 47260 [2019-09-10 07:16:46,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47260 states. [2019-09-10 07:16:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47260 to 46898. [2019-09-10 07:16:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46898 states. [2019-09-10 07:16:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46898 states to 46898 states and 71057 transitions. [2019-09-10 07:16:46,832 INFO L78 Accepts]: Start accepts. Automaton has 46898 states and 71057 transitions. Word has length 89 [2019-09-10 07:16:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:46,832 INFO L475 AbstractCegarLoop]: Abstraction has 46898 states and 71057 transitions. [2019-09-10 07:16:46,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 46898 states and 71057 transitions. [2019-09-10 07:16:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:16:46,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:46,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:46,844 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:46,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1873505628, now seen corresponding path program 1 times [2019-09-10 07:16:46,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:46,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:46,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:46,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:46,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:46,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:16:46,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:46,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:16:46,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:16:46,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:16:46,977 INFO L87 Difference]: Start difference. First operand 46898 states and 71057 transitions. Second operand 4 states. [2019-09-10 07:16:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:47,330 INFO L93 Difference]: Finished difference Result 85804 states and 128722 transitions. [2019-09-10 07:16:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:16:47,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 07:16:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:47,479 INFO L225 Difference]: With dead ends: 85804 [2019-09-10 07:16:47,480 INFO L226 Difference]: Without dead ends: 85804 [2019-09-10 07:16:47,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85804 states. [2019-09-10 07:16:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85804 to 85242. [2019-09-10 07:16:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85242 states. [2019-09-10 07:16:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85242 states to 85242 states and 128161 transitions. [2019-09-10 07:16:48,517 INFO L78 Accepts]: Start accepts. Automaton has 85242 states and 128161 transitions. Word has length 89 [2019-09-10 07:16:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:48,517 INFO L475 AbstractCegarLoop]: Abstraction has 85242 states and 128161 transitions. [2019-09-10 07:16:48,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:16:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 85242 states and 128161 transitions. [2019-09-10 07:16:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:16:48,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:48,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:48,527 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash 354142704, now seen corresponding path program 1 times [2019-09-10 07:16:48,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:48,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:48,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:48,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:48,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:48,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:48,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:48,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:48,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:48,584 INFO L87 Difference]: Start difference. First operand 85242 states and 128161 transitions. Second operand 3 states. [2019-09-10 07:16:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:48,874 INFO L93 Difference]: Finished difference Result 116317 states and 173275 transitions. [2019-09-10 07:16:48,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:48,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:16:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:49,067 INFO L225 Difference]: With dead ends: 116317 [2019-09-10 07:16:49,067 INFO L226 Difference]: Without dead ends: 116317 [2019-09-10 07:16:49,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116317 states. [2019-09-10 07:16:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116317 to 116051. [2019-09-10 07:16:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116051 states. [2019-09-10 07:16:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116051 states to 116051 states and 173010 transitions. [2019-09-10 07:16:51,124 INFO L78 Accepts]: Start accepts. Automaton has 116051 states and 173010 transitions. Word has length 89 [2019-09-10 07:16:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:51,124 INFO L475 AbstractCegarLoop]: Abstraction has 116051 states and 173010 transitions. [2019-09-10 07:16:51,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 116051 states and 173010 transitions. [2019-09-10 07:16:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:16:51,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:51,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:51,136 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:51,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1105953187, now seen corresponding path program 1 times [2019-09-10 07:16:51,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:51,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:51,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:51,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:51,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:51,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:51,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:51,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:51,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:51,186 INFO L87 Difference]: Start difference. First operand 116051 states and 173010 transitions. Second operand 3 states. [2019-09-10 07:16:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:51,581 INFO L93 Difference]: Finished difference Result 129313 states and 189149 transitions. [2019-09-10 07:16:51,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:51,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:16:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:51,878 INFO L225 Difference]: With dead ends: 129313 [2019-09-10 07:16:51,878 INFO L226 Difference]: Without dead ends: 128265 [2019-09-10 07:16:51,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128265 states. [2019-09-10 07:16:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128265 to 113445. [2019-09-10 07:16:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113445 states. [2019-09-10 07:16:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113445 states to 113445 states and 166584 transitions. [2019-09-10 07:16:53,716 INFO L78 Accepts]: Start accepts. Automaton has 113445 states and 166584 transitions. Word has length 89 [2019-09-10 07:16:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:53,716 INFO L475 AbstractCegarLoop]: Abstraction has 113445 states and 166584 transitions. [2019-09-10 07:16:53,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 113445 states and 166584 transitions. [2019-09-10 07:16:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:16:53,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:53,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:53,728 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1939422446, now seen corresponding path program 1 times [2019-09-10 07:16:53,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:53,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:53,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:53,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:53,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:53,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:53,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:53,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:53,791 INFO L87 Difference]: Start difference. First operand 113445 states and 166584 transitions. Second operand 3 states. [2019-09-10 07:16:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:54,223 INFO L93 Difference]: Finished difference Result 120934 states and 173795 transitions. [2019-09-10 07:16:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:54,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:16:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:54,432 INFO L225 Difference]: With dead ends: 120934 [2019-09-10 07:16:54,433 INFO L226 Difference]: Without dead ends: 120934 [2019-09-10 07:16:54,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120934 states. [2019-09-10 07:16:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120934 to 119740. [2019-09-10 07:16:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119740 states. [2019-09-10 07:16:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119740 states to 119740 states and 172602 transitions. [2019-09-10 07:16:56,287 INFO L78 Accepts]: Start accepts. Automaton has 119740 states and 172602 transitions. Word has length 89 [2019-09-10 07:16:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:56,287 INFO L475 AbstractCegarLoop]: Abstraction has 119740 states and 172602 transitions. [2019-09-10 07:16:56,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 119740 states and 172602 transitions. [2019-09-10 07:16:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:16:56,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:56,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:56,296 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:56,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1377715858, now seen corresponding path program 1 times [2019-09-10 07:16:56,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:56,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:56,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:56,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:56,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:56,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:56,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:56,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:56,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:56,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:56,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:56,364 INFO L87 Difference]: Start difference. First operand 119740 states and 172602 transitions. Second operand 3 states. [2019-09-10 07:16:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:56,874 INFO L93 Difference]: Finished difference Result 163297 states and 231057 transitions. [2019-09-10 07:16:56,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:56,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:16:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:57,164 INFO L225 Difference]: With dead ends: 163297 [2019-09-10 07:16:57,165 INFO L226 Difference]: Without dead ends: 163297 [2019-09-10 07:16:57,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:57,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163297 states. [2019-09-10 07:16:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163297 to 161959. [2019-09-10 07:16:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161959 states. [2019-09-10 07:16:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161959 states to 161959 states and 229720 transitions. [2019-09-10 07:16:59,525 INFO L78 Accepts]: Start accepts. Automaton has 161959 states and 229720 transitions. Word has length 89 [2019-09-10 07:16:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:59,525 INFO L475 AbstractCegarLoop]: Abstraction has 161959 states and 229720 transitions. [2019-09-10 07:16:59,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 161959 states and 229720 transitions. [2019-09-10 07:16:59,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:16:59,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:59,531 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:59,532 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:59,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2021811832, now seen corresponding path program 1 times [2019-09-10 07:16:59,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:59,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:59,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:59,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:59,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:59,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:59,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:16:59,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:59,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:16:59,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:16:59,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:59,631 INFO L87 Difference]: Start difference. First operand 161959 states and 229720 transitions. Second operand 7 states. [2019-09-10 07:17:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:02,044 INFO L93 Difference]: Finished difference Result 736203 states and 1037769 transitions. [2019-09-10 07:17:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:17:02,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:17:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:03,043 INFO L225 Difference]: With dead ends: 736203 [2019-09-10 07:17:03,043 INFO L226 Difference]: Without dead ends: 736203 [2019-09-10 07:17:03,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:17:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736203 states. [2019-09-10 07:17:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736203 to 162171. [2019-09-10 07:17:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162171 states. [2019-09-10 07:17:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162171 states to 162171 states and 229975 transitions. [2019-09-10 07:17:14,385 INFO L78 Accepts]: Start accepts. Automaton has 162171 states and 229975 transitions. Word has length 90 [2019-09-10 07:17:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:14,385 INFO L475 AbstractCegarLoop]: Abstraction has 162171 states and 229975 transitions. [2019-09-10 07:17:14,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:17:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 162171 states and 229975 transitions. [2019-09-10 07:17:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:17:14,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:14,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:14,393 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:14,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1199896505, now seen corresponding path program 1 times [2019-09-10 07:17:14,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:14,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:14,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:15,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:15,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:15,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:15,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:15,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:15,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:15,118 INFO L87 Difference]: Start difference. First operand 162171 states and 229975 transitions. Second operand 7 states. [2019-09-10 07:17:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:16,977 INFO L93 Difference]: Finished difference Result 501747 states and 703590 transitions. [2019-09-10 07:17:16,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:17:16,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:17:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:17,824 INFO L225 Difference]: With dead ends: 501747 [2019-09-10 07:17:17,824 INFO L226 Difference]: Without dead ends: 501747 [2019-09-10 07:17:17,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:17:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501747 states. [2019-09-10 07:17:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501747 to 204061. [2019-09-10 07:17:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204061 states. [2019-09-10 07:17:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204061 states to 204061 states and 288843 transitions. [2019-09-10 07:17:26,286 INFO L78 Accepts]: Start accepts. Automaton has 204061 states and 288843 transitions. Word has length 90 [2019-09-10 07:17:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:26,287 INFO L475 AbstractCegarLoop]: Abstraction has 204061 states and 288843 transitions. [2019-09-10 07:17:26,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:17:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 204061 states and 288843 transitions. [2019-09-10 07:17:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:17:26,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:26,293 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:26,293 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:26,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:26,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1439056758, now seen corresponding path program 1 times [2019-09-10 07:17:26,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:26,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:26,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:26,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:26,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:26,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:26,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:26,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:26,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:26,399 INFO L87 Difference]: Start difference. First operand 204061 states and 288843 transitions. Second operand 7 states. [2019-09-10 07:17:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:28,873 INFO L93 Difference]: Finished difference Result 838453 states and 1172976 transitions. [2019-09-10 07:17:28,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:17:28,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:17:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:37,354 INFO L225 Difference]: With dead ends: 838453 [2019-09-10 07:17:37,355 INFO L226 Difference]: Without dead ends: 838453 [2019-09-10 07:17:37,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:17:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838453 states. [2019-09-10 07:17:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838453 to 204680. [2019-09-10 07:17:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204680 states. [2019-09-10 07:17:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204680 states to 204680 states and 289589 transitions. [2019-09-10 07:17:43,432 INFO L78 Accepts]: Start accepts. Automaton has 204680 states and 289589 transitions. Word has length 90 [2019-09-10 07:17:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:43,432 INFO L475 AbstractCegarLoop]: Abstraction has 204680 states and 289589 transitions. [2019-09-10 07:17:43,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:17:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 204680 states and 289589 transitions. [2019-09-10 07:17:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:17:43,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:43,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:43,440 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1741962972, now seen corresponding path program 1 times [2019-09-10 07:17:43,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:43,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:43,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:43,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:43,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:43,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:43,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:43,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:43,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:43,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:43,542 INFO L87 Difference]: Start difference. First operand 204680 states and 289589 transitions. Second operand 7 states. [2019-09-10 07:17:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:47,005 INFO L93 Difference]: Finished difference Result 827079 states and 1158732 transitions. [2019-09-10 07:17:47,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:17:47,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:17:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:48,312 INFO L225 Difference]: With dead ends: 827079 [2019-09-10 07:17:48,312 INFO L226 Difference]: Without dead ends: 827079 [2019-09-10 07:17:48,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:17:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827079 states. [2019-09-10 07:18:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827079 to 205081. [2019-09-10 07:18:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205081 states. [2019-09-10 07:18:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205081 states to 205081 states and 290080 transitions. [2019-09-10 07:18:03,416 INFO L78 Accepts]: Start accepts. Automaton has 205081 states and 290080 transitions. Word has length 90 [2019-09-10 07:18:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:03,416 INFO L475 AbstractCegarLoop]: Abstraction has 205081 states and 290080 transitions. [2019-09-10 07:18:03,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:18:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 205081 states and 290080 transitions. [2019-09-10 07:18:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:18:03,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:03,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:18:03,425 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:03,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1333696040, now seen corresponding path program 1 times [2019-09-10 07:18:03,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:03,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:03,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:03,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:03,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:18:03,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:03,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:18:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:18:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:18:03,527 INFO L87 Difference]: Start difference. First operand 205081 states and 290080 transitions. Second operand 7 states. [2019-09-10 07:18:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:06,573 INFO L93 Difference]: Finished difference Result 624279 states and 877121 transitions. [2019-09-10 07:18:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:18:06,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:18:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:07,431 INFO L225 Difference]: With dead ends: 624279 [2019-09-10 07:18:07,431 INFO L226 Difference]: Without dead ends: 624279 [2019-09-10 07:18:07,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:18:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624279 states. [2019-09-10 07:18:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624279 to 205201. [2019-09-10 07:18:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205201 states. [2019-09-10 07:18:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205201 states to 205201 states and 290224 transitions. [2019-09-10 07:18:17,227 INFO L78 Accepts]: Start accepts. Automaton has 205201 states and 290224 transitions. Word has length 90 [2019-09-10 07:18:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:17,227 INFO L475 AbstractCegarLoop]: Abstraction has 205201 states and 290224 transitions. [2019-09-10 07:18:17,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:18:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 205201 states and 290224 transitions. [2019-09-10 07:18:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:18:17,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:17,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:18:17,238 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:17,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1374139495, now seen corresponding path program 1 times [2019-09-10 07:18:17,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:17,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:17,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:17,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:17,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:17,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:17,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:18:17,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:17,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:18:17,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:18:17,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:18:17,391 INFO L87 Difference]: Start difference. First operand 205201 states and 290224 transitions. Second operand 7 states. [2019-09-10 07:18:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:20,170 INFO L93 Difference]: Finished difference Result 751830 states and 1063097 transitions. [2019-09-10 07:18:20,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:18:20,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:18:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:21,135 INFO L225 Difference]: With dead ends: 751830 [2019-09-10 07:18:21,135 INFO L226 Difference]: Without dead ends: 751830 [2019-09-10 07:18:21,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:18:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751830 states. [2019-09-10 07:18:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751830 to 233151. [2019-09-10 07:18:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233151 states. [2019-09-10 07:18:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233151 states to 233151 states and 330110 transitions. [2019-09-10 07:18:32,837 INFO L78 Accepts]: Start accepts. Automaton has 233151 states and 330110 transitions. Word has length 92 [2019-09-10 07:18:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:32,838 INFO L475 AbstractCegarLoop]: Abstraction has 233151 states and 330110 transitions. [2019-09-10 07:18:32,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:18:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 233151 states and 330110 transitions. [2019-09-10 07:18:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:18:32,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:32,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:18:32,850 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:32,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:32,850 INFO L82 PathProgramCache]: Analyzing trace with hash -646849668, now seen corresponding path program 1 times [2019-09-10 07:18:32,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:32,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:32,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:32,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:32,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:32,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:32,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:18:32,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:32,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:18:32,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:18:32,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:18:32,991 INFO L87 Difference]: Start difference. First operand 233151 states and 330110 transitions. Second operand 7 states. [2019-09-10 07:18:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:36,262 INFO L93 Difference]: Finished difference Result 782518 states and 1107265 transitions. [2019-09-10 07:18:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:18:36,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:18:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:37,479 INFO L225 Difference]: With dead ends: 782518 [2019-09-10 07:18:37,479 INFO L226 Difference]: Without dead ends: 782518 [2019-09-10 07:18:37,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:18:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782518 states. [2019-09-10 07:18:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782518 to 284955. [2019-09-10 07:18:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284955 states. [2019-09-10 07:18:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284955 states to 284955 states and 403129 transitions. [2019-09-10 07:18:51,419 INFO L78 Accepts]: Start accepts. Automaton has 284955 states and 403129 transitions. Word has length 92 [2019-09-10 07:18:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:51,419 INFO L475 AbstractCegarLoop]: Abstraction has 284955 states and 403129 transitions. [2019-09-10 07:18:51,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:18:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 284955 states and 403129 transitions. [2019-09-10 07:18:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:18:51,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:51,427 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:18:51,427 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:51,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash -494923189, now seen corresponding path program 1 times [2019-09-10 07:18:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:51,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:51,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:51,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:51,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:51,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:18:51,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:51,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:18:51,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:18:51,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:18:51,559 INFO L87 Difference]: Start difference. First operand 284955 states and 403129 transitions. Second operand 7 states. [2019-09-10 07:19:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:00,108 INFO L93 Difference]: Finished difference Result 803494 states and 1136299 transitions. [2019-09-10 07:19:00,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:19:00,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:19:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:01,501 INFO L225 Difference]: With dead ends: 803494 [2019-09-10 07:19:01,501 INFO L226 Difference]: Without dead ends: 803494 [2019-09-10 07:19:01,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:19:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803494 states. [2019-09-10 07:19:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803494 to 322269. [2019-09-10 07:19:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322269 states. [2019-09-10 07:19:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322269 states to 322269 states and 456449 transitions. [2019-09-10 07:19:08,448 INFO L78 Accepts]: Start accepts. Automaton has 322269 states and 456449 transitions. Word has length 92 [2019-09-10 07:19:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:08,448 INFO L475 AbstractCegarLoop]: Abstraction has 322269 states and 456449 transitions. [2019-09-10 07:19:08,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:19:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 322269 states and 456449 transitions. [2019-09-10 07:19:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:19:08,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:08,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:08,456 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:08,456 INFO L82 PathProgramCache]: Analyzing trace with hash 946118557, now seen corresponding path program 1 times [2019-09-10 07:19:08,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:08,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:08,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:08,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:08,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:19:08,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:08,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:19:08,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:19:08,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:19:08,600 INFO L87 Difference]: Start difference. First operand 322269 states and 456449 transitions. Second operand 7 states. [2019-09-10 07:19:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:11,891 INFO L93 Difference]: Finished difference Result 841289 states and 1189684 transitions. [2019-09-10 07:19:11,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:19:11,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:19:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:13,084 INFO L225 Difference]: With dead ends: 841289 [2019-09-10 07:19:13,084 INFO L226 Difference]: Without dead ends: 841289 [2019-09-10 07:19:13,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:19:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841289 states. [2019-09-10 07:19:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841289 to 373548. [2019-09-10 07:19:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373548 states. [2019-09-10 07:19:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373548 states to 373548 states and 529556 transitions. [2019-09-10 07:19:28,657 INFO L78 Accepts]: Start accepts. Automaton has 373548 states and 529556 transitions. Word has length 92 [2019-09-10 07:19:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:28,657 INFO L475 AbstractCegarLoop]: Abstraction has 373548 states and 529556 transitions. [2019-09-10 07:19:28,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:19:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 373548 states and 529556 transitions. [2019-09-10 07:19:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:19:28,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:28,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:28,665 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1908629869, now seen corresponding path program 1 times [2019-09-10 07:19:28,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:28,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:28,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:28,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:28,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:19:28,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:28,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:19:28,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:19:28,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:19:28,812 INFO L87 Difference]: Start difference. First operand 373548 states and 529556 transitions. Second operand 7 states. [2019-09-10 07:19:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:38,725 INFO L93 Difference]: Finished difference Result 872171 states and 1234447 transitions. [2019-09-10 07:19:38,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:19:38,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:19:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:40,150 INFO L225 Difference]: With dead ends: 872171 [2019-09-10 07:19:40,151 INFO L226 Difference]: Without dead ends: 872171 [2019-09-10 07:19:40,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:19:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872171 states. [2019-09-10 07:19:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872171 to 410731. [2019-09-10 07:19:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410731 states. [2019-09-10 07:19:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410731 states to 410731 states and 582153 transitions. [2019-09-10 07:19:48,278 INFO L78 Accepts]: Start accepts. Automaton has 410731 states and 582153 transitions. Word has length 92 [2019-09-10 07:19:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:48,278 INFO L475 AbstractCegarLoop]: Abstraction has 410731 states and 582153 transitions. [2019-09-10 07:19:48,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:19:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 410731 states and 582153 transitions. [2019-09-10 07:19:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:19:48,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:48,293 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] [2019-09-10 07:19:48,293 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:48,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:48,293 INFO L82 PathProgramCache]: Analyzing trace with hash -890562151, now seen corresponding path program 1 times [2019-09-10 07:19:48,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:48,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:48,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:48,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:48,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:48,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:48,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:19:48,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:48,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:19:48,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:19:48,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:19:48,777 INFO L87 Difference]: Start difference. First operand 410731 states and 582153 transitions. Second operand 13 states. [2019-09-10 07:19:49,307 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:19:49,499 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:19:49,700 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:19:49,937 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:19:50,173 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:19:50,421 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:19:50,562 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:19:50,825 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 07:19:51,414 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:19:52,030 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 07:20:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:13,211 INFO L93 Difference]: Finished difference Result 2550942 states and 3598133 transitions. [2019-09-10 07:20:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:20:13,211 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-10 07:20:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:18,610 INFO L225 Difference]: With dead ends: 2550942 [2019-09-10 07:20:18,610 INFO L226 Difference]: Without dead ends: 2550942 [2019-09-10 07:20:18,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:20:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550942 states. [2019-09-10 07:20:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550942 to 410494. [2019-09-10 07:20:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410494 states. [2019-09-10 07:20:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410494 states to 410494 states and 581844 transitions. [2019-09-10 07:20:50,765 INFO L78 Accepts]: Start accepts. Automaton has 410494 states and 581844 transitions. Word has length 97 [2019-09-10 07:20:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:50,766 INFO L475 AbstractCegarLoop]: Abstraction has 410494 states and 581844 transitions. [2019-09-10 07:20:50,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:20:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 410494 states and 581844 transitions. [2019-09-10 07:20:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:20:50,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:50,778 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] [2019-09-10 07:20:50,779 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:50,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash 92342314, now seen corresponding path program 1 times [2019-09-10 07:20:50,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:50,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:50,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:50,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:51,348 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-10 07:20:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:20:51,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:51,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:20:51,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:51,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:20:51,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:20:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:20:51,666 INFO L87 Difference]: Start difference. First operand 410494 states and 581844 transitions. Second operand 14 states. [2019-09-10 07:20:52,239 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:20:52,403 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:20:52,543 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 07:20:52,682 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 07:21:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:01,215 INFO L93 Difference]: Finished difference Result 1515350 states and 2135072 transitions. [2019-09-10 07:21:01,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:21:01,215 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-09-10 07:21:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:03,753 INFO L225 Difference]: With dead ends: 1515350 [2019-09-10 07:21:03,753 INFO L226 Difference]: Without dead ends: 1515350 [2019-09-10 07:21:03,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:21:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515350 states. [2019-09-10 07:21:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515350 to 774670. [2019-09-10 07:21:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774670 states. [2019-09-10 07:21:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774670 states to 774670 states and 1096139 transitions. [2019-09-10 07:21:31,087 INFO L78 Accepts]: Start accepts. Automaton has 774670 states and 1096139 transitions. Word has length 97 [2019-09-10 07:21:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:31,087 INFO L475 AbstractCegarLoop]: Abstraction has 774670 states and 1096139 transitions. [2019-09-10 07:21:31,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:21:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 774670 states and 1096139 transitions. [2019-09-10 07:21:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:21:31,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:31,102 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] [2019-09-10 07:21:31,102 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash 727160075, now seen corresponding path program 1 times [2019-09-10 07:21:31,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:31,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:31,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:31,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:31,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:21:31,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:31,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:21:31,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:31,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:21:31,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:21:31,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:21:31,662 INFO L87 Difference]: Start difference. First operand 774670 states and 1096139 transitions. Second operand 13 states. [2019-09-10 07:21:32,169 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-10 07:21:32,349 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 07:21:32,558 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:21:32,808 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 07:21:33,198 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-10 07:22:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:07,523 INFO L93 Difference]: Finished difference Result 3574646 states and 5056617 transitions. [2019-09-10 07:22:07,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:22:07,523 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-10 07:22:07,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:15,707 INFO L225 Difference]: With dead ends: 3574646 [2019-09-10 07:22:15,708 INFO L226 Difference]: Without dead ends: 3574646 [2019-09-10 07:22:15,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:22:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574646 states. [2019-09-10 07:23:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574646 to 774366. [2019-09-10 07:23:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774366 states. [2019-09-10 07:23:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774366 states to 774366 states and 1095759 transitions. [2019-09-10 07:23:04,809 INFO L78 Accepts]: Start accepts. Automaton has 774366 states and 1095759 transitions. Word has length 97 [2019-09-10 07:23:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:04,809 INFO L475 AbstractCegarLoop]: Abstraction has 774366 states and 1095759 transitions. [2019-09-10 07:23:04,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:23:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 774366 states and 1095759 transitions. [2019-09-10 07:23:04,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:23:04,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:04,826 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] [2019-09-10 07:23:04,826 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1766899687, now seen corresponding path program 1 times [2019-09-10 07:23:04,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:04,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:04,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:04,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:04,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:04,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:04,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:04,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:04,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:04,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:04,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:04,895 INFO L87 Difference]: Start difference. First operand 774366 states and 1095759 transitions. Second operand 3 states. [2019-09-10 07:23:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:18,157 INFO L93 Difference]: Finished difference Result 1216224 states and 1717667 transitions. [2019-09-10 07:23:18,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:18,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:23:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:20,274 INFO L225 Difference]: With dead ends: 1216224 [2019-09-10 07:23:20,274 INFO L226 Difference]: Without dead ends: 1216224 [2019-09-10 07:23:20,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216224 states. [2019-09-10 07:23:48,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216224 to 957112. [2019-09-10 07:23:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957112 states. [2019-09-10 07:23:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957112 states to 957112 states and 1354766 transitions. [2019-09-10 07:23:52,295 INFO L78 Accepts]: Start accepts. Automaton has 957112 states and 1354766 transitions. Word has length 98 [2019-09-10 07:23:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:52,296 INFO L475 AbstractCegarLoop]: Abstraction has 957112 states and 1354766 transitions. [2019-09-10 07:23:52,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 957112 states and 1354766 transitions. [2019-09-10 07:23:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:23:52,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:52,314 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] [2019-09-10 07:23:52,314 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1332063785, now seen corresponding path program 1 times [2019-09-10 07:23:52,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:52,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:52,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:52,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:52,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:52,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:52,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:52,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:52,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:52,364 INFO L87 Difference]: Start difference. First operand 957112 states and 1354766 transitions. Second operand 3 states. [2019-09-10 07:24:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:07,660 INFO L93 Difference]: Finished difference Result 1571006 states and 2222271 transitions. [2019-09-10 07:24:07,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:24:07,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:24:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:10,233 INFO L225 Difference]: With dead ends: 1571006 [2019-09-10 07:24:10,233 INFO L226 Difference]: Without dead ends: 1571006 [2019-09-10 07:24:10,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571006 states. [2019-09-10 07:24:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571006 to 1568799. [2019-09-10 07:24:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568799 states. [2019-09-10 07:24:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568799 states to 1568799 states and 2220065 transitions. [2019-09-10 07:24:55,526 INFO L78 Accepts]: Start accepts. Automaton has 1568799 states and 2220065 transitions. Word has length 101 [2019-09-10 07:24:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:55,527 INFO L475 AbstractCegarLoop]: Abstraction has 1568799 states and 2220065 transitions. [2019-09-10 07:24:55,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1568799 states and 2220065 transitions. [2019-09-10 07:24:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:24:55,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:55,546 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] [2019-09-10 07:24:55,547 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:55,547 INFO L82 PathProgramCache]: Analyzing trace with hash 591492711, now seen corresponding path program 1 times [2019-09-10 07:24:55,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:55,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:55,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:24:55,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:55,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:24:55,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:55,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:24:55,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:24:55,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:55,611 INFO L87 Difference]: Start difference. First operand 1568799 states and 2220065 transitions. Second operand 3 states.