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_floodmax.5.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:07:25,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:07:25,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:07:25,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:07:25,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:07:25,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:07:25,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:07:25,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:07:25,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:07:25,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:07:25,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:07:25,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:07:25,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:07:25,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:07:25,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:07:25,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:07:25,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:07:25,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:07:25,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:07:25,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:07:25,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:07:25,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:07:25,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:07:25,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:07:25,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:07:25,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:07:25,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:07:25,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:07:25,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:07:25,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:07:25,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:07:25,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:07:25,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:07:25,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:07:25,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:07:25,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:07:25,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:07:25,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:07:25,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:07:25,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:07:25,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:07:25,070 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:07:25,086 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:07:25,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:07:25,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:07:25,087 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:07:25,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:07:25,088 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:07:25,089 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:07:25,089 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:07:25,089 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:07:25,089 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:07:25,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:07:25,090 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:07:25,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:07:25,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:07:25,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:07:25,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:07:25,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:07:25,092 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:07:25,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:07:25,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:07:25,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:07:25,092 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:07:25,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:07:25,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:07:25,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:07:25,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:07:25,094 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:07:25,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:07:25,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:07:25,094 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:07:25,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:07:25,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:07:25,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:07:25,168 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:07:25,169 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:07:25,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.ufo.BOUNDED-10.pals.c [2019-09-10 04:07:25,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b956c67b/780ca59e13894f81ab1bd9b71e8ef6f2/FLAG93b0a0eb6 [2019-09-10 04:07:25,974 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:07:25,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.ufo.BOUNDED-10.pals.c [2019-09-10 04:07:26,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b956c67b/780ca59e13894f81ab1bd9b71e8ef6f2/FLAG93b0a0eb6 [2019-09-10 04:07:26,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b956c67b/780ca59e13894f81ab1bd9b71e8ef6f2 [2019-09-10 04:07:26,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:07:26,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:07:26,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:07:26,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:07:26,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:07:26,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:07:26" (1/1) ... [2019-09-10 04:07:26,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c295b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26, skipping insertion in model container [2019-09-10 04:07:26,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:07:26" (1/1) ... [2019-09-10 04:07:26,135 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:07:26,204 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:07:26,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:07:26,782 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:07:26,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:07:26,981 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:07:26,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26 WrapperNode [2019-09-10 04:07:26,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:07:26,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:07:26,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:07:26,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:07:27,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26" (1/1) ... [2019-09-10 04:07:27,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26" (1/1) ... [2019-09-10 04:07:27,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26" (1/1) ... [2019-09-10 04:07:27,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26" (1/1) ... [2019-09-10 04:07:27,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26" (1/1) ... [2019-09-10 04:07:27,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26" (1/1) ... [2019-09-10 04:07:27,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26" (1/1) ... [2019-09-10 04:07:27,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:07:27,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:07:27,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:07:27,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:07:27,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26" (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:07:27,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:07:27,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:07:27,286 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:07:27,286 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:07:27,287 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:07:27,287 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:07:27,287 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:07:27,289 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:07:27,289 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:07:27,289 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:07:27,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:07:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:07:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:07:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:07:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:07:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:07:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:07:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:07:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:07:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:07:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:07:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:07:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:07:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:07:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:07:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:07:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:07:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:07:30,213 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:07:30,213 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:07:30,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:07:30 BoogieIcfgContainer [2019-09-10 04:07:30,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:07:30,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:07:30,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:07:30,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:07:30,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:07:26" (1/3) ... [2019-09-10 04:07:30,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f5847d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:07:30, skipping insertion in model container [2019-09-10 04:07:30,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:07:26" (2/3) ... [2019-09-10 04:07:30,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f5847d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:07:30, skipping insertion in model container [2019-09-10 04:07:30,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:07:30" (3/3) ... [2019-09-10 04:07:30,227 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.ufo.BOUNDED-10.pals.c [2019-09-10 04:07:30,238 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:07:30,249 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:07:30,267 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:07:30,306 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:07:30,306 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:07:30,306 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:07:30,306 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:07:30,306 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:07:30,307 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:07:30,307 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:07:30,307 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:07:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states. [2019-09-10 04:07:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 04:07:30,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:30,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:07:30,403 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1201379833, now seen corresponding path program 1 times [2019-09-10 04:07:30,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:30,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:30,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:30,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:30,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:31,121 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:07:31,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:31,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:07:31,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:31,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:07:31,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:07:31,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:07:31,150 INFO L87 Difference]: Start difference. First operand 732 states. Second operand 5 states. [2019-09-10 04:07:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:31,562 INFO L93 Difference]: Finished difference Result 736 states and 1329 transitions. [2019-09-10 04:07:31,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:07:31,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 04:07:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:31,590 INFO L225 Difference]: With dead ends: 736 [2019-09-10 04:07:31,591 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 04:07:31,593 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:07:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 04:07:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-09-10 04:07:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-10 04:07:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1261 transitions. [2019-09-10 04:07:31,723 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1261 transitions. Word has length 176 [2019-09-10 04:07:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:31,726 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1261 transitions. [2019-09-10 04:07:31,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:07:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1261 transitions. [2019-09-10 04:07:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 04:07:31,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:31,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:31,736 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:31,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1760990222, now seen corresponding path program 1 times [2019-09-10 04:07:31,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:31,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:31,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:31,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:31,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:07:32,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:32,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:07:32,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:32,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:07:32,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:07:32,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:07:32,073 INFO L87 Difference]: Start difference. First operand 727 states and 1261 transitions. Second operand 5 states. [2019-09-10 04:07:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:35,413 INFO L93 Difference]: Finished difference Result 901 states and 1537 transitions. [2019-09-10 04:07:35,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:07:35,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2019-09-10 04:07:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:35,422 INFO L225 Difference]: With dead ends: 901 [2019-09-10 04:07:35,422 INFO L226 Difference]: Without dead ends: 901 [2019-09-10 04:07:35,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:07:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-09-10 04:07:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 889. [2019-09-10 04:07:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-09-10 04:07:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1522 transitions. [2019-09-10 04:07:35,515 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1522 transitions. Word has length 235 [2019-09-10 04:07:35,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:35,516 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1522 transitions. [2019-09-10 04:07:35,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:07:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1522 transitions. [2019-09-10 04:07:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 04:07:35,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:35,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:35,522 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1455690326, now seen corresponding path program 1 times [2019-09-10 04:07:35,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:35,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:35,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:35,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:35,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:35,751 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:07:35,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:35,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:07:35,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:35,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:07:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:07:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:07:35,754 INFO L87 Difference]: Start difference. First operand 889 states and 1522 transitions. Second operand 5 states. [2019-09-10 04:07:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:38,915 INFO L93 Difference]: Finished difference Result 1214 states and 2040 transitions. [2019-09-10 04:07:38,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:07:38,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2019-09-10 04:07:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:38,923 INFO L225 Difference]: With dead ends: 1214 [2019-09-10 04:07:38,923 INFO L226 Difference]: Without dead ends: 1214 [2019-09-10 04:07:38,924 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:07:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2019-09-10 04:07:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1206. [2019-09-10 04:07:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1206 states. [2019-09-10 04:07:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2033 transitions. [2019-09-10 04:07:38,975 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2033 transitions. Word has length 239 [2019-09-10 04:07:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:38,976 INFO L475 AbstractCegarLoop]: Abstraction has 1206 states and 2033 transitions. [2019-09-10 04:07:38,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:07:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2033 transitions. [2019-09-10 04:07:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 04:07:38,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:38,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:38,982 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:38,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:38,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1913212166, now seen corresponding path program 1 times [2019-09-10 04:07:38,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:38,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:38,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:38,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:38,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:39,239 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:07:39,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:39,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:07:39,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:39,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:07:39,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:07:39,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:07:39,242 INFO L87 Difference]: Start difference. First operand 1206 states and 2033 transitions. Second operand 5 states. [2019-09-10 04:07:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:42,864 INFO L93 Difference]: Finished difference Result 1836 states and 3030 transitions. [2019-09-10 04:07:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:07:42,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2019-09-10 04:07:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:42,876 INFO L225 Difference]: With dead ends: 1836 [2019-09-10 04:07:42,877 INFO L226 Difference]: Without dead ends: 1836 [2019-09-10 04:07:42,877 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:07:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2019-09-10 04:07:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1822. [2019-09-10 04:07:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2019-09-10 04:07:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 3017 transitions. [2019-09-10 04:07:43,005 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 3017 transitions. Word has length 243 [2019-09-10 04:07:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:43,006 INFO L475 AbstractCegarLoop]: Abstraction has 1822 states and 3017 transitions. [2019-09-10 04:07:43,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:07:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3017 transitions. [2019-09-10 04:07:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 04:07:43,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:43,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:43,014 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:43,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash 56946978, now seen corresponding path program 1 times [2019-09-10 04:07:43,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:43,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:43,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:43,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:43,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:43,253 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:07:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:43,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:07:43,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:43,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:07:43,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:07:43,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:07:43,255 INFO L87 Difference]: Start difference. First operand 1822 states and 3017 transitions. Second operand 5 states. [2019-09-10 04:07:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:46,044 INFO L93 Difference]: Finished difference Result 3044 states and 4934 transitions. [2019-09-10 04:07:46,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:07:46,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 247 [2019-09-10 04:07:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:46,069 INFO L225 Difference]: With dead ends: 3044 [2019-09-10 04:07:46,070 INFO L226 Difference]: Without dead ends: 3044 [2019-09-10 04:07:46,071 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:07:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2019-09-10 04:07:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3018. [2019-09-10 04:07:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-09-10 04:07:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4909 transitions. [2019-09-10 04:07:46,170 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4909 transitions. Word has length 247 [2019-09-10 04:07:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:46,171 INFO L475 AbstractCegarLoop]: Abstraction has 3018 states and 4909 transitions. [2019-09-10 04:07:46,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:07:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4909 transitions. [2019-09-10 04:07:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 04:07:46,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:46,179 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:46,180 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:46,180 INFO L82 PathProgramCache]: Analyzing trace with hash 19601918, now seen corresponding path program 1 times [2019-09-10 04:07:46,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:46,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:46,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:46,437 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:07:46,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:46,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:07:46,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:46,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:07:46,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:07:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:07:46,441 INFO L87 Difference]: Start difference. First operand 3018 states and 4909 transitions. Second operand 5 states. [2019-09-10 04:07:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:49,536 INFO L93 Difference]: Finished difference Result 5388 states and 8590 transitions. [2019-09-10 04:07:49,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:07:49,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2019-09-10 04:07:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:49,571 INFO L225 Difference]: With dead ends: 5388 [2019-09-10 04:07:49,571 INFO L226 Difference]: Without dead ends: 5388 [2019-09-10 04:07:49,572 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:07:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5388 states. [2019-09-10 04:07:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5388 to 5338. [2019-09-10 04:07:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5338 states. [2019-09-10 04:07:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5338 states to 5338 states and 8541 transitions. [2019-09-10 04:07:49,779 INFO L78 Accepts]: Start accepts. Automaton has 5338 states and 8541 transitions. Word has length 251 [2019-09-10 04:07:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:49,788 INFO L475 AbstractCegarLoop]: Abstraction has 5338 states and 8541 transitions. [2019-09-10 04:07:49,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:07:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 5338 states and 8541 transitions. [2019-09-10 04:07:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 04:07:49,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:49,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:49,800 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:49,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:49,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1668081690, now seen corresponding path program 1 times [2019-09-10 04:07:49,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:49,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:49,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:49,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:49,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:50,325 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:07:50,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:50,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:07:50,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:50,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:07:50,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:07:50,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:07:50,328 INFO L87 Difference]: Start difference. First operand 5338 states and 8541 transitions. Second operand 13 states. [2019-09-10 04:08:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:03,457 INFO L93 Difference]: Finished difference Result 32705 states and 52930 transitions. [2019-09-10 04:08:03,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 04:08:03,460 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 255 [2019-09-10 04:08:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:03,620 INFO L225 Difference]: With dead ends: 32705 [2019-09-10 04:08:03,620 INFO L226 Difference]: Without dead ends: 32705 [2019-09-10 04:08:03,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 04:08:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32705 states. [2019-09-10 04:08:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32705 to 29395. [2019-09-10 04:08:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29395 states. [2019-09-10 04:08:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29395 states to 29395 states and 47423 transitions. [2019-09-10 04:08:04,413 INFO L78 Accepts]: Start accepts. Automaton has 29395 states and 47423 transitions. Word has length 255 [2019-09-10 04:08:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:04,414 INFO L475 AbstractCegarLoop]: Abstraction has 29395 states and 47423 transitions. [2019-09-10 04:08:04,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:08:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 29395 states and 47423 transitions. [2019-09-10 04:08:04,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:08:04,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:04,439 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:04,440 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:04,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:04,440 INFO L82 PathProgramCache]: Analyzing trace with hash -738368700, now seen corresponding path program 1 times [2019-09-10 04:08:04,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:04,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:04,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:04,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:04,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:08:04,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:04,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:08:04,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:04,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:08:04,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:08:04,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:08:04,919 INFO L87 Difference]: Start difference. First operand 29395 states and 47423 transitions. Second operand 6 states. [2019-09-10 04:08:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:10,476 INFO L93 Difference]: Finished difference Result 46075 states and 74357 transitions. [2019-09-10 04:08:10,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:08:10,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2019-09-10 04:08:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:10,675 INFO L225 Difference]: With dead ends: 46075 [2019-09-10 04:08:10,675 INFO L226 Difference]: Without dead ends: 46075 [2019-09-10 04:08:10,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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 04:08:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46075 states. [2019-09-10 04:08:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46075 to 43369. [2019-09-10 04:08:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-09-10 04:08:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 70086 transitions. [2019-09-10 04:08:12,500 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 70086 transitions. Word has length 256 [2019-09-10 04:08:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:12,500 INFO L475 AbstractCegarLoop]: Abstraction has 43369 states and 70086 transitions. [2019-09-10 04:08:12,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:08:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 70086 transitions. [2019-09-10 04:08:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:08:12,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:12,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:12,528 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:12,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash -970166047, now seen corresponding path program 1 times [2019-09-10 04:08:12,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:12,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:12,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:12,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:12,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:12,910 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:08:12,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:12,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:08:12,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:12,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:08:12,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:08:12,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:08:12,913 INFO L87 Difference]: Start difference. First operand 43369 states and 70086 transitions. Second operand 13 states. [2019-09-10 04:08:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:29,984 INFO L93 Difference]: Finished difference Result 78548 states and 127743 transitions. [2019-09-10 04:08:29,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 04:08:29,985 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 256 [2019-09-10 04:08:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:30,227 INFO L225 Difference]: With dead ends: 78548 [2019-09-10 04:08:30,228 INFO L226 Difference]: Without dead ends: 78548 [2019-09-10 04:08:30,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1095, Invalid=4757, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 04:08:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78548 states. [2019-09-10 04:08:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78548 to 74850. [2019-09-10 04:08:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74850 states. [2019-09-10 04:08:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74850 states to 74850 states and 121297 transitions. [2019-09-10 04:08:31,966 INFO L78 Accepts]: Start accepts. Automaton has 74850 states and 121297 transitions. Word has length 256 [2019-09-10 04:08:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:31,967 INFO L475 AbstractCegarLoop]: Abstraction has 74850 states and 121297 transitions. [2019-09-10 04:08:31,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:08:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 74850 states and 121297 transitions. [2019-09-10 04:08:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:08:31,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:31,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:31,996 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:31,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:31,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1993892992, now seen corresponding path program 1 times [2019-09-10 04:08:31,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:32,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:32,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:32,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:34,006 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:08:34,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:34,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:08:34,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:34,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:08:34,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:08:34,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:08:34,008 INFO L87 Difference]: Start difference. First operand 74850 states and 121297 transitions. Second operand 13 states. [2019-09-10 04:08:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:53,027 INFO L93 Difference]: Finished difference Result 110155 states and 179744 transitions. [2019-09-10 04:08:53,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 04:08:53,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 256 [2019-09-10 04:08:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:53,415 INFO L225 Difference]: With dead ends: 110155 [2019-09-10 04:08:53,415 INFO L226 Difference]: Without dead ends: 110155 [2019-09-10 04:08:53,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1069, Invalid=4631, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 04:08:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110155 states. [2019-09-10 04:08:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110155 to 104503. [2019-09-10 04:08:55,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104503 states. [2019-09-10 04:08:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104503 states to 104503 states and 169631 transitions. [2019-09-10 04:08:55,228 INFO L78 Accepts]: Start accepts. Automaton has 104503 states and 169631 transitions. Word has length 256 [2019-09-10 04:08:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:55,228 INFO L475 AbstractCegarLoop]: Abstraction has 104503 states and 169631 transitions. [2019-09-10 04:08:55,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:08:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 104503 states and 169631 transitions. [2019-09-10 04:08:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:08:55,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:55,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:55,257 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:55,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1982808095, now seen corresponding path program 1 times [2019-09-10 04:08:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:55,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:55,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:55,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:55,495 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:08:55,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:55,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:08:55,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:55,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:08:55,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:08:55,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:08:55,497 INFO L87 Difference]: Start difference. First operand 104503 states and 169631 transitions. Second operand 6 states. [2019-09-10 04:08:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:59,053 INFO L93 Difference]: Finished difference Result 109881 states and 179613 transitions. [2019-09-10 04:08:59,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:08:59,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2019-09-10 04:08:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:59,458 INFO L225 Difference]: With dead ends: 109881 [2019-09-10 04:08:59,458 INFO L226 Difference]: Without dead ends: 109881 [2019-09-10 04:08:59,463 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:08:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109881 states. [2019-09-10 04:09:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109881 to 104761. [2019-09-10 04:09:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104761 states. [2019-09-10 04:09:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104761 states to 104761 states and 169639 transitions. [2019-09-10 04:09:01,460 INFO L78 Accepts]: Start accepts. Automaton has 104761 states and 169639 transitions. Word has length 256 [2019-09-10 04:09:01,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:01,461 INFO L475 AbstractCegarLoop]: Abstraction has 104761 states and 169639 transitions. [2019-09-10 04:09:01,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:09:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 104761 states and 169639 transitions. [2019-09-10 04:09:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:09:01,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:01,485 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:01,485 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:01,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:01,486 INFO L82 PathProgramCache]: Analyzing trace with hash 712895554, now seen corresponding path program 1 times [2019-09-10 04:09:01,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:01,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:01,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:01,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:01,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:01,854 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:09:01,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:01,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:09:01,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:01,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:09:01,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:09:01,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:09:01,856 INFO L87 Difference]: Start difference. First operand 104761 states and 169639 transitions. Second operand 13 states. [2019-09-10 04:09:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:21,089 INFO L93 Difference]: Finished difference Result 140737 states and 228681 transitions. [2019-09-10 04:09:21,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 04:09:21,090 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 256 [2019-09-10 04:09:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:21,414 INFO L225 Difference]: With dead ends: 140737 [2019-09-10 04:09:21,414 INFO L226 Difference]: Without dead ends: 140737 [2019-09-10 04:09:21,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 04:09:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140737 states. [2019-09-10 04:09:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140737 to 133795. [2019-09-10 04:09:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133795 states. [2019-09-10 04:09:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133795 states to 133795 states and 217009 transitions. [2019-09-10 04:09:23,402 INFO L78 Accepts]: Start accepts. Automaton has 133795 states and 217009 transitions. Word has length 256 [2019-09-10 04:09:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:23,403 INFO L475 AbstractCegarLoop]: Abstraction has 133795 states and 217009 transitions. [2019-09-10 04:09:23,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:09:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 133795 states and 217009 transitions. [2019-09-10 04:09:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 04:09:23,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:23,419 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:23,420 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1745613599, now seen corresponding path program 1 times [2019-09-10 04:09:23,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:23,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:23,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:23,770 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:09:23,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:23,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:09:23,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:23,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:09:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:09:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:09:23,773 INFO L87 Difference]: Start difference. First operand 133795 states and 217009 transitions. Second operand 6 states. [2019-09-10 04:09:29,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:29,160 INFO L93 Difference]: Finished difference Result 142538 states and 231515 transitions. [2019-09-10 04:09:29,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:09:29,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2019-09-10 04:09:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:29,562 INFO L225 Difference]: With dead ends: 142538 [2019-09-10 04:09:29,563 INFO L226 Difference]: Without dead ends: 142538 [2019-09-10 04:09:29,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:09:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142538 states. [2019-09-10 04:09:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142538 to 134327. [2019-09-10 04:09:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134327 states. [2019-09-10 04:09:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134327 states to 134327 states and 217419 transitions. [2019-09-10 04:09:32,129 INFO L78 Accepts]: Start accepts. Automaton has 134327 states and 217419 transitions. Word has length 256 [2019-09-10 04:09:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:32,129 INFO L475 AbstractCegarLoop]: Abstraction has 134327 states and 217419 transitions. [2019-09-10 04:09:32,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:09:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 134327 states and 217419 transitions. [2019-09-10 04:09:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 04:09:32,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:32,139 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:32,139 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:32,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1919395601, now seen corresponding path program 1 times [2019-09-10 04:09:32,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:32,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:32,454 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:09:32,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:32,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:09:32,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:32,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:09:32,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:09:32,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:09:32,457 INFO L87 Difference]: Start difference. First operand 134327 states and 217419 transitions. Second operand 6 states. [2019-09-10 04:09:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:37,356 INFO L93 Difference]: Finished difference Result 229800 states and 372094 transitions. [2019-09-10 04:09:37,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:09:37,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-09-10 04:09:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:37,955 INFO L225 Difference]: With dead ends: 229800 [2019-09-10 04:09:37,955 INFO L226 Difference]: Without dead ends: 229800 [2019-09-10 04:09:37,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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 04:09:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229800 states. [2019-09-10 04:09:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229800 to 228985. [2019-09-10 04:09:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228985 states. [2019-09-10 04:09:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228985 states to 228985 states and 370981 transitions. [2019-09-10 04:09:44,924 INFO L78 Accepts]: Start accepts. Automaton has 228985 states and 370981 transitions. Word has length 257 [2019-09-10 04:09:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:44,924 INFO L475 AbstractCegarLoop]: Abstraction has 228985 states and 370981 transitions. [2019-09-10 04:09:44,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:09:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 228985 states and 370981 transitions. [2019-09-10 04:09:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 04:09:44,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:44,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:44,933 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash 540049723, now seen corresponding path program 1 times [2019-09-10 04:09:44,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:44,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:44,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:45,372 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:09:45,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:45,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:09:45,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:45,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:09:45,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:09:45,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:09:45,375 INFO L87 Difference]: Start difference. First operand 228985 states and 370981 transitions. Second operand 6 states. [2019-09-10 04:09:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:49,363 INFO L93 Difference]: Finished difference Result 240516 states and 389049 transitions. [2019-09-10 04:09:49,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 04:09:49,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-09-10 04:09:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:49,987 INFO L225 Difference]: With dead ends: 240516 [2019-09-10 04:09:49,987 INFO L226 Difference]: Without dead ends: 240516 [2019-09-10 04:09:49,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:09:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240516 states. [2019-09-10 04:09:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240516 to 229362. [2019-09-10 04:09:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229362 states. [2019-09-10 04:09:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229362 states to 229362 states and 370981 transitions. [2019-09-10 04:09:58,517 INFO L78 Accepts]: Start accepts. Automaton has 229362 states and 370981 transitions. Word has length 257 [2019-09-10 04:09:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:58,518 INFO L475 AbstractCegarLoop]: Abstraction has 229362 states and 370981 transitions. [2019-09-10 04:09:58,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:09:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 229362 states and 370981 transitions. [2019-09-10 04:09:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 04:09:58,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:58,525 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash -516165191, now seen corresponding path program 1 times [2019-09-10 04:09:58,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:58,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:58,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:58,872 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:09:58,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:58,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:09:58,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:58,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:09:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:09:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:09:58,874 INFO L87 Difference]: Start difference. First operand 229362 states and 370981 transitions. Second operand 6 states. [2019-09-10 04:10:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:10:03,882 INFO L93 Difference]: Finished difference Result 249024 states and 415211 transitions. [2019-09-10 04:10:03,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:10:03,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-09-10 04:10:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:10:04,738 INFO L225 Difference]: With dead ends: 249024 [2019-09-10 04:10:04,738 INFO L226 Difference]: Without dead ends: 249024 [2019-09-10 04:10:04,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:10:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249024 states. [2019-09-10 04:10:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249024 to 231742. [2019-09-10 04:10:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231742 states. [2019-09-10 04:10:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231742 states to 231742 states and 374789 transitions. [2019-09-10 04:10:13,535 INFO L78 Accepts]: Start accepts. Automaton has 231742 states and 374789 transitions. Word has length 257 [2019-09-10 04:10:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:10:13,535 INFO L475 AbstractCegarLoop]: Abstraction has 231742 states and 374789 transitions. [2019-09-10 04:10:13,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:10:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 231742 states and 374789 transitions. [2019-09-10 04:10:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 04:10:13,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:10:13,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,540 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:10:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1640941925, now seen corresponding path program 1 times [2019-09-10 04:10:13,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:10:13,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:13,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:10:13,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:13,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:10:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:10:13,824 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:10:13,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:10:13,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:10:13,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:10:13,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:10:13,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:10:13,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:10:13,826 INFO L87 Difference]: Start difference. First operand 231742 states and 374789 transitions. Second operand 6 states. [2019-09-10 04:10:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:10:21,311 INFO L93 Difference]: Finished difference Result 509117 states and 824968 transitions. [2019-09-10 04:10:21,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:10:21,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-10 04:10:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:10:22,570 INFO L225 Difference]: With dead ends: 509117 [2019-09-10 04:10:22,571 INFO L226 Difference]: Without dead ends: 509117 [2019-09-10 04:10:22,571 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 04:10:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509117 states. [2019-09-10 04:10:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509117 to 418520. [2019-09-10 04:10:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418520 states. [2019-09-10 04:10:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418520 states to 418520 states and 678047 transitions. [2019-09-10 04:10:36,368 INFO L78 Accepts]: Start accepts. Automaton has 418520 states and 678047 transitions. Word has length 258 [2019-09-10 04:10:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:10:36,369 INFO L475 AbstractCegarLoop]: Abstraction has 418520 states and 678047 transitions. [2019-09-10 04:10:36,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:10:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 418520 states and 678047 transitions. [2019-09-10 04:10:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-10 04:10:36,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:10:36,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:36,374 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:10:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash -393940472, now seen corresponding path program 1 times [2019-09-10 04:10:36,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:10:36,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:36,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:10:36,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:36,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:10:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:10:36,593 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:10:36,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:10:36,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:10:36,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:10:36,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:10:36,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:10:36,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:10:36,595 INFO L87 Difference]: Start difference. First operand 418520 states and 678047 transitions. Second operand 6 states. [2019-09-10 04:10:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:10:53,632 INFO L93 Difference]: Finished difference Result 832621 states and 1347485 transitions. [2019-09-10 04:10:53,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:10:53,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-10 04:10:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:10:56,080 INFO L225 Difference]: With dead ends: 832621 [2019-09-10 04:10:56,080 INFO L226 Difference]: Without dead ends: 832621 [2019-09-10 04:10:56,080 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:10:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832621 states. [2019-09-10 04:11:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832621 to 828021. [2019-09-10 04:11:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828021 states. [2019-09-10 04:11:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828021 states to 828021 states and 1341017 transitions. [2019-09-10 04:11:30,130 INFO L78 Accepts]: Start accepts. Automaton has 828021 states and 1341017 transitions. Word has length 259 [2019-09-10 04:11:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:11:30,131 INFO L475 AbstractCegarLoop]: Abstraction has 828021 states and 1341017 transitions. [2019-09-10 04:11:30,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:11:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 828021 states and 1341017 transitions. [2019-09-10 04:11:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 04:11:30,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:11:30,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:30,135 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:11:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:30,135 INFO L82 PathProgramCache]: Analyzing trace with hash -443286030, now seen corresponding path program 1 times [2019-09-10 04:11:30,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:11:30,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:30,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:30,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:30,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:11:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:30,378 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:11:30,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:11:30,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:11:30,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:11:30,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:11:30,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:11:30,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:11:30,381 INFO L87 Difference]: Start difference. First operand 828021 states and 1341017 transitions. Second operand 6 states. [2019-09-10 04:11:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:11:55,753 INFO L93 Difference]: Finished difference Result 1455893 states and 2359780 transitions. [2019-09-10 04:11:55,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:11:55,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 260 [2019-09-10 04:11:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:00,549 INFO L225 Difference]: With dead ends: 1455893 [2019-09-10 04:12:00,550 INFO L226 Difference]: Without dead ends: 1455893 [2019-09-10 04:12:00,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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 04:12:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455893 states. [2019-09-10 04:12:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455893 to 1450615. [2019-09-10 04:12:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450615 states. [2019-09-10 04:12:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450615 states to 1450615 states and 2351953 transitions. [2019-09-10 04:12:59,572 INFO L78 Accepts]: Start accepts. Automaton has 1450615 states and 2351953 transitions. Word has length 260 [2019-09-10 04:12:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:59,572 INFO L475 AbstractCegarLoop]: Abstraction has 1450615 states and 2351953 transitions. [2019-09-10 04:12:59,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:12:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1450615 states and 2351953 transitions. [2019-09-10 04:12:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 04:12:59,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:59,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:59,577 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash -924984949, now seen corresponding path program 1 times [2019-09-10 04:12:59,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:59,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:59,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:59,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:59,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:59,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:12:59,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 04:12:59,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:59,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 04:12:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 04:12:59,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 04:12:59,918 INFO L87 Difference]: Start difference. First operand 1450615 states and 2351953 transitions. Second operand 14 states. [2019-09-10 04:13:12,555 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 22