java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:58:46,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:58:46,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:58:46,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:58:46,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:58:46,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:58:46,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:58:46,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:58:46,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:58:46,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:58:46,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:58:46,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:58:46,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:58:46,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:58:46,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:58:46,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:58:46,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:58:46,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:58:46,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:58:46,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:58:46,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:58:46,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:58:46,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:58:46,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:58:46,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:58:46,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:58:46,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:58:46,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:58:46,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:58:46,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:58:46,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:58:46,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:58:46,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:58:46,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:58:46,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:58:46,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:58:46,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:58:46,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:58:46,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:58:46,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:58:46,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:58:46,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 04:58:46,673 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:58:46,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:58:46,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:58:46,674 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:58:46,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:58:46,675 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:58:46,675 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:58:46,675 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:58:46,676 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:58:46,676 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:58:46,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:58:46,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:58:46,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:58:46,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:58:46,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:58:46,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:58:46,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:58:46,678 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:58:46,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:58:46,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:58:46,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:58:46,679 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:58:46,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:58:46,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:58:46,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:58:46,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:58:46,680 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:58:46,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:58:46,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:58:46,681 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:58:46,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:58:46,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:58:46,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:58:46,731 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:58:46,732 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:58:46,732 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-09-10 04:58:46,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8269c5a5a/99b1a8b2b8c54be285edc13cba8c619a/FLAG03dc75c6d [2019-09-10 04:58:47,300 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:58:47,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-09-10 04:58:47,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8269c5a5a/99b1a8b2b8c54be285edc13cba8c619a/FLAG03dc75c6d [2019-09-10 04:58:47,645 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8269c5a5a/99b1a8b2b8c54be285edc13cba8c619a [2019-09-10 04:58:47,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:58:47,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:58:47,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:58:47,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:58:47,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:58:47,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:58:47" (1/1) ... [2019-09-10 04:58:47,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f07c2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:47, skipping insertion in model container [2019-09-10 04:58:47,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:58:47" (1/1) ... [2019-09-10 04:58:47,674 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:58:47,746 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:58:48,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:58:48,245 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:58:48,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:58:48,399 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:58:48,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:48 WrapperNode [2019-09-10 04:58:48,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:58:48,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:58:48,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:58:48,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:58:48,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:48" (1/1) ... [2019-09-10 04:58:48,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:48" (1/1) ... [2019-09-10 04:58:48,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:48" (1/1) ... [2019-09-10 04:58:48,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:48" (1/1) ... [2019-09-10 04:58:48,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:48" (1/1) ... [2019-09-10 04:58:48,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:48" (1/1) ... [2019-09-10 04:58:48,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:48" (1/1) ... [2019-09-10 04:58:48,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:58:48,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:58:48,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:58:48,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:58:48,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:58:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:58:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:58:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:58:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:58:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:58:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:58:48,575 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:58:48,575 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:58:48,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:58:48,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:58:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:58:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:58:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:58:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:58:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:58:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:58:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:58:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:58:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:58:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:58:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:58:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:58:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:58:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:58:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:58:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:58:50,225 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:58:50,225 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:58:50,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:58:50 BoogieIcfgContainer [2019-09-10 04:58:50,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:58:50,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:58:50,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:58:50,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:58:50,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:58:47" (1/3) ... [2019-09-10 04:58:50,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2214327a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:58:50, skipping insertion in model container [2019-09-10 04:58:50,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:48" (2/3) ... [2019-09-10 04:58:50,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2214327a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:58:50, skipping insertion in model container [2019-09-10 04:58:50,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:58:50" (3/3) ... [2019-09-10 04:58:50,238 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-09-10 04:58:50,248 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:58:50,259 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:58:50,276 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:58:50,302 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:58:50,302 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:58:50,302 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:58:50,302 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:58:50,303 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:58:50,303 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:58:50,303 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:58:50,303 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:58:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states. [2019-09-10 04:58:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 04:58:50,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:50,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:58:50,355 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:50,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:50,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2107138659, now seen corresponding path program 1 times [2019-09-10 04:58:50,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:50,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:50,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:58:50,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:50,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:58:50,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:50,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:58:50,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:58:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:58:50,927 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 5 states. [2019-09-10 04:58:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:51,146 INFO L93 Difference]: Finished difference Result 356 states and 610 transitions. [2019-09-10 04:58:51,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:58:51,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 04:58:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:51,181 INFO L225 Difference]: With dead ends: 356 [2019-09-10 04:58:51,182 INFO L226 Difference]: Without dead ends: 347 [2019-09-10 04:58:51,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:58:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-10 04:58:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-09-10 04:58:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-10 04:58:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 556 transitions. [2019-09-10 04:58:51,262 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 556 transitions. Word has length 102 [2019-09-10 04:58:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:51,263 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 556 transitions. [2019-09-10 04:58:51,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:58:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 556 transitions. [2019-09-10 04:58:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 04:58:51,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:51,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:58:51,281 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:51,281 INFO L82 PathProgramCache]: Analyzing trace with hash 149921471, now seen corresponding path program 1 times [2019-09-10 04:58:51,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:51,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:51,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:58:51,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:51,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:58:51,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:51,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:58:51,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:58:51,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:58:51,587 INFO L87 Difference]: Start difference. First operand 347 states and 556 transitions. Second operand 5 states. [2019-09-10 04:58:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:52,893 INFO L93 Difference]: Finished difference Result 491 states and 775 transitions. [2019-09-10 04:58:52,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:58:52,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-10 04:58:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:52,900 INFO L225 Difference]: With dead ends: 491 [2019-09-10 04:58:52,900 INFO L226 Difference]: Without dead ends: 491 [2019-09-10 04:58:52,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:58:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-10 04:58:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 483. [2019-09-10 04:58:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-10 04:58:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 768 transitions. [2019-09-10 04:58:52,932 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 768 transitions. Word has length 147 [2019-09-10 04:58:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:52,933 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 768 transitions. [2019-09-10 04:58:52,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:58:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 768 transitions. [2019-09-10 04:58:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 04:58:52,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:52,940 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:58:52,940 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:52,941 INFO L82 PathProgramCache]: Analyzing trace with hash -849632732, now seen corresponding path program 1 times [2019-09-10 04:58:52,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:52,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:52,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:52,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:52,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:58:53,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:53,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:58:53,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:53,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:58:53,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:58:53,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:58:53,134 INFO L87 Difference]: Start difference. First operand 483 states and 768 transitions. Second operand 5 states. [2019-09-10 04:58:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:54,305 INFO L93 Difference]: Finished difference Result 754 states and 1188 transitions. [2019-09-10 04:58:54,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:58:54,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 04:58:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:54,313 INFO L225 Difference]: With dead ends: 754 [2019-09-10 04:58:54,313 INFO L226 Difference]: Without dead ends: 754 [2019-09-10 04:58:54,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:58:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-10 04:58:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 746. [2019-09-10 04:58:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-10 04:58:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1181 transitions. [2019-09-10 04:58:54,372 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1181 transitions. Word has length 150 [2019-09-10 04:58:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:54,372 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1181 transitions. [2019-09-10 04:58:54,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:58:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1181 transitions. [2019-09-10 04:58:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:58:54,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:54,376 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:58:54,376 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:54,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:54,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1519039157, now seen corresponding path program 1 times [2019-09-10 04:58:54,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:54,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:54,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:54,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:54,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:58:54,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:54,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:58:54,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:54,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:58:54,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:58:54,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:58:54,565 INFO L87 Difference]: Start difference. First operand 746 states and 1181 transitions. Second operand 5 states. [2019-09-10 04:58:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:55,953 INFO L93 Difference]: Finished difference Result 1270 states and 1988 transitions. [2019-09-10 04:58:55,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:58:55,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 04:58:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:55,963 INFO L225 Difference]: With dead ends: 1270 [2019-09-10 04:58:55,963 INFO L226 Difference]: Without dead ends: 1270 [2019-09-10 04:58:55,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:58:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-09-10 04:58:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1256. [2019-09-10 04:58:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-10 04:58:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1975 transitions. [2019-09-10 04:58:56,013 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1975 transitions. Word has length 153 [2019-09-10 04:58:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:56,014 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1975 transitions. [2019-09-10 04:58:56,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:58:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1975 transitions. [2019-09-10 04:58:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 04:58:56,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:56,017 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:58:56,018 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash -409144026, now seen corresponding path program 1 times [2019-09-10 04:58:56,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:56,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:56,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:58:56,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:56,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:58:56,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:56,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:58:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:58:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:58:56,188 INFO L87 Difference]: Start difference. First operand 1256 states and 1975 transitions. Second operand 5 states. [2019-09-10 04:58:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:57,441 INFO L93 Difference]: Finished difference Result 2270 states and 3524 transitions. [2019-09-10 04:58:57,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:58:57,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-10 04:58:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:57,461 INFO L225 Difference]: With dead ends: 2270 [2019-09-10 04:58:57,462 INFO L226 Difference]: Without dead ends: 2270 [2019-09-10 04:58:57,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:58:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-09-10 04:58:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2244. [2019-09-10 04:58:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-09-10 04:58:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3499 transitions. [2019-09-10 04:58:57,579 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3499 transitions. Word has length 156 [2019-09-10 04:58:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:57,580 INFO L475 AbstractCegarLoop]: Abstraction has 2244 states and 3499 transitions. [2019-09-10 04:58:57,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:58:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3499 transitions. [2019-09-10 04:58:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 04:58:57,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:57,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:58:57,590 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:57,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:57,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1622684031, now seen corresponding path program 1 times [2019-09-10 04:58:57,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:57,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:57,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:57,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:57,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:58:58,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:58,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:58:58,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:58,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:58:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:58:58,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:58:58,008 INFO L87 Difference]: Start difference. First operand 2244 states and 3499 transitions. Second operand 11 states. [2019-09-10 04:59:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:04,966 INFO L93 Difference]: Finished difference Result 10219 states and 16280 transitions. [2019-09-10 04:59:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 04:59:04,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2019-09-10 04:59:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:05,032 INFO L225 Difference]: With dead ends: 10219 [2019-09-10 04:59:05,032 INFO L226 Difference]: Without dead ends: 10219 [2019-09-10 04:59:05,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 04:59:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10219 states. [2019-09-10 04:59:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10219 to 8745. [2019-09-10 04:59:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8745 states. [2019-09-10 04:59:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8745 states to 8745 states and 13789 transitions. [2019-09-10 04:59:05,523 INFO L78 Accepts]: Start accepts. Automaton has 8745 states and 13789 transitions. Word has length 159 [2019-09-10 04:59:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:05,525 INFO L475 AbstractCegarLoop]: Abstraction has 8745 states and 13789 transitions. [2019-09-10 04:59:05,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:59:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8745 states and 13789 transitions. [2019-09-10 04:59:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 04:59:05,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:05,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:05,548 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:05,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:05,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1757376658, now seen corresponding path program 1 times [2019-09-10 04:59:05,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:05,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:05,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:59:05,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:05,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:59:05,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:05,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:59:05,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:59:05,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:05,745 INFO L87 Difference]: Start difference. First operand 8745 states and 13789 transitions. Second operand 6 states. [2019-09-10 04:59:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:08,177 INFO L93 Difference]: Finished difference Result 17374 states and 27371 transitions. [2019-09-10 04:59:08,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:59:08,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-10 04:59:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:08,264 INFO L225 Difference]: With dead ends: 17374 [2019-09-10 04:59:08,264 INFO L226 Difference]: Without dead ends: 17374 [2019-09-10 04:59:08,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17374 states. [2019-09-10 04:59:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17374 to 17218. [2019-09-10 04:59:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17218 states. [2019-09-10 04:59:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17218 states to 17218 states and 27183 transitions. [2019-09-10 04:59:08,719 INFO L78 Accepts]: Start accepts. Automaton has 17218 states and 27183 transitions. Word has length 160 [2019-09-10 04:59:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:08,719 INFO L475 AbstractCegarLoop]: Abstraction has 17218 states and 27183 transitions. [2019-09-10 04:59:08,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 17218 states and 27183 transitions. [2019-09-10 04:59:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 04:59:08,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:08,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:08,732 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash 141600103, now seen corresponding path program 1 times [2019-09-10 04:59:08,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:08,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:08,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:09,512 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-09-10 04:59:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:59:09,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:09,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:59:09,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:09,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:59:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:59:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:59:09,544 INFO L87 Difference]: Start difference. First operand 17218 states and 27183 transitions. Second operand 11 states. [2019-09-10 04:59:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:16,767 INFO L93 Difference]: Finished difference Result 28770 states and 45862 transitions. [2019-09-10 04:59:16,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 04:59:16,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-10 04:59:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:16,882 INFO L225 Difference]: With dead ends: 28770 [2019-09-10 04:59:16,882 INFO L226 Difference]: Without dead ends: 28770 [2019-09-10 04:59:16,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 04:59:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-09-10 04:59:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 25974. [2019-09-10 04:59:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25974 states. [2019-09-10 04:59:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25974 states to 25974 states and 41015 transitions. [2019-09-10 04:59:17,507 INFO L78 Accepts]: Start accepts. Automaton has 25974 states and 41015 transitions. Word has length 161 [2019-09-10 04:59:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:17,508 INFO L475 AbstractCegarLoop]: Abstraction has 25974 states and 41015 transitions. [2019-09-10 04:59:17,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:59:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states and 41015 transitions. [2019-09-10 04:59:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 04:59:17,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:17,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:17,525 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash -671538649, now seen corresponding path program 1 times [2019-09-10 04:59:17,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:17,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:17,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:17,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:17,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:59:17,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:17,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:59:17,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:17,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:59:17,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:59:17,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:59:17,848 INFO L87 Difference]: Start difference. First operand 25974 states and 41015 transitions. Second operand 11 states. [2019-09-10 04:59:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:26,483 INFO L93 Difference]: Finished difference Result 40876 states and 65240 transitions. [2019-09-10 04:59:26,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 04:59:26,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-10 04:59:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:26,647 INFO L225 Difference]: With dead ends: 40876 [2019-09-10 04:59:26,647 INFO L226 Difference]: Without dead ends: 40876 [2019-09-10 04:59:26,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 04:59:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40876 states. [2019-09-10 04:59:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40876 to 35896. [2019-09-10 04:59:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35896 states. [2019-09-10 04:59:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35896 states to 35896 states and 56891 transitions. [2019-09-10 04:59:27,648 INFO L78 Accepts]: Start accepts. Automaton has 35896 states and 56891 transitions. Word has length 161 [2019-09-10 04:59:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:27,649 INFO L475 AbstractCegarLoop]: Abstraction has 35896 states and 56891 transitions. [2019-09-10 04:59:27,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:59:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 35896 states and 56891 transitions. [2019-09-10 04:59:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 04:59:27,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:27,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:27,662 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:27,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1699484185, now seen corresponding path program 1 times [2019-09-10 04:59:27,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:27,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:27,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:27,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:27,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:59:27,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:27,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:59:27,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:27,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:59:27,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:59:27,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:59:27,880 INFO L87 Difference]: Start difference. First operand 35896 states and 56891 transitions. Second operand 11 states. [2019-09-10 04:59:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:37,183 INFO L93 Difference]: Finished difference Result 51464 states and 82135 transitions. [2019-09-10 04:59:37,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 04:59:37,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-10 04:59:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:37,353 INFO L225 Difference]: With dead ends: 51464 [2019-09-10 04:59:37,354 INFO L226 Difference]: Without dead ends: 51464 [2019-09-10 04:59:37,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=625, Invalid=2567, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 04:59:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51464 states. [2019-09-10 04:59:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51464 to 46484. [2019-09-10 04:59:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46484 states. [2019-09-10 04:59:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46484 states to 46484 states and 73741 transitions. [2019-09-10 04:59:38,269 INFO L78 Accepts]: Start accepts. Automaton has 46484 states and 73741 transitions. Word has length 161 [2019-09-10 04:59:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:38,270 INFO L475 AbstractCegarLoop]: Abstraction has 46484 states and 73741 transitions. [2019-09-10 04:59:38,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:59:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 46484 states and 73741 transitions. [2019-09-10 04:59:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 04:59:38,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:38,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:38,286 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:38,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:38,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1689565736, now seen corresponding path program 1 times [2019-09-10 04:59:38,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:38,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:38,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:38,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:38,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:59:38,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:38,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:59:38,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:38,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:59:38,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:59:38,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:38,477 INFO L87 Difference]: Start difference. First operand 46484 states and 73741 transitions. Second operand 6 states. [2019-09-10 04:59:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:41,297 INFO L93 Difference]: Finished difference Result 92556 states and 146663 transitions. [2019-09-10 04:59:41,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:59:41,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-10 04:59:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:41,553 INFO L225 Difference]: With dead ends: 92556 [2019-09-10 04:59:41,553 INFO L226 Difference]: Without dead ends: 92556 [2019-09-10 04:59:41,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92556 states. [2019-09-10 04:59:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92556 to 91932. [2019-09-10 04:59:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91932 states. [2019-09-10 04:59:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91932 states to 91932 states and 145795 transitions. [2019-09-10 04:59:44,217 INFO L78 Accepts]: Start accepts. Automaton has 91932 states and 145795 transitions. Word has length 161 [2019-09-10 04:59:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:44,218 INFO L475 AbstractCegarLoop]: Abstraction has 91932 states and 145795 transitions. [2019-09-10 04:59:44,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 91932 states and 145795 transitions. [2019-09-10 04:59:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 04:59:44,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:44,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:44,235 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:44,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:44,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1523949593, now seen corresponding path program 1 times [2019-09-10 04:59:44,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:44,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:44,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:44,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:44,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:59:44,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:44,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:59:44,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:44,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:59:44,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:59:44,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:44,417 INFO L87 Difference]: Start difference. First operand 91932 states and 145795 transitions. Second operand 6 states. [2019-09-10 04:59:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:45,951 INFO L93 Difference]: Finished difference Result 97374 states and 154932 transitions. [2019-09-10 04:59:45,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:59:45,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-10 04:59:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:48,173 INFO L225 Difference]: With dead ends: 97374 [2019-09-10 04:59:48,174 INFO L226 Difference]: Without dead ends: 97374 [2019-09-10 04:59:48,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:59:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97374 states. [2019-09-10 04:59:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97374 to 92164. [2019-09-10 04:59:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92164 states. [2019-09-10 04:59:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92164 states to 92164 states and 145795 transitions. [2019-09-10 04:59:49,454 INFO L78 Accepts]: Start accepts. Automaton has 92164 states and 145795 transitions. Word has length 161 [2019-09-10 04:59:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:49,455 INFO L475 AbstractCegarLoop]: Abstraction has 92164 states and 145795 transitions. [2019-09-10 04:59:49,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 92164 states and 145795 transitions. [2019-09-10 04:59:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 04:59:49,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:49,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:49,468 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1042735562, now seen corresponding path program 1 times [2019-09-10 04:59:49,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:49,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:49,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:49,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 04:59:49,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:49,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:59:49,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:49,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:59:49,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:59:49,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:59:49,950 INFO L87 Difference]: Start difference. First operand 92164 states and 145795 transitions. Second operand 7 states. [2019-09-10 04:59:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:52,565 INFO L93 Difference]: Finished difference Result 96692 states and 153678 transitions. [2019-09-10 04:59:52,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:59:52,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 162 [2019-09-10 04:59:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:52,851 INFO L225 Difference]: With dead ends: 96692 [2019-09-10 04:59:52,852 INFO L226 Difference]: Without dead ends: 96692 [2019-09-10 04:59:52,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96692 states. [2019-09-10 04:59:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96692 to 78362. [2019-09-10 04:59:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78362 states. [2019-09-10 04:59:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78362 states to 78362 states and 123947 transitions. [2019-09-10 04:59:54,295 INFO L78 Accepts]: Start accepts. Automaton has 78362 states and 123947 transitions. Word has length 162 [2019-09-10 04:59:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:54,295 INFO L475 AbstractCegarLoop]: Abstraction has 78362 states and 123947 transitions. [2019-09-10 04:59:54,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:59:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 78362 states and 123947 transitions. [2019-09-10 04:59:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 04:59:54,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:54,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:54,306 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:54,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1395823944, now seen corresponding path program 1 times [2019-09-10 04:59:54,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:54,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:54,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:54,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:54,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:59:54,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:54,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 04:59:54,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:54,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:59:54,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:59:54,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:54,516 INFO L87 Difference]: Start difference. First operand 78362 states and 123947 transitions. Second operand 12 states. [2019-09-10 05:00:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:06,051 INFO L93 Difference]: Finished difference Result 177072 states and 286432 transitions. [2019-09-10 05:00:06,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 05:00:06,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 162 [2019-09-10 05:00:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:06,563 INFO L225 Difference]: With dead ends: 177072 [2019-09-10 05:00:06,563 INFO L226 Difference]: Without dead ends: 177000 [2019-09-10 05:00:06,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 05:00:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177000 states. [2019-09-10 05:00:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177000 to 166722. [2019-09-10 05:00:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166722 states. [2019-09-10 05:00:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166722 states to 166722 states and 267964 transitions. [2019-09-10 05:00:09,322 INFO L78 Accepts]: Start accepts. Automaton has 166722 states and 267964 transitions. Word has length 162 [2019-09-10 05:00:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:09,322 INFO L475 AbstractCegarLoop]: Abstraction has 166722 states and 267964 transitions. [2019-09-10 05:00:09,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 05:00:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 166722 states and 267964 transitions. [2019-09-10 05:00:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 05:00:09,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:09,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:00:09,331 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash 360887909, now seen corresponding path program 1 times [2019-09-10 05:00:09,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:09,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:09,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:00:09,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:09,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:09,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:09,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:09,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:09,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:09,478 INFO L87 Difference]: Start difference. First operand 166722 states and 267964 transitions. Second operand 6 states. [2019-09-10 05:00:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:13,255 INFO L93 Difference]: Finished difference Result 333205 states and 535262 transitions. [2019-09-10 05:00:13,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:13,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-10 05:00:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:14,231 INFO L225 Difference]: With dead ends: 333205 [2019-09-10 05:00:14,231 INFO L226 Difference]: Without dead ends: 333205 [2019-09-10 05:00:14,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333205 states. [2019-09-10 05:00:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333205 to 330994. [2019-09-10 05:00:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330994 states. [2019-09-10 05:00:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330994 states to 330994 states and 532040 transitions. [2019-09-10 05:00:23,316 INFO L78 Accepts]: Start accepts. Automaton has 330994 states and 532040 transitions. Word has length 162 [2019-09-10 05:00:23,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:23,316 INFO L475 AbstractCegarLoop]: Abstraction has 330994 states and 532040 transitions. [2019-09-10 05:00:23,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 330994 states and 532040 transitions. [2019-09-10 05:00:23,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 05:00:23,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:23,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:00:23,328 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1706567795, now seen corresponding path program 1 times [2019-09-10 05:00:23,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:23,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:23,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:23,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:23,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:00:23,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:23,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:23,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:23,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:23,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:23,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:23,562 INFO L87 Difference]: Start difference. First operand 330994 states and 532040 transitions. Second operand 6 states. [2019-09-10 05:00:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:30,358 INFO L93 Difference]: Finished difference Result 338359 states and 544136 transitions. [2019-09-10 05:00:30,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 05:00:30,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-10 05:00:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:31,250 INFO L225 Difference]: With dead ends: 338359 [2019-09-10 05:00:31,251 INFO L226 Difference]: Without dead ends: 338355 [2019-09-10 05:00:31,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 05:00:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338355 states. [2019-09-10 05:00:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338355 to 330737. [2019-09-10 05:00:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330737 states. [2019-09-10 05:00:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330737 states to 330737 states and 530990 transitions. [2019-09-10 05:00:36,603 INFO L78 Accepts]: Start accepts. Automaton has 330737 states and 530990 transitions. Word has length 163 [2019-09-10 05:00:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:36,604 INFO L475 AbstractCegarLoop]: Abstraction has 330737 states and 530990 transitions. [2019-09-10 05:00:36,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 330737 states and 530990 transitions. [2019-09-10 05:00:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 05:00:36,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:36,609 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:00:36,610 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:36,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1818161165, now seen corresponding path program 1 times [2019-09-10 05:00:36,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:36,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:36,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:36,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:36,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:00:42,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:42,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:42,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:42,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:42,687 INFO L87 Difference]: Start difference. First operand 330737 states and 530990 transitions. Second operand 6 states. [2019-09-10 05:00:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:45,919 INFO L93 Difference]: Finished difference Result 361465 states and 603322 transitions. [2019-09-10 05:00:45,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:00:45,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-10 05:00:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:51,841 INFO L225 Difference]: With dead ends: 361465 [2019-09-10 05:00:51,842 INFO L226 Difference]: Without dead ends: 361457 [2019-09-10 05:00:51,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 05:00:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361457 states. [2019-09-10 05:00:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361457 to 333235. [2019-09-10 05:00:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333235 states. [2019-09-10 05:00:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333235 states to 333235 states and 534572 transitions. [2019-09-10 05:00:58,780 INFO L78 Accepts]: Start accepts. Automaton has 333235 states and 534572 transitions. Word has length 163 [2019-09-10 05:00:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:58,780 INFO L475 AbstractCegarLoop]: Abstraction has 333235 states and 534572 transitions. [2019-09-10 05:00:58,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 333235 states and 534572 transitions. [2019-09-10 05:00:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 05:00:58,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:58,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:00:58,784 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash -551243473, now seen corresponding path program 1 times [2019-09-10 05:00:58,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:58,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:58,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:58,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:00:58,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:58,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:58,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:58,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:58,957 INFO L87 Difference]: Start difference. First operand 333235 states and 534572 transitions. Second operand 6 states. [2019-09-10 05:01:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:05,556 INFO L93 Difference]: Finished difference Result 805915 states and 1297005 transitions. [2019-09-10 05:01:05,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:01:05,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-10 05:01:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:17,509 INFO L225 Difference]: With dead ends: 805915 [2019-09-10 05:01:17,509 INFO L226 Difference]: Without dead ends: 805915 [2019-09-10 05:01:17,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:01:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805915 states. [2019-09-10 05:01:37,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805915 to 613848. [2019-09-10 05:01:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613848 states. [2019-09-10 05:01:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613848 states to 613848 states and 988714 transitions. [2019-09-10 05:01:39,418 INFO L78 Accepts]: Start accepts. Automaton has 613848 states and 988714 transitions. Word has length 163 [2019-09-10 05:01:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:39,419 INFO L475 AbstractCegarLoop]: Abstraction has 613848 states and 988714 transitions. [2019-09-10 05:01:39,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:01:39,419 INFO L276 IsEmpty]: Start isEmpty. Operand 613848 states and 988714 transitions. [2019-09-10 05:01:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 05:01:39,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:39,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:01:39,423 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:39,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1283695039, now seen corresponding path program 1 times [2019-09-10 05:01:39,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:39,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:39,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:39,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:39,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:01:39,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:39,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:01:39,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:39,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:01:39,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:01:39,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:01:39,548 INFO L87 Difference]: Start difference. First operand 613848 states and 988714 transitions. Second operand 5 states. [2019-09-10 05:01:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:51,066 INFO L93 Difference]: Finished difference Result 1077134 states and 1746709 transitions. [2019-09-10 05:01:51,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 05:01:51,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-09-10 05:01:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:02:03,073 INFO L225 Difference]: With dead ends: 1077134 [2019-09-10 05:02:03,073 INFO L226 Difference]: Without dead ends: 1077134 [2019-09-10 05:02:03,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:02:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077134 states. [2019-09-10 05:02:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077134 to 1070091. [2019-09-10 05:02:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070091 states. [2019-09-10 05:02:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070091 states to 1070091 states and 1731988 transitions. [2019-09-10 05:02:54,459 INFO L78 Accepts]: Start accepts. Automaton has 1070091 states and 1731988 transitions. Word has length 164 [2019-09-10 05:02:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:02:54,460 INFO L475 AbstractCegarLoop]: Abstraction has 1070091 states and 1731988 transitions. [2019-09-10 05:02:54,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:02:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1070091 states and 1731988 transitions. [2019-09-10 05:02:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 05:02:54,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:02:54,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:02:54,464 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:02:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:02:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1625068863, now seen corresponding path program 1 times [2019-09-10 05:02:54,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:02:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:54,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:02:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:54,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:02:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:02:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:02:54,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:02:54,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 05:02:54,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:02:54,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 05:02:54,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 05:02:54,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:02:54,710 INFO L87 Difference]: Start difference. First operand 1070091 states and 1731988 transitions. Second operand 12 states. [2019-09-10 05:03:01,838 WARN L188 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-10 05:03:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:26,067 INFO L93 Difference]: Finished difference Result 1740145 states and 2824539 transitions. [2019-09-10 05:03:26,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 05:03:26,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-09-10 05:03:26,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:32,244 INFO L225 Difference]: With dead ends: 1740145 [2019-09-10 05:03:32,245 INFO L226 Difference]: Without dead ends: 1740145 [2019-09-10 05:03:32,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 05:03:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740145 states.