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/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:05:14,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:05:14,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:05:14,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:05:14,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:05:14,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:05:14,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:05:14,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:05:14,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:05:14,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:05:14,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:05:14,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:05:14,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:05:14,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:05:14,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:05:14,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:05:14,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:05:14,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:05:14,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:05:14,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:05:14,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:05:14,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:05:14,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:05:14,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:05:14,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:05:14,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:05:14,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:05:14,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:05:14,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:05:14,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:05:14,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:05:14,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:05:14,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:05:14,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:05:14,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:05:14,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:05:14,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:05:14,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:05:14,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:05:14,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:05:14,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:05:14,233 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:14,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:05:14,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:05:14,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:05:14,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:05:14,264 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:05:14,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:05:14,264 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:05:14,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:05:14,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:05:14,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:05:14,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:05:14,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:05:14,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:05:14,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:05:14,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:05:14,271 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:05:14,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:05:14,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:05:14,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:05:14,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:05:14,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:05:14,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:05:14,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:05:14,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:05:14,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:05:14,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:05:14,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:05:14,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:05:14,273 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:14,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:05:14,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:05:14,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:05:14,615 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:05:14,615 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:05:14,616 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-15 03:05:14,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeeaf91e6/d714b1a308ea4ebfa66251feab44ff64/FLAGd47937043 [2019-10-15 03:05:15,268 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:05:15,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-15 03:05:15,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeeaf91e6/d714b1a308ea4ebfa66251feab44ff64/FLAGd47937043 [2019-10-15 03:05:15,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeeaf91e6/d714b1a308ea4ebfa66251feab44ff64 [2019-10-15 03:05:15,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:05:15,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:05:15,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:15,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:05:15,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:05:15,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:15" (1/1) ... [2019-10-15 03:05:15,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a950ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:15, skipping insertion in model container [2019-10-15 03:05:15,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:15" (1/1) ... [2019-10-15 03:05:15,649 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:05:15,725 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:05:16,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:16,238 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:05:16,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:16,379 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:05:16,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:16 WrapperNode [2019-10-15 03:05:16,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:16,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:05:16,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:05:16,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:05:16,392 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:16" (1/1) ... [2019-10-15 03:05:16,392 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:16" (1/1) ... [2019-10-15 03:05:16,411 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:16" (1/1) ... [2019-10-15 03:05:16,411 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:16" (1/1) ... [2019-10-15 03:05:16,442 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:16" (1/1) ... [2019-10-15 03:05:16,462 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:16" (1/1) ... [2019-10-15 03:05:16,469 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:16" (1/1) ... [2019-10-15 03:05:16,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:05:16,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:05:16,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:05:16,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:05:16,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:16" (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:16,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:05:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:05:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 03:05:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-15 03:05:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-15 03:05:16,570 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-15 03:05:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-15 03:05:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-15 03:05:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-15 03:05:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-15 03:05:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 03:05:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:05:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-15 03:05:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-15 03:05:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-15 03:05:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-15 03:05:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-15 03:05:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 03:05:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 03:05:16,573 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 03:05:16,574 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 03:05:16,574 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 03:05:16,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-15 03:05:16,575 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-15 03:05:16,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-15 03:05:16,575 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-15 03:05:16,575 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-10-15 03:05:16,575 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-10-15 03:05:16,576 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-10-15 03:05:16,576 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 03:05:16,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:05:16,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:05:16,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:05:16,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:05:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:05:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-15 03:05:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-15 03:05:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-15 03:05:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-15 03:05:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-15 03:05:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-15 03:05:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-15 03:05:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-15 03:05:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-15 03:05:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-15 03:05:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-15 03:05:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 03:05:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 03:05:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 03:05:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-15 03:05:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-15 03:05:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-15 03:05:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-15 03:05:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-10-15 03:05:16,580 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-10-15 03:05:16,580 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-10-15 03:05:16,580 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 03:05:16,580 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 03:05:16,580 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 03:05:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-15 03:05:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 03:05:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:05:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 03:05:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:05:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:05:16,974 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:17,047 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:17,048 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:17,061 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:17,080 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:17,080 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:17,090 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:17,400 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-15 03:05:17,401 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-15 03:05:17,406 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:17,500 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-10-15 03:05:17,501 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-10-15 03:05:17,525 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:17,554 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 03:05:17,555 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 03:05:17,680 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:17,692 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:17,692 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:17,692 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:17,702 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:17,703 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:17,703 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:17,716 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:17,716 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:17,776 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:17,822 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-15 03:05:17,823 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-15 03:05:17,826 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:17,998 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-10-15 03:05:17,999 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-10-15 03:05:18,102 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:18,125 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:18,126 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:18,126 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:18,156 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:18,156 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:18,157 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:18,181 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:18,182 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:18,846 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:05:18,846 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:05:18,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:18 BoogieIcfgContainer [2019-10-15 03:05:18,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:05:18,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:05:18,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:05:18,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:05:18,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:05:15" (1/3) ... [2019-10-15 03:05:18,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b9810c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:18, skipping insertion in model container [2019-10-15 03:05:18,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:16" (2/3) ... [2019-10-15 03:05:18,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b9810c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:18, skipping insertion in model container [2019-10-15 03:05:18,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:18" (3/3) ... [2019-10-15 03:05:18,860 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-10-15 03:05:18,870 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:05:18,882 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:05:18,893 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:05:18,942 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:05:18,942 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:05:18,942 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:05:18,942 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:05:18,944 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:05:18,945 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:05:18,945 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:05:18,945 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:05:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-10-15 03:05:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:05:18,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:18,994 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:18,996 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:19,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:19,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1462923013, now seen corresponding path program 1 times [2019-10-15 03:05:19,016 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:19,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911656280] [2019-10-15 03:05:19,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:19,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:19,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:19,397 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,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911656280] [2019-10-15 03:05:19,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:19,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:19,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605861599] [2019-10-15 03:05:19,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:19,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:19,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:19,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:19,454 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-10-15 03:05:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:19,836 INFO L93 Difference]: Finished difference Result 591 states and 867 transitions. [2019-10-15 03:05:19,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:19,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 03:05:19,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:19,859 INFO L225 Difference]: With dead ends: 591 [2019-10-15 03:05:19,859 INFO L226 Difference]: Without dead ends: 383 [2019-10-15 03:05:19,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-15 03:05:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 366. [2019-10-15 03:05:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-15 03:05:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 486 transitions. [2019-10-15 03:05:19,952 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 486 transitions. Word has length 21 [2019-10-15 03:05:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:19,952 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 486 transitions. [2019-10-15 03:05:19,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 486 transitions. [2019-10-15 03:05:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:05:19,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:19,955 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:19,955 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 738687115, now seen corresponding path program 1 times [2019-10-15 03:05:19,956 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:19,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119502666] [2019-10-15 03:05:19,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:19,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:19,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:20,061 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:20,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119502666] [2019-10-15 03:05:20,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:20,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:20,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618458005] [2019-10-15 03:05:20,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:20,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:20,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:20,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:20,069 INFO L87 Difference]: Start difference. First operand 366 states and 486 transitions. Second operand 3 states. [2019-10-15 03:05:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:20,130 INFO L93 Difference]: Finished difference Result 384 states and 509 transitions. [2019-10-15 03:05:20,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:20,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 03:05:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:20,142 INFO L225 Difference]: With dead ends: 384 [2019-10-15 03:05:20,143 INFO L226 Difference]: Without dead ends: 366 [2019-10-15 03:05:20,144 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:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-10-15 03:05:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-10-15 03:05:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-15 03:05:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 485 transitions. [2019-10-15 03:05:20,216 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 485 transitions. Word has length 18 [2019-10-15 03:05:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:20,217 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 485 transitions. [2019-10-15 03:05:20,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 485 transitions. [2019-10-15 03:05:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:05:20,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:20,219 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:20,219 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:20,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:20,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1792373602, now seen corresponding path program 1 times [2019-10-15 03:05:20,220 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:20,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039172912] [2019-10-15 03:05:20,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:20,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:20,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:20,339 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:20,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039172912] [2019-10-15 03:05:20,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:20,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:20,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027070335] [2019-10-15 03:05:20,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:20,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:20,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:20,341 INFO L87 Difference]: Start difference. First operand 366 states and 485 transitions. Second operand 3 states. [2019-10-15 03:05:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:20,429 INFO L93 Difference]: Finished difference Result 462 states and 604 transitions. [2019-10-15 03:05:20,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:20,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 03:05:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:20,438 INFO L225 Difference]: With dead ends: 462 [2019-10-15 03:05:20,438 INFO L226 Difference]: Without dead ends: 443 [2019-10-15 03:05:20,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-15 03:05:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 421. [2019-10-15 03:05:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-10-15 03:05:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2019-10-15 03:05:20,475 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 26 [2019-10-15 03:05:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:20,476 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2019-10-15 03:05:20,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2019-10-15 03:05:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 03:05:20,478 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:20,479 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:20,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1021087200, now seen corresponding path program 1 times [2019-10-15 03:05:20,481 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:20,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628125131] [2019-10-15 03:05:20,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:20,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:20,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:20,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:20,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628125131] [2019-10-15 03:05:20,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:20,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:20,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872178925] [2019-10-15 03:05:20,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:20,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:20,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:20,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:20,642 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2019-10-15 03:05:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:20,711 INFO L93 Difference]: Finished difference Result 753 states and 984 transitions. [2019-10-15 03:05:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:20,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 03:05:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:20,716 INFO L225 Difference]: With dead ends: 753 [2019-10-15 03:05:20,716 INFO L226 Difference]: Without dead ends: 560 [2019-10-15 03:05:20,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-15 03:05:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 534. [2019-10-15 03:05:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-15 03:05:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 705 transitions. [2019-10-15 03:05:20,753 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 705 transitions. Word has length 27 [2019-10-15 03:05:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:20,753 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 705 transitions. [2019-10-15 03:05:20,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 705 transitions. [2019-10-15 03:05:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 03:05:20,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:20,756 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:20,756 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash 576858905, now seen corresponding path program 1 times [2019-10-15 03:05:20,757 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:20,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384465257] [2019-10-15 03:05:20,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:20,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:20,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:20,886 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:20,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384465257] [2019-10-15 03:05:20,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:20,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:20,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438513227] [2019-10-15 03:05:20,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:20,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:20,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:20,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:20,918 INFO L87 Difference]: Start difference. First operand 534 states and 705 transitions. Second operand 3 states. [2019-10-15 03:05:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,030 INFO L93 Difference]: Finished difference Result 543 states and 716 transitions. [2019-10-15 03:05:21,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:21,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 03:05:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,035 INFO L225 Difference]: With dead ends: 543 [2019-10-15 03:05:21,036 INFO L226 Difference]: Without dead ends: 540 [2019-10-15 03:05:21,036 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:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-15 03:05:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-15 03:05:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-15 03:05:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 712 transitions. [2019-10-15 03:05:21,077 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 712 transitions. Word has length 32 [2019-10-15 03:05:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,078 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 712 transitions. [2019-10-15 03:05:21,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 712 transitions. [2019-10-15 03:05:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 03:05:21,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,082 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] [2019-10-15 03:05:21,082 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,083 INFO L82 PathProgramCache]: Analyzing trace with hash 693216730, now seen corresponding path program 1 times [2019-10-15 03:05:21,083 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570918655] [2019-10-15 03:05:21,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,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:21,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570918655] [2019-10-15 03:05:21,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:21,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518580200] [2019-10-15 03:05:21,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:21,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:21,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:21,138 INFO L87 Difference]: Start difference. First operand 540 states and 712 transitions. Second operand 3 states. [2019-10-15 03:05:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,246 INFO L93 Difference]: Finished difference Result 572 states and 748 transitions. [2019-10-15 03:05:21,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:21,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-15 03:05:21,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,251 INFO L225 Difference]: With dead ends: 572 [2019-10-15 03:05:21,251 INFO L226 Difference]: Without dead ends: 567 [2019-10-15 03:05:21,252 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:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-15 03:05:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 565. [2019-10-15 03:05:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-15 03:05:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 741 transitions. [2019-10-15 03:05:21,284 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 741 transitions. Word has length 33 [2019-10-15 03:05:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,284 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 741 transitions. [2019-10-15 03:05:21,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 741 transitions. [2019-10-15 03:05:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 03:05:21,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,286 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] [2019-10-15 03:05:21,287 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,287 INFO L82 PathProgramCache]: Analyzing trace with hash 466530989, now seen corresponding path program 1 times [2019-10-15 03:05:21,287 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733779858] [2019-10-15 03:05:21,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,358 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:21,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733779858] [2019-10-15 03:05:21,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:21,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947724602] [2019-10-15 03:05:21,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:21,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:21,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:21,361 INFO L87 Difference]: Start difference. First operand 565 states and 741 transitions. Second operand 5 states. [2019-10-15 03:05:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,441 INFO L93 Difference]: Finished difference Result 578 states and 755 transitions. [2019-10-15 03:05:21,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:21,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-15 03:05:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,446 INFO L225 Difference]: With dead ends: 578 [2019-10-15 03:05:21,446 INFO L226 Difference]: Without dead ends: 563 [2019-10-15 03:05:21,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-15 03:05:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-15 03:05:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-15 03:05:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 737 transitions. [2019-10-15 03:05:21,481 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 737 transitions. Word has length 34 [2019-10-15 03:05:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,482 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 737 transitions. [2019-10-15 03:05:21,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 737 transitions. [2019-10-15 03:05:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 03:05:21,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,484 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:21,484 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2017596672, now seen corresponding path program 1 times [2019-10-15 03:05:21,485 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156812037] [2019-10-15 03:05:21,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:21,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156812037] [2019-10-15 03:05:21,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:21,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618573008] [2019-10-15 03:05:21,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:21,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:21,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:21,544 INFO L87 Difference]: Start difference. First operand 563 states and 737 transitions. Second operand 5 states. [2019-10-15 03:05:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,602 INFO L93 Difference]: Finished difference Result 576 states and 751 transitions. [2019-10-15 03:05:21,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:21,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-15 03:05:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,608 INFO L225 Difference]: With dead ends: 576 [2019-10-15 03:05:21,608 INFO L226 Difference]: Without dead ends: 557 [2019-10-15 03:05:21,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-15 03:05:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-10-15 03:05:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-10-15 03:05:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 729 transitions. [2019-10-15 03:05:21,639 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 729 transitions. Word has length 35 [2019-10-15 03:05:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,639 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 729 transitions. [2019-10-15 03:05:21,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 729 transitions. [2019-10-15 03:05:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 03:05:21,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,643 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] [2019-10-15 03:05:21,643 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1856256589, now seen corresponding path program 1 times [2019-10-15 03:05:21,643 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681636602] [2019-10-15 03:05:21,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,774 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:21,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681636602] [2019-10-15 03:05:21,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:21,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8082923] [2019-10-15 03:05:21,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:21,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:21,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:21,778 INFO L87 Difference]: Start difference. First operand 557 states and 729 transitions. Second operand 3 states. [2019-10-15 03:05:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,921 INFO L93 Difference]: Finished difference Result 713 states and 945 transitions. [2019-10-15 03:05:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:21,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-15 03:05:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,927 INFO L225 Difference]: With dead ends: 713 [2019-10-15 03:05:21,928 INFO L226 Difference]: Without dead ends: 710 [2019-10-15 03:05:21,928 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:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-15 03:05:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 603. [2019-10-15 03:05:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-15 03:05:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 793 transitions. [2019-10-15 03:05:21,967 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 793 transitions. Word has length 38 [2019-10-15 03:05:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,969 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 793 transitions. [2019-10-15 03:05:21,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 793 transitions. [2019-10-15 03:05:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 03:05:21,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,971 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:21,971 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1471321743, now seen corresponding path program 1 times [2019-10-15 03:05:21,972 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912334337] [2019-10-15 03:05:21,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:22,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912334337] [2019-10-15 03:05:22,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:22,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:22,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191812647] [2019-10-15 03:05:22,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:22,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:22,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:22,092 INFO L87 Difference]: Start difference. First operand 603 states and 793 transitions. Second operand 8 states. [2019-10-15 03:05:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:23,409 INFO L93 Difference]: Finished difference Result 792 states and 1035 transitions. [2019-10-15 03:05:23,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:23,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-15 03:05:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:23,416 INFO L225 Difference]: With dead ends: 792 [2019-10-15 03:05:23,416 INFO L226 Difference]: Without dead ends: 723 [2019-10-15 03:05:23,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-10-15 03:05:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 597. [2019-10-15 03:05:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-15 03:05:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 779 transitions. [2019-10-15 03:05:23,461 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 779 transitions. Word has length 39 [2019-10-15 03:05:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:23,461 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 779 transitions. [2019-10-15 03:05:23,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 779 transitions. [2019-10-15 03:05:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 03:05:23,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:23,464 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] [2019-10-15 03:05:23,464 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:23,464 INFO L82 PathProgramCache]: Analyzing trace with hash -58105418, now seen corresponding path program 1 times [2019-10-15 03:05:23,465 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:23,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206230356] [2019-10-15 03:05:23,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:23,537 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,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206230356] [2019-10-15 03:05:23,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:23,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:05:23,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124215543] [2019-10-15 03:05:23,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:05:23,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:05:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:05:23,539 INFO L87 Difference]: Start difference. First operand 597 states and 779 transitions. Second operand 4 states. [2019-10-15 03:05:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:23,600 INFO L93 Difference]: Finished difference Result 625 states and 812 transitions. [2019-10-15 03:05:23,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:05:23,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-15 03:05:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:23,605 INFO L225 Difference]: With dead ends: 625 [2019-10-15 03:05:23,605 INFO L226 Difference]: Without dead ends: 603 [2019-10-15 03:05:23,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-15 03:05:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2019-10-15 03:05:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 03:05:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 781 transitions. [2019-10-15 03:05:23,637 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 781 transitions. Word has length 37 [2019-10-15 03:05:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:23,638 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 781 transitions. [2019-10-15 03:05:23,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:05:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 781 transitions. [2019-10-15 03:05:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 03:05:23,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:23,640 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:23,640 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:23,640 INFO L82 PathProgramCache]: Analyzing trace with hash 898299433, now seen corresponding path program 1 times [2019-10-15 03:05:23,640 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:23,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381457856] [2019-10-15 03:05:23,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:23,719 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,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381457856] [2019-10-15 03:05:23,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:23,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:23,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865865783] [2019-10-15 03:05:23,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:23,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:23,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:23,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:23,721 INFO L87 Difference]: Start difference. First operand 599 states and 781 transitions. Second operand 8 states. [2019-10-15 03:05:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:24,549 INFO L93 Difference]: Finished difference Result 621 states and 803 transitions. [2019-10-15 03:05:24,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:24,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-15 03:05:24,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:24,555 INFO L225 Difference]: With dead ends: 621 [2019-10-15 03:05:24,555 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 03:05:24,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 03:05:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 599. [2019-10-15 03:05:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 03:05:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 780 transitions. [2019-10-15 03:05:24,599 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 780 transitions. Word has length 39 [2019-10-15 03:05:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:24,600 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 780 transitions. [2019-10-15 03:05:24,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 780 transitions. [2019-10-15 03:05:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:05:24,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:24,605 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:24,605 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:24,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1216858283, now seen corresponding path program 1 times [2019-10-15 03:05:24,606 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:24,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068881775] [2019-10-15 03:05:24,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:24,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068881775] [2019-10-15 03:05:24,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:24,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:24,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698653655] [2019-10-15 03:05:24,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:24,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:24,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:24,752 INFO L87 Difference]: Start difference. First operand 599 states and 780 transitions. Second operand 8 states. [2019-10-15 03:05:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:25,488 INFO L93 Difference]: Finished difference Result 621 states and 801 transitions. [2019-10-15 03:05:25,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:25,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-10-15 03:05:25,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:25,493 INFO L225 Difference]: With dead ends: 621 [2019-10-15 03:05:25,494 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 03:05:25,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 03:05:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 599. [2019-10-15 03:05:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 03:05:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 779 transitions. [2019-10-15 03:05:25,532 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 779 transitions. Word has length 40 [2019-10-15 03:05:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:25,532 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 779 transitions. [2019-10-15 03:05:25,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 779 transitions. [2019-10-15 03:05:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:05:25,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:25,534 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:25,534 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1560994504, now seen corresponding path program 1 times [2019-10-15 03:05:25,535 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:25,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019322558] [2019-10-15 03:05:25,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:25,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019322558] [2019-10-15 03:05:25,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:25,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:25,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547513840] [2019-10-15 03:05:25,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:25,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:25,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:25,585 INFO L87 Difference]: Start difference. First operand 599 states and 779 transitions. Second operand 3 states. [2019-10-15 03:05:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:25,632 INFO L93 Difference]: Finished difference Result 639 states and 826 transitions. [2019-10-15 03:05:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:25,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 03:05:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:25,637 INFO L225 Difference]: With dead ends: 639 [2019-10-15 03:05:25,637 INFO L226 Difference]: Without dead ends: 576 [2019-10-15 03:05:25,640 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:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-15 03:05:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 573. [2019-10-15 03:05:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-15 03:05:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 744 transitions. [2019-10-15 03:05:25,709 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 744 transitions. Word has length 40 [2019-10-15 03:05:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:25,710 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 744 transitions. [2019-10-15 03:05:25,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 744 transitions. [2019-10-15 03:05:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:05:25,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:25,712 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:25,712 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:25,712 INFO L82 PathProgramCache]: Analyzing trace with hash -848551918, now seen corresponding path program 1 times [2019-10-15 03:05:25,712 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:25,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577734710] [2019-10-15 03:05:25,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:25,769 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:25,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577734710] [2019-10-15 03:05:25,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:25,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:25,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351699888] [2019-10-15 03:05:25,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:25,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:25,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:25,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:25,772 INFO L87 Difference]: Start difference. First operand 573 states and 744 transitions. Second operand 5 states. [2019-10-15 03:05:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:25,827 INFO L93 Difference]: Finished difference Result 589 states and 759 transitions. [2019-10-15 03:05:25,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:25,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-15 03:05:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:25,832 INFO L225 Difference]: With dead ends: 589 [2019-10-15 03:05:25,832 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 03:05:25,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 03:05:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 03:05:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 03:05:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 740 transitions. [2019-10-15 03:05:25,868 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 740 transitions. Word has length 41 [2019-10-15 03:05:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:25,868 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 740 transitions. [2019-10-15 03:05:25,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 740 transitions. [2019-10-15 03:05:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:25,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:25,870 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:25,870 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1321910963, now seen corresponding path program 1 times [2019-10-15 03:05:25,871 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:25,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229466379] [2019-10-15 03:05:25,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:25,934 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:25,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229466379] [2019-10-15 03:05:25,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:25,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:05:25,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491606574] [2019-10-15 03:05:25,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:05:25,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:25,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:05:25,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:05:25,939 INFO L87 Difference]: Start difference. First operand 571 states and 740 transitions. Second operand 4 states. [2019-10-15 03:05:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:26,238 INFO L93 Difference]: Finished difference Result 621 states and 784 transitions. [2019-10-15 03:05:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:05:26,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-15 03:05:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:26,241 INFO L225 Difference]: With dead ends: 621 [2019-10-15 03:05:26,241 INFO L226 Difference]: Without dead ends: 432 [2019-10-15 03:05:26,243 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:26,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-10-15 03:05:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 413. [2019-10-15 03:05:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-10-15 03:05:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 516 transitions. [2019-10-15 03:05:26,267 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 516 transitions. Word has length 43 [2019-10-15 03:05:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:26,269 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 516 transitions. [2019-10-15 03:05:26,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:05:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 516 transitions. [2019-10-15 03:05:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:05:26,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:26,270 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:26,271 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:26,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:26,271 INFO L82 PathProgramCache]: Analyzing trace with hash -360854459, now seen corresponding path program 1 times [2019-10-15 03:05:26,271 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:26,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479211328] [2019-10-15 03:05:26,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:26,364 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:26,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479211328] [2019-10-15 03:05:26,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:26,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:26,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245697721] [2019-10-15 03:05:26,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:26,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:26,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:26,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:26,366 INFO L87 Difference]: Start difference. First operand 413 states and 516 transitions. Second operand 5 states. [2019-10-15 03:05:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:26,469 INFO L93 Difference]: Finished difference Result 429 states and 531 transitions. [2019-10-15 03:05:26,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:26,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-15 03:05:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:26,473 INFO L225 Difference]: With dead ends: 429 [2019-10-15 03:05:26,474 INFO L226 Difference]: Without dead ends: 411 [2019-10-15 03:05:26,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-15 03:05:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2019-10-15 03:05:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-15 03:05:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 512 transitions. [2019-10-15 03:05:26,504 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 512 transitions. Word has length 41 [2019-10-15 03:05:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:26,505 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 512 transitions. [2019-10-15 03:05:26,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 512 transitions. [2019-10-15 03:05:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:26,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:26,507 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:26,507 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:26,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:26,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1939669222, now seen corresponding path program 1 times [2019-10-15 03:05:26,508 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:26,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022726029] [2019-10-15 03:05:26,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:26,576 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:26,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022726029] [2019-10-15 03:05:26,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:26,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:26,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493873388] [2019-10-15 03:05:26,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:26,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:26,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:26,579 INFO L87 Difference]: Start difference. First operand 411 states and 512 transitions. Second operand 3 states. [2019-10-15 03:05:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:26,724 INFO L93 Difference]: Finished difference Result 566 states and 717 transitions. [2019-10-15 03:05:26,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:26,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 03:05:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:26,728 INFO L225 Difference]: With dead ends: 566 [2019-10-15 03:05:26,729 INFO L226 Difference]: Without dead ends: 542 [2019-10-15 03:05:26,729 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:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-10-15 03:05:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 445. [2019-10-15 03:05:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-15 03:05:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 555 transitions. [2019-10-15 03:05:26,756 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 555 transitions. Word has length 43 [2019-10-15 03:05:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:26,756 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 555 transitions. [2019-10-15 03:05:26,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 555 transitions. [2019-10-15 03:05:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:05:26,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:26,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:26,758 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:26,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1952247639, now seen corresponding path program 1 times [2019-10-15 03:05:26,759 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:26,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034181333] [2019-10-15 03:05:26,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:26,865 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:26,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034181333] [2019-10-15 03:05:26,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:26,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:26,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097109414] [2019-10-15 03:05:26,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:26,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:26,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:26,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:26,868 INFO L87 Difference]: Start difference. First operand 445 states and 555 transitions. Second operand 3 states. [2019-10-15 03:05:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:26,944 INFO L93 Difference]: Finished difference Result 626 states and 787 transitions. [2019-10-15 03:05:26,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:26,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-15 03:05:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:26,947 INFO L225 Difference]: With dead ends: 626 [2019-10-15 03:05:26,947 INFO L226 Difference]: Without dead ends: 448 [2019-10-15 03:05:26,948 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:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-10-15 03:05:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-10-15 03:05:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-15 03:05:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 559 transitions. [2019-10-15 03:05:26,973 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 559 transitions. Word has length 51 [2019-10-15 03:05:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:26,973 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 559 transitions. [2019-10-15 03:05:26,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 559 transitions. [2019-10-15 03:05:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:05:26,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:26,975 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] [2019-10-15 03:05:26,975 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:26,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:26,975 INFO L82 PathProgramCache]: Analyzing trace with hash 452129407, now seen corresponding path program 1 times [2019-10-15 03:05:26,975 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:26,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982705393] [2019-10-15 03:05:26,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:27,041 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,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982705393] [2019-10-15 03:05:27,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:27,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:27,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632342849] [2019-10-15 03:05:27,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:27,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:27,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:27,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:27,043 INFO L87 Difference]: Start difference. First operand 448 states and 559 transitions. Second operand 8 states. [2019-10-15 03:05:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:27,287 INFO L93 Difference]: Finished difference Result 478 states and 593 transitions. [2019-10-15 03:05:27,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:27,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-15 03:05:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:27,291 INFO L225 Difference]: With dead ends: 478 [2019-10-15 03:05:27,291 INFO L226 Difference]: Without dead ends: 474 [2019-10-15 03:05:27,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-15 03:05:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 466. [2019-10-15 03:05:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-15 03:05:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 580 transitions. [2019-10-15 03:05:27,318 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 580 transitions. Word has length 44 [2019-10-15 03:05:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:27,319 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 580 transitions. [2019-10-15 03:05:27,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 580 transitions. [2019-10-15 03:05:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:05:27,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,320 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] [2019-10-15 03:05:27,321 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash 451852577, now seen corresponding path program 1 times [2019-10-15 03:05:27,321 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757596134] [2019-10-15 03:05:27,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:27,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757596134] [2019-10-15 03:05:27,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:27,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:27,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135388863] [2019-10-15 03:05:27,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:27,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:27,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:27,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:27,548 INFO L87 Difference]: Start difference. First operand 466 states and 580 transitions. Second operand 10 states. [2019-10-15 03:05:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,050 INFO L93 Difference]: Finished difference Result 568 states and 718 transitions. [2019-10-15 03:05:30,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:05:30,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-10-15 03:05:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,056 INFO L225 Difference]: With dead ends: 568 [2019-10-15 03:05:30,056 INFO L226 Difference]: Without dead ends: 552 [2019-10-15 03:05:30,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:05:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-10-15 03:05:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 479. [2019-10-15 03:05:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-15 03:05:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 594 transitions. [2019-10-15 03:05:30,107 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 594 transitions. Word has length 44 [2019-10-15 03:05:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,107 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 594 transitions. [2019-10-15 03:05:30,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 594 transitions. [2019-10-15 03:05:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:05:30,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,110 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] [2019-10-15 03:05:30,110 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1045295946, now seen corresponding path program 1 times [2019-10-15 03:05:30,111 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804428874] [2019-10-15 03:05:30,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,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:30,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804428874] [2019-10-15 03:05:30,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:30,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073781650] [2019-10-15 03:05:30,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:30,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:30,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:30,231 INFO L87 Difference]: Start difference. First operand 479 states and 594 transitions. Second operand 7 states. [2019-10-15 03:05:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:31,759 INFO L93 Difference]: Finished difference Result 569 states and 702 transitions. [2019-10-15 03:05:31,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 03:05:31,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-10-15 03:05:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:31,763 INFO L225 Difference]: With dead ends: 569 [2019-10-15 03:05:31,764 INFO L226 Difference]: Without dead ends: 498 [2019-10-15 03:05:31,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-15 03:05:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 490. [2019-10-15 03:05:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-15 03:05:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 606 transitions. [2019-10-15 03:05:31,797 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 606 transitions. Word has length 44 [2019-10-15 03:05:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:31,797 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 606 transitions. [2019-10-15 03:05:31,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 606 transitions. [2019-10-15 03:05:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 03:05:31,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:31,803 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:31,803 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:31,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:31,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1960933712, now seen corresponding path program 1 times [2019-10-15 03:05:31,803 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:31,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011652787] [2019-10-15 03:05:31,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:31,907 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,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011652787] [2019-10-15 03:05:31,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:31,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:31,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218340792] [2019-10-15 03:05:31,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:31,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:31,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:31,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:31,911 INFO L87 Difference]: Start difference. First operand 490 states and 606 transitions. Second operand 7 states. [2019-10-15 03:05:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:32,090 INFO L93 Difference]: Finished difference Result 508 states and 623 transitions. [2019-10-15 03:05:32,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:32,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-10-15 03:05:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:32,095 INFO L225 Difference]: With dead ends: 508 [2019-10-15 03:05:32,095 INFO L226 Difference]: Without dead ends: 487 [2019-10-15 03:05:32,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-15 03:05:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2019-10-15 03:05:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-10-15 03:05:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 589 transitions. [2019-10-15 03:05:32,140 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 589 transitions. Word has length 45 [2019-10-15 03:05:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:32,141 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 589 transitions. [2019-10-15 03:05:32,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 589 transitions. [2019-10-15 03:05:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 03:05:32,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:32,147 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:32,147 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:32,148 INFO L82 PathProgramCache]: Analyzing trace with hash -519110175, now seen corresponding path program 1 times [2019-10-15 03:05:32,148 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:32,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500622837] [2019-10-15 03:05:32,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,218 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,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500622837] [2019-10-15 03:05:32,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:32,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162391062] [2019-10-15 03:05:32,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:32,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:32,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:32,222 INFO L87 Difference]: Start difference. First operand 485 states and 589 transitions. Second operand 3 states. [2019-10-15 03:05:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:32,349 INFO L93 Difference]: Finished difference Result 569 states and 692 transitions. [2019-10-15 03:05:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:32,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-15 03:05:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:32,354 INFO L225 Difference]: With dead ends: 569 [2019-10-15 03:05:32,354 INFO L226 Difference]: Without dead ends: 516 [2019-10-15 03:05:32,357 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:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-10-15 03:05:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 467. [2019-10-15 03:05:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-10-15 03:05:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 573 transitions. [2019-10-15 03:05:32,424 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 573 transitions. Word has length 45 [2019-10-15 03:05:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:32,424 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 573 transitions. [2019-10-15 03:05:32,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 573 transitions. [2019-10-15 03:05:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:05:32,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:32,427 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:32,427 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash -706098147, now seen corresponding path program 1 times [2019-10-15 03:05:32,428 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:32,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214436161] [2019-10-15 03:05:32,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,656 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,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214436161] [2019-10-15 03:05:32,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:32,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255813249] [2019-10-15 03:05:32,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:32,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:32,659 INFO L87 Difference]: Start difference. First operand 467 states and 573 transitions. Second operand 5 states. [2019-10-15 03:05:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:32,715 INFO L93 Difference]: Finished difference Result 645 states and 802 transitions. [2019-10-15 03:05:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:32,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-15 03:05:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:32,718 INFO L225 Difference]: With dead ends: 645 [2019-10-15 03:05:32,718 INFO L226 Difference]: Without dead ends: 435 [2019-10-15 03:05:32,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-15 03:05:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-10-15 03:05:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-15 03:05:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 526 transitions. [2019-10-15 03:05:32,756 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 526 transitions. Word has length 53 [2019-10-15 03:05:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:32,757 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 526 transitions. [2019-10-15 03:05:32,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 526 transitions. [2019-10-15 03:05:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 03:05:32,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:32,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:32,759 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1539102598, now seen corresponding path program 1 times [2019-10-15 03:05:32,759 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:32,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327816298] [2019-10-15 03:05:32,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,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:32,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327816298] [2019-10-15 03:05:32,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:32,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329405307] [2019-10-15 03:05:32,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:32,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:32,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:32,841 INFO L87 Difference]: Start difference. First operand 435 states and 526 transitions. Second operand 5 states. [2019-10-15 03:05:33,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:33,210 INFO L93 Difference]: Finished difference Result 449 states and 539 transitions. [2019-10-15 03:05:33,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:33,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-15 03:05:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:33,214 INFO L225 Difference]: With dead ends: 449 [2019-10-15 03:05:33,214 INFO L226 Difference]: Without dead ends: 431 [2019-10-15 03:05:33,216 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:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-15 03:05:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2019-10-15 03:05:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-15 03:05:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 512 transitions. [2019-10-15 03:05:33,259 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 512 transitions. Word has length 46 [2019-10-15 03:05:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:33,260 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 512 transitions. [2019-10-15 03:05:33,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 512 transitions. [2019-10-15 03:05:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:05:33,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:33,266 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:33,266 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:33,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:33,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1827396325, now seen corresponding path program 1 times [2019-10-15 03:05:33,267 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:33,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101620687] [2019-10-15 03:05:33,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:33,359 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:33,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101620687] [2019-10-15 03:05:33,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:33,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:33,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205545626] [2019-10-15 03:05:33,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:33,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:33,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:33,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:33,362 INFO L87 Difference]: Start difference. First operand 423 states and 512 transitions. Second operand 8 states. [2019-10-15 03:05:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:33,569 INFO L93 Difference]: Finished difference Result 436 states and 524 transitions. [2019-10-15 03:05:33,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:33,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-15 03:05:33,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:33,573 INFO L225 Difference]: With dead ends: 436 [2019-10-15 03:05:33,573 INFO L226 Difference]: Without dead ends: 412 [2019-10-15 03:05:33,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-10-15 03:05:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2019-10-15 03:05:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-10-15 03:05:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 499 transitions. [2019-10-15 03:05:33,608 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 499 transitions. Word has length 47 [2019-10-15 03:05:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:33,609 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 499 transitions. [2019-10-15 03:05:33,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 499 transitions. [2019-10-15 03:05:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:05:33,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:33,611 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:33,611 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash 358397846, now seen corresponding path program 1 times [2019-10-15 03:05:33,611 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:33,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361850443] [2019-10-15 03:05:33,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:33,681 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:33,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361850443] [2019-10-15 03:05:33,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:33,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:33,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953011462] [2019-10-15 03:05:33,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:33,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:33,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:33,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:33,684 INFO L87 Difference]: Start difference. First operand 412 states and 499 transitions. Second operand 8 states. [2019-10-15 03:05:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:33,892 INFO L93 Difference]: Finished difference Result 435 states and 522 transitions. [2019-10-15 03:05:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:33,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-15 03:05:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:33,895 INFO L225 Difference]: With dead ends: 435 [2019-10-15 03:05:33,895 INFO L226 Difference]: Without dead ends: 407 [2019-10-15 03:05:33,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-10-15 03:05:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2019-10-15 03:05:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-10-15 03:05:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 491 transitions. [2019-10-15 03:05:33,924 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 491 transitions. Word has length 47 [2019-10-15 03:05:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:33,924 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 491 transitions. [2019-10-15 03:05:33,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 491 transitions. [2019-10-15 03:05:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:05:33,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:33,926 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:33,926 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:33,927 INFO L82 PathProgramCache]: Analyzing trace with hash -933816145, now seen corresponding path program 1 times [2019-10-15 03:05:33,927 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:33,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985109516] [2019-10-15 03:05:33,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:34,031 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,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985109516] [2019-10-15 03:05:34,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:34,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:05:34,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557451530] [2019-10-15 03:05:34,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:05:34,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:34,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:05:34,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:34,033 INFO L87 Difference]: Start difference. First operand 407 states and 491 transitions. Second operand 6 states. [2019-10-15 03:05:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:34,147 INFO L93 Difference]: Finished difference Result 436 states and 524 transitions. [2019-10-15 03:05:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:34,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-15 03:05:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:34,151 INFO L225 Difference]: With dead ends: 436 [2019-10-15 03:05:34,151 INFO L226 Difference]: Without dead ends: 409 [2019-10-15 03:05:34,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-15 03:05:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-15 03:05:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-15 03:05:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 493 transitions. [2019-10-15 03:05:34,181 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 493 transitions. Word has length 47 [2019-10-15 03:05:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:34,181 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 493 transitions. [2019-10-15 03:05:34,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:05:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 493 transitions. [2019-10-15 03:05:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:05:34,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:34,183 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:34,184 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:34,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:34,184 INFO L82 PathProgramCache]: Analyzing trace with hash 971008662, now seen corresponding path program 1 times [2019-10-15 03:05:34,184 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:34,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184102589] [2019-10-15 03:05:34,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:34,261 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,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184102589] [2019-10-15 03:05:34,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:34,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:34,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831873802] [2019-10-15 03:05:34,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:34,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:34,263 INFO L87 Difference]: Start difference. First operand 409 states and 493 transitions. Second operand 5 states. [2019-10-15 03:05:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:34,836 INFO L93 Difference]: Finished difference Result 587 states and 716 transitions. [2019-10-15 03:05:34,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:34,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-15 03:05:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:34,839 INFO L225 Difference]: With dead ends: 587 [2019-10-15 03:05:34,839 INFO L226 Difference]: Without dead ends: 409 [2019-10-15 03:05:34,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-15 03:05:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-15 03:05:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-15 03:05:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 492 transitions. [2019-10-15 03:05:34,871 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 492 transitions. Word has length 57 [2019-10-15 03:05:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:34,871 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 492 transitions. [2019-10-15 03:05:34,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 492 transitions. [2019-10-15 03:05:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:05:34,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:34,873 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:34,873 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:34,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:34,873 INFO L82 PathProgramCache]: Analyzing trace with hash -550061814, now seen corresponding path program 1 times [2019-10-15 03:05:34,874 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:34,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211827388] [2019-10-15 03:05:34,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:35,004 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,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211827388] [2019-10-15 03:05:35,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:35,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:35,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903678183] [2019-10-15 03:05:35,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:35,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:35,007 INFO L87 Difference]: Start difference. First operand 409 states and 492 transitions. Second operand 7 states. [2019-10-15 03:05:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:35,357 INFO L93 Difference]: Finished difference Result 428 states and 512 transitions. [2019-10-15 03:05:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:35,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-15 03:05:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:35,361 INFO L225 Difference]: With dead ends: 428 [2019-10-15 03:05:35,361 INFO L226 Difference]: Without dead ends: 425 [2019-10-15 03:05:35,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-10-15 03:05:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 409. [2019-10-15 03:05:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-15 03:05:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 492 transitions. [2019-10-15 03:05:35,447 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 492 transitions. Word has length 58 [2019-10-15 03:05:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:35,447 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 492 transitions. [2019-10-15 03:05:35,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 492 transitions. [2019-10-15 03:05:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:35,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:35,449 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:35,450 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:35,450 INFO L82 PathProgramCache]: Analyzing trace with hash 815295926, now seen corresponding path program 1 times [2019-10-15 03:05:35,450 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:35,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308654975] [2019-10-15 03:05:35,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:35,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308654975] [2019-10-15 03:05:35,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:35,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:35,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716939748] [2019-10-15 03:05:35,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:35,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:35,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:35,563 INFO L87 Difference]: Start difference. First operand 409 states and 492 transitions. Second operand 9 states. [2019-10-15 03:05:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:35,769 INFO L93 Difference]: Finished difference Result 434 states and 517 transitions. [2019-10-15 03:05:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:35,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-10-15 03:05:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:35,773 INFO L225 Difference]: With dead ends: 434 [2019-10-15 03:05:35,773 INFO L226 Difference]: Without dead ends: 404 [2019-10-15 03:05:35,774 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:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-10-15 03:05:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2019-10-15 03:05:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-15 03:05:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 484 transitions. [2019-10-15 03:05:35,814 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 484 transitions. Word has length 50 [2019-10-15 03:05:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:35,814 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 484 transitions. [2019-10-15 03:05:35,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 484 transitions. [2019-10-15 03:05:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:35,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:35,816 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:35,816 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:35,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:35,817 INFO L82 PathProgramCache]: Analyzing trace with hash 298589759, now seen corresponding path program 1 times [2019-10-15 03:05:35,817 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:35,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104067677] [2019-10-15 03:05:35,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:35,978 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,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104067677] [2019-10-15 03:05:35,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:35,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:35,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026241208] [2019-10-15 03:05:35,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:35,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:35,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:35,981 INFO L87 Difference]: Start difference. First operand 404 states and 484 transitions. Second operand 9 states. [2019-10-15 03:05:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:36,293 INFO L93 Difference]: Finished difference Result 429 states and 509 transitions. [2019-10-15 03:05:36,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:36,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-10-15 03:05:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:36,297 INFO L225 Difference]: With dead ends: 429 [2019-10-15 03:05:36,297 INFO L226 Difference]: Without dead ends: 399 [2019-10-15 03:05:36,299 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:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-15 03:05:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-10-15 03:05:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-10-15 03:05:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 476 transitions. [2019-10-15 03:05:36,338 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 476 transitions. Word has length 50 [2019-10-15 03:05:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:36,339 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 476 transitions. [2019-10-15 03:05:36,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 476 transitions. [2019-10-15 03:05:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 03:05:36,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:36,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:36,342 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash 211621434, now seen corresponding path program 1 times [2019-10-15 03:05:36,343 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:36,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239495500] [2019-10-15 03:05:36,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:36,487 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,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239495500] [2019-10-15 03:05:36,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:36,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:05:36,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201316885] [2019-10-15 03:05:36,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:05:36,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:36,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:05:36,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:36,490 INFO L87 Difference]: Start difference. First operand 399 states and 476 transitions. Second operand 6 states. [2019-10-15 03:05:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:36,608 INFO L93 Difference]: Finished difference Result 416 states and 492 transitions. [2019-10-15 03:05:36,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:36,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-15 03:05:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:36,612 INFO L225 Difference]: With dead ends: 416 [2019-10-15 03:05:36,612 INFO L226 Difference]: Without dead ends: 394 [2019-10-15 03:05:36,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-10-15 03:05:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2019-10-15 03:05:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-10-15 03:05:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 470 transitions. [2019-10-15 03:05:36,647 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 470 transitions. Word has length 52 [2019-10-15 03:05:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:36,647 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 470 transitions. [2019-10-15 03:05:36,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:05:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 470 transitions. [2019-10-15 03:05:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:05:36,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:36,649 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:36,649 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:36,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:36,649 INFO L82 PathProgramCache]: Analyzing trace with hash -407065973, now seen corresponding path program 1 times [2019-10-15 03:05:36,649 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:36,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339569932] [2019-10-15 03:05:36,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:36,842 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,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339569932] [2019-10-15 03:05:36,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:36,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:36,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279149062] [2019-10-15 03:05:36,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:36,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:36,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:36,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:36,844 INFO L87 Difference]: Start difference. First operand 394 states and 470 transitions. Second operand 9 states. [2019-10-15 03:05:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:37,106 INFO L93 Difference]: Finished difference Result 419 states and 495 transitions. [2019-10-15 03:05:37,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:37,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-15 03:05:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:37,111 INFO L225 Difference]: With dead ends: 419 [2019-10-15 03:05:37,112 INFO L226 Difference]: Without dead ends: 389 [2019-10-15 03:05:37,112 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:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-10-15 03:05:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2019-10-15 03:05:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-10-15 03:05:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 462 transitions. [2019-10-15 03:05:37,149 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 462 transitions. Word has length 51 [2019-10-15 03:05:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:37,149 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 462 transitions. [2019-10-15 03:05:37,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 462 transitions. [2019-10-15 03:05:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:05:37,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:37,152 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:37,152 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2007347647, now seen corresponding path program 1 times [2019-10-15 03:05:37,153 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:37,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359537164] [2019-10-15 03:05:37,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:37,318 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,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359537164] [2019-10-15 03:05:37,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:37,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:05:37,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419675942] [2019-10-15 03:05:37,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:05:37,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:37,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:05:37,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:37,324 INFO L87 Difference]: Start difference. First operand 389 states and 462 transitions. Second operand 6 states. [2019-10-15 03:05:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:37,383 INFO L93 Difference]: Finished difference Result 401 states and 474 transitions. [2019-10-15 03:05:37,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:37,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-15 03:05:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:37,386 INFO L225 Difference]: With dead ends: 401 [2019-10-15 03:05:37,386 INFO L226 Difference]: Without dead ends: 362 [2019-10-15 03:05:37,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-15 03:05:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-10-15 03:05:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-15 03:05:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 422 transitions. [2019-10-15 03:05:37,414 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 422 transitions. Word has length 53 [2019-10-15 03:05:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:37,415 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 422 transitions. [2019-10-15 03:05:37,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:05:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 422 transitions. [2019-10-15 03:05:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:05:37,416 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:37,416 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,416 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:37,417 INFO L82 PathProgramCache]: Analyzing trace with hash -759076076, now seen corresponding path program 1 times [2019-10-15 03:05:37,417 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:37,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822314788] [2019-10-15 03:05:37,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:37,567 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,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822314788] [2019-10-15 03:05:37,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:37,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:37,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994806313] [2019-10-15 03:05:37,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:37,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:37,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:37,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:37,570 INFO L87 Difference]: Start difference. First operand 360 states and 422 transitions. Second operand 5 states. [2019-10-15 03:05:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:38,180 INFO L93 Difference]: Finished difference Result 613 states and 733 transitions. [2019-10-15 03:05:38,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:38,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-15 03:05:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:38,184 INFO L225 Difference]: With dead ends: 613 [2019-10-15 03:05:38,184 INFO L226 Difference]: Without dead ends: 441 [2019-10-15 03:05:38,185 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:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-15 03:05:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2019-10-15 03:05:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-10-15 03:05:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2019-10-15 03:05:38,230 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 57 [2019-10-15 03:05:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:38,230 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2019-10-15 03:05:38,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2019-10-15 03:05:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:38,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:38,232 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:38,232 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1791603402, now seen corresponding path program 1 times [2019-10-15 03:05:38,233 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:38,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928926143] [2019-10-15 03:05:38,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:38,322 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,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928926143] [2019-10-15 03:05:38,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:38,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:38,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170241697] [2019-10-15 03:05:38,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:38,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:38,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:38,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:38,324 INFO L87 Difference]: Start difference. First operand 410 states and 484 transitions. Second operand 9 states. [2019-10-15 03:05:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:38,550 INFO L93 Difference]: Finished difference Result 435 states and 509 transitions. [2019-10-15 03:05:38,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:38,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-15 03:05:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:38,553 INFO L225 Difference]: With dead ends: 435 [2019-10-15 03:05:38,553 INFO L226 Difference]: Without dead ends: 381 [2019-10-15 03:05:38,554 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:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-10-15 03:05:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2019-10-15 03:05:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-15 03:05:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 448 transitions. [2019-10-15 03:05:38,586 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 448 transitions. Word has length 54 [2019-10-15 03:05:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:38,586 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 448 transitions. [2019-10-15 03:05:38,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 448 transitions. [2019-10-15 03:05:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:38,591 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:38,591 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:38,591 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:38,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1794667652, now seen corresponding path program 1 times [2019-10-15 03:05:38,592 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:38,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511676260] [2019-10-15 03:05:38,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:38,680 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,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511676260] [2019-10-15 03:05:38,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:38,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:38,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862562075] [2019-10-15 03:05:38,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:38,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:38,683 INFO L87 Difference]: Start difference. First operand 381 states and 448 transitions. Second operand 8 states. [2019-10-15 03:05:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:38,831 INFO L93 Difference]: Finished difference Result 398 states and 465 transitions. [2019-10-15 03:05:38,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:38,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-15 03:05:38,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:38,835 INFO L225 Difference]: With dead ends: 398 [2019-10-15 03:05:38,836 INFO L226 Difference]: Without dead ends: 354 [2019-10-15 03:05:38,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-15 03:05:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-10-15 03:05:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-10-15 03:05:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 417 transitions. [2019-10-15 03:05:38,870 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 417 transitions. Word has length 54 [2019-10-15 03:05:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:38,870 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 417 transitions. [2019-10-15 03:05:38,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 417 transitions. [2019-10-15 03:05:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-15 03:05:38,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:38,873 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, 1, 1, 1, 1, 1] [2019-10-15 03:05:38,873 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:38,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:38,874 INFO L82 PathProgramCache]: Analyzing trace with hash -309591851, now seen corresponding path program 1 times [2019-10-15 03:05:38,874 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:38,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443055941] [2019-10-15 03:05:38,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:39,019 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,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443055941] [2019-10-15 03:05:39,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:39,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:39,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089332774] [2019-10-15 03:05:39,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:39,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:39,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:39,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:39,022 INFO L87 Difference]: Start difference. First operand 354 states and 417 transitions. Second operand 10 states. [2019-10-15 03:05:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:39,576 INFO L93 Difference]: Finished difference Result 388 states and 451 transitions. [2019-10-15 03:05:39,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:39,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-10-15 03:05:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:39,579 INFO L225 Difference]: With dead ends: 388 [2019-10-15 03:05:39,580 INFO L226 Difference]: Without dead ends: 352 [2019-10-15 03:05:39,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-15 03:05:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-10-15 03:05:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-15 03:05:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 412 transitions. [2019-10-15 03:05:39,607 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 412 transitions. Word has length 66 [2019-10-15 03:05:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:39,607 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 412 transitions. [2019-10-15 03:05:39,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 412 transitions. [2019-10-15 03:05:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 03:05:39,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:39,609 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, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:39,609 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash -83778572, now seen corresponding path program 1 times [2019-10-15 03:05:39,610 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:39,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461052422] [2019-10-15 03:05:39,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:39,746 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,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461052422] [2019-10-15 03:05:39,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:39,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:39,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130012495] [2019-10-15 03:05:39,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:39,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:39,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:39,749 INFO L87 Difference]: Start difference. First operand 352 states and 412 transitions. Second operand 8 states. [2019-10-15 03:05:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:40,326 INFO L93 Difference]: Finished difference Result 434 states and 521 transitions. [2019-10-15 03:05:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:40,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-10-15 03:05:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:40,329 INFO L225 Difference]: With dead ends: 434 [2019-10-15 03:05:40,329 INFO L226 Difference]: Without dead ends: 430 [2019-10-15 03:05:40,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-15 03:05:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 352. [2019-10-15 03:05:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-15 03:05:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 412 transitions. [2019-10-15 03:05:40,359 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 412 transitions. Word has length 67 [2019-10-15 03:05:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:40,360 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 412 transitions. [2019-10-15 03:05:40,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 412 transitions. [2019-10-15 03:05:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:05:40,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:40,362 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, 1] [2019-10-15 03:05:40,362 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:40,362 INFO L82 PathProgramCache]: Analyzing trace with hash 451436269, now seen corresponding path program 1 times [2019-10-15 03:05:40,362 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:40,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413474954] [2019-10-15 03:05:40,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:40,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:40,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:40,419 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,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413474954] [2019-10-15 03:05:40,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:40,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:40,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863735556] [2019-10-15 03:05:40,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:40,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:40,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:40,421 INFO L87 Difference]: Start difference. First operand 352 states and 412 transitions. Second operand 5 states. [2019-10-15 03:05:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:40,882 INFO L93 Difference]: Finished difference Result 637 states and 726 transitions. [2019-10-15 03:05:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:40,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-15 03:05:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:40,886 INFO L225 Difference]: With dead ends: 637 [2019-10-15 03:05:40,886 INFO L226 Difference]: Without dead ends: 418 [2019-10-15 03:05:40,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-15 03:05:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 398. [2019-10-15 03:05:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-10-15 03:05:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 456 transitions. [2019-10-15 03:05:40,923 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 456 transitions. Word has length 62 [2019-10-15 03:05:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:40,924 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 456 transitions. [2019-10-15 03:05:40,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 456 transitions. [2019-10-15 03:05:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 03:05:40,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:40,925 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, 1, 1] [2019-10-15 03:05:40,925 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1445775960, now seen corresponding path program 1 times [2019-10-15 03:05:40,926 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:40,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574550347] [2019-10-15 03:05:40,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:40,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:40,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:41,137 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,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574550347] [2019-10-15 03:05:41,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:41,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:41,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423680591] [2019-10-15 03:05:41,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:41,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:41,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:41,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:41,140 INFO L87 Difference]: Start difference. First operand 398 states and 456 transitions. Second operand 9 states. [2019-10-15 03:05:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:41,425 INFO L93 Difference]: Finished difference Result 400 states and 457 transitions. [2019-10-15 03:05:41,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:41,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-15 03:05:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:41,429 INFO L225 Difference]: With dead ends: 400 [2019-10-15 03:05:41,429 INFO L226 Difference]: Without dead ends: 328 [2019-10-15 03:05:41,430 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:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-10-15 03:05:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-10-15 03:05:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-15 03:05:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 380 transitions. [2019-10-15 03:05:41,466 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 380 transitions. Word has length 63 [2019-10-15 03:05:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:41,468 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 380 transitions. [2019-10-15 03:05:41,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 380 transitions. [2019-10-15 03:05:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-15 03:05:41,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:41,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:41,470 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:41,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2143981119, now seen corresponding path program 1 times [2019-10-15 03:05:41,471 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:41,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127840420] [2019-10-15 03:05:41,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:41,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:41,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:41,538 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,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127840420] [2019-10-15 03:05:41,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:41,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:41,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431825465] [2019-10-15 03:05:41,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:41,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:41,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:41,542 INFO L87 Difference]: Start difference. First operand 328 states and 380 transitions. Second operand 7 states. [2019-10-15 03:05:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:41,646 INFO L93 Difference]: Finished difference Result 345 states and 396 transitions. [2019-10-15 03:05:41,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:41,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-10-15 03:05:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:41,649 INFO L225 Difference]: With dead ends: 345 [2019-10-15 03:05:41,649 INFO L226 Difference]: Without dead ends: 326 [2019-10-15 03:05:41,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-15 03:05:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2019-10-15 03:05:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-15 03:05:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2019-10-15 03:05:41,677 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 74 [2019-10-15 03:05:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:41,677 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2019-10-15 03:05:41,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2019-10-15 03:05:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-15 03:05:41,679 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:41,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:41,679 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:41,680 INFO L82 PathProgramCache]: Analyzing trace with hash -123615300, now seen corresponding path program 1 times [2019-10-15 03:05:41,680 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:41,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850437020] [2019-10-15 03:05:41,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:41,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:41,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:41,897 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,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850437020] [2019-10-15 03:05:41,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:41,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:41,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291779547] [2019-10-15 03:05:41,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:41,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:41,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:41,899 INFO L87 Difference]: Start difference. First operand 287 states and 328 transitions. Second operand 10 states. [2019-10-15 03:05:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:42,769 INFO L93 Difference]: Finished difference Result 403 states and 457 transitions. [2019-10-15 03:05:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:42,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-10-15 03:05:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:42,772 INFO L225 Difference]: With dead ends: 403 [2019-10-15 03:05:42,772 INFO L226 Difference]: Without dead ends: 259 [2019-10-15 03:05:42,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-15 03:05:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-10-15 03:05:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-15 03:05:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 289 transitions. [2019-10-15 03:05:42,808 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 289 transitions. Word has length 75 [2019-10-15 03:05:42,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:42,810 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 289 transitions. [2019-10-15 03:05:42,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 289 transitions. [2019-10-15 03:05:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-15 03:05:42,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:42,813 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, 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:42,813 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:42,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:42,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1138474364, now seen corresponding path program 1 times [2019-10-15 03:05:42,815 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:42,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15766521] [2019-10-15 03:05:42,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:42,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:42,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:42,980 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:42,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15766521] [2019-10-15 03:05:42,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:42,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:42,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991241814] [2019-10-15 03:05:42,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:42,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:42,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:42,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:42,983 INFO L87 Difference]: Start difference. First operand 255 states and 289 transitions. Second operand 10 states. [2019-10-15 03:05:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:43,331 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2019-10-15 03:05:43,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:43,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-10-15 03:05:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:43,334 INFO L225 Difference]: With dead ends: 297 [2019-10-15 03:05:43,334 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:05:43,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:05:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-10-15 03:05:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-15 03:05:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 265 transitions. [2019-10-15 03:05:43,357 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 265 transitions. Word has length 81 [2019-10-15 03:05:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:43,357 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 265 transitions. [2019-10-15 03:05:43,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 265 transitions. [2019-10-15 03:05:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-15 03:05:43,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:43,359 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,359 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:43,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash 775720589, now seen corresponding path program 1 times [2019-10-15 03:05:43,360 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:43,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744633233] [2019-10-15 03:05:43,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:43,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:43,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:43,494 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:43,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744633233] [2019-10-15 03:05:43,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:43,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:43,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216695914] [2019-10-15 03:05:43,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:43,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:43,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:43,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:43,496 INFO L87 Difference]: Start difference. First operand 235 states and 265 transitions. Second operand 11 states. [2019-10-15 03:05:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:43,607 INFO L93 Difference]: Finished difference Result 313 states and 350 transitions. [2019-10-15 03:05:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:43,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-10-15 03:05:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:43,609 INFO L225 Difference]: With dead ends: 313 [2019-10-15 03:05:43,609 INFO L226 Difference]: Without dead ends: 200 [2019-10-15 03:05:43,610 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:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-15 03:05:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2019-10-15 03:05:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-15 03:05:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2019-10-15 03:05:43,629 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 86 [2019-10-15 03:05:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:43,630 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2019-10-15 03:05:43,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2019-10-15 03:05:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 03:05:43,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:43,631 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 03:05:43,631 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1293847127, now seen corresponding path program 1 times [2019-10-15 03:05:43,632 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:43,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554949991] [2019-10-15 03:05:43,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:43,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:43,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 03:05:43,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554949991] [2019-10-15 03:05:43,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:43,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:43,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313937315] [2019-10-15 03:05:43,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:43,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:43,761 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand 7 states. [2019-10-15 03:05:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:43,937 INFO L93 Difference]: Finished difference Result 251 states and 282 transitions. [2019-10-15 03:05:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:43,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-10-15 03:05:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:43,939 INFO L225 Difference]: With dead ends: 251 [2019-10-15 03:05:43,939 INFO L226 Difference]: Without dead ends: 248 [2019-10-15 03:05:43,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-15 03:05:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2019-10-15 03:05:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-15 03:05:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 252 transitions. [2019-10-15 03:05:43,962 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 252 transitions. Word has length 91 [2019-10-15 03:05:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:43,962 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 252 transitions. [2019-10-15 03:05:43,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 252 transitions. [2019-10-15 03:05:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 03:05:43,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:43,964 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 03:05:43,964 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:43,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2073576186, now seen corresponding path program 1 times [2019-10-15 03:05:43,965 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:43,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601638538] [2019-10-15 03:05:43,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:43,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:43,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:44,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601638538] [2019-10-15 03:05:44,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:44,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:44,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518163494] [2019-10-15 03:05:44,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:44,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:44,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:44,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:44,046 INFO L87 Difference]: Start difference. First operand 226 states and 252 transitions. Second operand 5 states. [2019-10-15 03:05:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:44,299 INFO L93 Difference]: Finished difference Result 307 states and 337 transitions. [2019-10-15 03:05:44,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:44,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-15 03:05:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:44,301 INFO L225 Difference]: With dead ends: 307 [2019-10-15 03:05:44,301 INFO L226 Difference]: Without dead ends: 246 [2019-10-15 03:05:44,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-15 03:05:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 151. [2019-10-15 03:05:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-15 03:05:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2019-10-15 03:05:44,322 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 99 [2019-10-15 03:05:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:44,322 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2019-10-15 03:05:44,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2019-10-15 03:05:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 03:05:44,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:44,324 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:44,325 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:44,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1183994184, now seen corresponding path program 1 times [2019-10-15 03:05:44,325 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:44,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520155999] [2019-10-15 03:05:44,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:44,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:44,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:44,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520155999] [2019-10-15 03:05:44,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:44,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:05:44,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981387685] [2019-10-15 03:05:44,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:05:44,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:44,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:05:44,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:44,489 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 13 states. [2019-10-15 03:05:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:44,850 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2019-10-15 03:05:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:05:44,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-10-15 03:05:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:44,851 INFO L225 Difference]: With dead ends: 194 [2019-10-15 03:05:44,852 INFO L226 Difference]: Without dead ends: 165 [2019-10-15 03:05:44,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:05:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-15 03:05:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-10-15 03:05:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-15 03:05:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2019-10-15 03:05:44,871 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 110 [2019-10-15 03:05:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:44,871 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2019-10-15 03:05:44,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:05:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2019-10-15 03:05:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 03:05:44,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:44,873 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:44,874 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1713752837, now seen corresponding path program 1 times [2019-10-15 03:05:44,874 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:44,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464622068] [2019-10-15 03:05:44,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:44,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:44,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:45,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464622068] [2019-10-15 03:05:45,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:45,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:45,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101625317] [2019-10-15 03:05:45,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:45,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:45,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:45,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:45,030 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 11 states. [2019-10-15 03:05:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:45,241 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2019-10-15 03:05:45,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:45,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2019-10-15 03:05:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:45,243 INFO L225 Difference]: With dead ends: 190 [2019-10-15 03:05:45,243 INFO L226 Difference]: Without dead ends: 157 [2019-10-15 03:05:45,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:05:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-15 03:05:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-15 03:05:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-15 03:05:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2019-10-15 03:05:45,260 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 123 [2019-10-15 03:05:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:45,260 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2019-10-15 03:05:45,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2019-10-15 03:05:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-15 03:05:45,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:45,262 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:45,262 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:45,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:45,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1253619711, now seen corresponding path program 1 times [2019-10-15 03:05:45,262 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:45,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141451851] [2019-10-15 03:05:45,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:45,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:45,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:45,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141451851] [2019-10-15 03:05:45,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:45,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:45,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221623699] [2019-10-15 03:05:45,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:45,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:45,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:45,378 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand 5 states. [2019-10-15 03:05:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:45,484 INFO L93 Difference]: Finished difference Result 196 states and 203 transitions. [2019-10-15 03:05:45,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:05:45,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-10-15 03:05:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:45,486 INFO L225 Difference]: With dead ends: 196 [2019-10-15 03:05:45,486 INFO L226 Difference]: Without dead ends: 142 [2019-10-15 03:05:45,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-15 03:05:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-10-15 03:05:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-15 03:05:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-10-15 03:05:45,504 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 126 [2019-10-15 03:05:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:45,504 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-10-15 03:05:45,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-10-15 03:05:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 03:05:45,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:45,507 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:45,507 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash 120929572, now seen corresponding path program 1 times [2019-10-15 03:05:45,508 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:45,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525957501] [2019-10-15 03:05:45,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:45,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:45,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:45,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525957501] [2019-10-15 03:05:45,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:45,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 03:05:45,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792259694] [2019-10-15 03:05:45,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 03:05:45,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 03:05:45,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:05:45,930 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 14 states.