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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:44:59,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:44:59,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:44:59,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:44:59,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:44:59,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:44:59,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:44:59,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:44:59,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:44:59,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:44:59,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:44:59,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:44:59,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:44:59,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:44:59,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:44:59,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:44:59,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:44:59,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:44:59,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:44:59,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:44:59,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:44:59,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:44:59,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:44:59,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:44:59,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:44:59,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:44:59,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:44:59,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:44:59,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:44:59,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:44:59,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:44:59,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:44:59,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:44:59,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:44:59,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:44:59,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:44:59,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:44:59,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:44:59,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:44:59,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:44:59,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:44:59,428 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 08:44:59,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:44:59,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:44:59,455 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:44:59,456 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:44:59,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:44:59,457 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:44:59,457 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:44:59,458 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:44:59,458 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:44:59,458 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:44:59,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:44:59,460 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:44:59,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:44:59,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:44:59,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:44:59,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:44:59,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:44:59,462 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:44:59,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:44:59,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:44:59,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:44:59,463 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:44:59,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:44:59,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:44:59,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:44:59,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:44:59,464 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:44:59,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:44:59,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:44:59,465 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:44:59,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:44:59,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:44:59,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:44:59,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:44:59,532 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:44:59,533 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 08:44:59,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7036475ea/1315e521d25144e8bc7188c7fc3afcfe/FLAGfc4bba205 [2019-09-10 08:45:00,176 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:45:00,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 08:45:00,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7036475ea/1315e521d25144e8bc7188c7fc3afcfe/FLAGfc4bba205 [2019-09-10 08:45:00,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7036475ea/1315e521d25144e8bc7188c7fc3afcfe [2019-09-10 08:45:00,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:45:00,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:45:00,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:45:00,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:45:00,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:45:00,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:45:00" (1/1) ... [2019-09-10 08:45:00,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75378872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:00, skipping insertion in model container [2019-09-10 08:45:00,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:45:00" (1/1) ... [2019-09-10 08:45:00,512 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:45:00,589 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:45:01,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:45:01,177 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:45:01,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:45:01,622 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:45:01,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:01 WrapperNode [2019-09-10 08:45:01,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:45:01,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:45:01,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:45:01,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:45:01,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:01" (1/1) ... [2019-09-10 08:45:01,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:01" (1/1) ... [2019-09-10 08:45:01,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:01" (1/1) ... [2019-09-10 08:45:01,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:01" (1/1) ... [2019-09-10 08:45:01,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:01" (1/1) ... [2019-09-10 08:45:01,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:01" (1/1) ... [2019-09-10 08:45:01,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:01" (1/1) ... [2019-09-10 08:45:01,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:45:01,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:45:01,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:45:01,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:45:01,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:01" (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 08:45:01,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:45:01,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:45:01,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:45:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:45:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:45:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:45:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:45:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:45:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:45:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:45:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:45:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:45:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:45:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:45:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:45:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:45:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:45:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:45:03,208 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:45:03,209 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:45:03,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:45:03 BoogieIcfgContainer [2019-09-10 08:45:03,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:45:03,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:45:03,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:45:03,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:45:03,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:45:00" (1/3) ... [2019-09-10 08:45:03,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c52ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:45:03, skipping insertion in model container [2019-09-10 08:45:03,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:45:01" (2/3) ... [2019-09-10 08:45:03,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c52ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:45:03, skipping insertion in model container [2019-09-10 08:45:03,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:45:03" (3/3) ... [2019-09-10 08:45:03,226 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-10 08:45:03,238 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:45:03,265 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:45:03,288 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:45:03,319 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:45:03,319 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:45:03,319 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:45:03,320 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:45:03,320 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:45:03,320 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:45:03,320 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:45:03,320 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:45:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states. [2019-09-10 08:45:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:45:03,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:03,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:03,407 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:03,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:03,414 INFO L82 PathProgramCache]: Analyzing trace with hash 424996304, now seen corresponding path program 1 times [2019-09-10 08:45:03,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:03,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:03,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:03,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:03,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:04,134 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 08:45:04,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:04,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:04,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:04,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:04,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:04,161 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 3 states. [2019-09-10 08:45:04,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:04,375 INFO L93 Difference]: Finished difference Result 548 states and 951 transitions. [2019-09-10 08:45:04,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:04,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-09-10 08:45:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:04,399 INFO L225 Difference]: With dead ends: 548 [2019-09-10 08:45:04,400 INFO L226 Difference]: Without dead ends: 540 [2019-09-10 08:45:04,401 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 08:45:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-10 08:45:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2019-09-10 08:45:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-09-10 08:45:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 803 transitions. [2019-09-10 08:45:04,504 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 803 transitions. Word has length 157 [2019-09-10 08:45:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:04,506 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 803 transitions. [2019-09-10 08:45:04,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 803 transitions. [2019-09-10 08:45:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:45:04,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:04,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:04,519 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:04,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1469457116, now seen corresponding path program 1 times [2019-09-10 08:45:04,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:04,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:04,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:04,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:05,074 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 08:45:05,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:05,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:05,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:05,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:05,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:05,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:05,078 INFO L87 Difference]: Start difference. First operand 538 states and 803 transitions. Second operand 4 states. [2019-09-10 08:45:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:05,185 INFO L93 Difference]: Finished difference Result 1036 states and 1530 transitions. [2019-09-10 08:45:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:05,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-10 08:45:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:05,192 INFO L225 Difference]: With dead ends: 1036 [2019-09-10 08:45:05,193 INFO L226 Difference]: Without dead ends: 1036 [2019-09-10 08:45:05,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 08:45:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-10 08:45:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2019-09-10 08:45:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-09-10 08:45:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1529 transitions. [2019-09-10 08:45:05,228 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1529 transitions. Word has length 157 [2019-09-10 08:45:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:05,229 INFO L475 AbstractCegarLoop]: Abstraction has 1034 states and 1529 transitions. [2019-09-10 08:45:05,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1529 transitions. [2019-09-10 08:45:05,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:45:05,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:05,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:05,234 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash -790671312, now seen corresponding path program 1 times [2019-09-10 08:45:05,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:05,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:05,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:05,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:05,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:05,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:05,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:05,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:05,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:05,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:05,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:05,367 INFO L87 Difference]: Start difference. First operand 1034 states and 1529 transitions. Second operand 3 states. [2019-09-10 08:45:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:05,406 INFO L93 Difference]: Finished difference Result 2054 states and 3037 transitions. [2019-09-10 08:45:05,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:05,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 08:45:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:05,424 INFO L225 Difference]: With dead ends: 2054 [2019-09-10 08:45:05,433 INFO L226 Difference]: Without dead ends: 2054 [2019-09-10 08:45:05,434 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 08:45:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2019-09-10 08:45:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1036. [2019-09-10 08:45:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-09-10 08:45:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1531 transitions. [2019-09-10 08:45:05,478 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1531 transitions. Word has length 158 [2019-09-10 08:45:05,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:05,478 INFO L475 AbstractCegarLoop]: Abstraction has 1036 states and 1531 transitions. [2019-09-10 08:45:05,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1531 transitions. [2019-09-10 08:45:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:45:05,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:05,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:05,483 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1966932605, now seen corresponding path program 1 times [2019-09-10 08:45:05,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:05,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:05,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:05,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:05,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:05,693 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 08:45:05,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:05,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:05,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:05,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:05,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:05,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:05,695 INFO L87 Difference]: Start difference. First operand 1036 states and 1531 transitions. Second operand 4 states. [2019-09-10 08:45:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:05,738 INFO L93 Difference]: Finished difference Result 1094 states and 1613 transitions. [2019-09-10 08:45:05,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:05,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-10 08:45:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:05,745 INFO L225 Difference]: With dead ends: 1094 [2019-09-10 08:45:05,745 INFO L226 Difference]: Without dead ends: 1034 [2019-09-10 08:45:05,746 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 08:45:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-09-10 08:45:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2019-09-10 08:45:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-09-10 08:45:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1527 transitions. [2019-09-10 08:45:05,777 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1527 transitions. Word has length 159 [2019-09-10 08:45:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:05,778 INFO L475 AbstractCegarLoop]: Abstraction has 1034 states and 1527 transitions. [2019-09-10 08:45:05,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1527 transitions. [2019-09-10 08:45:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:45:05,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:05,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:05,782 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:05,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:05,782 INFO L82 PathProgramCache]: Analyzing trace with hash 745680526, now seen corresponding path program 1 times [2019-09-10 08:45:05,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:05,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:05,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:05,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:05,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:06,040 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 08:45:06,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:06,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:06,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:06,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:06,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:06,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:06,042 INFO L87 Difference]: Start difference. First operand 1034 states and 1527 transitions. Second operand 3 states. [2019-09-10 08:45:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:06,129 INFO L93 Difference]: Finished difference Result 1530 states and 2232 transitions. [2019-09-10 08:45:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:06,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-10 08:45:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:06,139 INFO L225 Difference]: With dead ends: 1530 [2019-09-10 08:45:06,140 INFO L226 Difference]: Without dead ends: 1530 [2019-09-10 08:45:06,140 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 08:45:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2019-09-10 08:45:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1528. [2019-09-10 08:45:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-09-10 08:45:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2231 transitions. [2019-09-10 08:45:06,209 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2231 transitions. Word has length 159 [2019-09-10 08:45:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:06,210 INFO L475 AbstractCegarLoop]: Abstraction has 1528 states and 2231 transitions. [2019-09-10 08:45:06,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2231 transitions. [2019-09-10 08:45:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:45:06,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:06,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:06,217 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:06,218 INFO L82 PathProgramCache]: Analyzing trace with hash -51426036, now seen corresponding path program 1 times [2019-09-10 08:45:06,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:06,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:06,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:06,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:06,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:06,345 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 08:45:06,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:06,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:06,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:06,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:06,347 INFO L87 Difference]: Start difference. First operand 1528 states and 2231 transitions. Second operand 3 states. [2019-09-10 08:45:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:06,437 INFO L93 Difference]: Finished difference Result 2268 states and 3368 transitions. [2019-09-10 08:45:06,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:06,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 08:45:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:06,454 INFO L225 Difference]: With dead ends: 2268 [2019-09-10 08:45:06,455 INFO L226 Difference]: Without dead ends: 2268 [2019-09-10 08:45:06,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-09-10 08:45:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1952. [2019-09-10 08:45:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-10 08:45:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2919 transitions. [2019-09-10 08:45:06,543 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2919 transitions. Word has length 161 [2019-09-10 08:45:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:06,543 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 2919 transitions. [2019-09-10 08:45:06,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2919 transitions. [2019-09-10 08:45:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 08:45:06,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:06,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:06,550 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:06,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:06,551 INFO L82 PathProgramCache]: Analyzing trace with hash -541662678, now seen corresponding path program 1 times [2019-09-10 08:45:06,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:06,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:06,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:06,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:06,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:06,747 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 08:45:06,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:06,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:06,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:06,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:06,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:06,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:06,750 INFO L87 Difference]: Start difference. First operand 1952 states and 2919 transitions. Second operand 3 states. [2019-09-10 08:45:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:06,835 INFO L93 Difference]: Finished difference Result 2986 states and 4539 transitions. [2019-09-10 08:45:06,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:06,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-10 08:45:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:06,854 INFO L225 Difference]: With dead ends: 2986 [2019-09-10 08:45:06,854 INFO L226 Difference]: Without dead ends: 2986 [2019-09-10 08:45:06,855 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 08:45:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-09-10 08:45:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2706. [2019-09-10 08:45:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-09-10 08:45:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4140 transitions. [2019-09-10 08:45:06,946 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4140 transitions. Word has length 163 [2019-09-10 08:45:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:06,947 INFO L475 AbstractCegarLoop]: Abstraction has 2706 states and 4140 transitions. [2019-09-10 08:45:06,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4140 transitions. [2019-09-10 08:45:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:45:06,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:06,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:06,953 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:06,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:06,953 INFO L82 PathProgramCache]: Analyzing trace with hash 911873176, now seen corresponding path program 1 times [2019-09-10 08:45:06,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:06,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:06,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:06,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:06,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:07,174 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 08:45:07,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:07,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:45:07,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:07,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:45:07,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:45:07,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:07,177 INFO L87 Difference]: Start difference. First operand 2706 states and 4140 transitions. Second operand 5 states. [2019-09-10 08:45:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:07,588 INFO L93 Difference]: Finished difference Result 5078 states and 7795 transitions. [2019-09-10 08:45:07,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:45:07,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-09-10 08:45:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:07,615 INFO L225 Difference]: With dead ends: 5078 [2019-09-10 08:45:07,616 INFO L226 Difference]: Without dead ends: 5078 [2019-09-10 08:45:07,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:45:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-09-10 08:45:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5076. [2019-09-10 08:45:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-09-10 08:45:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7794 transitions. [2019-09-10 08:45:07,861 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7794 transitions. Word has length 164 [2019-09-10 08:45:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:07,862 INFO L475 AbstractCegarLoop]: Abstraction has 5076 states and 7794 transitions. [2019-09-10 08:45:07,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:45:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7794 transitions. [2019-09-10 08:45:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:45:07,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:07,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:07,871 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:07,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:07,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2112908957, now seen corresponding path program 1 times [2019-09-10 08:45:07,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:07,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:07,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:07,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:07,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:08,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:08,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:08,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:08,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:08,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:08,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:08,197 INFO L87 Difference]: Start difference. First operand 5076 states and 7794 transitions. Second operand 4 states. [2019-09-10 08:45:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:08,321 INFO L93 Difference]: Finished difference Result 8194 states and 12473 transitions. [2019-09-10 08:45:08,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:08,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-10 08:45:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:08,372 INFO L225 Difference]: With dead ends: 8194 [2019-09-10 08:45:08,372 INFO L226 Difference]: Without dead ends: 8194 [2019-09-10 08:45:08,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 08:45:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states. [2019-09-10 08:45:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8192. [2019-09-10 08:45:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8192 states. [2019-09-10 08:45:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 12472 transitions. [2019-09-10 08:45:08,613 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 12472 transitions. Word has length 164 [2019-09-10 08:45:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:08,614 INFO L475 AbstractCegarLoop]: Abstraction has 8192 states and 12472 transitions. [2019-09-10 08:45:08,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 12472 transitions. [2019-09-10 08:45:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:45:08,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:08,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:08,623 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:08,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1008257189, now seen corresponding path program 1 times [2019-09-10 08:45:08,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:08,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:08,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:08,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:08,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:08,765 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 08:45:08,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:08,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:08,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:08,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:08,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:08,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:08,849 INFO L87 Difference]: Start difference. First operand 8192 states and 12472 transitions. Second operand 3 states. [2019-09-10 08:45:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:08,962 INFO L93 Difference]: Finished difference Result 14274 states and 21485 transitions. [2019-09-10 08:45:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:08,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-10 08:45:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:09,002 INFO L225 Difference]: With dead ends: 14274 [2019-09-10 08:45:09,002 INFO L226 Difference]: Without dead ends: 14274 [2019-09-10 08:45:09,003 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 08:45:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14274 states. [2019-09-10 08:45:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14274 to 14272. [2019-09-10 08:45:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14272 states. [2019-09-10 08:45:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14272 states to 14272 states and 21484 transitions. [2019-09-10 08:45:09,351 INFO L78 Accepts]: Start accepts. Automaton has 14272 states and 21484 transitions. Word has length 166 [2019-09-10 08:45:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:09,352 INFO L475 AbstractCegarLoop]: Abstraction has 14272 states and 21484 transitions. [2019-09-10 08:45:09,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 14272 states and 21484 transitions. [2019-09-10 08:45:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:45:09,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:09,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:09,365 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash 332205762, now seen corresponding path program 1 times [2019-09-10 08:45:09,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:09,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:09,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:09,540 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 08:45:09,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:09,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:09,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:09,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:09,543 INFO L87 Difference]: Start difference. First operand 14272 states and 21484 transitions. Second operand 4 states. [2019-09-10 08:45:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:09,618 INFO L93 Difference]: Finished difference Result 12785 states and 19221 transitions. [2019-09-10 08:45:09,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:09,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-10 08:45:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:09,652 INFO L225 Difference]: With dead ends: 12785 [2019-09-10 08:45:09,652 INFO L226 Difference]: Without dead ends: 12737 [2019-09-10 08:45:09,653 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 08:45:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12737 states. [2019-09-10 08:45:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12737 to 12737. [2019-09-10 08:45:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12737 states. [2019-09-10 08:45:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 19158 transitions. [2019-09-10 08:45:10,022 INFO L78 Accepts]: Start accepts. Automaton has 12737 states and 19158 transitions. Word has length 166 [2019-09-10 08:45:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:10,023 INFO L475 AbstractCegarLoop]: Abstraction has 12737 states and 19158 transitions. [2019-09-10 08:45:10,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 12737 states and 19158 transitions. [2019-09-10 08:45:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:45:10,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:10,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:10,037 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:10,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1356015054, now seen corresponding path program 1 times [2019-09-10 08:45:10,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:10,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:10,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:10,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:10,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:10,166 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 08:45:10,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:10,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:10,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:10,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:10,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:10,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:10,168 INFO L87 Difference]: Start difference. First operand 12737 states and 19158 transitions. Second operand 3 states. [2019-09-10 08:45:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:10,331 INFO L93 Difference]: Finished difference Result 21443 states and 32518 transitions. [2019-09-10 08:45:10,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:10,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-10 08:45:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:10,398 INFO L225 Difference]: With dead ends: 21443 [2019-09-10 08:45:10,399 INFO L226 Difference]: Without dead ends: 21443 [2019-09-10 08:45:10,399 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 08:45:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21443 states. [2019-09-10 08:45:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21443 to 19533. [2019-09-10 08:45:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-09-10 08:45:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 29933 transitions. [2019-09-10 08:45:11,520 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 29933 transitions. Word has length 170 [2019-09-10 08:45:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:11,521 INFO L475 AbstractCegarLoop]: Abstraction has 19533 states and 29933 transitions. [2019-09-10 08:45:11,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 29933 transitions. [2019-09-10 08:45:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 08:45:11,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:11,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:11,536 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:11,536 INFO L82 PathProgramCache]: Analyzing trace with hash -927051742, now seen corresponding path program 1 times [2019-09-10 08:45:11,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:11,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:11,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:11,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:11,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:11,755 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 08:45:11,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:11,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:45:11,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:11,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:45:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:45:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:45:11,757 INFO L87 Difference]: Start difference. First operand 19533 states and 29933 transitions. Second operand 8 states. [2019-09-10 08:45:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:12,774 INFO L93 Difference]: Finished difference Result 61059 states and 92670 transitions. [2019-09-10 08:45:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:45:12,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2019-09-10 08:45:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:12,956 INFO L225 Difference]: With dead ends: 61059 [2019-09-10 08:45:12,956 INFO L226 Difference]: Without dead ends: 61059 [2019-09-10 08:45:12,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:45:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61059 states. [2019-09-10 08:45:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61059 to 32625. [2019-09-10 08:45:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32625 states. [2019-09-10 08:45:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32625 states to 32625 states and 49361 transitions. [2019-09-10 08:45:13,820 INFO L78 Accepts]: Start accepts. Automaton has 32625 states and 49361 transitions. Word has length 171 [2019-09-10 08:45:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:13,820 INFO L475 AbstractCegarLoop]: Abstraction has 32625 states and 49361 transitions. [2019-09-10 08:45:13,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:45:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 32625 states and 49361 transitions. [2019-09-10 08:45:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 08:45:13,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:13,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:13,835 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:13,835 INFO L82 PathProgramCache]: Analyzing trace with hash 299202232, now seen corresponding path program 1 times [2019-09-10 08:45:13,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:13,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:13,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:13,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:13,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:14,032 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 08:45:14,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:14,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:14,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:14,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:14,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:14,035 INFO L87 Difference]: Start difference. First operand 32625 states and 49361 transitions. Second operand 4 states. [2019-09-10 08:45:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:14,635 INFO L93 Difference]: Finished difference Result 58021 states and 86399 transitions. [2019-09-10 08:45:14,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:14,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-10 08:45:14,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:14,743 INFO L225 Difference]: With dead ends: 58021 [2019-09-10 08:45:14,743 INFO L226 Difference]: Without dead ends: 58021 [2019-09-10 08:45:14,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 08:45:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58021 states. [2019-09-10 08:45:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58021 to 58019. [2019-09-10 08:45:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58019 states. [2019-09-10 08:45:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58019 states to 58019 states and 86398 transitions. [2019-09-10 08:45:16,965 INFO L78 Accepts]: Start accepts. Automaton has 58019 states and 86398 transitions. Word has length 171 [2019-09-10 08:45:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:16,965 INFO L475 AbstractCegarLoop]: Abstraction has 58019 states and 86398 transitions. [2019-09-10 08:45:16,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 58019 states and 86398 transitions. [2019-09-10 08:45:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:45:16,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:16,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:16,990 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash -996193854, now seen corresponding path program 1 times [2019-09-10 08:45:16,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:16,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:16,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:17,069 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 08:45:17,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:17,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:17,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:17,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:17,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:17,071 INFO L87 Difference]: Start difference. First operand 58019 states and 86398 transitions. Second operand 3 states. [2019-09-10 08:45:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:17,488 INFO L93 Difference]: Finished difference Result 115946 states and 172678 transitions. [2019-09-10 08:45:17,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:17,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 08:45:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:17,670 INFO L225 Difference]: With dead ends: 115946 [2019-09-10 08:45:17,671 INFO L226 Difference]: Without dead ends: 115946 [2019-09-10 08:45:17,671 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 08:45:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115946 states. [2019-09-10 08:45:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115946 to 58025. [2019-09-10 08:45:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58025 states. [2019-09-10 08:45:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58025 states to 58025 states and 86404 transitions. [2019-09-10 08:45:19,092 INFO L78 Accepts]: Start accepts. Automaton has 58025 states and 86404 transitions. Word has length 172 [2019-09-10 08:45:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:19,093 INFO L475 AbstractCegarLoop]: Abstraction has 58025 states and 86404 transitions. [2019-09-10 08:45:19,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 58025 states and 86404 transitions. [2019-09-10 08:45:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:45:19,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:19,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:19,118 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash -991150146, now seen corresponding path program 1 times [2019-09-10 08:45:19,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:19,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:19,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:19,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:19,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:19,236 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 08:45:19,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:19,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:19,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:19,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:19,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:19,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:19,241 INFO L87 Difference]: Start difference. First operand 58025 states and 86404 transitions. Second operand 3 states. [2019-09-10 08:45:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:19,529 INFO L93 Difference]: Finished difference Result 95257 states and 139928 transitions. [2019-09-10 08:45:19,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:19,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 08:45:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:19,658 INFO L225 Difference]: With dead ends: 95257 [2019-09-10 08:45:19,658 INFO L226 Difference]: Without dead ends: 95257 [2019-09-10 08:45:19,658 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 08:45:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95257 states. [2019-09-10 08:45:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95257 to 95255. [2019-09-10 08:45:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95255 states. [2019-09-10 08:45:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95255 states to 95255 states and 139927 transitions. [2019-09-10 08:45:21,067 INFO L78 Accepts]: Start accepts. Automaton has 95255 states and 139927 transitions. Word has length 173 [2019-09-10 08:45:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:21,067 INFO L475 AbstractCegarLoop]: Abstraction has 95255 states and 139927 transitions. [2019-09-10 08:45:21,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 95255 states and 139927 transitions. [2019-09-10 08:45:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:45:21,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:21,108 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:21,109 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1114653633, now seen corresponding path program 1 times [2019-09-10 08:45:21,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:21,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:21,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:21,282 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 08:45:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:21,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:21,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:21,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:21,283 INFO L87 Difference]: Start difference. First operand 95255 states and 139927 transitions. Second operand 4 states. [2019-09-10 08:45:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:21,513 INFO L93 Difference]: Finished difference Result 84846 states and 124574 transitions. [2019-09-10 08:45:21,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:21,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 08:45:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:23,210 INFO L225 Difference]: With dead ends: 84846 [2019-09-10 08:45:23,210 INFO L226 Difference]: Without dead ends: 84655 [2019-09-10 08:45:23,211 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 08:45:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84655 states. [2019-09-10 08:45:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84655 to 84655. [2019-09-10 08:45:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84655 states. [2019-09-10 08:45:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84655 states to 84655 states and 124346 transitions. [2019-09-10 08:45:23,941 INFO L78 Accepts]: Start accepts. Automaton has 84655 states and 124346 transitions. Word has length 173 [2019-09-10 08:45:23,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:23,942 INFO L475 AbstractCegarLoop]: Abstraction has 84655 states and 124346 transitions. [2019-09-10 08:45:23,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 84655 states and 124346 transitions. [2019-09-10 08:45:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:45:23,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:23,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:23,959 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:23,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:23,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1296649650, now seen corresponding path program 1 times [2019-09-10 08:45:23,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:23,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:23,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:24,306 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 08:45:24,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:24,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:24,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:24,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:24,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:24,309 INFO L87 Difference]: Start difference. First operand 84655 states and 124346 transitions. Second operand 4 states. [2019-09-10 08:45:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:24,852 INFO L93 Difference]: Finished difference Result 154615 states and 230695 transitions. [2019-09-10 08:45:24,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:24,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-10 08:45:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:25,033 INFO L225 Difference]: With dead ends: 154615 [2019-09-10 08:45:25,034 INFO L226 Difference]: Without dead ends: 154615 [2019-09-10 08:45:25,034 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 08:45:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154615 states. [2019-09-10 08:45:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154615 to 83121. [2019-09-10 08:45:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83121 states. [2019-09-10 08:45:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83121 states to 83121 states and 122384 transitions. [2019-09-10 08:45:28,080 INFO L78 Accepts]: Start accepts. Automaton has 83121 states and 122384 transitions. Word has length 178 [2019-09-10 08:45:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:28,080 INFO L475 AbstractCegarLoop]: Abstraction has 83121 states and 122384 transitions. [2019-09-10 08:45:28,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 83121 states and 122384 transitions. [2019-09-10 08:45:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:45:28,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:28,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:28,092 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:28,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1810459694, now seen corresponding path program 1 times [2019-09-10 08:45:28,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:28,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:28,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:28,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:28,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:28,292 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 08:45:28,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:28,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:28,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:28,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:28,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:28,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:28,296 INFO L87 Difference]: Start difference. First operand 83121 states and 122384 transitions. Second operand 4 states. [2019-09-10 08:45:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:28,573 INFO L93 Difference]: Finished difference Result 75852 states and 111618 transitions. [2019-09-10 08:45:28,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:28,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-10 08:45:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:28,655 INFO L225 Difference]: With dead ends: 75852 [2019-09-10 08:45:28,655 INFO L226 Difference]: Without dead ends: 75852 [2019-09-10 08:45:28,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 08:45:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75852 states. [2019-09-10 08:45:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75852 to 75810. [2019-09-10 08:45:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75810 states. [2019-09-10 08:45:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75810 states to 75810 states and 111569 transitions. [2019-09-10 08:45:29,947 INFO L78 Accepts]: Start accepts. Automaton has 75810 states and 111569 transitions. Word has length 178 [2019-09-10 08:45:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:29,948 INFO L475 AbstractCegarLoop]: Abstraction has 75810 states and 111569 transitions. [2019-09-10 08:45:29,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 75810 states and 111569 transitions. [2019-09-10 08:45:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:45:29,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:29,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:29,961 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash -398440038, now seen corresponding path program 1 times [2019-09-10 08:45:29,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:29,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:29,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:29,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:29,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:30,130 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 08:45:30,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:30,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:30,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:30,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:30,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:30,132 INFO L87 Difference]: Start difference. First operand 75810 states and 111569 transitions. Second operand 4 states. [2019-09-10 08:45:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:30,419 INFO L93 Difference]: Finished difference Result 75975 states and 111750 transitions. [2019-09-10 08:45:30,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:30,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-10 08:45:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:30,534 INFO L225 Difference]: With dead ends: 75975 [2019-09-10 08:45:30,534 INFO L226 Difference]: Without dead ends: 75975 [2019-09-10 08:45:30,535 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 08:45:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75975 states. [2019-09-10 08:45:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75975 to 75913. [2019-09-10 08:45:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75913 states. [2019-09-10 08:45:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75913 states to 75913 states and 111673 transitions. [2019-09-10 08:45:31,384 INFO L78 Accepts]: Start accepts. Automaton has 75913 states and 111673 transitions. Word has length 180 [2019-09-10 08:45:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:31,385 INFO L475 AbstractCegarLoop]: Abstraction has 75913 states and 111673 transitions. [2019-09-10 08:45:31,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 75913 states and 111673 transitions. [2019-09-10 08:45:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 08:45:31,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:31,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:31,401 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash 226188346, now seen corresponding path program 1 times [2019-09-10 08:45:31,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:31,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:31,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:31,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:31,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:31,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 08:45:31,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:31,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:31,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:31,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:31,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:31,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:31,467 INFO L87 Difference]: Start difference. First operand 75913 states and 111673 transitions. Second operand 3 states. [2019-09-10 08:45:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:31,877 INFO L93 Difference]: Finished difference Result 151612 states and 223094 transitions. [2019-09-10 08:45:31,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:31,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 08:45:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:33,869 INFO L225 Difference]: With dead ends: 151612 [2019-09-10 08:45:33,869 INFO L226 Difference]: Without dead ends: 151612 [2019-09-10 08:45:33,870 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 08:45:33,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151612 states. [2019-09-10 08:45:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151612 to 75923. [2019-09-10 08:45:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75923 states. [2019-09-10 08:45:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75923 states to 75923 states and 111683 transitions. [2019-09-10 08:45:35,194 INFO L78 Accepts]: Start accepts. Automaton has 75923 states and 111683 transitions. Word has length 181 [2019-09-10 08:45:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:35,195 INFO L475 AbstractCegarLoop]: Abstraction has 75923 states and 111683 transitions. [2019-09-10 08:45:35,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 75923 states and 111683 transitions. [2019-09-10 08:45:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:45:35,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:35,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:35,207 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:35,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1394966811, now seen corresponding path program 1 times [2019-09-10 08:45:35,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:35,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:35,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:35,350 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 08:45:35,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:35,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:35,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:35,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:35,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:35,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:35,352 INFO L87 Difference]: Start difference. First operand 75923 states and 111683 transitions. Second operand 4 states. [2019-09-10 08:45:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:35,584 INFO L93 Difference]: Finished difference Result 76113 states and 111868 transitions. [2019-09-10 08:45:35,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:35,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-10 08:45:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:36,105 INFO L225 Difference]: With dead ends: 76113 [2019-09-10 08:45:36,105 INFO L226 Difference]: Without dead ends: 75913 [2019-09-10 08:45:36,108 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 08:45:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75913 states. [2019-09-10 08:45:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75913 to 75913. [2019-09-10 08:45:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75913 states. [2019-09-10 08:45:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75913 states to 75913 states and 111668 transitions. [2019-09-10 08:45:36,828 INFO L78 Accepts]: Start accepts. Automaton has 75913 states and 111668 transitions. Word has length 182 [2019-09-10 08:45:36,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:36,828 INFO L475 AbstractCegarLoop]: Abstraction has 75913 states and 111668 transitions. [2019-09-10 08:45:36,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 75913 states and 111668 transitions. [2019-09-10 08:45:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:45:36,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:36,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:36,840 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:36,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1207544264, now seen corresponding path program 1 times [2019-09-10 08:45:36,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:36,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:36,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:36,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:36,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:36,998 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 08:45:36,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:36,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:36,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:37,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:37,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:37,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:37,000 INFO L87 Difference]: Start difference. First operand 75913 states and 111668 transitions. Second operand 4 states. [2019-09-10 08:45:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:37,305 INFO L93 Difference]: Finished difference Result 69809 states and 102611 transitions. [2019-09-10 08:45:37,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:37,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-10 08:45:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:37,423 INFO L225 Difference]: With dead ends: 69809 [2019-09-10 08:45:37,423 INFO L226 Difference]: Without dead ends: 69809 [2019-09-10 08:45:37,424 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 08:45:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69809 states. [2019-09-10 08:45:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69809 to 69652. [2019-09-10 08:45:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69652 states. [2019-09-10 08:45:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69652 states to 69652 states and 102423 transitions. [2019-09-10 08:45:38,157 INFO L78 Accepts]: Start accepts. Automaton has 69652 states and 102423 transitions. Word has length 182 [2019-09-10 08:45:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:38,158 INFO L475 AbstractCegarLoop]: Abstraction has 69652 states and 102423 transitions. [2019-09-10 08:45:38,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 69652 states and 102423 transitions. [2019-09-10 08:45:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:45:38,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:38,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:38,169 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash -921357460, now seen corresponding path program 1 times [2019-09-10 08:45:38,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:38,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:38,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:38,733 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 08:45:38,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:38,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:38,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:38,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:38,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:38,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:38,739 INFO L87 Difference]: Start difference. First operand 69652 states and 102423 transitions. Second operand 4 states. [2019-09-10 08:45:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:39,213 INFO L93 Difference]: Finished difference Result 128755 states and 191947 transitions. [2019-09-10 08:45:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:39,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-10 08:45:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:39,396 INFO L225 Difference]: With dead ends: 128755 [2019-09-10 08:45:39,397 INFO L226 Difference]: Without dead ends: 128755 [2019-09-10 08:45:39,397 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 08:45:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128755 states. [2019-09-10 08:45:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128755 to 69595. [2019-09-10 08:45:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69595 states. [2019-09-10 08:45:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69595 states to 69595 states and 102282 transitions. [2019-09-10 08:45:40,444 INFO L78 Accepts]: Start accepts. Automaton has 69595 states and 102282 transitions. Word has length 184 [2019-09-10 08:45:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:40,444 INFO L475 AbstractCegarLoop]: Abstraction has 69595 states and 102282 transitions. [2019-09-10 08:45:40,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 69595 states and 102282 transitions. [2019-09-10 08:45:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:45:40,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:40,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:40,454 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash -275308307, now seen corresponding path program 1 times [2019-09-10 08:45:40,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:40,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:40,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:40,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:40,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:45:40,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:40,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:45:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:45:40,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:45:40,669 INFO L87 Difference]: Start difference. First operand 69595 states and 102282 transitions. Second operand 8 states. [2019-09-10 08:45:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:42,173 INFO L93 Difference]: Finished difference Result 158832 states and 231708 transitions. [2019-09-10 08:45:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:45:42,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2019-09-10 08:45:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:42,490 INFO L225 Difference]: With dead ends: 158832 [2019-09-10 08:45:42,491 INFO L226 Difference]: Without dead ends: 158832 [2019-09-10 08:45:42,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:45:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158832 states. [2019-09-10 08:45:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158832 to 77004. [2019-09-10 08:45:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77004 states. [2019-09-10 08:45:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77004 states to 77004 states and 113416 transitions. [2019-09-10 08:45:44,330 INFO L78 Accepts]: Start accepts. Automaton has 77004 states and 113416 transitions. Word has length 184 [2019-09-10 08:45:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:44,331 INFO L475 AbstractCegarLoop]: Abstraction has 77004 states and 113416 transitions. [2019-09-10 08:45:44,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:45:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 77004 states and 113416 transitions. [2019-09-10 08:45:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:45:44,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:44,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:45:44,341 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:44,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:44,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1479976886, now seen corresponding path program 1 times [2019-09-10 08:45:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:44,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:44,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:46,452 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 08:45:46,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:46,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:45:46,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:46,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:45:46,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:45:46,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:45:46,456 INFO L87 Difference]: Start difference. First operand 77004 states and 113416 transitions. Second operand 21 states. [2019-09-10 08:45:47,238 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 08:45:47,657 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:45:47,917 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 08:45:48,172 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 08:45:48,742 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:45:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:52,125 INFO L93 Difference]: Finished difference Result 110920 states and 162454 transitions. [2019-09-10 08:45:52,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:45:52,126 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-10 08:45:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:52,264 INFO L225 Difference]: With dead ends: 110920 [2019-09-10 08:45:52,265 INFO L226 Difference]: Without dead ends: 110920 [2019-09-10 08:45:52,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:45:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110920 states. [2019-09-10 08:45:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110920 to 96973. [2019-09-10 08:45:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96973 states. [2019-09-10 08:45:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96973 states to 96973 states and 142342 transitions. [2019-09-10 08:45:53,304 INFO L78 Accepts]: Start accepts. Automaton has 96973 states and 142342 transitions. Word has length 184 [2019-09-10 08:45:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:53,304 INFO L475 AbstractCegarLoop]: Abstraction has 96973 states and 142342 transitions. [2019-09-10 08:45:53,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:45:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 96973 states and 142342 transitions. [2019-09-10 08:45:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:45:53,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:53,316 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:53,317 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:53,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:53,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1347217683, now seen corresponding path program 1 times [2019-09-10 08:45:53,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:53,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:53,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:53,423 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 08:45:53,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:53,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:53,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:53,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:53,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:53,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:53,425 INFO L87 Difference]: Start difference. First operand 96973 states and 142342 transitions. Second operand 4 states. [2019-09-10 08:45:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:54,352 INFO L93 Difference]: Finished difference Result 169465 states and 250341 transitions. [2019-09-10 08:45:54,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:54,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-10 08:45:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:54,652 INFO L225 Difference]: With dead ends: 169465 [2019-09-10 08:45:54,652 INFO L226 Difference]: Without dead ends: 169465 [2019-09-10 08:45:54,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169465 states. [2019-09-10 08:45:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169465 to 98857. [2019-09-10 08:45:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98857 states. [2019-09-10 08:45:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98857 states to 98857 states and 144404 transitions. [2019-09-10 08:45:56,127 INFO L78 Accepts]: Start accepts. Automaton has 98857 states and 144404 transitions. Word has length 184 [2019-09-10 08:45:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:56,127 INFO L475 AbstractCegarLoop]: Abstraction has 98857 states and 144404 transitions. [2019-09-10 08:45:56,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 98857 states and 144404 transitions. [2019-09-10 08:45:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:45:56,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:56,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:56,140 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1351844283, now seen corresponding path program 1 times [2019-09-10 08:45:56,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:56,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:56,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:56,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:56,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:56,282 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 08:45:56,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:56,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:45:56,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:56,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:45:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:45:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:56,284 INFO L87 Difference]: Start difference. First operand 98857 states and 144404 transitions. Second operand 5 states. [2019-09-10 08:45:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:57,066 INFO L93 Difference]: Finished difference Result 169465 states and 248088 transitions. [2019-09-10 08:45:57,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:45:57,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2019-09-10 08:45:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:57,290 INFO L225 Difference]: With dead ends: 169465 [2019-09-10 08:45:57,291 INFO L226 Difference]: Without dead ends: 169465 [2019-09-10 08:45:57,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:45:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169465 states. [2019-09-10 08:45:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169465 to 152580. [2019-09-10 08:45:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152580 states. [2019-09-10 08:45:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152580 states to 152580 states and 223100 transitions. [2019-09-10 08:45:59,413 INFO L78 Accepts]: Start accepts. Automaton has 152580 states and 223100 transitions. Word has length 184 [2019-09-10 08:45:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:59,413 INFO L475 AbstractCegarLoop]: Abstraction has 152580 states and 223100 transitions. [2019-09-10 08:45:59,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:45:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 152580 states and 223100 transitions. [2019-09-10 08:45:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:45:59,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:59,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:59,432 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash 977794702, now seen corresponding path program 1 times [2019-09-10 08:45:59,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:59,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:59,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:00,414 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-09-10 08:46:00,678 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-10 08:46:00,958 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2019-09-10 08:46:01,225 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-09-10 08:46:01,959 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 08:46:01,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:01,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:46:01,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:01,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:46:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:46:01,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:46:01,960 INFO L87 Difference]: Start difference. First operand 152580 states and 223100 transitions. Second operand 21 states. [2019-09-10 08:46:02,454 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-09-10 08:46:02,718 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 08:46:02,935 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 08:46:03,816 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:46:04,075 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:46:04,259 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:46:04,420 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:46:04,620 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 08:46:04,785 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-10 08:46:05,059 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-10 08:46:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:08,134 INFO L93 Difference]: Finished difference Result 196522 states and 286540 transitions. [2019-09-10 08:46:08,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:46:08,134 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-10 08:46:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:08,459 INFO L225 Difference]: With dead ends: 196522 [2019-09-10 08:46:08,459 INFO L226 Difference]: Without dead ends: 196522 [2019-09-10 08:46:08,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:46:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196522 states. [2019-09-10 08:46:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196522 to 153175. [2019-09-10 08:46:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153175 states. [2019-09-10 08:46:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153175 states to 153175 states and 223789 transitions. [2019-09-10 08:46:15,040 INFO L78 Accepts]: Start accepts. Automaton has 153175 states and 223789 transitions. Word has length 184 [2019-09-10 08:46:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:15,040 INFO L475 AbstractCegarLoop]: Abstraction has 153175 states and 223789 transitions. [2019-09-10 08:46:15,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:46:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 153175 states and 223789 transitions. [2019-09-10 08:46:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:46:15,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:15,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:15,060 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:15,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1522390191, now seen corresponding path program 1 times [2019-09-10 08:46:15,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:15,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:15,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:15,145 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 08:46:15,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:15,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:15,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:15,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:15,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:15,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:15,147 INFO L87 Difference]: Start difference. First operand 153175 states and 223789 transitions. Second operand 3 states. [2019-09-10 08:46:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:15,794 INFO L93 Difference]: Finished difference Result 152456 states and 222341 transitions. [2019-09-10 08:46:15,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:15,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:46:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:15,991 INFO L225 Difference]: With dead ends: 152456 [2019-09-10 08:46:15,991 INFO L226 Difference]: Without dead ends: 152456 [2019-09-10 08:46:15,992 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 08:46:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152456 states. [2019-09-10 08:46:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152456 to 152456. [2019-09-10 08:46:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152456 states. [2019-09-10 08:46:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152456 states to 152456 states and 222341 transitions. [2019-09-10 08:46:17,537 INFO L78 Accepts]: Start accepts. Automaton has 152456 states and 222341 transitions. Word has length 185 [2019-09-10 08:46:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:17,537 INFO L475 AbstractCegarLoop]: Abstraction has 152456 states and 222341 transitions. [2019-09-10 08:46:17,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 152456 states and 222341 transitions. [2019-09-10 08:46:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:46:17,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:17,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:17,555 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 62436878, now seen corresponding path program 1 times [2019-09-10 08:46:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:17,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:17,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:17,626 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 08:46:17,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:17,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:17,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:17,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:17,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:17,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:17,628 INFO L87 Difference]: Start difference. First operand 152456 states and 222341 transitions. Second operand 3 states. [2019-09-10 08:46:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:18,251 INFO L93 Difference]: Finished difference Result 163998 states and 236380 transitions. [2019-09-10 08:46:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:18,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:46:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:18,454 INFO L225 Difference]: With dead ends: 163998 [2019-09-10 08:46:18,454 INFO L226 Difference]: Without dead ends: 163998 [2019-09-10 08:46:18,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163998 states. [2019-09-10 08:46:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163998 to 151906. [2019-09-10 08:46:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151906 states. [2019-09-10 08:46:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151906 states to 151906 states and 220696 transitions. [2019-09-10 08:46:23,243 INFO L78 Accepts]: Start accepts. Automaton has 151906 states and 220696 transitions. Word has length 185 [2019-09-10 08:46:23,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:23,244 INFO L475 AbstractCegarLoop]: Abstraction has 151906 states and 220696 transitions. [2019-09-10 08:46:23,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:23,244 INFO L276 IsEmpty]: Start isEmpty. Operand 151906 states and 220696 transitions. [2019-09-10 08:46:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:46:23,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:23,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:23,262 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:23,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1641134443, now seen corresponding path program 1 times [2019-09-10 08:46:23,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:23,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:23,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:23,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:23,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:23,329 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 08:46:23,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:23,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:23,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:23,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:23,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:23,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:23,331 INFO L87 Difference]: Start difference. First operand 151906 states and 220696 transitions. Second operand 3 states. [2019-09-10 08:46:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:24,473 INFO L93 Difference]: Finished difference Result 166824 states and 240377 transitions. [2019-09-10 08:46:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:24,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:46:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:24,687 INFO L225 Difference]: With dead ends: 166824 [2019-09-10 08:46:24,687 INFO L226 Difference]: Without dead ends: 166824 [2019-09-10 08:46:24,687 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 08:46:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166824 states. [2019-09-10 08:46:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166824 to 150069. [2019-09-10 08:46:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150069 states. [2019-09-10 08:46:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150069 states to 150069 states and 217923 transitions. [2019-09-10 08:46:27,821 INFO L78 Accepts]: Start accepts. Automaton has 150069 states and 217923 transitions. Word has length 185 [2019-09-10 08:46:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:27,821 INFO L475 AbstractCegarLoop]: Abstraction has 150069 states and 217923 transitions. [2019-09-10 08:46:27,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 150069 states and 217923 transitions. [2019-09-10 08:46:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:46:27,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:27,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:27,841 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:27,842 INFO L82 PathProgramCache]: Analyzing trace with hash -342638478, now seen corresponding path program 1 times [2019-09-10 08:46:27,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:27,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:27,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:27,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:27,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:27,915 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 08:46:27,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:27,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:27,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:27,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:27,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:27,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:27,917 INFO L87 Difference]: Start difference. First operand 150069 states and 217923 transitions. Second operand 3 states. [2019-09-10 08:46:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:28,427 INFO L93 Difference]: Finished difference Result 150165 states and 216884 transitions. [2019-09-10 08:46:28,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:28,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:46:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:28,663 INFO L225 Difference]: With dead ends: 150165 [2019-09-10 08:46:28,664 INFO L226 Difference]: Without dead ends: 150165 [2019-09-10 08:46:28,664 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 08:46:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150165 states. [2019-09-10 08:46:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150165 to 148942. [2019-09-10 08:46:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148942 states. [2019-09-10 08:46:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148942 states to 148942 states and 215661 transitions. [2019-09-10 08:46:31,295 INFO L78 Accepts]: Start accepts. Automaton has 148942 states and 215661 transitions. Word has length 185 [2019-09-10 08:46:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:31,296 INFO L475 AbstractCegarLoop]: Abstraction has 148942 states and 215661 transitions. [2019-09-10 08:46:31,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 148942 states and 215661 transitions. [2019-09-10 08:46:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:46:31,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:31,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:31,311 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:31,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1994345695, now seen corresponding path program 1 times [2019-09-10 08:46:31,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:31,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:31,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:31,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:46:31,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:31,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:31,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:31,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:31,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:31,395 INFO L87 Difference]: Start difference. First operand 148942 states and 215661 transitions. Second operand 3 states. [2019-09-10 08:46:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:31,894 INFO L93 Difference]: Finished difference Result 162741 states and 232017 transitions. [2019-09-10 08:46:31,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:31,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:46:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:32,136 INFO L225 Difference]: With dead ends: 162741 [2019-09-10 08:46:32,137 INFO L226 Difference]: Without dead ends: 162741 [2019-09-10 08:46:32,137 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 08:46:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162741 states. [2019-09-10 08:46:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162741 to 148330. [2019-09-10 08:46:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148330 states. [2019-09-10 08:46:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148330 states to 148330 states and 213827 transitions. [2019-09-10 08:46:37,042 INFO L78 Accepts]: Start accepts. Automaton has 148330 states and 213827 transitions. Word has length 185 [2019-09-10 08:46:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:37,042 INFO L475 AbstractCegarLoop]: Abstraction has 148330 states and 213827 transitions. [2019-09-10 08:46:37,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 148330 states and 213827 transitions. [2019-09-10 08:46:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:46:37,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:37,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:37,061 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash -478851934, now seen corresponding path program 1 times [2019-09-10 08:46:37,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:37,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:37,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:37,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:37,152 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 08:46:37,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:37,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:37,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:37,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:37,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:37,154 INFO L87 Difference]: Start difference. First operand 148330 states and 213827 transitions. Second operand 3 states. [2019-09-10 08:46:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:37,800 INFO L93 Difference]: Finished difference Result 146374 states and 210789 transitions. [2019-09-10 08:46:37,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:37,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:46:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:38,014 INFO L225 Difference]: With dead ends: 146374 [2019-09-10 08:46:38,014 INFO L226 Difference]: Without dead ends: 146374 [2019-09-10 08:46:38,016 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 08:46:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146374 states. [2019-09-10 08:46:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146374 to 146374. [2019-09-10 08:46:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146374 states. [2019-09-10 08:46:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146374 states to 146374 states and 210789 transitions. [2019-09-10 08:46:40,153 INFO L78 Accepts]: Start accepts. Automaton has 146374 states and 210789 transitions. Word has length 185 [2019-09-10 08:46:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:40,154 INFO L475 AbstractCegarLoop]: Abstraction has 146374 states and 210789 transitions. [2019-09-10 08:46:40,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 146374 states and 210789 transitions. [2019-09-10 08:46:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:46:40,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:40,171 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:40,171 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1014323284, now seen corresponding path program 1 times [2019-09-10 08:46:40,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:40,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:40,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:40,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:40,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:46:40,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:40,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:40,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:40,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:40,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:40,297 INFO L87 Difference]: Start difference. First operand 146374 states and 210789 transitions. Second operand 4 states. [2019-09-10 08:46:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:43,127 INFO L93 Difference]: Finished difference Result 146310 states and 210093 transitions. [2019-09-10 08:46:43,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:43,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-09-10 08:46:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:43,315 INFO L225 Difference]: With dead ends: 146310 [2019-09-10 08:46:43,315 INFO L226 Difference]: Without dead ends: 146310 [2019-09-10 08:46:43,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146310 states. [2019-09-10 08:46:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146310 to 146308. [2019-09-10 08:46:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146308 states. [2019-09-10 08:46:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146308 states to 146308 states and 210092 transitions. [2019-09-10 08:46:45,189 INFO L78 Accepts]: Start accepts. Automaton has 146308 states and 210092 transitions. Word has length 187 [2019-09-10 08:46:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:45,189 INFO L475 AbstractCegarLoop]: Abstraction has 146308 states and 210092 transitions. [2019-09-10 08:46:45,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 146308 states and 210092 transitions. [2019-09-10 08:46:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:46:45,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:45,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:46:45,203 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:45,207 INFO L82 PathProgramCache]: Analyzing trace with hash -718250076, now seen corresponding path program 1 times [2019-09-10 08:46:45,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:45,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:45,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:45,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:47,057 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 08:46:47,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:47,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:46:47,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:47,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:46:47,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:46:47,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:46:47,059 INFO L87 Difference]: Start difference. First operand 146308 states and 210092 transitions. Second operand 22 states. [2019-09-10 08:46:47,922 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:46:48,132 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:46:48,341 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:46:48,552 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:46:48,737 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 08:46:50,418 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2019-09-10 08:46:50,631 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-09-10 08:46:51,075 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-09-10 08:46:51,220 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2019-09-10 08:46:51,515 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2019-09-10 08:46:51,659 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 08:46:51,838 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 08:46:52,246 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-09-10 08:46:53,935 WARN L188 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2019-09-10 08:46:54,188 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 32 [2019-09-10 08:46:54,354 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:46:54,524 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 08:46:54,708 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:46:54,966 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:46:55,631 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 08:46:57,285 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 32 [2019-09-10 08:46:58,461 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-09-10 08:46:58,854 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:46:59,026 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 32 [2019-09-10 08:46:59,461 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-09-10 08:46:59,700 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 08:46:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:59,840 INFO L93 Difference]: Finished difference Result 269047 states and 388937 transitions. [2019-09-10 08:46:59,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 08:46:59,840 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 187 [2019-09-10 08:46:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:00,305 INFO L225 Difference]: With dead ends: 269047 [2019-09-10 08:47:00,306 INFO L226 Difference]: Without dead ends: 269047 [2019-09-10 08:47:00,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=964, Invalid=2818, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 08:47:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269047 states. [2019-09-10 08:47:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269047 to 146770. [2019-09-10 08:47:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146770 states. [2019-09-10 08:47:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146770 states to 146770 states and 210601 transitions. [2019-09-10 08:47:02,619 INFO L78 Accepts]: Start accepts. Automaton has 146770 states and 210601 transitions. Word has length 187 [2019-09-10 08:47:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:02,619 INFO L475 AbstractCegarLoop]: Abstraction has 146770 states and 210601 transitions. [2019-09-10 08:47:02,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:47:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 146770 states and 210601 transitions. [2019-09-10 08:47:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:47:02,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:02,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:02,635 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:02,636 INFO L82 PathProgramCache]: Analyzing trace with hash -932837444, now seen corresponding path program 1 times [2019-09-10 08:47:02,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:02,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:02,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:02,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:02,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:03,491 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 08:47:03,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:03,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:47:03,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:03,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:47:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:47:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:47:03,493 INFO L87 Difference]: Start difference. First operand 146770 states and 210601 transitions. Second operand 8 states. [2019-09-10 08:47:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:03,970 INFO L93 Difference]: Finished difference Result 146641 states and 209621 transitions. [2019-09-10 08:47:03,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:03,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 187 [2019-09-10 08:47:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:04,176 INFO L225 Difference]: With dead ends: 146641 [2019-09-10 08:47:04,177 INFO L226 Difference]: Without dead ends: 146641 [2019-09-10 08:47:04,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:47:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146641 states. [2019-09-10 08:47:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146641 to 146639. [2019-09-10 08:47:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146639 states. [2019-09-10 08:47:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146639 states to 146639 states and 209620 transitions. [2019-09-10 08:47:09,017 INFO L78 Accepts]: Start accepts. Automaton has 146639 states and 209620 transitions. Word has length 187 [2019-09-10 08:47:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:09,017 INFO L475 AbstractCegarLoop]: Abstraction has 146639 states and 209620 transitions. [2019-09-10 08:47:09,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:47:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 146639 states and 209620 transitions. [2019-09-10 08:47:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:47:09,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:09,031 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:09,031 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1506636302, now seen corresponding path program 1 times [2019-09-10 08:47:09,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:09,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:09,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:09,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:09,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:09,148 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 08:47:09,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:09,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:47:09,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:09,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:47:09,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:47:09,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:09,150 INFO L87 Difference]: Start difference. First operand 146639 states and 209620 transitions. Second operand 5 states. [2019-09-10 08:47:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:10,272 INFO L93 Difference]: Finished difference Result 397619 states and 577636 transitions. [2019-09-10 08:47:10,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:47:10,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-09-10 08:47:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:10,827 INFO L225 Difference]: With dead ends: 397619 [2019-09-10 08:47:10,827 INFO L226 Difference]: Without dead ends: 397619 [2019-09-10 08:47:10,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:47:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397619 states. [2019-09-10 08:47:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397619 to 394823. [2019-09-10 08:47:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394823 states. [2019-09-10 08:47:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394823 states to 394823 states and 574842 transitions. [2019-09-10 08:47:19,168 INFO L78 Accepts]: Start accepts. Automaton has 394823 states and 574842 transitions. Word has length 187 [2019-09-10 08:47:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:19,168 INFO L475 AbstractCegarLoop]: Abstraction has 394823 states and 574842 transitions. [2019-09-10 08:47:19,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:47:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 394823 states and 574842 transitions. [2019-09-10 08:47:19,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:47:19,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:19,182 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:19,183 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:19,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:19,183 INFO L82 PathProgramCache]: Analyzing trace with hash -523794799, now seen corresponding path program 1 times [2019-09-10 08:47:19,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:19,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:19,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:19,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:19,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:19,288 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 08:47:19,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:19,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:19,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:19,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:19,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:19,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:19,290 INFO L87 Difference]: Start difference. First operand 394823 states and 574842 transitions. Second operand 3 states. [2019-09-10 08:47:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:21,572 INFO L93 Difference]: Finished difference Result 498189 states and 710117 transitions. [2019-09-10 08:47:21,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:21,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:47:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:22,278 INFO L225 Difference]: With dead ends: 498189 [2019-09-10 08:47:22,278 INFO L226 Difference]: Without dead ends: 498189 [2019-09-10 08:47:22,278 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 08:47:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498189 states. [2019-09-10 08:47:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498189 to 371523. [2019-09-10 08:47:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371523 states. [2019-09-10 08:47:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371523 states to 371523 states and 525988 transitions. [2019-09-10 08:47:34,404 INFO L78 Accepts]: Start accepts. Automaton has 371523 states and 525988 transitions. Word has length 187 [2019-09-10 08:47:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:34,404 INFO L475 AbstractCegarLoop]: Abstraction has 371523 states and 525988 transitions. [2019-09-10 08:47:34,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 371523 states and 525988 transitions. [2019-09-10 08:47:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:47:34,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:34,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:34,419 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1577309251, now seen corresponding path program 1 times [2019-09-10 08:47:34,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:34,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:34,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:34,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:34,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:34,570 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 08:47:34,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:34,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:47:34,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:34,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:47:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:47:34,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:34,572 INFO L87 Difference]: Start difference. First operand 371523 states and 525988 transitions. Second operand 5 states. [2019-09-10 08:47:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:36,315 INFO L93 Difference]: Finished difference Result 627604 states and 894483 transitions. [2019-09-10 08:47:36,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:47:36,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-09-10 08:47:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:37,286 INFO L225 Difference]: With dead ends: 627604 [2019-09-10 08:47:37,286 INFO L226 Difference]: Without dead ends: 627604 [2019-09-10 08:47:37,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627604 states. [2019-09-10 08:47:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627604 to 402453. [2019-09-10 08:47:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402453 states. [2019-09-10 08:47:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402453 states to 402453 states and 571116 transitions. [2019-09-10 08:47:52,840 INFO L78 Accepts]: Start accepts. Automaton has 402453 states and 571116 transitions. Word has length 187 [2019-09-10 08:47:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:52,840 INFO L475 AbstractCegarLoop]: Abstraction has 402453 states and 571116 transitions. [2019-09-10 08:47:52,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:47:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 402453 states and 571116 transitions. [2019-09-10 08:47:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:47:52,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:52,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:47:52,852 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:52,853 INFO L82 PathProgramCache]: Analyzing trace with hash 823204625, now seen corresponding path program 1 times [2019-09-10 08:47:52,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:52,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:52,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:52,963 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 08:47:52,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:52,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:52,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:52,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:52,964 INFO L87 Difference]: Start difference. First operand 402453 states and 571116 transitions. Second operand 4 states. [2019-09-10 08:47:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:53,952 INFO L93 Difference]: Finished difference Result 379647 states and 536539 transitions. [2019-09-10 08:47:53,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:53,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-09-10 08:47:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:00,371 INFO L225 Difference]: With dead ends: 379647 [2019-09-10 08:48:00,372 INFO L226 Difference]: Without dead ends: 379647 [2019-09-10 08:48:00,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379647 states. [2019-09-10 08:48:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379647 to 302115. [2019-09-10 08:48:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302115 states. [2019-09-10 08:48:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302115 states to 302115 states and 423462 transitions. [2019-09-10 08:48:04,734 INFO L78 Accepts]: Start accepts. Automaton has 302115 states and 423462 transitions. Word has length 187 [2019-09-10 08:48:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:04,734 INFO L475 AbstractCegarLoop]: Abstraction has 302115 states and 423462 transitions. [2019-09-10 08:48:04,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 302115 states and 423462 transitions. [2019-09-10 08:48:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:48:04,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:04,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:04,748 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:04,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:04,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1216916258, now seen corresponding path program 1 times [2019-09-10 08:48:04,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:04,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:04,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:04,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:04,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:06,066 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 08:48:06,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:06,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:48:06,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:06,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:48:06,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:48:06,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:48:06,067 INFO L87 Difference]: Start difference. First operand 302115 states and 423462 transitions. Second operand 22 states. [2019-09-10 08:48:06,960 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 08:48:07,157 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:48:07,640 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 08:48:08,731 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2019-09-10 08:48:08,910 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-10 08:48:09,077 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 08:48:09,273 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2019-09-10 08:48:12,437 WARN L188 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 08:48:12,630 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 08:48:12,838 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2019-09-10 08:48:12,999 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-09-10 08:48:13,190 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 08:48:13,467 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2019-09-10 08:48:17,626 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 37 [2019-09-10 08:48:17,916 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2019-09-10 08:48:18,674 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:48:18,842 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:48:19,049 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:48:19,252 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:48:19,401 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:48:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:19,470 INFO L93 Difference]: Finished difference Result 332763 states and 463978 transitions. [2019-09-10 08:48:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 08:48:19,470 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 187 [2019-09-10 08:48:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:19,929 INFO L225 Difference]: With dead ends: 332763 [2019-09-10 08:48:19,929 INFO L226 Difference]: Without dead ends: 332763 [2019-09-10 08:48:19,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:48:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332763 states. [2019-09-10 08:48:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332763 to 298058. [2019-09-10 08:48:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298058 states. [2019-09-10 08:48:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298058 states to 298058 states and 417368 transitions. [2019-09-10 08:48:23,732 INFO L78 Accepts]: Start accepts. Automaton has 298058 states and 417368 transitions. Word has length 187 [2019-09-10 08:48:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:23,732 INFO L475 AbstractCegarLoop]: Abstraction has 298058 states and 417368 transitions. [2019-09-10 08:48:23,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:48:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 298058 states and 417368 transitions. [2019-09-10 08:48:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:48:23,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:23,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:23,748 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash 960839163, now seen corresponding path program 1 times [2019-09-10 08:48:23,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:23,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:23,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:25,217 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-09-10 08:48:25,660 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 26 [2019-09-10 08:48:26,948 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 08:48:26,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:26,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:48:26,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:26,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:48:26,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:48:26,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:48:26,950 INFO L87 Difference]: Start difference. First operand 298058 states and 417368 transitions. Second operand 26 states. [2019-09-10 08:48:27,938 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:48:28,271 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:48:28,571 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 08:48:28,881 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 08:48:29,090 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 08:48:29,360 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 08:48:29,622 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:48:29,901 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:48:30,154 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:48:30,372 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:48:30,649 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 08:48:30,841 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 08:48:32,862 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:48:33,179 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 08:48:33,402 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:48:33,633 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:48:34,089 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 08:48:34,443 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:48:35,018 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 08:48:35,565 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:48:35,720 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 08:48:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:38,088 INFO L93 Difference]: Finished difference Result 343887 states and 481199 transitions. [2019-09-10 08:48:38,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:48:38,088 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 187 [2019-09-10 08:48:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:40,023 INFO L225 Difference]: With dead ends: 343887 [2019-09-10 08:48:40,023 INFO L226 Difference]: Without dead ends: 343887 [2019-09-10 08:48:40,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=596, Invalid=2160, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 08:48:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343887 states. [2019-09-10 08:48:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343887 to 299343. [2019-09-10 08:48:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299343 states. [2019-09-10 08:48:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299343 states to 299343 states and 418833 transitions. [2019-09-10 08:48:48,258 INFO L78 Accepts]: Start accepts. Automaton has 299343 states and 418833 transitions. Word has length 187 [2019-09-10 08:48:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:48,258 INFO L475 AbstractCegarLoop]: Abstraction has 299343 states and 418833 transitions. [2019-09-10 08:48:48,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:48:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 299343 states and 418833 transitions. [2019-09-10 08:48:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:48:48,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:48,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:48:48,272 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:48,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:48,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1069591938, now seen corresponding path program 1 times [2019-09-10 08:48:48,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:48,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:48,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:48,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:48,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:48,418 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 08:48:48,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:48,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:48:48,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:48,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:48:48,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:48:48,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:48:48,419 INFO L87 Difference]: Start difference. First operand 299343 states and 418833 transitions. Second operand 5 states. [2019-09-10 08:48:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:50,701 INFO L93 Difference]: Finished difference Result 469157 states and 661270 transitions. [2019-09-10 08:48:50,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:48:50,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-09-10 08:48:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:51,459 INFO L225 Difference]: With dead ends: 469157 [2019-09-10 08:48:51,459 INFO L226 Difference]: Without dead ends: 469157 [2019-09-10 08:48:51,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:48:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469157 states. [2019-09-10 08:49:01,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469157 to 315135. [2019-09-10 08:49:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315135 states. [2019-09-10 08:49:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315135 states to 315135 states and 441865 transitions. [2019-09-10 08:49:02,408 INFO L78 Accepts]: Start accepts. Automaton has 315135 states and 441865 transitions. Word has length 187 [2019-09-10 08:49:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:02,409 INFO L475 AbstractCegarLoop]: Abstraction has 315135 states and 441865 transitions. [2019-09-10 08:49:02,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:49:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 315135 states and 441865 transitions. [2019-09-10 08:49:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:02,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:02,424 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1117025568, now seen corresponding path program 1 times [2019-09-10 08:49:02,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:02,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:02,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:02,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:02,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:02,648 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 08:49:02,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:02,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:49:02,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:02,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:49:02,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:49:02,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:49:02,650 INFO L87 Difference]: Start difference. First operand 315135 states and 441865 transitions. Second operand 10 states. [2019-09-10 08:49:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:03,477 INFO L93 Difference]: Finished difference Result 301480 states and 420523 transitions. [2019-09-10 08:49:03,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:49:03,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 187 [2019-09-10 08:49:03,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:03,878 INFO L225 Difference]: With dead ends: 301480 [2019-09-10 08:49:03,879 INFO L226 Difference]: Without dead ends: 301480 [2019-09-10 08:49:03,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:49:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301480 states. [2019-09-10 08:49:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301480 to 301480. [2019-09-10 08:49:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301480 states. [2019-09-10 08:49:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301480 states to 301480 states and 420523 transitions. [2019-09-10 08:49:15,800 INFO L78 Accepts]: Start accepts. Automaton has 301480 states and 420523 transitions. Word has length 187 [2019-09-10 08:49:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:15,801 INFO L475 AbstractCegarLoop]: Abstraction has 301480 states and 420523 transitions. [2019-09-10 08:49:15,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:49:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 301480 states and 420523 transitions. [2019-09-10 08:49:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:15,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:15,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:15,820 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash 327333263, now seen corresponding path program 1 times [2019-09-10 08:49:15,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:15,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:15,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:15,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:15,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:17,920 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 08:49:17,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:17,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:49:17,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:17,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:49:17,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:49:17,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:49:17,922 INFO L87 Difference]: Start difference. First operand 301480 states and 420523 transitions. Second operand 26 states. [2019-09-10 08:49:18,874 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 08:49:19,394 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 08:49:19,986 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 08:49:20,436 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 08:49:20,634 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 08:49:20,827 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 08:49:21,047 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:49:21,246 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 08:49:21,677 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 08:49:23,375 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-10 08:49:24,041 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 08:49:24,286 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 08:49:25,190 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-10 08:49:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:27,959 INFO L93 Difference]: Finished difference Result 305367 states and 424973 transitions. [2019-09-10 08:49:27,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:49:27,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 187 [2019-09-10 08:49:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:28,429 INFO L225 Difference]: With dead ends: 305367 [2019-09-10 08:49:28,429 INFO L226 Difference]: Without dead ends: 305367 [2019-09-10 08:49:28,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=565, Invalid=2191, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 08:49:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305367 states. [2019-09-10 08:49:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305367 to 294710. [2019-09-10 08:49:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294710 states. [2019-09-10 08:49:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294710 states to 294710 states and 410620 transitions. [2019-09-10 08:49:32,124 INFO L78 Accepts]: Start accepts. Automaton has 294710 states and 410620 transitions. Word has length 187 [2019-09-10 08:49:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:32,124 INFO L475 AbstractCegarLoop]: Abstraction has 294710 states and 410620 transitions. [2019-09-10 08:49:32,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:49:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 294710 states and 410620 transitions. [2019-09-10 08:49:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:32,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:32,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:32,140 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:32,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:32,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1823168088, now seen corresponding path program 1 times [2019-09-10 08:49:32,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:32,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:34,229 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 08:49:34,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:34,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:49:34,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:34,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:49:34,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:49:34,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:49:34,231 INFO L87 Difference]: Start difference. First operand 294710 states and 410620 transitions. Second operand 22 states. [2019-09-10 08:49:35,142 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 08:49:35,296 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 08:49:35,674 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 08:49:35,884 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 08:49:36,730 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 08:49:36,901 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 08:49:37,239 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 08:49:37,460 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 08:49:37,696 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 08:49:37,993 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 08:49:38,150 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 08:49:38,521 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 08:49:39,085 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 08:49:40,155 WARN L188 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-09-10 08:49:41,990 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-10 08:49:43,127 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-09-10 08:49:43,405 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-10 08:49:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:43,566 INFO L93 Difference]: Finished difference Result 326135 states and 452323 transitions. [2019-09-10 08:49:43,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:49:43,567 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 187 [2019-09-10 08:49:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:43,993 INFO L225 Difference]: With dead ends: 326135 [2019-09-10 08:49:43,993 INFO L226 Difference]: Without dead ends: 326135 [2019-09-10 08:49:43,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=531, Invalid=1631, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 08:49:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326135 states. [2019-09-10 08:49:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326135 to 284231. [2019-09-10 08:49:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284231 states. [2019-09-10 08:49:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284231 states to 284231 states and 395442 transitions. [2019-09-10 08:49:53,563 INFO L78 Accepts]: Start accepts. Automaton has 284231 states and 395442 transitions. Word has length 187 [2019-09-10 08:49:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:53,564 INFO L475 AbstractCegarLoop]: Abstraction has 284231 states and 395442 transitions. [2019-09-10 08:49:53,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:49:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 284231 states and 395442 transitions. [2019-09-10 08:49:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:53,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:53,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:49:53,583 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:53,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:53,584 INFO L82 PathProgramCache]: Analyzing trace with hash 926530493, now seen corresponding path program 1 times [2019-09-10 08:49:53,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:53,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:53,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:53,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:53,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:55,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 08:49:55,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:55,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 08:49:55,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:55,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:49:55,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:49:55,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:49:55,054 INFO L87 Difference]: Start difference. First operand 284231 states and 395442 transitions. Second operand 23 states. [2019-09-10 08:49:55,585 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 08:49:55,828 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 08:49:56,059 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:49:56,415 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 08:49:58,486 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-09-10 08:49:58,939 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 08:49:59,110 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:49:59,310 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:49:59,510 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-10 08:49:59,710 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-09-10 08:49:59,953 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:50:00,143 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-10 08:50:00,832 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:50:01,300 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:50:03,319 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-10 08:50:04,355 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-09-10 08:50:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:05,624 INFO L93 Difference]: Finished difference Result 290826 states and 403136 transitions. [2019-09-10 08:50:05,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 08:50:05,624 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 187 [2019-09-10 08:50:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:06,085 INFO L225 Difference]: With dead ends: 290826 [2019-09-10 08:50:06,085 INFO L226 Difference]: Without dead ends: 290826 [2019-09-10 08:50:06,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=506, Invalid=1564, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 08:50:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290826 states. [2019-09-10 08:50:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290826 to 272739. [2019-09-10 08:50:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272739 states. [2019-09-10 08:50:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272739 states to 272739 states and 378836 transitions. [2019-09-10 08:50:09,758 INFO L78 Accepts]: Start accepts. Automaton has 272739 states and 378836 transitions. Word has length 187 [2019-09-10 08:50:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:09,759 INFO L475 AbstractCegarLoop]: Abstraction has 272739 states and 378836 transitions. [2019-09-10 08:50:09,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:50:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 272739 states and 378836 transitions. [2019-09-10 08:50:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:50:09,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:09,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:09,775 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:09,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:09,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1143062765, now seen corresponding path program 1 times [2019-09-10 08:50:09,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:09,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:09,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:09,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:09,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:11,073 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 08:50:11,321 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-10 08:50:12,396 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 08:50:12,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:12,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:50:12,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:12,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:50:12,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:50:12,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:50:12,397 INFO L87 Difference]: Start difference. First operand 272739 states and 378836 transitions. Second operand 26 states. [2019-09-10 08:50:14,122 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:50:14,331 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:50:14,653 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-09-10 08:50:14,966 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 08:50:15,489 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-09-10 08:50:15,865 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 92 [2019-09-10 08:50:16,179 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 08:50:16,399 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:50:16,686 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:50:16,890 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 08:50:17,125 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:50:17,502 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-10 08:50:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:21,188 INFO L93 Difference]: Finished difference Result 266765 states and 370322 transitions. [2019-09-10 08:50:21,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:50:21,188 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 189 [2019-09-10 08:50:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:22,604 INFO L225 Difference]: With dead ends: 266765 [2019-09-10 08:50:22,605 INFO L226 Difference]: Without dead ends: 266765 [2019-09-10 08:50:22,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=346, Invalid=1376, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:50:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266765 states. [2019-09-10 08:50:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266765 to 263352. [2019-09-10 08:50:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263352 states. [2019-09-10 08:50:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263352 states to 263352 states and 365701 transitions. [2019-09-10 08:50:32,776 INFO L78 Accepts]: Start accepts. Automaton has 263352 states and 365701 transitions. Word has length 189 [2019-09-10 08:50:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:32,777 INFO L475 AbstractCegarLoop]: Abstraction has 263352 states and 365701 transitions. [2019-09-10 08:50:32,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:50:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 263352 states and 365701 transitions. [2019-09-10 08:50:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:50:32,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:32,792 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:32,792 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:32,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:32,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1424059318, now seen corresponding path program 1 times [2019-09-10 08:50:32,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:32,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:32,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:32,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:32,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:33,917 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 08:50:33,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:33,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:50:33,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:33,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:50:33,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:50:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:50:33,918 INFO L87 Difference]: Start difference. First operand 263352 states and 365701 transitions. Second operand 15 states. [2019-09-10 08:50:34,530 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-09-10 08:50:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:37,154 INFO L93 Difference]: Finished difference Result 305795 states and 424246 transitions. [2019-09-10 08:50:37,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:50:37,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 189 [2019-09-10 08:50:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:37,658 INFO L225 Difference]: With dead ends: 305795 [2019-09-10 08:50:37,659 INFO L226 Difference]: Without dead ends: 305795 [2019-09-10 08:50:37,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:50:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305795 states. [2019-09-10 08:50:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305795 to 234717. [2019-09-10 08:50:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234717 states. [2019-09-10 08:50:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234717 states to 234717 states and 325711 transitions. [2019-09-10 08:50:41,545 INFO L78 Accepts]: Start accepts. Automaton has 234717 states and 325711 transitions. Word has length 189 [2019-09-10 08:50:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:41,545 INFO L475 AbstractCegarLoop]: Abstraction has 234717 states and 325711 transitions. [2019-09-10 08:50:41,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:50:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 234717 states and 325711 transitions. [2019-09-10 08:50:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:50:41,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:41,563 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:41,563 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1074233553, now seen corresponding path program 1 times [2019-09-10 08:50:41,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:41,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:41,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:41,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:41,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:41,624 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 08:50:41,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:41,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:41,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:41,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:41,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:41,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:41,625 INFO L87 Difference]: Start difference. First operand 234717 states and 325711 transitions. Second operand 3 states. [2019-09-10 08:50:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:43,366 INFO L93 Difference]: Finished difference Result 231562 states and 319415 transitions. [2019-09-10 08:50:43,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:43,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-10 08:50:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:43,726 INFO L225 Difference]: With dead ends: 231562 [2019-09-10 08:50:43,726 INFO L226 Difference]: Without dead ends: 231562 [2019-09-10 08:50:43,726 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 08:50:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231562 states. [2019-09-10 08:50:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231562 to 231515. [2019-09-10 08:50:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231515 states. [2019-09-10 08:50:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231515 states to 231515 states and 319363 transitions. [2019-09-10 08:50:50,505 INFO L78 Accepts]: Start accepts. Automaton has 231515 states and 319363 transitions. Word has length 190 [2019-09-10 08:50:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:50,505 INFO L475 AbstractCegarLoop]: Abstraction has 231515 states and 319363 transitions. [2019-09-10 08:50:50,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 231515 states and 319363 transitions. [2019-09-10 08:50:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:50:50,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:50,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:50,523 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1313841575, now seen corresponding path program 1 times [2019-09-10 08:50:50,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:50,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:50,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:50,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:50,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:50,608 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 08:50:50,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:50,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:50,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:50,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:50,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:50,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:50,611 INFO L87 Difference]: Start difference. First operand 231515 states and 319363 transitions. Second operand 3 states. [2019-09-10 08:50:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:51,360 INFO L93 Difference]: Finished difference Result 227464 states and 312314 transitions. [2019-09-10 08:50:51,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:51,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-10 08:50:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:51,719 INFO L225 Difference]: With dead ends: 227464 [2019-09-10 08:50:51,720 INFO L226 Difference]: Without dead ends: 227464 [2019-09-10 08:50:51,720 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 08:50:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227464 states. [2019-09-10 08:50:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227464 to 227386. [2019-09-10 08:50:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227386 states. [2019-09-10 08:50:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227386 states to 227386 states and 312231 transitions. [2019-09-10 08:50:55,780 INFO L78 Accepts]: Start accepts. Automaton has 227386 states and 312231 transitions. Word has length 190 [2019-09-10 08:50:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:55,780 INFO L475 AbstractCegarLoop]: Abstraction has 227386 states and 312231 transitions. [2019-09-10 08:50:55,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 227386 states and 312231 transitions. [2019-09-10 08:50:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:50:55,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:55,797 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:50:55,797 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:55,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1782249611, now seen corresponding path program 1 times [2019-09-10 08:50:55,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:55,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:55,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:55,855 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 08:50:55,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:55,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:55,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:55,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:55,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:55,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:55,856 INFO L87 Difference]: Start difference. First operand 227386 states and 312231 transitions. Second operand 3 states. [2019-09-10 08:50:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:57,384 INFO L93 Difference]: Finished difference Result 227356 states and 310658 transitions. [2019-09-10 08:50:57,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:57,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-10 08:50:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:57,696 INFO L225 Difference]: With dead ends: 227356 [2019-09-10 08:50:57,696 INFO L226 Difference]: Without dead ends: 227356 [2019-09-10 08:50:57,696 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 08:50:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227356 states. [2019-09-10 08:51:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227356 to 227354. [2019-09-10 08:51:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227354 states. [2019-09-10 08:51:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227354 states to 227354 states and 310657 transitions. [2019-09-10 08:51:03,541 INFO L78 Accepts]: Start accepts. Automaton has 227354 states and 310657 transitions. Word has length 190 [2019-09-10 08:51:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:03,542 INFO L475 AbstractCegarLoop]: Abstraction has 227354 states and 310657 transitions. [2019-09-10 08:51:03,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 227354 states and 310657 transitions. [2019-09-10 08:51:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:51:03,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:03,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:51:03,557 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:03,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:03,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1716401789, now seen corresponding path program 1 times [2019-09-10 08:51:03,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:03,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:03,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:03,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:03,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:03,634 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 08:51:03,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:03,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:03,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:03,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:03,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:03,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:03,636 INFO L87 Difference]: Start difference. First operand 227354 states and 310657 transitions. Second operand 3 states. [2019-09-10 08:51:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:04,907 INFO L93 Difference]: Finished difference Result 215326 states and 292342 transitions. [2019-09-10 08:51:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:04,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-10 08:51:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:05,268 INFO L225 Difference]: With dead ends: 215326 [2019-09-10 08:51:05,269 INFO L226 Difference]: Without dead ends: 215326 [2019-09-10 08:51:05,269 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 08:51:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215326 states. [2019-09-10 08:51:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215326 to 215243. [2019-09-10 08:51:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215243 states. [2019-09-10 08:51:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215243 states to 215243 states and 292255 transitions. [2019-09-10 08:51:08,421 INFO L78 Accepts]: Start accepts. Automaton has 215243 states and 292255 transitions. Word has length 190 [2019-09-10 08:51:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:08,422 INFO L475 AbstractCegarLoop]: Abstraction has 215243 states and 292255 transitions. [2019-09-10 08:51:08,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 215243 states and 292255 transitions. [2019-09-10 08:51:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:51:08,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:08,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:51:08,437 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:08,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1674720626, now seen corresponding path program 1 times [2019-09-10 08:51:08,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:08,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:08,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:08,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:08,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:09,712 WARN L188 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-09-10 08:51:10,027 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 08:51:10,169 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:51:10,406 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:51:11,285 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 08:51:11,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:11,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:51:11,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:11,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:51:11,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:51:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:51:11,287 INFO L87 Difference]: Start difference. First operand 215243 states and 292255 transitions. Second operand 21 states. [2019-09-10 08:51:11,855 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 08:51:12,183 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:51:12,521 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-09-10 08:51:13,023 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2019-09-10 08:51:13,437 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 112 [2019-09-10 08:51:13,770 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:51:14,204 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:51:14,420 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:51:14,792 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:51:15,027 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 08:51:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:18,761 INFO L93 Difference]: Finished difference Result 200630 states and 272668 transitions. [2019-09-10 08:51:18,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:51:18,761 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2019-09-10 08:51:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:18,995 INFO L225 Difference]: With dead ends: 200630 [2019-09-10 08:51:18,996 INFO L226 Difference]: Without dead ends: 200630 [2019-09-10 08:51:18,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:51:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200630 states. [2019-09-10 08:51:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200630 to 200612. [2019-09-10 08:51:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200612 states. [2019-09-10 08:51:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200612 states to 200612 states and 272653 transitions. [2019-09-10 08:51:24,005 INFO L78 Accepts]: Start accepts. Automaton has 200612 states and 272653 transitions. Word has length 192 [2019-09-10 08:51:24,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:24,006 INFO L475 AbstractCegarLoop]: Abstraction has 200612 states and 272653 transitions. [2019-09-10 08:51:24,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:51:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 200612 states and 272653 transitions. [2019-09-10 08:51:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:51:24,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:24,022 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:51:24,022 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:24,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1204371986, now seen corresponding path program 1 times [2019-09-10 08:51:24,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:24,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:24,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:24,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:24,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:25,237 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 08:51:25,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:25,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:51:25,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:25,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:51:25,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:51:25,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:51:25,239 INFO L87 Difference]: Start difference. First operand 200612 states and 272653 transitions. Second operand 21 states. [2019-09-10 08:51:25,814 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 08:51:26,073 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 08:51:26,312 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-10 08:51:27,341 WARN L188 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-09-10 08:51:27,671 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-09-10 08:51:27,842 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:51:28,197 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:51:28,424 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 08:51:28,595 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 08:51:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:31,396 INFO L93 Difference]: Finished difference Result 188892 states and 256655 transitions. [2019-09-10 08:51:31,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:51:31,396 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2019-09-10 08:51:31,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:31,624 INFO L225 Difference]: With dead ends: 188892 [2019-09-10 08:51:31,624 INFO L226 Difference]: Without dead ends: 188892 [2019-09-10 08:51:31,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:51:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188892 states. [2019-09-10 08:51:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188892 to 188866. [2019-09-10 08:51:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188866 states. [2019-09-10 08:51:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188866 states to 188866 states and 256629 transitions. [2019-09-10 08:51:34,032 INFO L78 Accepts]: Start accepts. Automaton has 188866 states and 256629 transitions. Word has length 192 [2019-09-10 08:51:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:34,032 INFO L475 AbstractCegarLoop]: Abstraction has 188866 states and 256629 transitions. [2019-09-10 08:51:34,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:51:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 188866 states and 256629 transitions. [2019-09-10 08:51:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:51:34,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:34,045 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:51:34,045 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:34,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash -986461078, now seen corresponding path program 1 times [2019-09-10 08:51:34,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:34,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:34,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:34,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:35,376 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 08:51:35,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:35,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:51:35,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:35,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:51:35,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:51:35,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:51:35,379 INFO L87 Difference]: Start difference. First operand 188866 states and 256629 transitions. Second operand 21 states. [2019-09-10 08:51:36,878 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 08:51:37,012 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 08:51:37,191 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:51:37,402 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 08:51:37,601 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 08:51:37,841 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:51:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:41,475 INFO L93 Difference]: Finished difference Result 186620 states and 253674 transitions. [2019-09-10 08:51:41,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:51:41,476 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2019-09-10 08:51:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:41,744 INFO L225 Difference]: With dead ends: 186620 [2019-09-10 08:51:41,745 INFO L226 Difference]: Without dead ends: 186588 [2019-09-10 08:51:41,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=333, Invalid=1073, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:51:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186588 states. [2019-09-10 08:51:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186588 to 186584. [2019-09-10 08:51:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186584 states. [2019-09-10 08:51:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186584 states to 186584 states and 253640 transitions. [2019-09-10 08:51:44,421 INFO L78 Accepts]: Start accepts. Automaton has 186584 states and 253640 transitions. Word has length 192 [2019-09-10 08:51:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:44,422 INFO L475 AbstractCegarLoop]: Abstraction has 186584 states and 253640 transitions. [2019-09-10 08:51:44,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:51:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 186584 states and 253640 transitions. [2019-09-10 08:51:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:51:44,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:44,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:51:44,436 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:44,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:44,437 INFO L82 PathProgramCache]: Analyzing trace with hash -582742884, now seen corresponding path program 1 times [2019-09-10 08:51:44,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:44,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:44,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:44,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:44,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:45,083 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-10 08:51:45,866 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 08:51:45,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:45,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:51:45,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:45,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:51:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:51:45,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:51:45,868 INFO L87 Difference]: Start difference. First operand 186584 states and 253640 transitions. Second operand 21 states. [2019-09-10 08:51:46,315 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 08:51:47,087 WARN L188 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:51:47,414 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 08:51:47,744 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 08:51:48,294 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-10 08:51:48,741 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 08:51:48,966 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:51:49,210 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:51:49,455 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:51:49,674 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:51:50,159 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 08:51:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:52,653 INFO L93 Difference]: Finished difference Result 181823 states and 247137 transitions. [2019-09-10 08:51:52,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:51:52,653 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2019-09-10 08:51:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:52,919 INFO L225 Difference]: With dead ends: 181823 [2019-09-10 08:51:52,919 INFO L226 Difference]: Without dead ends: 181823 [2019-09-10 08:51:52,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:51:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181823 states. [2019-09-10 08:51:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181823 to 181788. [2019-09-10 08:51:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181788 states. [2019-09-10 08:51:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181788 states to 181788 states and 247104 transitions. [2019-09-10 08:51:57,590 INFO L78 Accepts]: Start accepts. Automaton has 181788 states and 247104 transitions. Word has length 192 [2019-09-10 08:51:57,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:57,590 INFO L475 AbstractCegarLoop]: Abstraction has 181788 states and 247104 transitions. [2019-09-10 08:51:57,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:51:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 181788 states and 247104 transitions. [2019-09-10 08:51:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:51:57,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:57,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:51:57,603 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1629464639, now seen corresponding path program 1 times [2019-09-10 08:51:57,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:57,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:57,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:57,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:57,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:58,676 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 08:51:58,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:58,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:51:58,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:58,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:51:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:51:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:51:58,678 INFO L87 Difference]: Start difference. First operand 181788 states and 247104 transitions. Second operand 19 states. [2019-09-10 08:51:58,880 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 08:51:59,050 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 08:51:59,801 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 08:51:59,950 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 08:52:00,267 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 08:52:00,473 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-09-10 08:52:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:04,558 INFO L93 Difference]: Finished difference Result 180820 states and 245976 transitions. [2019-09-10 08:52:04,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:52:04,559 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 192 [2019-09-10 08:52:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:04,817 INFO L225 Difference]: With dead ends: 180820 [2019-09-10 08:52:04,817 INFO L226 Difference]: Without dead ends: 180816 [2019-09-10 08:52:04,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=377, Invalid=1183, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:52:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180816 states. [2019-09-10 08:52:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180816 to 170066. [2019-09-10 08:52:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170066 states. [2019-09-10 08:52:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170066 states to 170066 states and 231107 transitions. [2019-09-10 08:52:07,522 INFO L78 Accepts]: Start accepts. Automaton has 170066 states and 231107 transitions. Word has length 192 [2019-09-10 08:52:07,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:07,522 INFO L475 AbstractCegarLoop]: Abstraction has 170066 states and 231107 transitions. [2019-09-10 08:52:07,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:52:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 170066 states and 231107 transitions. [2019-09-10 08:52:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:52:07,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:07,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:07,534 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:07,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash -593915614, now seen corresponding path program 1 times [2019-09-10 08:52:07,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:07,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:07,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:07,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:07,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:08,767 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 08:52:08,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:08,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:52:08,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:08,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:52:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:52:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:52:08,768 INFO L87 Difference]: Start difference. First operand 170066 states and 231107 transitions. Second operand 21 states. [2019-09-10 08:52:09,357 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 08:52:09,556 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 08:52:09,876 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-09-10 08:52:10,169 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-09-10 08:52:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:13,069 INFO L93 Difference]: Finished difference Result 158181 states and 214899 transitions. [2019-09-10 08:52:13,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:52:13,069 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2019-09-10 08:52:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:13,287 INFO L225 Difference]: With dead ends: 158181 [2019-09-10 08:52:13,287 INFO L226 Difference]: Without dead ends: 158151 [2019-09-10 08:52:13,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:52:13,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158151 states. [2019-09-10 08:52:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158151 to 158149. [2019-09-10 08:52:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158149 states. [2019-09-10 08:52:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158149 states to 158149 states and 214867 transitions. [2019-09-10 08:52:15,969 INFO L78 Accepts]: Start accepts. Automaton has 158149 states and 214867 transitions. Word has length 192 [2019-09-10 08:52:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:15,969 INFO L475 AbstractCegarLoop]: Abstraction has 158149 states and 214867 transitions. [2019-09-10 08:52:15,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:52:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 158149 states and 214867 transitions. [2019-09-10 08:52:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:52:15,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:15,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:15,982 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1842403655, now seen corresponding path program 1 times [2019-09-10 08:52:15,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:15,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:15,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:15,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:15,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:17,740 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-09-10 08:52:17,860 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 08:52:18,082 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:52:19,056 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 08:52:19,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:19,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:52:19,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:19,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:52:19,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:52:19,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:52:19,058 INFO L87 Difference]: Start difference. First operand 158149 states and 214867 transitions. Second operand 20 states. [2019-09-10 08:52:19,632 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 91 [2019-09-10 08:52:20,076 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2019-09-10 08:52:20,901 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-10 08:52:21,182 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:52:21,606 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-09-10 08:52:22,044 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-09-10 08:52:22,617 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-09-10 08:52:23,170 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-09-10 08:52:23,557 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 08:52:23,879 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 08:52:24,104 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 08:52:24,459 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:52:24,746 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:52:24,965 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-09-10 08:52:25,524 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-09-10 08:52:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:29,265 INFO L93 Difference]: Finished difference Result 152485 states and 207041 transitions. [2019-09-10 08:52:29,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:52:29,265 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 192 [2019-09-10 08:52:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:29,480 INFO L225 Difference]: With dead ends: 152485 [2019-09-10 08:52:29,480 INFO L226 Difference]: Without dead ends: 152485 [2019-09-10 08:52:29,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=340, Invalid=1142, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:52:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152485 states. [2019-09-10 08:52:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152485 to 146531. [2019-09-10 08:52:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146531 states. [2019-09-10 08:52:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146531 states to 146531 states and 198928 transitions. [2019-09-10 08:52:31,374 INFO L78 Accepts]: Start accepts. Automaton has 146531 states and 198928 transitions. Word has length 192 [2019-09-10 08:52:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:31,374 INFO L475 AbstractCegarLoop]: Abstraction has 146531 states and 198928 transitions. [2019-09-10 08:52:31,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:52:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 146531 states and 198928 transitions. [2019-09-10 08:52:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:52:31,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:31,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:31,388 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash 951653073, now seen corresponding path program 1 times [2019-09-10 08:52:31,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:31,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:31,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:31,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:33,032 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 08:52:33,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:33,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:52:33,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:33,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:52:33,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:52:33,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:52:33,034 INFO L87 Difference]: Start difference. First operand 146531 states and 198928 transitions. Second operand 25 states. [2019-09-10 08:52:33,962 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-09-10 08:52:34,118 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-09-10 08:52:34,412 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 08:52:34,597 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:52:34,892 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 08:52:35,202 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-09-10 08:52:35,661 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 87 [2019-09-10 08:52:35,883 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:52:36,179 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:52:38,136 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:52:38,658 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:52:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:42,114 INFO L93 Difference]: Finished difference Result 141718 states and 192397 transitions. [2019-09-10 08:52:42,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:52:42,117 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 192 [2019-09-10 08:52:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:42,300 INFO L225 Difference]: With dead ends: 141718 [2019-09-10 08:52:42,300 INFO L226 Difference]: Without dead ends: 141718 [2019-09-10 08:52:42,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=414, Invalid=1748, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 08:52:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141718 states. [2019-09-10 08:52:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141718 to 141700. [2019-09-10 08:52:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141700 states. [2019-09-10 08:52:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141700 states to 141700 states and 192380 transitions. [2019-09-10 08:52:43,829 INFO L78 Accepts]: Start accepts. Automaton has 141700 states and 192380 transitions. Word has length 192 [2019-09-10 08:52:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:43,829 INFO L475 AbstractCegarLoop]: Abstraction has 141700 states and 192380 transitions. [2019-09-10 08:52:43,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:52:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 141700 states and 192380 transitions. [2019-09-10 08:52:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:52:43,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:43,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:43,842 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:43,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:43,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1662733430, now seen corresponding path program 1 times [2019-09-10 08:52:43,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:43,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:43,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:43,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:44,584 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 08:52:44,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:44,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:52:44,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:44,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:52:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:52:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:52:44,585 INFO L87 Difference]: Start difference. First operand 141700 states and 192380 transitions. Second operand 19 states. [2019-09-10 08:52:44,748 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:52:45,476 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:52:45,659 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:52:45,913 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:52:46,126 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 08:52:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:50,074 INFO L93 Difference]: Finished difference Result 130436 states and 177052 transitions. [2019-09-10 08:52:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:52:50,075 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 192 [2019-09-10 08:52:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:50,260 INFO L225 Difference]: With dead ends: 130436 [2019-09-10 08:52:50,260 INFO L226 Difference]: Without dead ends: 130436 [2019-09-10 08:52:50,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=340, Invalid=1300, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:52:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130436 states. [2019-09-10 08:52:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130436 to 128914. [2019-09-10 08:52:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128914 states. [2019-09-10 08:52:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128914 states to 128914 states and 175155 transitions. [2019-09-10 08:52:52,263 INFO L78 Accepts]: Start accepts. Automaton has 128914 states and 175155 transitions. Word has length 192 [2019-09-10 08:52:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:52,263 INFO L475 AbstractCegarLoop]: Abstraction has 128914 states and 175155 transitions. [2019-09-10 08:52:52,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:52:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states and 175155 transitions. [2019-09-10 08:52:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:52:52,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:52,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:52,275 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1681212109, now seen corresponding path program 1 times [2019-09-10 08:52:52,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:52,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:52,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:52,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:52,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:53,093 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 08:52:53,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:53,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:52:53,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:53,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:52:53,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:52:53,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:52:53,095 INFO L87 Difference]: Start difference. First operand 128914 states and 175155 transitions. Second operand 22 states. [2019-09-10 08:52:53,324 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 08:52:54,399 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:52:54,609 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 08:52:54,941 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 08:52:55,220 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-09-10 08:52:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:59,679 INFO L93 Difference]: Finished difference Result 129188 states and 175445 transitions. [2019-09-10 08:52:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:52:59,680 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 192 [2019-09-10 08:52:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:00,354 INFO L225 Difference]: With dead ends: 129188 [2019-09-10 08:53:00,354 INFO L226 Difference]: Without dead ends: 129188 [2019-09-10 08:53:00,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:53:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129188 states. [2019-09-10 08:53:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129188 to 128960. [2019-09-10 08:53:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128960 states. [2019-09-10 08:53:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128960 states to 128960 states and 175207 transitions. [2019-09-10 08:53:01,528 INFO L78 Accepts]: Start accepts. Automaton has 128960 states and 175207 transitions. Word has length 192 [2019-09-10 08:53:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:01,528 INFO L475 AbstractCegarLoop]: Abstraction has 128960 states and 175207 transitions. [2019-09-10 08:53:01,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:53:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 128960 states and 175207 transitions. [2019-09-10 08:53:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:53:01,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:01,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:01,541 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:01,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:01,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1521773495, now seen corresponding path program 1 times [2019-09-10 08:53:01,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:01,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:01,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:01,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:01,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:02,167 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 08:53:02,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:02,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:53:02,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:02,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:53:02,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:53:02,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:53:02,168 INFO L87 Difference]: Start difference. First operand 128960 states and 175207 transitions. Second operand 19 states. [2019-09-10 08:53:02,323 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 08:53:03,386 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:53:03,623 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 08:53:03,807 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 08:53:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:06,120 INFO L93 Difference]: Finished difference Result 113727 states and 154560 transitions. [2019-09-10 08:53:06,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:53:06,121 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 192 [2019-09-10 08:53:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:06,260 INFO L225 Difference]: With dead ends: 113727 [2019-09-10 08:53:06,260 INFO L226 Difference]: Without dead ends: 113727 [2019-09-10 08:53:06,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:53:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113727 states. [2019-09-10 08:53:07,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113727 to 113662. [2019-09-10 08:53:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113662 states. [2019-09-10 08:53:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113662 states to 113662 states and 154491 transitions. [2019-09-10 08:53:08,085 INFO L78 Accepts]: Start accepts. Automaton has 113662 states and 154491 transitions. Word has length 192 [2019-09-10 08:53:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:08,086 INFO L475 AbstractCegarLoop]: Abstraction has 113662 states and 154491 transitions. [2019-09-10 08:53:08,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:53:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 113662 states and 154491 transitions. [2019-09-10 08:53:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:53:08,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:08,097 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:08,097 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:08,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash 73286270, now seen corresponding path program 1 times [2019-09-10 08:53:08,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:08,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:08,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:08,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:08,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:08,221 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 08:53:08,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:08,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:53:08,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:08,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:53:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:53:08,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:53:08,222 INFO L87 Difference]: Start difference. First operand 113662 states and 154491 transitions. Second operand 6 states. [2019-09-10 08:53:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:08,794 INFO L93 Difference]: Finished difference Result 187795 states and 258429 transitions. [2019-09-10 08:53:08,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:53:08,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-09-10 08:53:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:09,029 INFO L225 Difference]: With dead ends: 187795 [2019-09-10 08:53:09,030 INFO L226 Difference]: Without dead ends: 187795 [2019-09-10 08:53:09,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:53:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187795 states. [2019-09-10 08:53:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187795 to 133308. [2019-09-10 08:53:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133308 states. [2019-09-10 08:53:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133308 states to 133308 states and 181283 transitions. [2019-09-10 08:53:11,356 INFO L78 Accepts]: Start accepts. Automaton has 133308 states and 181283 transitions. Word has length 193 [2019-09-10 08:53:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:11,357 INFO L475 AbstractCegarLoop]: Abstraction has 133308 states and 181283 transitions. [2019-09-10 08:53:11,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:53:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 133308 states and 181283 transitions. [2019-09-10 08:53:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:53:11,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:11,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:11,368 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:11,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:11,368 INFO L82 PathProgramCache]: Analyzing trace with hash -162944831, now seen corresponding path program 1 times [2019-09-10 08:53:11,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:11,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:11,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:11,506 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 08:53:11,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:11,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:53:11,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:11,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:53:11,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:53:11,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:53:11,507 INFO L87 Difference]: Start difference. First operand 133308 states and 181283 transitions. Second operand 8 states. [2019-09-10 08:53:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:12,949 INFO L93 Difference]: Finished difference Result 371519 states and 500563 transitions. [2019-09-10 08:53:12,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:53:12,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2019-09-10 08:53:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:13,536 INFO L225 Difference]: With dead ends: 371519 [2019-09-10 08:53:13,536 INFO L226 Difference]: Without dead ends: 371519 [2019-09-10 08:53:13,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:53:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371519 states. [2019-09-10 08:53:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371519 to 195467. [2019-09-10 08:53:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195467 states. [2019-09-10 08:53:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195467 states to 195467 states and 264579 transitions. [2019-09-10 08:53:21,803 INFO L78 Accepts]: Start accepts. Automaton has 195467 states and 264579 transitions. Word has length 193 [2019-09-10 08:53:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:21,803 INFO L475 AbstractCegarLoop]: Abstraction has 195467 states and 264579 transitions. [2019-09-10 08:53:21,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:53:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 195467 states and 264579 transitions. [2019-09-10 08:53:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:53:21,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:21,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:21,815 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2084617453, now seen corresponding path program 1 times [2019-09-10 08:53:21,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:21,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:21,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:21,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:21,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:21,947 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 08:53:21,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:21,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:53:21,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:21,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:53:21,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:53:21,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:53:21,949 INFO L87 Difference]: Start difference. First operand 195467 states and 264579 transitions. Second operand 6 states. [2019-09-10 08:53:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:22,736 INFO L93 Difference]: Finished difference Result 283661 states and 384847 transitions. [2019-09-10 08:53:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:53:22,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-09-10 08:53:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:23,101 INFO L225 Difference]: With dead ends: 283661 [2019-09-10 08:53:23,102 INFO L226 Difference]: Without dead ends: 283661 [2019-09-10 08:53:23,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:53:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283661 states. [2019-09-10 08:53:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283661 to 192485. [2019-09-10 08:53:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192485 states. [2019-09-10 08:53:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192485 states to 192485 states and 259538 transitions. [2019-09-10 08:53:26,058 INFO L78 Accepts]: Start accepts. Automaton has 192485 states and 259538 transitions. Word has length 193 [2019-09-10 08:53:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:26,058 INFO L475 AbstractCegarLoop]: Abstraction has 192485 states and 259538 transitions. [2019-09-10 08:53:26,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:53:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 192485 states and 259538 transitions. [2019-09-10 08:53:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:53:26,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:26,070 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:26,070 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1855772631, now seen corresponding path program 1 times [2019-09-10 08:53:26,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:26,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:26,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:26,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:26,190 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 08:53:26,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:26,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:53:26,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:26,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:53:26,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:53:26,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:53:26,192 INFO L87 Difference]: Start difference. First operand 192485 states and 259538 transitions. Second operand 8 states. [2019-09-10 08:53:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:28,520 INFO L93 Difference]: Finished difference Result 380812 states and 504692 transitions. [2019-09-10 08:53:28,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:53:28,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2019-09-10 08:53:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:29,037 INFO L225 Difference]: With dead ends: 380812 [2019-09-10 08:53:29,038 INFO L226 Difference]: Without dead ends: 380812 [2019-09-10 08:53:29,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:53:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380812 states. [2019-09-10 08:53:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380812 to 255707. [2019-09-10 08:53:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255707 states. [2019-09-10 08:53:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255707 states to 255707 states and 343273 transitions. [2019-09-10 08:53:33,287 INFO L78 Accepts]: Start accepts. Automaton has 255707 states and 343273 transitions. Word has length 193 [2019-09-10 08:53:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:33,287 INFO L475 AbstractCegarLoop]: Abstraction has 255707 states and 343273 transitions. [2019-09-10 08:53:33,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:53:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 255707 states and 343273 transitions. [2019-09-10 08:53:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:53:33,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:33,304 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:33,305 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:33,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:33,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1432219922, now seen corresponding path program 1 times [2019-09-10 08:53:33,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:33,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:33,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:33,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:33,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:34,455 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 08:53:34,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:34,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:53:34,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:34,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:53:34,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:53:34,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:53:34,457 INFO L87 Difference]: Start difference. First operand 255707 states and 343273 transitions. Second operand 6 states. [2019-09-10 08:53:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:35,303 INFO L93 Difference]: Finished difference Result 306145 states and 409499 transitions. [2019-09-10 08:53:35,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:53:35,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-09-10 08:53:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:35,736 INFO L225 Difference]: With dead ends: 306145 [2019-09-10 08:53:35,736 INFO L226 Difference]: Without dead ends: 306145 [2019-09-10 08:53:35,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:53:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306145 states. [2019-09-10 08:53:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306145 to 232445. [2019-09-10 08:53:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232445 states. [2019-09-10 08:53:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232445 states to 232445 states and 309484 transitions. [2019-09-10 08:53:39,424 INFO L78 Accepts]: Start accepts. Automaton has 232445 states and 309484 transitions. Word has length 193 [2019-09-10 08:53:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:39,424 INFO L475 AbstractCegarLoop]: Abstraction has 232445 states and 309484 transitions. [2019-09-10 08:53:39,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:53:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 232445 states and 309484 transitions. [2019-09-10 08:53:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:53:39,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:39,440 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:39,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash 601322104, now seen corresponding path program 1 times [2019-09-10 08:53:39,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:39,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:39,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:39,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:39,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:39,561 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 08:53:39,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:39,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:53:39,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:39,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:53:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:53:39,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:53:39,563 INFO L87 Difference]: Start difference. First operand 232445 states and 309484 transitions. Second operand 8 states. [2019-09-10 08:53:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:42,295 INFO L93 Difference]: Finished difference Result 541659 states and 714943 transitions. [2019-09-10 08:53:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:53:42,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2019-09-10 08:53:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:43,177 INFO L225 Difference]: With dead ends: 541659 [2019-09-10 08:53:43,177 INFO L226 Difference]: Without dead ends: 541659 [2019-09-10 08:53:43,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:53:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541659 states. [2019-09-10 08:53:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541659 to 271159. [2019-09-10 08:53:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271159 states. [2019-09-10 08:53:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271159 states to 271159 states and 361335 transitions. [2019-09-10 08:53:53,139 INFO L78 Accepts]: Start accepts. Automaton has 271159 states and 361335 transitions. Word has length 193 [2019-09-10 08:53:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:53,139 INFO L475 AbstractCegarLoop]: Abstraction has 271159 states and 361335 transitions. [2019-09-10 08:53:53,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:53:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 271159 states and 361335 transitions. [2019-09-10 08:53:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:53:53,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:53,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:53,155 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:53,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash 346001446, now seen corresponding path program 1 times [2019-09-10 08:53:53,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:53,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:53,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:53,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:53,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:53,269 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 08:53:53,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:53,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:53:53,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:53,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:53:53,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:53:53,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:53:53,270 INFO L87 Difference]: Start difference. First operand 271159 states and 361335 transitions. Second operand 8 states. [2019-09-10 08:53:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:55,150 INFO L93 Difference]: Finished difference Result 590058 states and 778463 transitions. [2019-09-10 08:53:55,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:53:55,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2019-09-10 08:53:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:56,227 INFO L225 Difference]: With dead ends: 590058 [2019-09-10 08:53:56,227 INFO L226 Difference]: Without dead ends: 590058 [2019-09-10 08:53:56,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:53:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590058 states. [2019-09-10 08:54:03,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590058 to 305762. [2019-09-10 08:54:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305762 states. [2019-09-10 08:54:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305762 states to 305762 states and 408626 transitions. [2019-09-10 08:54:03,725 INFO L78 Accepts]: Start accepts. Automaton has 305762 states and 408626 transitions. Word has length 193 [2019-09-10 08:54:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:03,725 INFO L475 AbstractCegarLoop]: Abstraction has 305762 states and 408626 transitions. [2019-09-10 08:54:03,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:54:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 305762 states and 408626 transitions. [2019-09-10 08:54:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:54:03,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:03,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:03,739 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:03,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1518876902, now seen corresponding path program 1 times [2019-09-10 08:54:03,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:03,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:03,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:03,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:03,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:04,224 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 08:54:04,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:04,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:54:04,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:04,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:54:04,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:54:04,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:54:04,226 INFO L87 Difference]: Start difference. First operand 305762 states and 408626 transitions. Second operand 17 states. [2019-09-10 08:54:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:09,375 INFO L93 Difference]: Finished difference Result 308175 states and 411137 transitions. [2019-09-10 08:54:09,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:54:09,376 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 195 [2019-09-10 08:54:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:09,834 INFO L225 Difference]: With dead ends: 308175 [2019-09-10 08:54:09,834 INFO L226 Difference]: Without dead ends: 308175 [2019-09-10 08:54:09,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=388, Invalid=1252, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:54:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308175 states. [2019-09-10 08:54:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308175 to 306288. [2019-09-10 08:54:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306288 states. [2019-09-10 08:54:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306288 states to 306288 states and 409179 transitions. [2019-09-10 08:54:18,237 INFO L78 Accepts]: Start accepts. Automaton has 306288 states and 409179 transitions. Word has length 195 [2019-09-10 08:54:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:18,237 INFO L475 AbstractCegarLoop]: Abstraction has 306288 states and 409179 transitions. [2019-09-10 08:54:18,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:54:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 306288 states and 409179 transitions. [2019-09-10 08:54:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:54:18,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:18,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:18,253 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:18,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:18,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1324998421, now seen corresponding path program 1 times [2019-09-10 08:54:18,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:18,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:18,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:19,001 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:54:20,064 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 08:54:20,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:20,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 08:54:20,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:20,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:54:20,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:54:20,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:54:20,065 INFO L87 Difference]: Start difference. First operand 306288 states and 409179 transitions. Second operand 23 states. [2019-09-10 08:54:20,659 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:54:20,872 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 08:54:21,255 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:54:21,562 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 08:54:21,877 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 08:54:22,139 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 08:54:22,412 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 08:54:22,633 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 08:54:22,822 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2019-09-10 08:54:23,690 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-09-10 08:54:23,909 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2019-09-10 08:54:24,411 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 58 [2019-09-10 08:54:24,785 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2019-09-10 08:54:25,044 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 58 [2019-09-10 08:54:25,347 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:54:26,497 WARN L188 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:54:27,081 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2019-09-10 08:54:27,322 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:54:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:28,813 INFO L93 Difference]: Finished difference Result 306977 states and 409915 transitions. [2019-09-10 08:54:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:54:28,813 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 195 [2019-09-10 08:54:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:29,296 INFO L225 Difference]: With dead ends: 306977 [2019-09-10 08:54:29,296 INFO L226 Difference]: Without dead ends: 306977 [2019-09-10 08:54:29,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=476, Invalid=1594, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 08:54:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306977 states. [2019-09-10 08:54:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306977 to 306447. [2019-09-10 08:54:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306447 states. [2019-09-10 08:54:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306447 states to 306447 states and 409347 transitions. [2019-09-10 08:54:33,670 INFO L78 Accepts]: Start accepts. Automaton has 306447 states and 409347 transitions. Word has length 195 [2019-09-10 08:54:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:33,670 INFO L475 AbstractCegarLoop]: Abstraction has 306447 states and 409347 transitions. [2019-09-10 08:54:33,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:54:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 306447 states and 409347 transitions. [2019-09-10 08:54:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:54:33,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:33,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:33,686 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:33,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1631803926, now seen corresponding path program 1 times [2019-09-10 08:54:33,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:33,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:33,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:35,210 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 08:54:35,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:35,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 08:54:35,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:35,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:54:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:54:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:54:35,211 INFO L87 Difference]: Start difference. First operand 306447 states and 409347 transitions. Second operand 23 states. [2019-09-10 08:54:35,488 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 08:54:36,431 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:54:36,652 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:54:37,344 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:54:37,494 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 08:54:39,299 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 08:54:40,354 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 59 [2019-09-10 08:54:41,780 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 52 [2019-09-10 08:54:42,092 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 08:54:42,539 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:54:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:43,772 INFO L93 Difference]: Finished difference Result 298219 states and 398400 transitions. [2019-09-10 08:54:43,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 08:54:43,773 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 195 [2019-09-10 08:54:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:44,212 INFO L225 Difference]: With dead ends: 298219 [2019-09-10 08:54:44,213 INFO L226 Difference]: Without dead ends: 298219 [2019-09-10 08:54:44,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=427, Invalid=2435, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 08:54:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298219 states. [2019-09-10 08:54:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298219 to 297539. [2019-09-10 08:54:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297539 states. [2019-09-10 08:54:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297539 states to 297539 states and 397684 transitions. [2019-09-10 08:54:54,128 INFO L78 Accepts]: Start accepts. Automaton has 297539 states and 397684 transitions. Word has length 195 [2019-09-10 08:54:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:54,128 INFO L475 AbstractCegarLoop]: Abstraction has 297539 states and 397684 transitions. [2019-09-10 08:54:54,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:54:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 297539 states and 397684 transitions. [2019-09-10 08:54:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:54:54,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:54,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:54,146 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:54,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:54,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2026078922, now seen corresponding path program 1 times [2019-09-10 08:54:54,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:54,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:54,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:54,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:54,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:54,199 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 08:54:54,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:54,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:54,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:54,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:54,200 INFO L87 Difference]: Start difference. First operand 297539 states and 397684 transitions. Second operand 3 states. [2019-09-10 08:54:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:55,148 INFO L93 Difference]: Finished difference Result 362884 states and 467459 transitions. [2019-09-10 08:54:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:55,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-10 08:54:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:55,692 INFO L225 Difference]: With dead ends: 362884 [2019-09-10 08:54:55,693 INFO L226 Difference]: Without dead ends: 362884 [2019-09-10 08:54:55,693 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 08:54:55,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362884 states. [2019-09-10 08:55:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362884 to 298868. [2019-09-10 08:55:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298868 states. [2019-09-10 08:55:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298868 states to 298868 states and 383978 transitions. [2019-09-10 08:55:00,816 INFO L78 Accepts]: Start accepts. Automaton has 298868 states and 383978 transitions. Word has length 195 [2019-09-10 08:55:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:00,816 INFO L475 AbstractCegarLoop]: Abstraction has 298868 states and 383978 transitions. [2019-09-10 08:55:00,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 298868 states and 383978 transitions. [2019-09-10 08:55:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:55:00,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:00,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:00,834 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:00,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1487375532, now seen corresponding path program 1 times [2019-09-10 08:55:00,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:00,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:00,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:00,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:00,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:01,512 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 08:55:01,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:01,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:55:01,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:01,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:55:01,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:55:01,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:55:01,514 INFO L87 Difference]: Start difference. First operand 298868 states and 383978 transitions. Second operand 18 states. [2019-09-10 08:55:01,686 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:55:03,647 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2019-09-10 08:55:03,801 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2019-09-10 08:55:04,209 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2019-09-10 08:55:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:05,521 INFO L93 Difference]: Finished difference Result 300455 states and 385623 transitions. [2019-09-10 08:55:05,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:55:05,521 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 195 [2019-09-10 08:55:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:05,950 INFO L225 Difference]: With dead ends: 300455 [2019-09-10 08:55:05,950 INFO L226 Difference]: Without dead ends: 300455 [2019-09-10 08:55:05,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=284, Invalid=906, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:55:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300455 states. [2019-09-10 08:55:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300455 to 299986. [2019-09-10 08:55:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299986 states. [2019-09-10 08:55:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299986 states to 299986 states and 385138 transitions. [2019-09-10 08:55:10,544 INFO L78 Accepts]: Start accepts. Automaton has 299986 states and 385138 transitions. Word has length 195 [2019-09-10 08:55:10,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:10,545 INFO L475 AbstractCegarLoop]: Abstraction has 299986 states and 385138 transitions. [2019-09-10 08:55:10,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:55:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 299986 states and 385138 transitions. [2019-09-10 08:55:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:55:10,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:10,561 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:10,561 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:10,562 INFO L82 PathProgramCache]: Analyzing trace with hash -972519977, now seen corresponding path program 1 times [2019-09-10 08:55:10,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:10,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:10,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:10,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:10,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:12,368 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 08:55:12,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:12,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:55:12,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:12,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:55:12,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:55:12,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:55:12,369 INFO L87 Difference]: Start difference. First operand 299986 states and 385138 transitions. Second operand 22 states. [2019-09-10 08:55:12,686 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2019-09-10 08:55:13,381 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:55:13,858 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 08:55:15,172 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 08:55:15,422 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 08:55:15,893 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 08:55:16,176 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 08:55:16,352 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:55:16,590 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-10 08:55:17,224 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 46 [2019-09-10 08:55:17,599 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-09-10 08:55:17,809 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-09-10 08:55:18,098 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2019-09-10 08:55:18,375 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 56 [2019-09-10 08:55:18,686 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-09-10 08:55:18,965 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2019-09-10 08:55:19,513 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 08:55:19,929 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:55:20,223 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-09-10 08:55:20,389 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:55:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:21,315 INFO L93 Difference]: Finished difference Result 241186 states and 309771 transitions. [2019-09-10 08:55:21,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:55:21,315 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 195 [2019-09-10 08:55:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:21,615 INFO L225 Difference]: With dead ends: 241186 [2019-09-10 08:55:21,615 INFO L226 Difference]: Without dead ends: 241186 [2019-09-10 08:55:21,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=457, Invalid=1523, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:55:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241186 states. [2019-09-10 08:55:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241186 to 240356. [2019-09-10 08:55:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240356 states. [2019-09-10 08:55:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240356 states to 240356 states and 308872 transitions. [2019-09-10 08:55:27,959 INFO L78 Accepts]: Start accepts. Automaton has 240356 states and 308872 transitions. Word has length 195 [2019-09-10 08:55:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:27,959 INFO L475 AbstractCegarLoop]: Abstraction has 240356 states and 308872 transitions. [2019-09-10 08:55:27,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:55:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 240356 states and 308872 transitions. [2019-09-10 08:55:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:55:27,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:27,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:27,975 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash -860462950, now seen corresponding path program 1 times [2019-09-10 08:55:27,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:27,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:27,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:29,333 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-09-10 08:55:29,574 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 08:55:29,830 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-09-10 08:55:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:55:31,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:31,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:55:31,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:31,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:55:31,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:55:31,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:55:31,368 INFO L87 Difference]: Start difference. First operand 240356 states and 308872 transitions. Second operand 26 states. [2019-09-10 08:55:31,993 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 08:55:32,162 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:55:32,592 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 08:55:32,953 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:55:33,542 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-09-10 08:55:34,026 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 08:55:34,255 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:55:34,923 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:55:35,130 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:55:35,501 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:55:35,723 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 08:55:35,957 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:55:36,974 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34