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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:06:45,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:06:45,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:06:45,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:06:45,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:06:45,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:06:45,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:06:45,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:06:45,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:06:45,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:06:45,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:06:45,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:06:45,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:06:45,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:06:45,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:06:45,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:06:45,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:06:45,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:06:45,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:06:45,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:06:45,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:06:45,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:06:45,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:06:45,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:06:45,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:06:45,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:06:45,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:06:45,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:06:45,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:06:45,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:06:45,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:06:45,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:06:45,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:06:45,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:06:45,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:06:45,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:06:45,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:06:45,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:06:45,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:06:45,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:06:45,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:06:45,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:06:45,289 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:06:45,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:06:45,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:06:45,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:06:45,291 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:06:45,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:06:45,291 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:06:45,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:06:45,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:06:45,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:06:45,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:06:45,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:06:45,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:06:45,292 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:06:45,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:06:45,293 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:06:45,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:06:45,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:06:45,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:06:45,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:06:45,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:06:45,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:45,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:06:45,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:06:45,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:06:45,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:06:45,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:06:45,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:06:45,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:06:45,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:06:45,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:06:45,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:06:45,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:06:45,586 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:06:45,587 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-10-15 01:06:45,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4fc6515/05110ca0c07c4ba9864bb91c9f3d9dfb/FLAGaa0df262c [2019-10-15 01:06:46,236 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:06:46,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-10-15 01:06:46,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4fc6515/05110ca0c07c4ba9864bb91c9f3d9dfb/FLAGaa0df262c [2019-10-15 01:06:46,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4fc6515/05110ca0c07c4ba9864bb91c9f3d9dfb [2019-10-15 01:06:46,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:06:46,431 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:06:46,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:46,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:06:46,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:06:46,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:46,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebb8931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46, skipping insertion in model container [2019-10-15 01:06:46,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:46,450 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:06:46,527 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:06:47,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:47,098 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:06:47,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:47,281 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:06:47,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:47 WrapperNode [2019-10-15 01:06:47,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:47,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:06:47,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:06:47,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:06:47,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:47" (1/1) ... [2019-10-15 01:06:47,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:47" (1/1) ... [2019-10-15 01:06:47,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:47" (1/1) ... [2019-10-15 01:06:47,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:47" (1/1) ... [2019-10-15 01:06:47,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:47" (1/1) ... [2019-10-15 01:06:47,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:47" (1/1) ... [2019-10-15 01:06:47,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:47" (1/1) ... [2019-10-15 01:06:47,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:06:47,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:06:47,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:06:47,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:06:47,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:47" (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-10-15 01:06:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:06:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:06:47,486 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 01:06:47,486 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 01:06:47,486 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-15 01:06:47,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-15 01:06:47,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-15 01:06:47,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-15 01:06:47,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-15 01:06:47,488 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-15 01:06:47,488 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-15 01:06:47,488 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-15 01:06:47,488 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-10-15 01:06:47,489 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-15 01:06:47,489 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-15 01:06:47,490 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-15 01:06:47,492 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-15 01:06:47,492 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-15 01:06:47,492 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-15 01:06:47,492 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-15 01:06:47,492 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-15 01:06:47,492 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 01:06:47,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:06:47,493 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 01:06:47,493 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 01:06:47,493 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 01:06:47,493 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 01:06:47,493 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 01:06:47,494 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-15 01:06:47,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-15 01:06:47,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:06:47,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:06:47,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:06:47,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:06:47,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:06:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-15 01:06:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-15 01:06:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-15 01:06:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-15 01:06:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-15 01:06:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-15 01:06:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-15 01:06:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-15 01:06:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-10-15 01:06:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-15 01:06:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-15 01:06:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-15 01:06:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-15 01:06:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-15 01:06:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-15 01:06:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 01:06:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 01:06:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 01:06:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-15 01:06:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-15 01:06:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 01:06:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 01:06:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 01:06:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-15 01:06:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-15 01:06:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 01:06:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:06:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 01:06:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:06:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:06:48,100 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,206 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-15 01:06:48,206 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-15 01:06:48,219 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,266 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-15 01:06:48,267 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-15 01:06:48,303 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,327 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 01:06:48,328 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 01:06:48,416 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,477 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-10-15 01:06:48,477 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-15 01:06:48,478 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-15 01:06:48,486 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,686 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-15 01:06:48,686 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-15 01:06:48,687 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,719 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-15 01:06:48,719 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-15 01:06:48,748 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,766 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-15 01:06:48,767 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-15 01:06:48,771 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,969 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-15 01:06:48,970 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-15 01:06:48,991 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,999 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:49,000 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:49,016 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:06:49,016 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:06:49,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:49 BoogieIcfgContainer [2019-10-15 01:06:49,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:06:49,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:06:49,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:06:49,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:06:49,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:06:46" (1/3) ... [2019-10-15 01:06:49,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e37e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:49, skipping insertion in model container [2019-10-15 01:06:49,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:47" (2/3) ... [2019-10-15 01:06:49,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e37e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:49, skipping insertion in model container [2019-10-15 01:06:49,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:49" (3/3) ... [2019-10-15 01:06:49,028 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2019-10-15 01:06:49,038 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:06:49,047 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:06:49,059 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:06:49,096 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:06:49,096 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:06:49,096 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:06:49,097 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:06:49,097 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:06:49,097 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:06:49,097 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:06:49,097 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:06:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2019-10-15 01:06:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:06:49,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:49,164 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:49,167 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:49,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2019-10-15 01:06:49,186 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:49,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170909287] [2019-10-15 01:06:49,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:49,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:49,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:49,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170909287] [2019-10-15 01:06:49,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:49,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:49,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541714961] [2019-10-15 01:06:49,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:49,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:49,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:49,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:49,575 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2019-10-15 01:06:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:49,824 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2019-10-15 01:06:49,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:49,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:06:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:49,856 INFO L225 Difference]: With dead ends: 887 [2019-10-15 01:06:49,856 INFO L226 Difference]: Without dead ends: 507 [2019-10-15 01:06:49,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-10-15 01:06:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-10-15 01:06:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-10-15 01:06:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2019-10-15 01:06:49,973 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2019-10-15 01:06:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:49,974 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2019-10-15 01:06:49,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2019-10-15 01:06:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:06:49,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:49,976 INFO L380 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] [2019-10-15 01:06:49,976 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:49,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:49,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2019-10-15 01:06:49,977 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:49,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240788615] [2019-10-15 01:06:49,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:49,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:49,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:50,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240788615] [2019-10-15 01:06:50,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:50,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:50,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602972067] [2019-10-15 01:06:50,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:50,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:50,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:50,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:50,141 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2019-10-15 01:06:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:50,424 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2019-10-15 01:06:50,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:50,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:06:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:50,438 INFO L225 Difference]: With dead ends: 789 [2019-10-15 01:06:50,439 INFO L226 Difference]: Without dead ends: 670 [2019-10-15 01:06:50,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-15 01:06:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2019-10-15 01:06:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-10-15 01:06:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2019-10-15 01:06:50,500 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2019-10-15 01:06:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:50,500 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2019-10-15 01:06:50,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2019-10-15 01:06:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:06:50,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:50,503 INFO L380 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] [2019-10-15 01:06:50,503 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1338407833, now seen corresponding path program 1 times [2019-10-15 01:06:50,504 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:50,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983094071] [2019-10-15 01:06:50,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:50,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:50,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:50,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983094071] [2019-10-15 01:06:50,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:50,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:50,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188321078] [2019-10-15 01:06:50,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:50,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:50,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:50,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:50,607 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2019-10-15 01:06:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:50,677 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2019-10-15 01:06:50,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:50,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:06:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:50,686 INFO L225 Difference]: With dead ends: 995 [2019-10-15 01:06:50,687 INFO L226 Difference]: Without dead ends: 819 [2019-10-15 01:06:50,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-10-15 01:06:50,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2019-10-15 01:06:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-10-15 01:06:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2019-10-15 01:06:50,770 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2019-10-15 01:06:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:50,771 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2019-10-15 01:06:50,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2019-10-15 01:06:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:06:50,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:50,780 INFO L380 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] [2019-10-15 01:06:50,780 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:50,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:50,781 INFO L82 PathProgramCache]: Analyzing trace with hash 817062638, now seen corresponding path program 1 times [2019-10-15 01:06:50,781 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:50,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591114780] [2019-10-15 01:06:50,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:50,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:50,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:50,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591114780] [2019-10-15 01:06:50,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:50,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:50,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961275626] [2019-10-15 01:06:50,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:50,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:50,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:50,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:50,890 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2019-10-15 01:06:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:51,104 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2019-10-15 01:06:51,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:51,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:06:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:51,115 INFO L225 Difference]: With dead ends: 1424 [2019-10-15 01:06:51,116 INFO L226 Difference]: Without dead ends: 1160 [2019-10-15 01:06:51,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-10-15 01:06:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2019-10-15 01:06:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-10-15 01:06:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2019-10-15 01:06:51,193 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2019-10-15 01:06:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:51,194 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2019-10-15 01:06:51,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2019-10-15 01:06:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:06:51,207 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:51,208 INFO L380 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] [2019-10-15 01:06:51,208 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash -679253739, now seen corresponding path program 1 times [2019-10-15 01:06:51,208 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:51,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118345776] [2019-10-15 01:06:51,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:51,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:51,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:51,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118345776] [2019-10-15 01:06:51,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:51,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:06:51,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442182991] [2019-10-15 01:06:51,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:06:51,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:51,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:06:51,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:06:51,349 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2019-10-15 01:06:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:52,331 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2019-10-15 01:06:52,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:06:52,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-15 01:06:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:52,339 INFO L225 Difference]: With dead ends: 1562 [2019-10-15 01:06:52,339 INFO L226 Difference]: Without dead ends: 984 [2019-10-15 01:06:52,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:06:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-10-15 01:06:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2019-10-15 01:06:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-10-15 01:06:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2019-10-15 01:06:52,393 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2019-10-15 01:06:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:52,393 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2019-10-15 01:06:52,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:06:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2019-10-15 01:06:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 01:06:52,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:52,396 INFO L380 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] [2019-10-15 01:06:52,396 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash 891535335, now seen corresponding path program 1 times [2019-10-15 01:06:52,397 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:52,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952256606] [2019-10-15 01:06:52,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:52,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952256606] [2019-10-15 01:06:52,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:52,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:52,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193280746] [2019-10-15 01:06:52,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:52,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:52,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,459 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2019-10-15 01:06:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:52,549 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2019-10-15 01:06:52,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:52,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-15 01:06:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:52,556 INFO L225 Difference]: With dead ends: 890 [2019-10-15 01:06:52,556 INFO L226 Difference]: Without dead ends: 886 [2019-10-15 01:06:52,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-10-15 01:06:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-10-15 01:06:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-10-15 01:06:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2019-10-15 01:06:52,606 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2019-10-15 01:06:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:52,607 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2019-10-15 01:06:52,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2019-10-15 01:06:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:06:52,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:52,610 INFO L380 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] [2019-10-15 01:06:52,610 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:52,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:52,611 INFO L82 PathProgramCache]: Analyzing trace with hash 975145180, now seen corresponding path program 1 times [2019-10-15 01:06:52,611 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:52,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933178315] [2019-10-15 01:06:52,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:52,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933178315] [2019-10-15 01:06:52,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:52,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:52,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922053834] [2019-10-15 01:06:52,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:52,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:52,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:52,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,729 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2019-10-15 01:06:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:52,785 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2019-10-15 01:06:52,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:52,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-15 01:06:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:52,792 INFO L225 Difference]: With dead ends: 1274 [2019-10-15 01:06:52,792 INFO L226 Difference]: Without dead ends: 1015 [2019-10-15 01:06:52,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-10-15 01:06:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2019-10-15 01:06:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-15 01:06:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2019-10-15 01:06:52,843 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2019-10-15 01:06:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:52,844 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2019-10-15 01:06:52,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2019-10-15 01:06:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:06:52,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:52,847 INFO L380 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] [2019-10-15 01:06:52,847 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:52,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2019-10-15 01:06:52,848 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:52,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935343177] [2019-10-15 01:06:52,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:52,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935343177] [2019-10-15 01:06:52,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:52,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:52,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117548647] [2019-10-15 01:06:52,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:52,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:52,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,903 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2019-10-15 01:06:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:52,959 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2019-10-15 01:06:52,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:52,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 01:06:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:52,966 INFO L225 Difference]: With dead ends: 972 [2019-10-15 01:06:52,967 INFO L226 Difference]: Without dead ends: 954 [2019-10-15 01:06:52,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-10-15 01:06:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2019-10-15 01:06:53,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-10-15 01:06:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2019-10-15 01:06:53,020 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2019-10-15 01:06:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:53,020 INFO L462 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2019-10-15 01:06:53,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2019-10-15 01:06:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:06:53,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:53,024 INFO L380 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] [2019-10-15 01:06:53,024 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:53,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1915119306, now seen corresponding path program 1 times [2019-10-15 01:06:53,025 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:53,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865587522] [2019-10-15 01:06:53,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:53,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865587522] [2019-10-15 01:06:53,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:53,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:53,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619936715] [2019-10-15 01:06:53,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:53,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:53,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:53,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:53,077 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2019-10-15 01:06:53,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:53,143 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2019-10-15 01:06:53,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:53,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 01:06:53,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:53,150 INFO L225 Difference]: With dead ends: 1167 [2019-10-15 01:06:53,150 INFO L226 Difference]: Without dead ends: 925 [2019-10-15 01:06:53,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-10-15 01:06:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2019-10-15 01:06:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-10-15 01:06:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2019-10-15 01:06:53,219 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2019-10-15 01:06:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:53,220 INFO L462 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2019-10-15 01:06:53,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2019-10-15 01:06:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:06:53,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:53,224 INFO L380 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] [2019-10-15 01:06:53,224 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:53,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2102488102, now seen corresponding path program 1 times [2019-10-15 01:06:53,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:53,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815178084] [2019-10-15 01:06:53,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:53,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815178084] [2019-10-15 01:06:53,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:53,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:06:53,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202573275] [2019-10-15 01:06:53,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:06:53,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:53,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:06:53,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:06:53,318 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2019-10-15 01:06:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:53,749 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2019-10-15 01:06:53,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:06:53,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:06:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:53,755 INFO L225 Difference]: With dead ends: 1014 [2019-10-15 01:06:53,755 INFO L226 Difference]: Without dead ends: 785 [2019-10-15 01:06:53,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:06:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-10-15 01:06:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2019-10-15 01:06:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-10-15 01:06:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2019-10-15 01:06:53,808 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2019-10-15 01:06:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:53,808 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2019-10-15 01:06:53,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:06:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2019-10-15 01:06:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:06:53,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:53,811 INFO L380 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] [2019-10-15 01:06:53,811 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:53,812 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2019-10-15 01:06:53,812 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:53,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838125512] [2019-10-15 01:06:53,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:53,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838125512] [2019-10-15 01:06:53,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:53,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:53,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281740433] [2019-10-15 01:06:53,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:53,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:53,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:53,861 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2019-10-15 01:06:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:53,907 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2019-10-15 01:06:53,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:53,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:06:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:53,912 INFO L225 Difference]: With dead ends: 871 [2019-10-15 01:06:53,912 INFO L226 Difference]: Without dead ends: 775 [2019-10-15 01:06:53,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-10-15 01:06:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2019-10-15 01:06:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-10-15 01:06:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2019-10-15 01:06:53,951 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2019-10-15 01:06:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:53,952 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2019-10-15 01:06:53,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2019-10-15 01:06:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:06:53,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:53,954 INFO L380 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] [2019-10-15 01:06:53,955 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:53,955 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2019-10-15 01:06:53,955 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:53,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13435780] [2019-10-15 01:06:53,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:53,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13435780] [2019-10-15 01:06:53,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:53,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:53,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180727363] [2019-10-15 01:06:53,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:53,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:53,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:53,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:53,996 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2019-10-15 01:06:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:54,100 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2019-10-15 01:06:54,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:54,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-15 01:06:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:54,106 INFO L225 Difference]: With dead ends: 938 [2019-10-15 01:06:54,106 INFO L226 Difference]: Without dead ends: 928 [2019-10-15 01:06:54,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:54,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-10-15 01:06:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2019-10-15 01:06:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-10-15 01:06:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2019-10-15 01:06:54,155 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2019-10-15 01:06:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:54,155 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2019-10-15 01:06:54,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2019-10-15 01:06:54,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:06:54,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:54,159 INFO L380 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] [2019-10-15 01:06:54,159 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2019-10-15 01:06:54,160 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:54,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226508751] [2019-10-15 01:06:54,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:54,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226508751] [2019-10-15 01:06:54,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:54,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:06:54,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789550948] [2019-10-15 01:06:54,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:06:54,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:54,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:06:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:54,263 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2019-10-15 01:06:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:54,424 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2019-10-15 01:06:54,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:06:54,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-15 01:06:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:54,430 INFO L225 Difference]: With dead ends: 851 [2019-10-15 01:06:54,430 INFO L226 Difference]: Without dead ends: 847 [2019-10-15 01:06:54,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:06:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-10-15 01:06:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2019-10-15 01:06:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-10-15 01:06:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2019-10-15 01:06:54,484 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2019-10-15 01:06:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:54,486 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2019-10-15 01:06:54,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:06:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2019-10-15 01:06:54,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:06:54,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:54,489 INFO L380 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] [2019-10-15 01:06:54,490 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:54,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:54,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2019-10-15 01:06:54,490 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:54,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353782917] [2019-10-15 01:06:54,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:54,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353782917] [2019-10-15 01:06:54,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:54,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:06:54,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377546700] [2019-10-15 01:06:54,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:06:54,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:54,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:06:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:54,567 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2019-10-15 01:06:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:54,704 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2019-10-15 01:06:54,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:06:54,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-15 01:06:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:54,713 INFO L225 Difference]: With dead ends: 886 [2019-10-15 01:06:54,713 INFO L226 Difference]: Without dead ends: 865 [2019-10-15 01:06:54,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:06:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-10-15 01:06:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2019-10-15 01:06:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-10-15 01:06:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2019-10-15 01:06:54,782 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2019-10-15 01:06:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:54,782 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2019-10-15 01:06:54,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:06:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2019-10-15 01:06:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:06:54,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:54,791 INFO L380 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] [2019-10-15 01:06:54,791 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:54,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2019-10-15 01:06:54,792 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:54,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987270124] [2019-10-15 01:06:54,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:54,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987270124] [2019-10-15 01:06:54,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:54,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:54,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899634492] [2019-10-15 01:06:54,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:54,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:54,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:54,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:54,856 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2019-10-15 01:06:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:55,024 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2019-10-15 01:06:55,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:55,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-15 01:06:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:55,034 INFO L225 Difference]: With dead ends: 1081 [2019-10-15 01:06:55,034 INFO L226 Difference]: Without dead ends: 1049 [2019-10-15 01:06:55,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-10-15 01:06:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2019-10-15 01:06:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-10-15 01:06:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2019-10-15 01:06:55,161 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2019-10-15 01:06:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:55,161 INFO L462 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2019-10-15 01:06:55,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2019-10-15 01:06:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:06:55,166 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:55,167 INFO L380 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] [2019-10-15 01:06:55,167 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:55,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2019-10-15 01:06:55,168 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:55,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653660675] [2019-10-15 01:06:55,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:55,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:55,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:55,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653660675] [2019-10-15 01:06:55,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:55,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:06:55,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472456230] [2019-10-15 01:06:55,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:06:55,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:55,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:06:55,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:06:55,230 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2019-10-15 01:06:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:55,291 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2019-10-15 01:06:55,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:06:55,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-10-15 01:06:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:55,297 INFO L225 Difference]: With dead ends: 966 [2019-10-15 01:06:55,297 INFO L226 Difference]: Without dead ends: 944 [2019-10-15 01:06:55,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:06:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-10-15 01:06:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2019-10-15 01:06:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-10-15 01:06:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2019-10-15 01:06:55,355 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2019-10-15 01:06:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:55,355 INFO L462 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2019-10-15 01:06:55,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:06:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2019-10-15 01:06:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:06:55,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:55,359 INFO L380 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] [2019-10-15 01:06:55,359 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:55,359 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2019-10-15 01:06:55,360 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:55,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667967530] [2019-10-15 01:06:55,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:55,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:55,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:55,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667967530] [2019-10-15 01:06:55,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:55,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:06:55,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488642369] [2019-10-15 01:06:55,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:06:55,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:55,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:06:55,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:06:55,443 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2019-10-15 01:06:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:56,664 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2019-10-15 01:06:56,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:06:56,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-10-15 01:06:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:56,673 INFO L225 Difference]: With dead ends: 1110 [2019-10-15 01:06:56,673 INFO L226 Difference]: Without dead ends: 1016 [2019-10-15 01:06:56,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:06:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-10-15 01:06:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2019-10-15 01:06:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-10-15 01:06:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2019-10-15 01:06:56,753 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2019-10-15 01:06:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:56,753 INFO L462 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2019-10-15 01:06:56,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:06:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2019-10-15 01:06:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:06:56,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:56,758 INFO L380 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] [2019-10-15 01:06:56,758 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:56,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2019-10-15 01:06:56,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:56,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551129513] [2019-10-15 01:06:56,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:57,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551129513] [2019-10-15 01:06:57,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:57,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-15 01:06:57,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907465573] [2019-10-15 01:06:57,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:06:57,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:57,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:06:57,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:06:57,046 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 15 states. [2019-10-15 01:07:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:00,487 INFO L93 Difference]: Finished difference Result 1054 states and 1469 transitions. [2019-10-15 01:07:00,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-15 01:07:00,487 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-10-15 01:07:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:00,495 INFO L225 Difference]: With dead ends: 1054 [2019-10-15 01:07:00,495 INFO L226 Difference]: Without dead ends: 1033 [2019-10-15 01:07:00,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:07:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-10-15 01:07:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 876. [2019-10-15 01:07:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-15 01:07:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1182 transitions. [2019-10-15 01:07:00,546 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1182 transitions. Word has length 50 [2019-10-15 01:07:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:00,546 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1182 transitions. [2019-10-15 01:07:00,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:07:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1182 transitions. [2019-10-15 01:07:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:07:00,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:00,553 INFO L380 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] [2019-10-15 01:07:00,554 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash -594952383, now seen corresponding path program 1 times [2019-10-15 01:07:00,554 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:00,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055811421] [2019-10-15 01:07:00,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:00,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:00,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:00,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055811421] [2019-10-15 01:07:00,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:00,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:00,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18563913] [2019-10-15 01:07:00,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:00,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:00,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:00,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:00,662 INFO L87 Difference]: Start difference. First operand 876 states and 1182 transitions. Second operand 10 states. [2019-10-15 01:07:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,116 INFO L93 Difference]: Finished difference Result 1142 states and 1589 transitions. [2019-10-15 01:07:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:07:03,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-15 01:07:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,124 INFO L225 Difference]: With dead ends: 1142 [2019-10-15 01:07:03,125 INFO L226 Difference]: Without dead ends: 1121 [2019-10-15 01:07:03,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:03,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-10-15 01:07:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 880. [2019-10-15 01:07:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-10-15 01:07:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1184 transitions. [2019-10-15 01:07:03,177 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1184 transitions. Word has length 50 [2019-10-15 01:07:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,178 INFO L462 AbstractCegarLoop]: Abstraction has 880 states and 1184 transitions. [2019-10-15 01:07:03,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1184 transitions. [2019-10-15 01:07:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:03,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,181 INFO L380 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] [2019-10-15 01:07:03,181 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2019-10-15 01:07:03,182 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369946062] [2019-10-15 01:07:03,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:03,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369946062] [2019-10-15 01:07:03,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:03,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357309316] [2019-10-15 01:07:03,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:03,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:03,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,231 INFO L87 Difference]: Start difference. First operand 880 states and 1184 transitions. Second operand 3 states. [2019-10-15 01:07:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,319 INFO L93 Difference]: Finished difference Result 905 states and 1212 transitions. [2019-10-15 01:07:03,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:03,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-15 01:07:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,326 INFO L225 Difference]: With dead ends: 905 [2019-10-15 01:07:03,326 INFO L226 Difference]: Without dead ends: 900 [2019-10-15 01:07:03,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-10-15 01:07:03,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 896. [2019-10-15 01:07:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-10-15 01:07:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1203 transitions. [2019-10-15 01:07:03,391 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1203 transitions. Word has length 52 [2019-10-15 01:07:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,392 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1203 transitions. [2019-10-15 01:07:03,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1203 transitions. [2019-10-15 01:07:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:03,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,395 INFO L380 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] [2019-10-15 01:07:03,395 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2019-10-15 01:07:03,396 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069058809] [2019-10-15 01:07:03,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:03,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069058809] [2019-10-15 01:07:03,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:03,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872210537] [2019-10-15 01:07:03,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:03,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:03,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,454 INFO L87 Difference]: Start difference. First operand 896 states and 1203 transitions. Second operand 3 states. [2019-10-15 01:07:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,593 INFO L93 Difference]: Finished difference Result 1109 states and 1487 transitions. [2019-10-15 01:07:03,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:03,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-15 01:07:03,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,597 INFO L225 Difference]: With dead ends: 1109 [2019-10-15 01:07:03,598 INFO L226 Difference]: Without dead ends: 868 [2019-10-15 01:07:03,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-15 01:07:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2019-10-15 01:07:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-10-15 01:07:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1166 transitions. [2019-10-15 01:07:03,646 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1166 transitions. Word has length 54 [2019-10-15 01:07:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,647 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1166 transitions. [2019-10-15 01:07:03,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1166 transitions. [2019-10-15 01:07:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:07:03,651 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,651 INFO L380 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] [2019-10-15 01:07:03,651 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2019-10-15 01:07:03,652 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254032647] [2019-10-15 01:07:03,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:03,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254032647] [2019-10-15 01:07:03,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:07:03,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036119450] [2019-10-15 01:07:03,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:07:03,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:07:03,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:03,787 INFO L87 Difference]: Start difference. First operand 868 states and 1166 transitions. Second operand 13 states. [2019-10-15 01:07:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:05,716 INFO L93 Difference]: Finished difference Result 903 states and 1205 transitions. [2019-10-15 01:07:05,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:07:05,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-10-15 01:07:05,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:05,723 INFO L225 Difference]: With dead ends: 903 [2019-10-15 01:07:05,723 INFO L226 Difference]: Without dead ends: 897 [2019-10-15 01:07:05,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:07:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-10-15 01:07:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 868. [2019-10-15 01:07:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-10-15 01:07:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1165 transitions. [2019-10-15 01:07:05,774 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1165 transitions. Word has length 53 [2019-10-15 01:07:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:05,774 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1165 transitions. [2019-10-15 01:07:05,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:07:05,774 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1165 transitions. [2019-10-15 01:07:05,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:07:05,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:05,777 INFO L380 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] [2019-10-15 01:07:05,778 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:05,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1608320713, now seen corresponding path program 1 times [2019-10-15 01:07:05,778 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:05,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314383475] [2019-10-15 01:07:05,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:05,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314383475] [2019-10-15 01:07:05,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:05,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:05,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169189769] [2019-10-15 01:07:05,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:05,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:05,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:05,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:05,880 INFO L87 Difference]: Start difference. First operand 868 states and 1165 transitions. Second operand 10 states. [2019-10-15 01:07:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:08,311 INFO L93 Difference]: Finished difference Result 1116 states and 1551 transitions. [2019-10-15 01:07:08,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:07:08,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-15 01:07:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:08,317 INFO L225 Difference]: With dead ends: 1116 [2019-10-15 01:07:08,318 INFO L226 Difference]: Without dead ends: 1110 [2019-10-15 01:07:08,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-10-15 01:07:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 868. [2019-10-15 01:07:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-10-15 01:07:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1164 transitions. [2019-10-15 01:07:08,374 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1164 transitions. Word has length 53 [2019-10-15 01:07:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:08,374 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1164 transitions. [2019-10-15 01:07:08,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1164 transitions. [2019-10-15 01:07:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:08,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:08,378 INFO L380 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] [2019-10-15 01:07:08,378 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:08,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2019-10-15 01:07:08,379 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:08,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764821609] [2019-10-15 01:07:08,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:08,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764821609] [2019-10-15 01:07:08,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:08,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:08,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900938181] [2019-10-15 01:07:08,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:08,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:08,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:08,517 INFO L87 Difference]: Start difference. First operand 868 states and 1164 transitions. Second operand 11 states. [2019-10-15 01:07:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:09,772 INFO L93 Difference]: Finished difference Result 891 states and 1188 transitions. [2019-10-15 01:07:09,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:09,773 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-10-15 01:07:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:09,779 INFO L225 Difference]: With dead ends: 891 [2019-10-15 01:07:09,779 INFO L226 Difference]: Without dead ends: 867 [2019-10-15 01:07:09,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-10-15 01:07:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2019-10-15 01:07:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-10-15 01:07:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1162 transitions. [2019-10-15 01:07:09,837 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1162 transitions. Word has length 52 [2019-10-15 01:07:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:09,839 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 1162 transitions. [2019-10-15 01:07:09,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1162 transitions. [2019-10-15 01:07:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:09,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:09,843 INFO L380 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] [2019-10-15 01:07:09,843 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:09,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1177776774, now seen corresponding path program 1 times [2019-10-15 01:07:09,844 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:09,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351890204] [2019-10-15 01:07:09,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:09,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351890204] [2019-10-15 01:07:09,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:09,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:09,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794334970] [2019-10-15 01:07:09,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:09,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:09,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:09,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:09,931 INFO L87 Difference]: Start difference. First operand 867 states and 1162 transitions. Second operand 5 states. [2019-10-15 01:07:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:10,561 INFO L93 Difference]: Finished difference Result 879 states and 1173 transitions. [2019-10-15 01:07:10,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:10,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-10-15 01:07:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:10,566 INFO L225 Difference]: With dead ends: 879 [2019-10-15 01:07:10,566 INFO L226 Difference]: Without dead ends: 844 [2019-10-15 01:07:10,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-10-15 01:07:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 838. [2019-10-15 01:07:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-15 01:07:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1130 transitions. [2019-10-15 01:07:10,618 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1130 transitions. Word has length 52 [2019-10-15 01:07:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:10,619 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1130 transitions. [2019-10-15 01:07:10,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1130 transitions. [2019-10-15 01:07:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:10,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:10,622 INFO L380 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] [2019-10-15 01:07:10,622 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:10,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2019-10-15 01:07:10,623 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:10,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741688900] [2019-10-15 01:07:10,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:10,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741688900] [2019-10-15 01:07:10,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:10,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:07:10,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966918191] [2019-10-15 01:07:10,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:07:10,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:10,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:07:10,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:10,784 INFO L87 Difference]: Start difference. First operand 838 states and 1130 transitions. Second operand 13 states. [2019-10-15 01:07:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:12,564 INFO L93 Difference]: Finished difference Result 871 states and 1166 transitions. [2019-10-15 01:07:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:07:12,565 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-10-15 01:07:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:12,569 INFO L225 Difference]: With dead ends: 871 [2019-10-15 01:07:12,570 INFO L226 Difference]: Without dead ends: 865 [2019-10-15 01:07:12,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:07:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-10-15 01:07:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 838. [2019-10-15 01:07:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-15 01:07:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2019-10-15 01:07:12,644 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 54 [2019-10-15 01:07:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:12,644 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2019-10-15 01:07:12,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:07:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2019-10-15 01:07:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:12,647 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:12,647 INFO L380 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] [2019-10-15 01:07:12,648 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:12,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:12,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1041344956, now seen corresponding path program 1 times [2019-10-15 01:07:12,648 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:12,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525789953] [2019-10-15 01:07:12,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:12,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525789953] [2019-10-15 01:07:12,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:12,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:12,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279753441] [2019-10-15 01:07:12,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:12,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:12,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:12,754 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 9 states. [2019-10-15 01:07:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:14,664 INFO L93 Difference]: Finished difference Result 1133 states and 1567 transitions. [2019-10-15 01:07:14,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:07:14,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-15 01:07:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:14,668 INFO L225 Difference]: With dead ends: 1133 [2019-10-15 01:07:14,668 INFO L226 Difference]: Without dead ends: 1083 [2019-10-15 01:07:14,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-10-15 01:07:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 847. [2019-10-15 01:07:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-10-15 01:07:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2019-10-15 01:07:14,730 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2019-10-15 01:07:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,731 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2019-10-15 01:07:14,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2019-10-15 01:07:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:07:14,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,733 INFO L380 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] [2019-10-15 01:07:14,734 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2019-10-15 01:07:14,734 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126820260] [2019-10-15 01:07:14,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:14,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126820260] [2019-10-15 01:07:14,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:14,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686058295] [2019-10-15 01:07:14,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:14,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:14,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:14,828 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 9 states. [2019-10-15 01:07:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,110 INFO L93 Difference]: Finished difference Result 874 states and 1183 transitions. [2019-10-15 01:07:15,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:15,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 01:07:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,114 INFO L225 Difference]: With dead ends: 874 [2019-10-15 01:07:15,115 INFO L226 Difference]: Without dead ends: 838 [2019-10-15 01:07:15,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-10-15 01:07:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-10-15 01:07:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-15 01:07:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2019-10-15 01:07:15,169 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2019-10-15 01:07:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,169 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2019-10-15 01:07:15,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2019-10-15 01:07:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:07:15,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,172 INFO L380 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] [2019-10-15 01:07:15,172 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash 41202246, now seen corresponding path program 1 times [2019-10-15 01:07:15,173 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625790423] [2019-10-15 01:07:15,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:15,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625790423] [2019-10-15 01:07:15,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:15,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865343112] [2019-10-15 01:07:15,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:15,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:15,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:15,314 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2019-10-15 01:07:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,569 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2019-10-15 01:07:15,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:07:15,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-15 01:07:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,573 INFO L225 Difference]: With dead ends: 854 [2019-10-15 01:07:15,573 INFO L226 Difference]: Without dead ends: 836 [2019-10-15 01:07:15,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:15,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-10-15 01:07:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2019-10-15 01:07:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-10-15 01:07:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2019-10-15 01:07:15,623 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 56 [2019-10-15 01:07:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,623 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2019-10-15 01:07:15,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2019-10-15 01:07:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:07:15,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,626 INFO L380 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] [2019-10-15 01:07:15,626 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1300823154, now seen corresponding path program 1 times [2019-10-15 01:07:15,627 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333275983] [2019-10-15 01:07:15,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:15,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333275983] [2019-10-15 01:07:15,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:15,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484554625] [2019-10-15 01:07:15,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:15,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:15,737 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2019-10-15 01:07:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,966 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2019-10-15 01:07:15,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:07:15,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-15 01:07:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,970 INFO L225 Difference]: With dead ends: 849 [2019-10-15 01:07:15,970 INFO L226 Difference]: Without dead ends: 831 [2019-10-15 01:07:15,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-10-15 01:07:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2019-10-15 01:07:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-10-15 01:07:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2019-10-15 01:07:16,019 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 55 [2019-10-15 01:07:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,020 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2019-10-15 01:07:16,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2019-10-15 01:07:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 01:07:16,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,023 INFO L380 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] [2019-10-15 01:07:16,023 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2026975246, now seen corresponding path program 1 times [2019-10-15 01:07:16,024 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648138729] [2019-10-15 01:07:16,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:16,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648138729] [2019-10-15 01:07:16,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:16,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710795526] [2019-10-15 01:07:16,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:16,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:16,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:16,094 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 5 states. [2019-10-15 01:07:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,995 INFO L93 Difference]: Finished difference Result 1378 states and 1925 transitions. [2019-10-15 01:07:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:16,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-15 01:07:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,999 INFO L225 Difference]: With dead ends: 1378 [2019-10-15 01:07:17,000 INFO L226 Difference]: Without dead ends: 1214 [2019-10-15 01:07:17,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2019-10-15 01:07:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 869. [2019-10-15 01:07:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-10-15 01:07:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1173 transitions. [2019-10-15 01:07:17,058 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1173 transitions. Word has length 61 [2019-10-15 01:07:17,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:17,059 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1173 transitions. [2019-10-15 01:07:17,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:17,059 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1173 transitions. [2019-10-15 01:07:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:07:17,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:17,062 INFO L380 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] [2019-10-15 01:07:17,062 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:17,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:17,063 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2019-10-15 01:07:17,063 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:17,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597090065] [2019-10-15 01:07:17,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:17,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597090065] [2019-10-15 01:07:17,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:17,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:17,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962834604] [2019-10-15 01:07:17,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:17,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:17,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:17,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:17,197 INFO L87 Difference]: Start difference. First operand 869 states and 1173 transitions. Second operand 11 states. [2019-10-15 01:07:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:17,471 INFO L93 Difference]: Finished difference Result 886 states and 1191 transitions. [2019-10-15 01:07:17,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:17,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-10-15 01:07:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:17,474 INFO L225 Difference]: With dead ends: 886 [2019-10-15 01:07:17,474 INFO L226 Difference]: Without dead ends: 866 [2019-10-15 01:07:17,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-10-15 01:07:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2019-10-15 01:07:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-10-15 01:07:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1168 transitions. [2019-10-15 01:07:17,528 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1168 transitions. Word has length 58 [2019-10-15 01:07:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:17,528 INFO L462 AbstractCegarLoop]: Abstraction has 866 states and 1168 transitions. [2019-10-15 01:07:17,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1168 transitions. [2019-10-15 01:07:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:07:17,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:17,531 INFO L380 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] [2019-10-15 01:07:17,531 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash 771734352, now seen corresponding path program 1 times [2019-10-15 01:07:17,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:17,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218294815] [2019-10-15 01:07:17,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:17,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218294815] [2019-10-15 01:07:17,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:17,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:07:17,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29655917] [2019-10-15 01:07:17,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:07:17,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:17,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:07:17,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:07:17,783 INFO L87 Difference]: Start difference. First operand 866 states and 1168 transitions. Second operand 12 states. [2019-10-15 01:07:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:18,149 INFO L93 Difference]: Finished difference Result 892 states and 1196 transitions. [2019-10-15 01:07:18,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:07:18,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-15 01:07:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:18,152 INFO L225 Difference]: With dead ends: 892 [2019-10-15 01:07:18,152 INFO L226 Difference]: Without dead ends: 867 [2019-10-15 01:07:18,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:07:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-10-15 01:07:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2019-10-15 01:07:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-10-15 01:07:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1157 transitions. [2019-10-15 01:07:18,226 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1157 transitions. Word has length 59 [2019-10-15 01:07:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:18,226 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1157 transitions. [2019-10-15 01:07:18,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:07:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1157 transitions. [2019-10-15 01:07:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:07:18,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:18,229 INFO L380 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] [2019-10-15 01:07:18,230 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:18,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:18,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2019-10-15 01:07:18,230 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:18,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407342744] [2019-10-15 01:07:18,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:18,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:18,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:18,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407342744] [2019-10-15 01:07:18,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:18,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:18,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511993720] [2019-10-15 01:07:18,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:18,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:18,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:18,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:18,318 INFO L87 Difference]: Start difference. First operand 865 states and 1157 transitions. Second operand 9 states. [2019-10-15 01:07:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:18,498 INFO L93 Difference]: Finished difference Result 887 states and 1180 transitions. [2019-10-15 01:07:18,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:18,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-15 01:07:18,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:18,502 INFO L225 Difference]: With dead ends: 887 [2019-10-15 01:07:18,502 INFO L226 Difference]: Without dead ends: 853 [2019-10-15 01:07:18,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-10-15 01:07:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2019-10-15 01:07:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-10-15 01:07:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1136 transitions. [2019-10-15 01:07:18,556 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1136 transitions. Word has length 59 [2019-10-15 01:07:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:18,556 INFO L462 AbstractCegarLoop]: Abstraction has 853 states and 1136 transitions. [2019-10-15 01:07:18,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1136 transitions. [2019-10-15 01:07:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:07:18,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:18,559 INFO L380 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] [2019-10-15 01:07:18,560 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2019-10-15 01:07:18,560 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:18,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170769865] [2019-10-15 01:07:18,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:18,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:18,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:18,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170769865] [2019-10-15 01:07:18,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:18,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:18,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044112224] [2019-10-15 01:07:18,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:18,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:18,603 INFO L87 Difference]: Start difference. First operand 853 states and 1136 transitions. Second operand 4 states. [2019-10-15 01:07:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:18,758 INFO L93 Difference]: Finished difference Result 1009 states and 1359 transitions. [2019-10-15 01:07:18,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:18,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-15 01:07:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:18,762 INFO L225 Difference]: With dead ends: 1009 [2019-10-15 01:07:18,762 INFO L226 Difference]: Without dead ends: 898 [2019-10-15 01:07:18,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-10-15 01:07:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 860. [2019-10-15 01:07:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-10-15 01:07:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1152 transitions. [2019-10-15 01:07:18,817 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1152 transitions. Word has length 60 [2019-10-15 01:07:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:18,817 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1152 transitions. [2019-10-15 01:07:18,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1152 transitions. [2019-10-15 01:07:18,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:07:18,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:18,821 INFO L380 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] [2019-10-15 01:07:18,821 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:18,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:18,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2019-10-15 01:07:18,821 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:18,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121920018] [2019-10-15 01:07:18,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:18,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:18,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:18,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121920018] [2019-10-15 01:07:18,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:18,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:18,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870466711] [2019-10-15 01:07:18,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:18,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:18,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:18,934 INFO L87 Difference]: Start difference. First operand 860 states and 1152 transitions. Second operand 11 states. [2019-10-15 01:07:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:19,105 INFO L93 Difference]: Finished difference Result 929 states and 1245 transitions. [2019-10-15 01:07:19,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:19,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-15 01:07:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:19,112 INFO L225 Difference]: With dead ends: 929 [2019-10-15 01:07:19,113 INFO L226 Difference]: Without dead ends: 874 [2019-10-15 01:07:19,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-15 01:07:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 864. [2019-10-15 01:07:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-10-15 01:07:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1170 transitions. [2019-10-15 01:07:19,199 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1170 transitions. Word has length 60 [2019-10-15 01:07:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:19,200 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1170 transitions. [2019-10-15 01:07:19,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1170 transitions. [2019-10-15 01:07:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:07:19,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:19,204 INFO L380 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] [2019-10-15 01:07:19,204 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1213114951, now seen corresponding path program 1 times [2019-10-15 01:07:19,205 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:19,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351421948] [2019-10-15 01:07:19,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:19,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351421948] [2019-10-15 01:07:19,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:19,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:19,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286091297] [2019-10-15 01:07:19,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:19,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:19,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:19,312 INFO L87 Difference]: Start difference. First operand 864 states and 1170 transitions. Second operand 9 states. [2019-10-15 01:07:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:19,545 INFO L93 Difference]: Finished difference Result 895 states and 1207 transitions. [2019-10-15 01:07:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:19,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-10-15 01:07:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:19,550 INFO L225 Difference]: With dead ends: 895 [2019-10-15 01:07:19,550 INFO L226 Difference]: Without dead ends: 856 [2019-10-15 01:07:19,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states.