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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:05:04,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:05:04,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:05:04,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:05:04,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:05:04,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:05:04,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:05:04,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:05:04,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:05:04,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:05:04,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:05:04,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:05:04,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:05:04,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:05:04,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:05:04,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:05:04,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:05:04,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:05:04,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:05:04,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:05:04,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:05:04,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:05:04,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:05:04,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:05:04,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:05:04,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:05:04,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:05:04,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:05:04,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:05:04,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:05:04,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:05:04,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:05:04,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:05:04,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:05:04,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:05:04,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:05:04,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:05:04,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:05:04,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:05:04,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:05:04,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:05:04,412 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 03:05:04,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:05:04,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:05:04,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:05:04,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:05:04,428 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:05:04,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:05:04,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:05:04,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:05:04,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:05:04,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:05:04,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:05:04,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:05:04,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:05:04,429 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:05:04,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:05:04,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:05:04,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:05:04,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:05:04,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:05:04,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:05:04,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:05:04,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:05:04,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:05:04,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:05:04,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:05:04,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:05:04,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:05:04,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:05:04,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:05:04,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:05:04,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:05:04,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:05:04,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:05:04,754 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:05:04,755 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 03:05:04,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2ca9a39/33af49d70e7d44c5bad084dc81f3b428/FLAGed58ef372 [2019-10-15 03:05:05,341 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:05:05,342 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-10-15 03:05:05,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2ca9a39/33af49d70e7d44c5bad084dc81f3b428/FLAGed58ef372 [2019-10-15 03:05:05,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2ca9a39/33af49d70e7d44c5bad084dc81f3b428 [2019-10-15 03:05:05,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:05:05,616 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:05:05,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:05,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:05:05,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:05:05,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:05" (1/1) ... [2019-10-15 03:05:05,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453c3fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:05, skipping insertion in model container [2019-10-15 03:05:05,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:05" (1/1) ... [2019-10-15 03:05:05,632 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:05:05,706 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:05:06,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:06,277 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:05:06,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:06,498 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:05:06,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:06 WrapperNode [2019-10-15 03:05:06,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:06,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:05:06,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:05:06,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:05:06,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:06" (1/1) ... [2019-10-15 03:05:06,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:06" (1/1) ... [2019-10-15 03:05:06,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:06" (1/1) ... [2019-10-15 03:05:06,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:06" (1/1) ... [2019-10-15 03:05:06,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:06" (1/1) ... [2019-10-15 03:05:06,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:06" (1/1) ... [2019-10-15 03:05:06,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:06" (1/1) ... [2019-10-15 03:05:06,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:05:06,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:05:06,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:05:06,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:05:06,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:06" (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 03:05:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:05:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:05:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 03:05:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 03:05:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-15 03:05:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-15 03:05:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-15 03:05:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-15 03:05:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-15 03:05:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-15 03:05:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-15 03:05:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-15 03:05:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-10-15 03:05:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-15 03:05:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-15 03:05:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-15 03:05:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-15 03:05:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-15 03:05:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-15 03:05:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-15 03:05:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-15 03:05:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 03:05:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:05:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 03:05:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 03:05:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 03:05:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 03:05:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 03:05:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-15 03:05:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-15 03:05:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:05:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:05:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:05:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:05:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:05:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-15 03:05:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-15 03:05:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-15 03:05:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-15 03:05:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-15 03:05:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-15 03:05:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-15 03:05:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-15 03:05:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-10-15 03:05:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-15 03:05:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-15 03:05:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-15 03:05:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-15 03:05:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-15 03:05:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-15 03:05:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 03:05:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 03:05:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 03:05:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-15 03:05:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-15 03:05:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 03:05:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 03:05:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 03:05:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-15 03:05:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-15 03:05:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 03:05:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:05:06,702 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 03:05:06,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:05:06,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:05:07,381 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:07,508 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-15 03:05:07,508 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-15 03:05:07,537 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:07,635 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-15 03:05:07,636 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-15 03:05:07,668 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:07,720 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 03:05:07,721 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 03:05:07,797 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:07,862 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-10-15 03:05:07,863 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-15 03:05:07,863 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-15 03:05:07,869 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:08,059 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-15 03:05:08,059 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-15 03:05:08,061 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:08,100 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-15 03:05:08,100 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-15 03:05:08,150 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:08,189 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-15 03:05:08,189 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-15 03:05:08,197 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:08,408 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-15 03:05:08,409 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-15 03:05:08,426 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:08,431 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:08,431 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:09,079 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:05:09,079 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:05:09,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:09 BoogieIcfgContainer [2019-10-15 03:05:09,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:05:09,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:05:09,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:05:09,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:05:09,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:05:05" (1/3) ... [2019-10-15 03:05:09,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52907536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:09, skipping insertion in model container [2019-10-15 03:05:09,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:06" (2/3) ... [2019-10-15 03:05:09,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52907536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:09, skipping insertion in model container [2019-10-15 03:05:09,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:09" (3/3) ... [2019-10-15 03:05:09,088 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2019-10-15 03:05:09,099 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:05:09,109 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:05:09,120 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:05:09,165 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:05:09,165 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:05:09,165 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:05:09,165 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:05:09,165 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:05:09,165 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:05:09,166 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:05:09,166 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:05:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states. [2019-10-15 03:05:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:05:09,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:09,202 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:09,203 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:09,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:09,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1471663135, now seen corresponding path program 1 times [2019-10-15 03:05:09,218 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:09,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248569689] [2019-10-15 03:05:09,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:09,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:09,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:09,502 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 03:05:09,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248569689] [2019-10-15 03:05:09,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:09,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:09,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99530221] [2019-10-15 03:05:09,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:09,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:09,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:09,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:09,533 INFO L87 Difference]: Start difference. First operand 408 states. Second operand 3 states. [2019-10-15 03:05:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:09,742 INFO L93 Difference]: Finished difference Result 702 states and 1087 transitions. [2019-10-15 03:05:09,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:09,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 03:05:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:09,761 INFO L225 Difference]: With dead ends: 702 [2019-10-15 03:05:09,762 INFO L226 Difference]: Without dead ends: 402 [2019-10-15 03:05:09,770 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 03:05:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-10-15 03:05:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2019-10-15 03:05:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-10-15 03:05:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 579 transitions. [2019-10-15 03:05:09,868 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 579 transitions. Word has length 18 [2019-10-15 03:05:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:09,868 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 579 transitions. [2019-10-15 03:05:09,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 579 transitions. [2019-10-15 03:05:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:05:09,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:09,871 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] [2019-10-15 03:05:09,871 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:09,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1826833932, now seen corresponding path program 1 times [2019-10-15 03:05:09,873 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:09,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339827509] [2019-10-15 03:05:09,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:09,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:09,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:10,081 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 03:05:10,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339827509] [2019-10-15 03:05:10,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:10,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:10,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969028570] [2019-10-15 03:05:10,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:10,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:10,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:10,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:10,090 INFO L87 Difference]: Start difference. First operand 402 states and 579 transitions. Second operand 3 states. [2019-10-15 03:05:10,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:10,370 INFO L93 Difference]: Finished difference Result 572 states and 806 transitions. [2019-10-15 03:05:10,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:10,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 03:05:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:10,377 INFO L225 Difference]: With dead ends: 572 [2019-10-15 03:05:10,378 INFO L226 Difference]: Without dead ends: 475 [2019-10-15 03:05:10,379 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 03:05:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-10-15 03:05:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-10-15 03:05:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-10-15 03:05:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 672 transitions. [2019-10-15 03:05:10,444 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 672 transitions. Word has length 21 [2019-10-15 03:05:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:10,444 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 672 transitions. [2019-10-15 03:05:10,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 672 transitions. [2019-10-15 03:05:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:05:10,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:10,448 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] [2019-10-15 03:05:10,449 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:10,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:10,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1575704033, now seen corresponding path program 1 times [2019-10-15 03:05:10,449 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:10,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642249730] [2019-10-15 03:05:10,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:10,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:10,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:10,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642249730] [2019-10-15 03:05:10,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:10,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:10,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008354067] [2019-10-15 03:05:10,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:10,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:10,563 INFO L87 Difference]: Start difference. First operand 471 states and 672 transitions. Second operand 3 states. [2019-10-15 03:05:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:10,612 INFO L93 Difference]: Finished difference Result 685 states and 950 transitions. [2019-10-15 03:05:10,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:10,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 03:05:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:10,617 INFO L225 Difference]: With dead ends: 685 [2019-10-15 03:05:10,618 INFO L226 Difference]: Without dead ends: 578 [2019-10-15 03:05:10,619 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 03:05:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-15 03:05:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 541. [2019-10-15 03:05:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-15 03:05:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 764 transitions. [2019-10-15 03:05:10,652 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 764 transitions. Word has length 26 [2019-10-15 03:05:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:10,652 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 764 transitions. [2019-10-15 03:05:10,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 764 transitions. [2019-10-15 03:05:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 03:05:10,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:10,656 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] [2019-10-15 03:05:10,656 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:10,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:10,656 INFO L82 PathProgramCache]: Analyzing trace with hash 673908008, now seen corresponding path program 1 times [2019-10-15 03:05:10,657 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:10,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390256511] [2019-10-15 03:05:10,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:10,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:10,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:10,702 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 03:05:10,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390256511] [2019-10-15 03:05:10,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:10,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:10,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986731648] [2019-10-15 03:05:10,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:10,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:10,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:10,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:10,704 INFO L87 Difference]: Start difference. First operand 541 states and 764 transitions. Second operand 3 states. [2019-10-15 03:05:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:10,935 INFO L93 Difference]: Finished difference Result 1024 states and 1490 transitions. [2019-10-15 03:05:10,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:10,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 03:05:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:10,957 INFO L225 Difference]: With dead ends: 1024 [2019-10-15 03:05:10,958 INFO L226 Difference]: Without dead ends: 818 [2019-10-15 03:05:10,960 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 03:05:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-15 03:05:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 668. [2019-10-15 03:05:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-10-15 03:05:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 990 transitions. [2019-10-15 03:05:11,061 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 990 transitions. Word has length 27 [2019-10-15 03:05:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:11,062 INFO L462 AbstractCegarLoop]: Abstraction has 668 states and 990 transitions. [2019-10-15 03:05:11,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 990 transitions. [2019-10-15 03:05:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:05:11,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:11,084 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] [2019-10-15 03:05:11,085 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:11,085 INFO L82 PathProgramCache]: Analyzing trace with hash -822079973, now seen corresponding path program 1 times [2019-10-15 03:05:11,086 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:11,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147557897] [2019-10-15 03:05:11,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:11,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:11,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:11,227 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 03:05:11,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147557897] [2019-10-15 03:05:11,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:11,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:11,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847301632] [2019-10-15 03:05:11,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:11,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:11,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:11,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:11,231 INFO L87 Difference]: Start difference. First operand 668 states and 990 transitions. Second operand 5 states. [2019-10-15 03:05:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:12,306 INFO L93 Difference]: Finished difference Result 1132 states and 1671 transitions. [2019-10-15 03:05:12,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:12,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-15 03:05:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:12,312 INFO L225 Difference]: With dead ends: 1132 [2019-10-15 03:05:12,312 INFO L226 Difference]: Without dead ends: 717 [2019-10-15 03:05:12,314 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 03:05:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-15 03:05:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 656. [2019-10-15 03:05:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-10-15 03:05:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 966 transitions. [2019-10-15 03:05:12,355 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 966 transitions. Word has length 28 [2019-10-15 03:05:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:12,355 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 966 transitions. [2019-10-15 03:05:12,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 966 transitions. [2019-10-15 03:05:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 03:05:12,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:12,357 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] [2019-10-15 03:05:12,358 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash -808448961, now seen corresponding path program 1 times [2019-10-15 03:05:12,358 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:12,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197560960] [2019-10-15 03:05:12,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:12,412 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 03:05:12,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197560960] [2019-10-15 03:05:12,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:12,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:12,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167730992] [2019-10-15 03:05:12,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:12,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:12,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:12,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:12,415 INFO L87 Difference]: Start difference. First operand 656 states and 966 transitions. Second operand 3 states. [2019-10-15 03:05:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:12,494 INFO L93 Difference]: Finished difference Result 659 states and 968 transitions. [2019-10-15 03:05:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:12,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 03:05:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:12,500 INFO L225 Difference]: With dead ends: 659 [2019-10-15 03:05:12,500 INFO L226 Difference]: Without dead ends: 655 [2019-10-15 03:05:12,501 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 03:05:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-15 03:05:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-10-15 03:05:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-15 03:05:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 963 transitions. [2019-10-15 03:05:12,583 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 963 transitions. Word has length 29 [2019-10-15 03:05:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:12,584 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 963 transitions. [2019-10-15 03:05:12,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 963 transitions. [2019-10-15 03:05:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 03:05:12,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:12,586 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] [2019-10-15 03:05:12,587 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:12,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:12,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1336520426, now seen corresponding path program 1 times [2019-10-15 03:05:12,587 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:12,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821003238] [2019-10-15 03:05:12,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:12,637 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 03:05:12,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821003238] [2019-10-15 03:05:12,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:12,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:12,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145866165] [2019-10-15 03:05:12,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:12,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:12,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:12,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:12,640 INFO L87 Difference]: Start difference. First operand 655 states and 963 transitions. Second operand 3 states. [2019-10-15 03:05:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:12,688 INFO L93 Difference]: Finished difference Result 925 states and 1317 transitions. [2019-10-15 03:05:12,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:12,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-15 03:05:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:12,693 INFO L225 Difference]: With dead ends: 925 [2019-10-15 03:05:12,693 INFO L226 Difference]: Without dead ends: 737 [2019-10-15 03:05:12,694 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 03:05:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-10-15 03:05:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 637. [2019-10-15 03:05:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-15 03:05:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 902 transitions. [2019-10-15 03:05:12,732 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 902 transitions. Word has length 35 [2019-10-15 03:05:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:12,732 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 902 transitions. [2019-10-15 03:05:12,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 902 transitions. [2019-10-15 03:05:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 03:05:12,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:12,735 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 03:05:12,735 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:12,735 INFO L82 PathProgramCache]: Analyzing trace with hash -804463058, now seen corresponding path program 1 times [2019-10-15 03:05:12,736 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:12,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708276752] [2019-10-15 03:05:12,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:12,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 03:05:12,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708276752] [2019-10-15 03:05:12,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:12,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:12,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065804834] [2019-10-15 03:05:12,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:12,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:12,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:12,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:12,788 INFO L87 Difference]: Start difference. First operand 637 states and 902 transitions. Second operand 3 states. [2019-10-15 03:05:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:12,838 INFO L93 Difference]: Finished difference Result 703 states and 983 transitions. [2019-10-15 03:05:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:12,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-15 03:05:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:12,842 INFO L225 Difference]: With dead ends: 703 [2019-10-15 03:05:12,843 INFO L226 Difference]: Without dead ends: 685 [2019-10-15 03:05:12,843 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 03:05:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-15 03:05:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 670. [2019-10-15 03:05:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-15 03:05:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 940 transitions. [2019-10-15 03:05:12,879 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 940 transitions. Word has length 36 [2019-10-15 03:05:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:12,879 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 940 transitions. [2019-10-15 03:05:12,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 940 transitions. [2019-10-15 03:05:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:12,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:12,882 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] [2019-10-15 03:05:12,882 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:12,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1782796671, now seen corresponding path program 1 times [2019-10-15 03:05:12,883 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:12,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480879490] [2019-10-15 03:05:12,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:12,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480879490] [2019-10-15 03:05:12,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:12,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:05:12,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779281780] [2019-10-15 03:05:12,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:05:12,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:12,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:05:12,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:05:12,952 INFO L87 Difference]: Start difference. First operand 670 states and 940 transitions. Second operand 4 states. [2019-10-15 03:05:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:13,349 INFO L93 Difference]: Finished difference Result 771 states and 1056 transitions. [2019-10-15 03:05:13,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:05:13,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-15 03:05:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:13,353 INFO L225 Difference]: With dead ends: 771 [2019-10-15 03:05:13,354 INFO L226 Difference]: Without dead ends: 597 [2019-10-15 03:05:13,356 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 03:05:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-15 03:05:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 568. [2019-10-15 03:05:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-15 03:05:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 785 transitions. [2019-10-15 03:05:13,418 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 785 transitions. Word has length 42 [2019-10-15 03:05:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:13,418 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 785 transitions. [2019-10-15 03:05:13,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:05:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 785 transitions. [2019-10-15 03:05:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:13,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:13,420 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] [2019-10-15 03:05:13,421 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:13,421 INFO L82 PathProgramCache]: Analyzing trace with hash 432749520, now seen corresponding path program 1 times [2019-10-15 03:05:13,421 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:13,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342139791] [2019-10-15 03:05:13,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:13,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:13,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:13,462 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 03:05:13,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342139791] [2019-10-15 03:05:13,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:13,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:13,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260790130] [2019-10-15 03:05:13,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:13,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:13,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:13,464 INFO L87 Difference]: Start difference. First operand 568 states and 785 transitions. Second operand 3 states. [2019-10-15 03:05:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:13,515 INFO L93 Difference]: Finished difference Result 773 states and 1059 transitions. [2019-10-15 03:05:13,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:13,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-15 03:05:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:13,519 INFO L225 Difference]: With dead ends: 773 [2019-10-15 03:05:13,520 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 03:05:13,521 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 03:05:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 03:05:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 568. [2019-10-15 03:05:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-15 03:05:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 783 transitions. [2019-10-15 03:05:13,555 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 783 transitions. Word has length 42 [2019-10-15 03:05:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:13,556 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 783 transitions. [2019-10-15 03:05:13,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 783 transitions. [2019-10-15 03:05:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:05:13,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:13,558 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 03:05:13,558 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:13,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:13,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1161412528, now seen corresponding path program 1 times [2019-10-15 03:05:13,559 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:13,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063208997] [2019-10-15 03:05:13,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:13,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:13,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:13,597 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 03:05:13,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063208997] [2019-10-15 03:05:13,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:13,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:13,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529414511] [2019-10-15 03:05:13,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:13,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:13,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:13,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:13,599 INFO L87 Difference]: Start difference. First operand 568 states and 783 transitions. Second operand 3 states. [2019-10-15 03:05:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:13,702 INFO L93 Difference]: Finished difference Result 726 states and 994 transitions. [2019-10-15 03:05:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:13,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 03:05:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:13,708 INFO L225 Difference]: With dead ends: 726 [2019-10-15 03:05:13,708 INFO L226 Difference]: Without dead ends: 716 [2019-10-15 03:05:13,709 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 03:05:13,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-10-15 03:05:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 635. [2019-10-15 03:05:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-15 03:05:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 864 transitions. [2019-10-15 03:05:13,752 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 864 transitions. Word has length 40 [2019-10-15 03:05:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:13,752 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 864 transitions. [2019-10-15 03:05:13,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 864 transitions. [2019-10-15 03:05:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:13,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:13,755 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] [2019-10-15 03:05:13,755 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:13,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1003994184, now seen corresponding path program 1 times [2019-10-15 03:05:13,756 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:13,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295502992] [2019-10-15 03:05:13,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:13,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:13,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:13,794 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 03:05:13,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295502992] [2019-10-15 03:05:13,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:13,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:13,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57289756] [2019-10-15 03:05:13,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:13,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:13,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:13,796 INFO L87 Difference]: Start difference. First operand 635 states and 864 transitions. Second operand 3 states. [2019-10-15 03:05:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:13,834 INFO L93 Difference]: Finished difference Result 744 states and 989 transitions. [2019-10-15 03:05:13,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:13,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 03:05:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:13,838 INFO L225 Difference]: With dead ends: 744 [2019-10-15 03:05:13,838 INFO L226 Difference]: Without dead ends: 658 [2019-10-15 03:05:13,839 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 03:05:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-10-15 03:05:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 632. [2019-10-15 03:05:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-15 03:05:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 856 transitions. [2019-10-15 03:05:13,879 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 856 transitions. Word has length 43 [2019-10-15 03:05:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:13,880 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 856 transitions. [2019-10-15 03:05:13,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 856 transitions. [2019-10-15 03:05:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:05:13,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:13,882 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] [2019-10-15 03:05:13,883 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1200179264, now seen corresponding path program 1 times [2019-10-15 03:05:13,883 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:13,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579665081] [2019-10-15 03:05:13,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:13,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:13,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:14,035 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 03:05:14,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579665081] [2019-10-15 03:05:14,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:14,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:14,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447586987] [2019-10-15 03:05:14,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:14,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:14,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:14,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:14,038 INFO L87 Difference]: Start difference. First operand 632 states and 856 transitions. Second operand 10 states. [2019-10-15 03:05:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:17,025 INFO L93 Difference]: Finished difference Result 808 states and 1130 transitions. [2019-10-15 03:05:17,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:05:17,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-10-15 03:05:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:17,033 INFO L225 Difference]: With dead ends: 808 [2019-10-15 03:05:17,033 INFO L226 Difference]: Without dead ends: 800 [2019-10-15 03:05:17,034 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:05:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-10-15 03:05:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 639. [2019-10-15 03:05:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-15 03:05:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 858 transitions. [2019-10-15 03:05:17,074 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 858 transitions. Word has length 41 [2019-10-15 03:05:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:17,075 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 858 transitions. [2019-10-15 03:05:17,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 858 transitions. [2019-10-15 03:05:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:05:17,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:17,077 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] [2019-10-15 03:05:17,077 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1361312649, now seen corresponding path program 1 times [2019-10-15 03:05:17,078 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:17,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461576130] [2019-10-15 03:05:17,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:17,136 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 03:05:17,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461576130] [2019-10-15 03:05:17,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:17,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:17,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912414844] [2019-10-15 03:05:17,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:17,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:17,139 INFO L87 Difference]: Start difference. First operand 639 states and 858 transitions. Second operand 7 states. [2019-10-15 03:05:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:18,845 INFO L93 Difference]: Finished difference Result 768 states and 1067 transitions. [2019-10-15 03:05:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:18,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-15 03:05:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:18,853 INFO L225 Difference]: With dead ends: 768 [2019-10-15 03:05:18,853 INFO L226 Difference]: Without dead ends: 713 [2019-10-15 03:05:18,854 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 03:05:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-10-15 03:05:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 639. [2019-10-15 03:05:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-15 03:05:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 856 transitions. [2019-10-15 03:05:18,900 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 856 transitions. Word has length 41 [2019-10-15 03:05:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:18,900 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 856 transitions. [2019-10-15 03:05:18,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 856 transitions. [2019-10-15 03:05:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:18,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:18,902 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] [2019-10-15 03:05:18,903 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash 808827987, now seen corresponding path program 1 times [2019-10-15 03:05:18,903 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:18,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234324826] [2019-10-15 03:05:18,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:18,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:18,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:19,068 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 03:05:19,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234324826] [2019-10-15 03:05:19,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:19,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:19,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492011126] [2019-10-15 03:05:19,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:19,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:19,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:19,070 INFO L87 Difference]: Start difference. First operand 639 states and 856 transitions. Second operand 9 states. [2019-10-15 03:05:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,912 INFO L93 Difference]: Finished difference Result 762 states and 1049 transitions. [2019-10-15 03:05:21,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 03:05:21,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-15 03:05:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,916 INFO L225 Difference]: With dead ends: 762 [2019-10-15 03:05:21,917 INFO L226 Difference]: Without dead ends: 709 [2019-10-15 03:05:21,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:05:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-10-15 03:05:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 574. [2019-10-15 03:05:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-15 03:05:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 772 transitions. [2019-10-15 03:05:21,960 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 772 transitions. Word has length 42 [2019-10-15 03:05:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,961 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 772 transitions. [2019-10-15 03:05:21,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 772 transitions. [2019-10-15 03:05:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:21,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,963 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] [2019-10-15 03:05:21,963 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash -971270421, now seen corresponding path program 1 times [2019-10-15 03:05:21,964 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285426864] [2019-10-15 03:05:21,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:22,007 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 03:05:22,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285426864] [2019-10-15 03:05:22,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:22,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:22,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683164331] [2019-10-15 03:05:22,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:22,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:22,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:22,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:22,009 INFO L87 Difference]: Start difference. First operand 574 states and 772 transitions. Second operand 3 states. [2019-10-15 03:05:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:22,195 INFO L93 Difference]: Finished difference Result 715 states and 955 transitions. [2019-10-15 03:05:22,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:22,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-15 03:05:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:22,201 INFO L225 Difference]: With dead ends: 715 [2019-10-15 03:05:22,201 INFO L226 Difference]: Without dead ends: 704 [2019-10-15 03:05:22,202 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 03:05:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-10-15 03:05:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 621. [2019-10-15 03:05:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-15 03:05:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 823 transitions. [2019-10-15 03:05:22,257 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 823 transitions. Word has length 42 [2019-10-15 03:05:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:22,258 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 823 transitions. [2019-10-15 03:05:22,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 823 transitions. [2019-10-15 03:05:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:22,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:22,263 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] [2019-10-15 03:05:22,263 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:22,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:22,264 INFO L82 PathProgramCache]: Analyzing trace with hash 399258757, now seen corresponding path program 1 times [2019-10-15 03:05:22,264 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:22,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416811627] [2019-10-15 03:05:22,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:22,439 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 03:05:22,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416811627] [2019-10-15 03:05:22,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:22,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:22,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227478245] [2019-10-15 03:05:22,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:22,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:22,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:22,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:22,443 INFO L87 Difference]: Start difference. First operand 621 states and 823 transitions. Second operand 8 states. [2019-10-15 03:05:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:22,657 INFO L93 Difference]: Finished difference Result 636 states and 840 transitions. [2019-10-15 03:05:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:22,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-15 03:05:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:22,661 INFO L225 Difference]: With dead ends: 636 [2019-10-15 03:05:22,661 INFO L226 Difference]: Without dead ends: 632 [2019-10-15 03:05:22,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-15 03:05:22,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 630. [2019-10-15 03:05:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-15 03:05:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 834 transitions. [2019-10-15 03:05:22,711 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 834 transitions. Word has length 43 [2019-10-15 03:05:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:22,712 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 834 transitions. [2019-10-15 03:05:22,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 834 transitions. [2019-10-15 03:05:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:22,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:22,715 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] [2019-10-15 03:05:22,715 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:22,716 INFO L82 PathProgramCache]: Analyzing trace with hash 398981927, now seen corresponding path program 1 times [2019-10-15 03:05:22,716 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:22,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300608992] [2019-10-15 03:05:22,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,717 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:22,796 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 03:05:22,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300608992] [2019-10-15 03:05:22,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:22,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:22,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58394691] [2019-10-15 03:05:22,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:22,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:22,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:22,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:22,799 INFO L87 Difference]: Start difference. First operand 630 states and 834 transitions. Second operand 5 states. [2019-10-15 03:05:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:23,779 INFO L93 Difference]: Finished difference Result 715 states and 953 transitions. [2019-10-15 03:05:23,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:23,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 03:05:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:23,787 INFO L225 Difference]: With dead ends: 715 [2019-10-15 03:05:23,787 INFO L226 Difference]: Without dead ends: 685 [2019-10-15 03:05:23,788 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 03:05:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-15 03:05:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 606. [2019-10-15 03:05:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-15 03:05:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 807 transitions. [2019-10-15 03:05:23,860 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 807 transitions. Word has length 43 [2019-10-15 03:05:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:23,861 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 807 transitions. [2019-10-15 03:05:23,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 807 transitions. [2019-10-15 03:05:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 03:05:23,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:23,864 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] [2019-10-15 03:05:23,865 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:23,865 INFO L82 PathProgramCache]: Analyzing trace with hash -456522929, now seen corresponding path program 1 times [2019-10-15 03:05:23,865 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:23,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601816604] [2019-10-15 03:05:23,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:23,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601816604] [2019-10-15 03:05:23,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:23,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:23,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575244748] [2019-10-15 03:05:23,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:23,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:23,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:23,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:23,952 INFO L87 Difference]: Start difference. First operand 606 states and 807 transitions. Second operand 3 states. [2019-10-15 03:05:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:24,127 INFO L93 Difference]: Finished difference Result 631 states and 835 transitions. [2019-10-15 03:05:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:24,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-15 03:05:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:24,133 INFO L225 Difference]: With dead ends: 631 [2019-10-15 03:05:24,133 INFO L226 Difference]: Without dead ends: 624 [2019-10-15 03:05:24,135 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 03:05:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-15 03:05:24,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 622. [2019-10-15 03:05:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-15 03:05:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 825 transitions. [2019-10-15 03:05:24,217 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 825 transitions. Word has length 45 [2019-10-15 03:05:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:24,218 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 825 transitions. [2019-10-15 03:05:24,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 825 transitions. [2019-10-15 03:05:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:24,221 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:24,221 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 03:05:24,221 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:24,222 INFO L82 PathProgramCache]: Analyzing trace with hash -185372726, now seen corresponding path program 1 times [2019-10-15 03:05:24,222 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:24,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425328653] [2019-10-15 03:05:24,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:24,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425328653] [2019-10-15 03:05:24,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:24,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:24,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721686884] [2019-10-15 03:05:24,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:24,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:24,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:24,296 INFO L87 Difference]: Start difference. First operand 622 states and 825 transitions. Second operand 3 states. [2019-10-15 03:05:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:24,402 INFO L93 Difference]: Finished difference Result 791 states and 1043 transitions. [2019-10-15 03:05:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:24,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-15 03:05:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:24,406 INFO L225 Difference]: With dead ends: 791 [2019-10-15 03:05:24,406 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 03:05:24,407 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 03:05:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 03:05:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 03:05:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 03:05:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 792 transitions. [2019-10-15 03:05:24,578 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 792 transitions. Word has length 50 [2019-10-15 03:05:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:24,579 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 792 transitions. [2019-10-15 03:05:24,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 792 transitions. [2019-10-15 03:05:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:05:24,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:24,582 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 03:05:24,583 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:24,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:24,583 INFO L82 PathProgramCache]: Analyzing trace with hash -397376972, now seen corresponding path program 1 times [2019-10-15 03:05:24,583 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:24,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069431330] [2019-10-15 03:05:24,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:24,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069431330] [2019-10-15 03:05:24,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:24,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:05:24,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29748403] [2019-10-15 03:05:24,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:05:24,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:24,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:05:24,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:24,845 INFO L87 Difference]: Start difference. First operand 598 states and 792 transitions. Second operand 13 states. [2019-10-15 03:05:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:27,693 INFO L93 Difference]: Finished difference Result 628 states and 824 transitions. [2019-10-15 03:05:27,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:05:27,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-10-15 03:05:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:27,707 INFO L225 Difference]: With dead ends: 628 [2019-10-15 03:05:27,707 INFO L226 Difference]: Without dead ends: 622 [2019-10-15 03:05:27,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-10-15 03:05:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-15 03:05:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 598. [2019-10-15 03:05:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 03:05:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 791 transitions. [2019-10-15 03:05:27,755 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 791 transitions. Word has length 47 [2019-10-15 03:05:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:27,756 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 791 transitions. [2019-10-15 03:05:27,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:05:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 791 transitions. [2019-10-15 03:05:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:05:27,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,759 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 03:05:27,759 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,759 INFO L82 PathProgramCache]: Analyzing trace with hash 878367500, now seen corresponding path program 1 times [2019-10-15 03:05:27,760 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79763477] [2019-10-15 03:05:27,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:27,894 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 03:05:27,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79763477] [2019-10-15 03:05:27,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:27,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:27,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707016920] [2019-10-15 03:05:27,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:27,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:27,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:27,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:27,896 INFO L87 Difference]: Start difference. First operand 598 states and 791 transitions. Second operand 9 states. [2019-10-15 03:05:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,166 INFO L93 Difference]: Finished difference Result 622 states and 817 transitions. [2019-10-15 03:05:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:28,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-10-15 03:05:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,172 INFO L225 Difference]: With dead ends: 622 [2019-10-15 03:05:28,172 INFO L226 Difference]: Without dead ends: 593 [2019-10-15 03:05:28,173 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-15 03:05:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-15 03:05:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-15 03:05:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 774 transitions. [2019-10-15 03:05:28,218 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 774 transitions. Word has length 48 [2019-10-15 03:05:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,219 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 774 transitions. [2019-10-15 03:05:28,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 774 transitions. [2019-10-15 03:05:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:28,221 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,221 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 03:05:28,222 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1711324058, now seen corresponding path program 1 times [2019-10-15 03:05:28,222 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985280744] [2019-10-15 03:05:28,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,311 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 03:05:28,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985280744] [2019-10-15 03:05:28,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:28,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530563097] [2019-10-15 03:05:28,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:28,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:28,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:28,316 INFO L87 Difference]: Start difference. First operand 593 states and 774 transitions. Second operand 10 states. [2019-10-15 03:05:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,549 INFO L93 Difference]: Finished difference Result 609 states and 791 transitions. [2019-10-15 03:05:28,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 03:05:28,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-15 03:05:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,553 INFO L225 Difference]: With dead ends: 609 [2019-10-15 03:05:28,553 INFO L226 Difference]: Without dead ends: 591 [2019-10-15 03:05:28,554 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 03:05:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-15 03:05:28,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-15 03:05:28,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-15 03:05:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 770 transitions. [2019-10-15 03:05:28,595 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 770 transitions. Word has length 50 [2019-10-15 03:05:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,595 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 770 transitions. [2019-10-15 03:05:28,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 770 transitions. [2019-10-15 03:05:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:28,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,597 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 03:05:28,598 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,598 INFO L82 PathProgramCache]: Analyzing trace with hash 211323632, now seen corresponding path program 1 times [2019-10-15 03:05:28,598 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907914739] [2019-10-15 03:05:28,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,743 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 03:05:28,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907914739] [2019-10-15 03:05:28,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:28,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590085812] [2019-10-15 03:05:28,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:28,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:28,745 INFO L87 Difference]: Start difference. First operand 591 states and 770 transitions. Second operand 11 states. [2019-10-15 03:05:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,021 INFO L93 Difference]: Finished difference Result 607 states and 787 transitions. [2019-10-15 03:05:29,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:29,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-10-15 03:05:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,026 INFO L225 Difference]: With dead ends: 607 [2019-10-15 03:05:29,026 INFO L226 Difference]: Without dead ends: 589 [2019-10-15 03:05:29,029 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 03:05:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-15 03:05:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-15 03:05:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-15 03:05:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 766 transitions. [2019-10-15 03:05:29,074 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 766 transitions. Word has length 50 [2019-10-15 03:05:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,074 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 766 transitions. [2019-10-15 03:05:29,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 766 transitions. [2019-10-15 03:05:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 03:05:29,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,079 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 03:05:29,079 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1636630726, now seen corresponding path program 1 times [2019-10-15 03:05:29,080 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126491422] [2019-10-15 03:05:29,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:29,198 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 03:05:29,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126491422] [2019-10-15 03:05:29,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:29,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:29,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640905779] [2019-10-15 03:05:29,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:29,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:29,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:29,200 INFO L87 Difference]: Start difference. First operand 589 states and 766 transitions. Second operand 10 states. [2019-10-15 03:05:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,417 INFO L93 Difference]: Finished difference Result 602 states and 780 transitions. [2019-10-15 03:05:29,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 03:05:29,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-10-15 03:05:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,421 INFO L225 Difference]: With dead ends: 602 [2019-10-15 03:05:29,421 INFO L226 Difference]: Without dead ends: 584 [2019-10-15 03:05:29,422 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 03:05:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-15 03:05:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-15 03:05:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-15 03:05:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 759 transitions. [2019-10-15 03:05:29,466 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 759 transitions. Word has length 49 [2019-10-15 03:05:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,468 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 759 transitions. [2019-10-15 03:05:29,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 759 transitions. [2019-10-15 03:05:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:29,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,473 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 03:05:29,473 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,474 INFO L82 PathProgramCache]: Analyzing trace with hash -572398302, now seen corresponding path program 1 times [2019-10-15 03:05:29,474 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814514207] [2019-10-15 03:05:29,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:29,649 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 03:05:29,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814514207] [2019-10-15 03:05:29,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:29,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:05:29,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826294503] [2019-10-15 03:05:29,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:05:29,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:29,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:05:29,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:29,687 INFO L87 Difference]: Start difference. First operand 584 states and 759 transitions. Second operand 12 states. [2019-10-15 03:05:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,992 INFO L93 Difference]: Finished difference Result 609 states and 786 transitions. [2019-10-15 03:05:29,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:29,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-15 03:05:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,997 INFO L225 Difference]: With dead ends: 609 [2019-10-15 03:05:29,997 INFO L226 Difference]: Without dead ends: 586 [2019-10-15 03:05:29,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-15 03:05:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 582. [2019-10-15 03:05:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 03:05:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 755 transitions. [2019-10-15 03:05:30,039 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 755 transitions. Word has length 54 [2019-10-15 03:05:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,040 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 755 transitions. [2019-10-15 03:05:30,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:05:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 755 transitions. [2019-10-15 03:05:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:05:30,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,043 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 03:05:30,043 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,043 INFO L82 PathProgramCache]: Analyzing trace with hash 916624012, now seen corresponding path program 1 times [2019-10-15 03:05:30,043 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586404770] [2019-10-15 03:05:30,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,183 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 03:05:30,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586404770] [2019-10-15 03:05:30,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:05:30,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173407128] [2019-10-15 03:05:30,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:05:30,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:05:30,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:30,185 INFO L87 Difference]: Start difference. First operand 582 states and 755 transitions. Second operand 12 states. [2019-10-15 03:05:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,456 INFO L93 Difference]: Finished difference Result 607 states and 782 transitions. [2019-10-15 03:05:30,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:30,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-10-15 03:05:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,463 INFO L225 Difference]: With dead ends: 607 [2019-10-15 03:05:30,463 INFO L226 Difference]: Without dead ends: 584 [2019-10-15 03:05:30,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:30,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-15 03:05:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-10-15 03:05:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-15 03:05:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 751 transitions. [2019-10-15 03:05:30,507 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 751 transitions. Word has length 53 [2019-10-15 03:05:30,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,507 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 751 transitions. [2019-10-15 03:05:30,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:05:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 751 transitions. [2019-10-15 03:05:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:05:30,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,510 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] [2019-10-15 03:05:30,510 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,510 INFO L82 PathProgramCache]: Analyzing trace with hash 911278729, now seen corresponding path program 1 times [2019-10-15 03:05:30,511 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650620976] [2019-10-15 03:05:30,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:30,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650620976] [2019-10-15 03:05:30,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:05:30,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236050034] [2019-10-15 03:05:30,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:05:30,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:05:30,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:30,650 INFO L87 Difference]: Start difference. First operand 580 states and 751 transitions. Second operand 12 states. [2019-10-15 03:05:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,930 INFO L93 Difference]: Finished difference Result 603 states and 776 transitions. [2019-10-15 03:05:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:30,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-15 03:05:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,936 INFO L225 Difference]: With dead ends: 603 [2019-10-15 03:05:30,937 INFO L226 Difference]: Without dead ends: 579 [2019-10-15 03:05:30,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-15 03:05:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-15 03:05:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-15 03:05:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 740 transitions. [2019-10-15 03:05:30,986 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 740 transitions. Word has length 51 [2019-10-15 03:05:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,987 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 740 transitions. [2019-10-15 03:05:30,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:05:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 740 transitions. [2019-10-15 03:05:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:30,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,990 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 03:05:30,990 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash -126879601, now seen corresponding path program 1 times [2019-10-15 03:05:30,991 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887725174] [2019-10-15 03:05:30,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:31,087 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 03:05:31,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887725174] [2019-10-15 03:05:31,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:31,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:31,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548383992] [2019-10-15 03:05:31,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:31,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:31,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:31,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:31,089 INFO L87 Difference]: Start difference. First operand 579 states and 740 transitions. Second operand 5 states. [2019-10-15 03:05:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:32,129 INFO L93 Difference]: Finished difference Result 962 states and 1289 transitions. [2019-10-15 03:05:32,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:32,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-15 03:05:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:32,134 INFO L225 Difference]: With dead ends: 962 [2019-10-15 03:05:32,134 INFO L226 Difference]: Without dead ends: 837 [2019-10-15 03:05:32,135 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 03:05:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-10-15 03:05:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 610. [2019-10-15 03:05:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-15 03:05:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 785 transitions. [2019-10-15 03:05:32,186 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 785 transitions. Word has length 54 [2019-10-15 03:05:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:32,187 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 785 transitions. [2019-10-15 03:05:32,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 785 transitions. [2019-10-15 03:05:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:05:32,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:32,189 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] [2019-10-15 03:05:32,189 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash -264370587, now seen corresponding path program 1 times [2019-10-15 03:05:32,190 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:32,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832226118] [2019-10-15 03:05:32,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,281 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 03:05:32,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832226118] [2019-10-15 03:05:32,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:32,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94636366] [2019-10-15 03:05:32,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:32,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:32,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:32,283 INFO L87 Difference]: Start difference. First operand 610 states and 785 transitions. Second operand 9 states. [2019-10-15 03:05:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:32,505 INFO L93 Difference]: Finished difference Result 634 states and 811 transitions. [2019-10-15 03:05:32,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:32,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-15 03:05:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:32,516 INFO L225 Difference]: With dead ends: 634 [2019-10-15 03:05:32,517 INFO L226 Difference]: Without dead ends: 583 [2019-10-15 03:05:32,518 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 03:05:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-15 03:05:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-15 03:05:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-15 03:05:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 737 transitions. [2019-10-15 03:05:32,561 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 737 transitions. Word has length 51 [2019-10-15 03:05:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:32,561 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 737 transitions. [2019-10-15 03:05:32,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 737 transitions. [2019-10-15 03:05:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:32,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:32,563 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 03:05:32,564 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash -678859389, now seen corresponding path program 1 times [2019-10-15 03:05:32,564 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:32,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383962763] [2019-10-15 03:05:32,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,695 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 03:05:32,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383962763] [2019-10-15 03:05:32,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:32,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163312000] [2019-10-15 03:05:32,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:32,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:32,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:32,697 INFO L87 Difference]: Start difference. First operand 583 states and 737 transitions. Second operand 11 states. [2019-10-15 03:05:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:32,828 INFO L93 Difference]: Finished difference Result 644 states and 816 transitions. [2019-10-15 03:05:32,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:32,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-15 03:05:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:32,832 INFO L225 Difference]: With dead ends: 644 [2019-10-15 03:05:32,832 INFO L226 Difference]: Without dead ends: 593 [2019-10-15 03:05:32,833 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 03:05:32,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-15 03:05:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 587. [2019-10-15 03:05:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-15 03:05:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 754 transitions. [2019-10-15 03:05:32,875 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 754 transitions. Word has length 54 [2019-10-15 03:05:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:32,876 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 754 transitions. [2019-10-15 03:05:32,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 754 transitions. [2019-10-15 03:05:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 03:05:32,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:32,878 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:05:32,878 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:32,879 INFO L82 PathProgramCache]: Analyzing trace with hash -289383489, now seen corresponding path program 1 times [2019-10-15 03:05:32,879 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:32,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612583558] [2019-10-15 03:05:32,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:05:32,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612583558] [2019-10-15 03:05:32,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:32,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549700298] [2019-10-15 03:05:32,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:32,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:32,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:32,949 INFO L87 Difference]: Start difference. First operand 587 states and 754 transitions. Second operand 5 states. [2019-10-15 03:05:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:33,549 INFO L93 Difference]: Finished difference Result 877 states and 1124 transitions. [2019-10-15 03:05:33,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:33,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-15 03:05:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:33,554 INFO L225 Difference]: With dead ends: 877 [2019-10-15 03:05:33,554 INFO L226 Difference]: Without dead ends: 587 [2019-10-15 03:05:33,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-15 03:05:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-15 03:05:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-15 03:05:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 742 transitions. [2019-10-15 03:05:33,674 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 742 transitions. Word has length 67 [2019-10-15 03:05:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:33,674 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 742 transitions. [2019-10-15 03:05:33,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 742 transitions. [2019-10-15 03:05:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-15 03:05:33,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:33,678 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:05:33,678 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:33,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash 750568491, now seen corresponding path program 1 times [2019-10-15 03:05:33,679 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:33,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914210805] [2019-10-15 03:05:33,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:05:33,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914210805] [2019-10-15 03:05:33,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:33,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:33,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966524663] [2019-10-15 03:05:33,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:33,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:33,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:33,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:33,721 INFO L87 Difference]: Start difference. First operand 587 states and 742 transitions. Second operand 3 states. [2019-10-15 03:05:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:33,757 INFO L93 Difference]: Finished difference Result 717 states and 897 transitions. [2019-10-15 03:05:33,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:33,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-15 03:05:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:33,761 INFO L225 Difference]: With dead ends: 717 [2019-10-15 03:05:33,761 INFO L226 Difference]: Without dead ends: 565 [2019-10-15 03:05:33,763 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 03:05:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-15 03:05:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2019-10-15 03:05:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-15 03:05:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 705 transitions. [2019-10-15 03:05:33,804 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 705 transitions. Word has length 68 [2019-10-15 03:05:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:33,804 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 705 transitions. [2019-10-15 03:05:33,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 705 transitions. [2019-10-15 03:05:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:05:33,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:33,809 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 03:05:33,809 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:33,810 INFO L82 PathProgramCache]: Analyzing trace with hash 876079827, now seen corresponding path program 1 times [2019-10-15 03:05:33,810 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:33,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673666328] [2019-10-15 03:05:33,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:34,127 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 03:05:34,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673666328] [2019-10-15 03:05:34,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:34,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 03:05:34,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679905239] [2019-10-15 03:05:34,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 03:05:34,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:34,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 03:05:34,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:05:34,130 INFO L87 Difference]: Start difference. First operand 563 states and 705 transitions. Second operand 14 states. [2019-10-15 03:05:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:34,698 INFO L93 Difference]: Finished difference Result 605 states and 755 transitions. [2019-10-15 03:05:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 03:05:34,698 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-15 03:05:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:34,702 INFO L225 Difference]: With dead ends: 605 [2019-10-15 03:05:34,702 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 03:05:34,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:05:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 03:05:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 567. [2019-10-15 03:05:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-15 03:05:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 711 transitions. [2019-10-15 03:05:34,761 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 711 transitions. Word has length 55 [2019-10-15 03:05:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:34,762 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 711 transitions. [2019-10-15 03:05:34,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 03:05:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 711 transitions. [2019-10-15 03:05:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:05:34,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:34,764 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 03:05:34,765 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:34,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1672905161, now seen corresponding path program 1 times [2019-10-15 03:05:34,765 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:34,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489182542] [2019-10-15 03:05:34,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:34,885 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 03:05:34,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489182542] [2019-10-15 03:05:34,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:34,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:05:34,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709376319] [2019-10-15 03:05:34,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:05:34,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:34,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:05:34,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:34,887 INFO L87 Difference]: Start difference. First operand 567 states and 711 transitions. Second operand 13 states. [2019-10-15 03:05:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:35,187 INFO L93 Difference]: Finished difference Result 583 states and 728 transitions. [2019-10-15 03:05:35,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:05:35,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-10-15 03:05:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:35,194 INFO L225 Difference]: With dead ends: 583 [2019-10-15 03:05:35,194 INFO L226 Difference]: Without dead ends: 562 [2019-10-15 03:05:35,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:05:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-15 03:05:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-15 03:05:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 03:05:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 704 transitions. [2019-10-15 03:05:35,247 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 704 transitions. Word has length 55 [2019-10-15 03:05:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:35,247 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 704 transitions. [2019-10-15 03:05:35,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:05:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 704 transitions. [2019-10-15 03:05:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:05:35,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:35,250 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 03:05:35,250 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:35,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:35,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2129275013, now seen corresponding path program 1 times [2019-10-15 03:05:35,251 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:35,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724228790] [2019-10-15 03:05:35,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:35,369 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 03:05:35,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724228790] [2019-10-15 03:05:35,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:35,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:35,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69192026] [2019-10-15 03:05:35,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:35,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:35,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:35,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:35,371 INFO L87 Difference]: Start difference. First operand 562 states and 704 transitions. Second operand 5 states. [2019-10-15 03:05:35,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:35,882 INFO L93 Difference]: Finished difference Result 657 states and 811 transitions. [2019-10-15 03:05:35,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:35,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 03:05:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:35,909 INFO L225 Difference]: With dead ends: 657 [2019-10-15 03:05:35,909 INFO L226 Difference]: Without dead ends: 584 [2019-10-15 03:05:35,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-15 03:05:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 563. [2019-10-15 03:05:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-15 03:05:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 702 transitions. [2019-10-15 03:05:35,957 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 702 transitions. Word has length 59 [2019-10-15 03:05:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:35,958 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 702 transitions. [2019-10-15 03:05:35,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 702 transitions. [2019-10-15 03:05:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:05:35,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:35,960 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 03:05:35,961 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:35,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2136791779, now seen corresponding path program 1 times [2019-10-15 03:05:35,961 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:35,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981609597] [2019-10-15 03:05:35,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:36,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 03:05:36,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981609597] [2019-10-15 03:05:36,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:36,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:36,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93213085] [2019-10-15 03:05:36,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:36,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:36,319 INFO L87 Difference]: Start difference. First operand 563 states and 702 transitions. Second operand 11 states. [2019-10-15 03:05:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:36,510 INFO L93 Difference]: Finished difference Result 599 states and 743 transitions. [2019-10-15 03:05:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:36,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-15 03:05:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:36,515 INFO L225 Difference]: With dead ends: 599 [2019-10-15 03:05:36,515 INFO L226 Difference]: Without dead ends: 576 [2019-10-15 03:05:36,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-15 03:05:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 563. [2019-10-15 03:05:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-15 03:05:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 702 transitions. [2019-10-15 03:05:36,576 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 702 transitions. Word has length 56 [2019-10-15 03:05:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:36,577 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 702 transitions. [2019-10-15 03:05:36,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 702 transitions. [2019-10-15 03:05:36,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:05:36,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:36,580 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 03:05:36,580 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:36,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:36,581 INFO L82 PathProgramCache]: Analyzing trace with hash -59246208, now seen corresponding path program 1 times [2019-10-15 03:05:36,581 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:36,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896958500] [2019-10-15 03:05:36,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:36,625 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 03:05:36,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896958500] [2019-10-15 03:05:36,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:36,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:36,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746806435] [2019-10-15 03:05:36,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:36,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:36,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:36,627 INFO L87 Difference]: Start difference. First operand 563 states and 702 transitions. Second operand 3 states. [2019-10-15 03:05:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:36,672 INFO L93 Difference]: Finished difference Result 714 states and 878 transitions. [2019-10-15 03:05:36,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:36,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-15 03:05:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:36,676 INFO L225 Difference]: With dead ends: 714 [2019-10-15 03:05:36,676 INFO L226 Difference]: Without dead ends: 520 [2019-10-15 03:05:36,677 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 03:05:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-10-15 03:05:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 502. [2019-10-15 03:05:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-15 03:05:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 602 transitions. [2019-10-15 03:05:36,730 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 602 transitions. Word has length 56 [2019-10-15 03:05:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:36,731 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 602 transitions. [2019-10-15 03:05:36,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 602 transitions. [2019-10-15 03:05:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:05:36,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:36,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, 1] [2019-10-15 03:05:36,733 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash -775523185, now seen corresponding path program 1 times [2019-10-15 03:05:36,733 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:36,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772223950] [2019-10-15 03:05:36,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:36,951 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 03:05:36,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772223950] [2019-10-15 03:05:36,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:36,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:05:36,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808678238] [2019-10-15 03:05:36,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:05:36,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:36,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:05:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:36,955 INFO L87 Difference]: Start difference. First operand 502 states and 602 transitions. Second operand 13 states. [2019-10-15 03:05:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:37,283 INFO L93 Difference]: Finished difference Result 518 states and 619 transitions. [2019-10-15 03:05:37,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:05:37,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-10-15 03:05:37,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:37,287 INFO L225 Difference]: With dead ends: 518 [2019-10-15 03:05:37,288 INFO L226 Difference]: Without dead ends: 497 [2019-10-15 03:05:37,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:05:37,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-10-15 03:05:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2019-10-15 03:05:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-10-15 03:05:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 595 transitions. [2019-10-15 03:05:37,325 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 595 transitions. Word has length 56 [2019-10-15 03:05:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:37,326 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 595 transitions. [2019-10-15 03:05:37,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:05:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 595 transitions. [2019-10-15 03:05:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:05:37,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:37,328 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] [2019-10-15 03:05:37,328 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:37,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1844599993, now seen corresponding path program 1 times [2019-10-15 03:05:37,329 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:37,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499004723] [2019-10-15 03:05:37,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:37,460 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 03:05:37,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499004723] [2019-10-15 03:05:37,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:37,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:37,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013250795] [2019-10-15 03:05:37,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:37,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:37,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:37,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:37,462 INFO L87 Difference]: Start difference. First operand 497 states and 595 transitions. Second operand 11 states. [2019-10-15 03:05:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:37,591 INFO L93 Difference]: Finished difference Result 521 states and 621 transitions. [2019-10-15 03:05:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:37,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-10-15 03:05:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:37,594 INFO L225 Difference]: With dead ends: 521 [2019-10-15 03:05:37,594 INFO L226 Difference]: Without dead ends: 494 [2019-10-15 03:05:37,594 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 03:05:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-15 03:05:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2019-10-15 03:05:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-15 03:05:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 590 transitions. [2019-10-15 03:05:37,631 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 590 transitions. Word has length 57 [2019-10-15 03:05:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:37,632 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 590 transitions. [2019-10-15 03:05:37,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 590 transitions. [2019-10-15 03:05:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:05:37,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:37,634 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 03:05:37,634 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:37,634 INFO L82 PathProgramCache]: Analyzing trace with hash -504628611, now seen corresponding path program 1 times [2019-10-15 03:05:37,634 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:37,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297091443] [2019-10-15 03:05:37,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:37,760 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 03:05:37,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297091443] [2019-10-15 03:05:37,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:37,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:05:37,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327881290] [2019-10-15 03:05:37,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:05:37,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:37,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:05:37,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:37,762 INFO L87 Difference]: Start difference. First operand 494 states and 590 transitions. Second operand 12 states. [2019-10-15 03:05:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:38,017 INFO L93 Difference]: Finished difference Result 517 states and 614 transitions. [2019-10-15 03:05:38,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:38,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-15 03:05:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:38,019 INFO L225 Difference]: With dead ends: 517 [2019-10-15 03:05:38,020 INFO L226 Difference]: Without dead ends: 494 [2019-10-15 03:05:38,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-15 03:05:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2019-10-15 03:05:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-15 03:05:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 586 transitions. [2019-10-15 03:05:38,064 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 586 transitions. Word has length 59 [2019-10-15 03:05:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:38,064 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 586 transitions. [2019-10-15 03:05:38,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:05:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 586 transitions. [2019-10-15 03:05:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:05:38,066 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:38,067 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 03:05:38,067 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1947857079, now seen corresponding path program 1 times [2019-10-15 03:05:38,068 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:38,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652713192] [2019-10-15 03:05:38,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:38,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652713192] [2019-10-15 03:05:38,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:38,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 03:05:38,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291134169] [2019-10-15 03:05:38,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 03:05:38,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:38,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 03:05:38,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:05:38,255 INFO L87 Difference]: Start difference. First operand 492 states and 586 transitions. Second operand 14 states. [2019-10-15 03:05:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:38,586 INFO L93 Difference]: Finished difference Result 517 states and 613 transitions. [2019-10-15 03:05:38,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:05:38,586 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-10-15 03:05:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:38,588 INFO L225 Difference]: With dead ends: 517 [2019-10-15 03:05:38,588 INFO L226 Difference]: Without dead ends: 491 [2019-10-15 03:05:38,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:05:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-15 03:05:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2019-10-15 03:05:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-10-15 03:05:38,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 581 transitions. [2019-10-15 03:05:38,631 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 581 transitions. Word has length 59 [2019-10-15 03:05:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:38,632 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 581 transitions. [2019-10-15 03:05:38,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 03:05:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 581 transitions. [2019-10-15 03:05:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:05:38,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:38,634 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 03:05:38,634 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:38,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1680440093, now seen corresponding path program 1 times [2019-10-15 03:05:38,635 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:38,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296970228] [2019-10-15 03:05:38,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:38,837 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 03:05:38,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296970228] [2019-10-15 03:05:38,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:38,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 03:05:38,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218496445] [2019-10-15 03:05:38,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 03:05:38,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:38,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 03:05:38,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:05:38,842 INFO L87 Difference]: Start difference. First operand 489 states and 581 transitions. Second operand 14 states. [2019-10-15 03:05:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:39,067 INFO L93 Difference]: Finished difference Result 514 states and 608 transitions. [2019-10-15 03:05:39,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:05:39,068 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-15 03:05:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:39,071 INFO L225 Difference]: With dead ends: 514 [2019-10-15 03:05:39,071 INFO L226 Difference]: Without dead ends: 486 [2019-10-15 03:05:39,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:05:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-10-15 03:05:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 484. [2019-10-15 03:05:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-15 03:05:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 574 transitions. [2019-10-15 03:05:39,110 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 574 transitions. Word has length 60 [2019-10-15 03:05:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:39,110 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 574 transitions. [2019-10-15 03:05:39,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 03:05:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 574 transitions. [2019-10-15 03:05:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:05:39,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:39,112 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 03:05:39,112 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:39,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1741479821, now seen corresponding path program 1 times [2019-10-15 03:05:39,113 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:39,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729008854] [2019-10-15 03:05:39,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:39,305 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 03:05:39,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729008854] [2019-10-15 03:05:39,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:39,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 03:05:39,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922760336] [2019-10-15 03:05:39,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 03:05:39,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:39,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 03:05:39,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:05:39,307 INFO L87 Difference]: Start difference. First operand 484 states and 574 transitions. Second operand 14 states. [2019-10-15 03:05:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:39,609 INFO L93 Difference]: Finished difference Result 509 states and 601 transitions. [2019-10-15 03:05:39,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:05:39,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-15 03:05:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:39,613 INFO L225 Difference]: With dead ends: 509 [2019-10-15 03:05:39,613 INFO L226 Difference]: Without dead ends: 483 [2019-10-15 03:05:39,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:05:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-15 03:05:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2019-10-15 03:05:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-10-15 03:05:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 569 transitions. [2019-10-15 03:05:39,648 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 569 transitions. Word has length 60 [2019-10-15 03:05:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:39,649 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 569 transitions. [2019-10-15 03:05:39,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 03:05:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 569 transitions. [2019-10-15 03:05:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:05:39,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:39,650 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 03:05:39,651 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:39,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1499433800, now seen corresponding path program 1 times [2019-10-15 03:05:39,651 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:39,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465252068] [2019-10-15 03:05:39,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:39,821 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 03:05:39,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465252068] [2019-10-15 03:05:39,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:39,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:05:39,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596091374] [2019-10-15 03:05:39,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:05:39,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:39,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:05:39,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:39,823 INFO L87 Difference]: Start difference. First operand 481 states and 569 transitions. Second operand 12 states. [2019-10-15 03:05:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:40,041 INFO L93 Difference]: Finished difference Result 502 states and 591 transitions. [2019-10-15 03:05:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:40,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-10-15 03:05:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:40,045 INFO L225 Difference]: With dead ends: 502 [2019-10-15 03:05:40,045 INFO L226 Difference]: Without dead ends: 479 [2019-10-15 03:05:40,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-15 03:05:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-10-15 03:05:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-15 03:05:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 565 transitions. [2019-10-15 03:05:40,094 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 565 transitions. Word has length 58 [2019-10-15 03:05:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:40,095 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 565 transitions. [2019-10-15 03:05:40,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:05:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 565 transitions. [2019-10-15 03:05:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:05:40,097 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:40,097 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 03:05:40,097 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash -913481009, now seen corresponding path program 1 times [2019-10-15 03:05:40,098 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:40,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115826004] [2019-10-15 03:05:40,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:40,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:40,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:40,219 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 03:05:40,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115826004] [2019-10-15 03:05:40,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:40,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:40,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641378982] [2019-10-15 03:05:40,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:40,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:40,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:40,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:40,241 INFO L87 Difference]: Start difference. First operand 479 states and 565 transitions. Second operand 11 states. [2019-10-15 03:05:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:40,429 INFO L93 Difference]: Finished difference Result 503 states and 591 transitions. [2019-10-15 03:05:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:40,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-10-15 03:05:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:40,431 INFO L225 Difference]: With dead ends: 503 [2019-10-15 03:05:40,431 INFO L226 Difference]: Without dead ends: 476 [2019-10-15 03:05:40,432 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 03:05:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-15 03:05:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-10-15 03:05:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-15 03:05:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 560 transitions. [2019-10-15 03:05:40,465 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 560 transitions. Word has length 59 [2019-10-15 03:05:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:40,465 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 560 transitions. [2019-10-15 03:05:40,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 560 transitions. [2019-10-15 03:05:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:05:40,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:40,467 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 03:05:40,468 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:40,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:40,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1493575287, now seen corresponding path program 1 times [2019-10-15 03:05:40,468 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:40,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228392840] [2019-10-15 03:05:40,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:40,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:40,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:40,695 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 03:05:40,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228392840] [2019-10-15 03:05:40,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:40,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 03:05:40,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994463154] [2019-10-15 03:05:40,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 03:05:40,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 03:05:40,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:05:40,699 INFO L87 Difference]: Start difference. First operand 476 states and 560 transitions. Second operand 14 states. [2019-10-15 03:05:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:41,009 INFO L93 Difference]: Finished difference Result 499 states and 585 transitions. [2019-10-15 03:05:41,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:05:41,013 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-15 03:05:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:41,015 INFO L225 Difference]: With dead ends: 499 [2019-10-15 03:05:41,015 INFO L226 Difference]: Without dead ends: 474 [2019-10-15 03:05:41,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:05:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-15 03:05:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-10-15 03:05:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-15 03:05:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 556 transitions. [2019-10-15 03:05:41,047 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 556 transitions. Word has length 60 [2019-10-15 03:05:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:41,047 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 556 transitions. [2019-10-15 03:05:41,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 03:05:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 556 transitions. [2019-10-15 03:05:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:05:41,049 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:41,049 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 03:05:41,049 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:41,050 INFO L82 PathProgramCache]: Analyzing trace with hash 604665947, now seen corresponding path program 1 times [2019-10-15 03:05:41,050 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:41,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392980382] [2019-10-15 03:05:41,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:41,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:41,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:41,311 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 03:05:41,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392980382] [2019-10-15 03:05:41,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:41,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:41,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724121769] [2019-10-15 03:05:41,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:41,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:41,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:41,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:41,314 INFO L87 Difference]: Start difference. First operand 474 states and 556 transitions. Second operand 11 states. [2019-10-15 03:05:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:41,463 INFO L93 Difference]: Finished difference Result 498 states and 582 transitions. [2019-10-15 03:05:41,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:41,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-15 03:05:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:41,466 INFO L225 Difference]: With dead ends: 498 [2019-10-15 03:05:41,466 INFO L226 Difference]: Without dead ends: 472 [2019-10-15 03:05:41,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-10-15 03:05:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-10-15 03:05:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-15 03:05:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 552 transitions. [2019-10-15 03:05:41,511 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 552 transitions. Word has length 60 [2019-10-15 03:05:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:41,511 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 552 transitions. [2019-10-15 03:05:41,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 552 transitions. [2019-10-15 03:05:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 03:05:41,514 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:41,514 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 03:05:41,515 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:41,515 INFO L82 PathProgramCache]: Analyzing trace with hash -640615229, now seen corresponding path program 1 times [2019-10-15 03:05:41,515 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:41,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356949476] [2019-10-15 03:05:41,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:41,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:41,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat