/usr/bin/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_simpl3.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:05:49,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:05:49,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:05:49,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:05:49,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:05:49,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:05:49,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:05:49,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:05:49,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:05:49,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:05:49,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:05:49,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:05:49,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:05:49,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:05:49,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:05:49,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:05:49,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:05:49,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:05:49,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:05:49,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:05:49,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:05:49,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:05:49,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:05:49,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:05:49,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:05:49,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:05:49,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:05:49,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:05:49,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:05:49,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:05:49,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:05:49,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:05:49,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:05:49,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:05:49,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:05:49,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:05:49,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:05:49,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:05:49,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:05:49,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:05:49,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:05:49,966 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-11-07 04:05:49,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:05:49,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:05:49,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:05:49,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:05:49,981 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:05:49,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:05:49,982 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:05:49,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:05:49,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:05:49,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:05:49,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:05:49,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:05:49,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:05:49,983 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:05:49,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:05:49,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:05:49,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:05:49,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:05:49,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:05:49,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:05:49,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:05:49,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:05:49,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:05:49,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:05:49,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:05:49,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:05:49,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:05:49,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:05:49,986 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-11-07 04:05:50,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:05:50,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:05:50,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:05:50,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:05:50,265 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:05:50,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-11-07 04:05:50,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1f63cdf/f69612a4ee9e4de6b5de3350efc2112a/FLAGb2a117378 [2019-11-07 04:05:50,935 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:05:50,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-11-07 04:05:50,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1f63cdf/f69612a4ee9e4de6b5de3350efc2112a/FLAGb2a117378 [2019-11-07 04:05:51,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1f63cdf/f69612a4ee9e4de6b5de3350efc2112a [2019-11-07 04:05:51,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:05:51,262 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:05:51,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:05:51,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:05:51,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:05:51,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:05:51" (1/1) ... [2019-11-07 04:05:51,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd5431d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51, skipping insertion in model container [2019-11-07 04:05:51,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:05:51" (1/1) ... [2019-11-07 04:05:51,317 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:05:51,421 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:05:51,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:05:51,854 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:05:51,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:05:51,955 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:05:51,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51 WrapperNode [2019-11-07 04:05:51,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:05:51,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:05:51,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:05:51,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:05:51,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51" (1/1) ... [2019-11-07 04:05:51,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51" (1/1) ... [2019-11-07 04:05:51,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51" (1/1) ... [2019-11-07 04:05:51,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51" (1/1) ... [2019-11-07 04:05:52,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51" (1/1) ... [2019-11-07 04:05:52,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51" (1/1) ... [2019-11-07 04:05:52,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51" (1/1) ... [2019-11-07 04:05:52,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:05:52,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:05:52,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:05:52,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:05:52,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51" (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-11-07 04:05:52,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:05:52,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:05:52,105 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-07 04:05:52,105 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-07 04:05:52,105 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-11-07 04:05:52,105 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-11-07 04:05:52,106 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-11-07 04:05:52,106 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-11-07 04:05:52,106 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-11-07 04:05:52,106 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-11-07 04:05:52,106 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-11-07 04:05:52,106 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-07 04:05:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:05:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-11-07 04:05:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-11-07 04:05:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-11-07 04:05:52,107 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-11-07 04:05:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-11-07 04:05:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-07 04:05:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-07 04:05:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-07 04:05:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-07 04:05:52,108 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-07 04:05:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-11-07 04:05:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-11-07 04:05:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-11-07 04:05:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-11-07 04:05:52,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:05:52,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:05:52,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:05:52,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 04:05:52,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 04:05:52,110 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-11-07 04:05:52,110 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-11-07 04:05:52,111 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-11-07 04:05:52,111 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-11-07 04:05:52,111 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-11-07 04:05:52,111 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-11-07 04:05:52,111 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-11-07 04:05:52,111 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-11-07 04:05:52,111 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-11-07 04:05:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-11-07 04:05:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-11-07 04:05:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-07 04:05:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-07 04:05:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-07 04:05:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-11-07 04:05:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-11-07 04:05:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-11-07 04:05:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-07 04:05:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-07 04:05:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-07 04:05:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-11-07 04:05:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-07 04:05:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:05:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-07 04:05:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-11-07 04:05:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:05:52,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:05:52,475 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:52,549 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:52,549 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:52,559 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:52,585 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:52,585 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:52,594 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:52,924 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-11-07 04:05:52,924 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-11-07 04:05:52,928 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:52,998 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-11-07 04:05:52,998 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-11-07 04:05:53,028 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,049 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-07 04:05:53,050 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-07 04:05:53,200 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,213 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:53,213 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:53,214 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,229 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:53,230 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:53,230 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,247 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:53,248 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:53,304 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,368 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-07 04:05:53,368 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-07 04:05:53,403 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,410 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:53,410 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:53,411 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,430 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:53,430 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:53,431 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,437 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:53,438 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:53,803 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:05:53,804 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 04:05:53,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:05:53 BoogieIcfgContainer [2019-11-07 04:05:53,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:05:53,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:05:53,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:05:53,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:05:53,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:05:51" (1/3) ... [2019-11-07 04:05:53,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369693f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:05:53, skipping insertion in model container [2019-11-07 04:05:53,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:51" (2/3) ... [2019-11-07 04:05:53,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369693f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:05:53, skipping insertion in model container [2019-11-07 04:05:53,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:05:53" (3/3) ... [2019-11-07 04:05:53,814 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-11-07 04:05:53,824 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:05:53,833 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:05:53,844 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:05:53,872 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:05:53,872 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:05:53,872 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:05:53,872 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:05:53,872 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:05:53,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:05:53,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:05:53,873 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:05:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states. [2019-11-07 04:05:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 04:05:53,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:53,907 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:53,910 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1497224750, now seen corresponding path program 1 times [2019-11-07 04:05:53,926 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:53,927 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038010947] [2019-11-07 04:05:53,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:54,185 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038010947] [2019-11-07 04:05:54,188 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:54,188 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:54,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169209363] [2019-11-07 04:05:54,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:54,200 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:54,220 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 3 states. [2019-11-07 04:05:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:54,378 INFO L93 Difference]: Finished difference Result 397 states and 575 transitions. [2019-11-07 04:05:54,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:54,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 04:05:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:54,406 INFO L225 Difference]: With dead ends: 397 [2019-11-07 04:05:54,407 INFO L226 Difference]: Without dead ends: 227 [2019-11-07 04:05:54,419 INFO L630 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-11-07 04:05:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-07 04:05:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-11-07 04:05:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-07 04:05:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 297 transitions. [2019-11-07 04:05:54,530 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 297 transitions. Word has length 18 [2019-11-07 04:05:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:54,531 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 297 transitions. [2019-11-07 04:05:54,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 297 transitions. [2019-11-07 04:05:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 04:05:54,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:54,534 INFO L410 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] [2019-11-07 04:05:54,535 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:54,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:54,535 INFO L82 PathProgramCache]: Analyzing trace with hash -726168722, now seen corresponding path program 1 times [2019-11-07 04:05:54,535 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:54,536 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696046116] [2019-11-07 04:05:54,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:54,815 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696046116] [2019-11-07 04:05:54,815 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:54,815 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:54,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240375229] [2019-11-07 04:05:54,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:54,818 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:54,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:54,818 INFO L87 Difference]: Start difference. First operand 227 states and 297 transitions. Second operand 3 states. [2019-11-07 04:05:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:55,032 INFO L93 Difference]: Finished difference Result 416 states and 544 transitions. [2019-11-07 04:05:55,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:55,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 04:05:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:55,036 INFO L225 Difference]: With dead ends: 416 [2019-11-07 04:05:55,037 INFO L226 Difference]: Without dead ends: 292 [2019-11-07 04:05:55,041 INFO L630 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-11-07 04:05:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-07 04:05:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2019-11-07 04:05:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-07 04:05:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 373 transitions. [2019-11-07 04:05:55,109 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 373 transitions. Word has length 22 [2019-11-07 04:05:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:55,109 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 373 transitions. [2019-11-07 04:05:55,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 373 transitions. [2019-11-07 04:05:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 04:05:55,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:55,111 INFO L410 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] [2019-11-07 04:05:55,111 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash -451141895, now seen corresponding path program 1 times [2019-11-07 04:05:55,112 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:55,112 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475544896] [2019-11-07 04:05:55,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:55,239 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475544896] [2019-11-07 04:05:55,239 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:55,239 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:55,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526830542] [2019-11-07 04:05:55,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:55,240 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:55,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:55,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:55,243 INFO L87 Difference]: Start difference. First operand 289 states and 373 transitions. Second operand 3 states. [2019-11-07 04:05:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:55,319 INFO L93 Difference]: Finished difference Result 605 states and 786 transitions. [2019-11-07 04:05:55,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:55,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-07 04:05:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:55,330 INFO L225 Difference]: With dead ends: 605 [2019-11-07 04:05:55,330 INFO L226 Difference]: Without dead ends: 443 [2019-11-07 04:05:55,332 INFO L630 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-11-07 04:05:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-07 04:05:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 415. [2019-11-07 04:05:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-11-07 04:05:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 542 transitions. [2019-11-07 04:05:55,389 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 542 transitions. Word has length 24 [2019-11-07 04:05:55,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:55,389 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 542 transitions. [2019-11-07 04:05:55,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:55,389 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 542 transitions. [2019-11-07 04:05:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 04:05:55,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:55,392 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:55,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:55,393 INFO L82 PathProgramCache]: Analyzing trace with hash -59603234, now seen corresponding path program 1 times [2019-11-07 04:05:55,393 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:55,394 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391397217] [2019-11-07 04:05:55,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:55,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-11-07 04:05:55,494 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391397217] [2019-11-07 04:05:55,494 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:55,494 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:55,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698762799] [2019-11-07 04:05:55,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:55,495 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:55,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:55,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:55,496 INFO L87 Difference]: Start difference. First operand 415 states and 542 transitions. Second operand 3 states. [2019-11-07 04:05:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:55,554 INFO L93 Difference]: Finished difference Result 484 states and 628 transitions. [2019-11-07 04:05:55,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:55,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 04:05:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:55,559 INFO L225 Difference]: With dead ends: 484 [2019-11-07 04:05:55,560 INFO L226 Difference]: Without dead ends: 466 [2019-11-07 04:05:55,561 INFO L630 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-11-07 04:05:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-07 04:05:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 450. [2019-11-07 04:05:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-11-07 04:05:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 584 transitions. [2019-11-07 04:05:55,588 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 584 transitions. Word has length 28 [2019-11-07 04:05:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:55,589 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 584 transitions. [2019-11-07 04:05:55,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 584 transitions. [2019-11-07 04:05:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 04:05:55,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:55,592 INFO L410 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-11-07 04:05:55,592 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:55,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1687296961, now seen corresponding path program 1 times [2019-11-07 04:05:55,592 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:55,593 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122583338] [2019-11-07 04:05:55,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:55,661 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122583338] [2019-11-07 04:05:55,661 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:55,661 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:55,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363797122] [2019-11-07 04:05:55,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:55,662 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:55,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:55,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:55,663 INFO L87 Difference]: Start difference. First operand 450 states and 584 transitions. Second operand 3 states. [2019-11-07 04:05:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:55,758 INFO L93 Difference]: Finished difference Result 459 states and 595 transitions. [2019-11-07 04:05:55,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:55,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-07 04:05:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:55,762 INFO L225 Difference]: With dead ends: 459 [2019-11-07 04:05:55,763 INFO L226 Difference]: Without dead ends: 456 [2019-11-07 04:05:55,763 INFO L630 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-11-07 04:05:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-07 04:05:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-11-07 04:05:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-07 04:05:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 591 transitions. [2019-11-07 04:05:55,789 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 591 transitions. Word has length 32 [2019-11-07 04:05:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:55,790 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 591 transitions. [2019-11-07 04:05:55,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 591 transitions. [2019-11-07 04:05:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 04:05:55,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:55,792 INFO L410 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-11-07 04:05:55,793 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:55,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:55,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1068938519, now seen corresponding path program 1 times [2019-11-07 04:05:55,793 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:55,794 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796071444] [2019-11-07 04:05:55,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:55,842 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796071444] [2019-11-07 04:05:55,842 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:55,842 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:55,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046523112] [2019-11-07 04:05:55,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:55,843 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:55,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:55,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:55,844 INFO L87 Difference]: Start difference. First operand 456 states and 591 transitions. Second operand 3 states. [2019-11-07 04:05:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:55,971 INFO L93 Difference]: Finished difference Result 605 states and 798 transitions. [2019-11-07 04:05:55,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:55,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-07 04:05:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:55,976 INFO L225 Difference]: With dead ends: 605 [2019-11-07 04:05:55,976 INFO L226 Difference]: Without dead ends: 602 [2019-11-07 04:05:55,977 INFO L630 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-11-07 04:05:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-07 04:05:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 502. [2019-11-07 04:05:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-11-07 04:05:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2019-11-07 04:05:56,010 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 35 [2019-11-07 04:05:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:56,010 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2019-11-07 04:05:56,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2019-11-07 04:05:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 04:05:56,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:56,013 INFO L410 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-11-07 04:05:56,013 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:56,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:56,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1155855189, now seen corresponding path program 1 times [2019-11-07 04:05:56,014 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:56,014 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798900736] [2019-11-07 04:05:56,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:56,106 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798900736] [2019-11-07 04:05:56,106 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:56,107 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:56,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951845609] [2019-11-07 04:05:56,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:56,107 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:56,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:56,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,108 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 3 states. [2019-11-07 04:05:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:56,219 INFO L93 Difference]: Finished difference Result 530 states and 687 transitions. [2019-11-07 04:05:56,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:56,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-07 04:05:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:56,224 INFO L225 Difference]: With dead ends: 530 [2019-11-07 04:05:56,224 INFO L226 Difference]: Without dead ends: 525 [2019-11-07 04:05:56,225 INFO L630 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-11-07 04:05:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-07 04:05:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 523. [2019-11-07 04:05:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-07 04:05:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 680 transitions. [2019-11-07 04:05:56,262 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 680 transitions. Word has length 35 [2019-11-07 04:05:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:56,262 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 680 transitions. [2019-11-07 04:05:56,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 680 transitions. [2019-11-07 04:05:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 04:05:56,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:56,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:56,266 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash 984815367, now seen corresponding path program 1 times [2019-11-07 04:05:56,267 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:56,267 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25763660] [2019-11-07 04:05:56,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:56,380 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25763660] [2019-11-07 04:05:56,380 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:56,380 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:05:56,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925929052] [2019-11-07 04:05:56,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:05:56,386 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:05:56,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:05:56,387 INFO L87 Difference]: Start difference. First operand 523 states and 680 transitions. Second operand 8 states. [2019-11-07 04:05:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:57,187 INFO L93 Difference]: Finished difference Result 689 states and 894 transitions. [2019-11-07 04:05:57,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:05:57,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-11-07 04:05:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:57,194 INFO L225 Difference]: With dead ends: 689 [2019-11-07 04:05:57,194 INFO L226 Difference]: Without dead ends: 620 [2019-11-07 04:05:57,195 INFO L630 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-11-07 04:05:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-11-07 04:05:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 517. [2019-11-07 04:05:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-07 04:05:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 666 transitions. [2019-11-07 04:05:57,229 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 666 transitions. Word has length 36 [2019-11-07 04:05:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:57,229 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 666 transitions. [2019-11-07 04:05:57,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:05:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 666 transitions. [2019-11-07 04:05:57,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 04:05:57,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:57,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:57,231 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:57,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:57,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1019894896, now seen corresponding path program 1 times [2019-11-07 04:05:57,232 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:57,232 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431072550] [2019-11-07 04:05:57,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:57,334 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431072550] [2019-11-07 04:05:57,334 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:57,334 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:05:57,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295154035] [2019-11-07 04:05:57,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:05:57,336 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:57,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:05:57,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:05:57,338 INFO L87 Difference]: Start difference. First operand 517 states and 666 transitions. Second operand 8 states. [2019-11-07 04:05:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:57,884 INFO L93 Difference]: Finished difference Result 539 states and 688 transitions. [2019-11-07 04:05:57,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:05:57,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-11-07 04:05:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:57,890 INFO L225 Difference]: With dead ends: 539 [2019-11-07 04:05:57,890 INFO L226 Difference]: Without dead ends: 533 [2019-11-07 04:05:57,891 INFO L630 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-11-07 04:05:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-07 04:05:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 517. [2019-11-07 04:05:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-07 04:05:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 665 transitions. [2019-11-07 04:05:57,936 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 665 transitions. Word has length 36 [2019-11-07 04:05:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:57,936 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 665 transitions. [2019-11-07 04:05:57,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:05:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 665 transitions. [2019-11-07 04:05:57,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 04:05:57,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:57,938 INFO L410 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-11-07 04:05:57,938 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:57,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:57,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1882604984, now seen corresponding path program 1 times [2019-11-07 04:05:57,939 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:57,940 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060321312] [2019-11-07 04:05:57,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:58,053 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060321312] [2019-11-07 04:05:58,053 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:58,053 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:05:58,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961303247] [2019-11-07 04:05:58,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:05:58,054 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:58,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:05:58,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:05:58,055 INFO L87 Difference]: Start difference. First operand 517 states and 665 transitions. Second operand 8 states. [2019-11-07 04:05:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:58,640 INFO L93 Difference]: Finished difference Result 539 states and 686 transitions. [2019-11-07 04:05:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:05:58,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-11-07 04:05:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:58,644 INFO L225 Difference]: With dead ends: 539 [2019-11-07 04:05:58,644 INFO L226 Difference]: Without dead ends: 533 [2019-11-07 04:05:58,645 INFO L630 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-11-07 04:05:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-07 04:05:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 517. [2019-11-07 04:05:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-07 04:05:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 664 transitions. [2019-11-07 04:05:58,676 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 664 transitions. Word has length 37 [2019-11-07 04:05:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:58,677 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 664 transitions. [2019-11-07 04:05:58,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:05:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 664 transitions. [2019-11-07 04:05:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 04:05:58,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:58,678 INFO L410 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-11-07 04:05:58,679 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1685011911, now seen corresponding path program 1 times [2019-11-07 04:05:58,679 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:58,679 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483456394] [2019-11-07 04:05:58,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:58,738 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483456394] [2019-11-07 04:05:58,738 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:58,738 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:05:58,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444172664] [2019-11-07 04:05:58,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:05:58,739 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:05:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:05:58,740 INFO L87 Difference]: Start difference. First operand 517 states and 664 transitions. Second operand 5 states. [2019-11-07 04:05:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:58,783 INFO L93 Difference]: Finished difference Result 533 states and 679 transitions. [2019-11-07 04:05:58,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:05:58,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-07 04:05:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:58,787 INFO L225 Difference]: With dead ends: 533 [2019-11-07 04:05:58,787 INFO L226 Difference]: Without dead ends: 515 [2019-11-07 04:05:58,788 INFO L630 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-11-07 04:05:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-11-07 04:05:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-11-07 04:05:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-07 04:05:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 660 transitions. [2019-11-07 04:05:58,822 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 660 transitions. Word has length 38 [2019-11-07 04:05:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:58,822 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 660 transitions. [2019-11-07 04:05:58,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:05:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 660 transitions. [2019-11-07 04:05:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 04:05:58,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:58,824 INFO L410 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-11-07 04:05:58,824 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:58,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:58,825 INFO L82 PathProgramCache]: Analyzing trace with hash 772670357, now seen corresponding path program 1 times [2019-11-07 04:05:58,825 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:58,825 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928037063] [2019-11-07 04:05:58,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:58,879 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928037063] [2019-11-07 04:05:58,879 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:58,879 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:05:58,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993488910] [2019-11-07 04:05:58,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:05:58,880 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:05:58,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:05:58,881 INFO L87 Difference]: Start difference. First operand 515 states and 660 transitions. Second operand 4 states. [2019-11-07 04:05:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:59,121 INFO L93 Difference]: Finished difference Result 565 states and 704 transitions. [2019-11-07 04:05:59,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:05:59,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-07 04:05:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:59,124 INFO L225 Difference]: With dead ends: 565 [2019-11-07 04:05:59,124 INFO L226 Difference]: Without dead ends: 376 [2019-11-07 04:05:59,125 INFO L630 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-11-07 04:05:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-07 04:05:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 357. [2019-11-07 04:05:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-07 04:05:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 436 transitions. [2019-11-07 04:05:59,163 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 436 transitions. Word has length 40 [2019-11-07 04:05:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:59,163 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 436 transitions. [2019-11-07 04:05:59,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:05:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 436 transitions. [2019-11-07 04:05:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 04:05:59,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:59,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:59,165 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1299782882, now seen corresponding path program 1 times [2019-11-07 04:05:59,166 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:59,166 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318586024] [2019-11-07 04:05:59,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:59,241 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318586024] [2019-11-07 04:05:59,241 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:59,241 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:59,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371599712] [2019-11-07 04:05:59,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:59,243 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:59,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:59,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:59,244 INFO L87 Difference]: Start difference. First operand 357 states and 436 transitions. Second operand 3 states. [2019-11-07 04:05:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:59,327 INFO L93 Difference]: Finished difference Result 538 states and 668 transitions. [2019-11-07 04:05:59,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:59,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-07 04:05:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:59,331 INFO L225 Difference]: With dead ends: 538 [2019-11-07 04:05:59,331 INFO L226 Difference]: Without dead ends: 360 [2019-11-07 04:05:59,333 INFO L630 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-11-07 04:05:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-11-07 04:05:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-11-07 04:05:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-07 04:05:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 440 transitions. [2019-11-07 04:05:59,364 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 440 transitions. Word has length 48 [2019-11-07 04:05:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:59,364 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 440 transitions. [2019-11-07 04:05:59,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 440 transitions. [2019-11-07 04:05:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:05:59,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:59,366 INFO L410 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-11-07 04:05:59,366 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1887771739, now seen corresponding path program 1 times [2019-11-07 04:05:59,367 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:59,367 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378231874] [2019-11-07 04:05:59,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:59,534 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378231874] [2019-11-07 04:05:59,534 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:59,534 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:05:59,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082378708] [2019-11-07 04:05:59,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:05:59,535 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:59,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:05:59,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:05:59,535 INFO L87 Difference]: Start difference. First operand 360 states and 440 transitions. Second operand 5 states. [2019-11-07 04:05:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:59,577 INFO L93 Difference]: Finished difference Result 534 states and 661 transitions. [2019-11-07 04:05:59,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:05:59,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-07 04:05:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:59,579 INFO L225 Difference]: With dead ends: 534 [2019-11-07 04:05:59,580 INFO L226 Difference]: Without dead ends: 353 [2019-11-07 04:05:59,581 INFO L630 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-11-07 04:05:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-07 04:05:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2019-11-07 04:05:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-07 04:05:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 428 transitions. [2019-11-07 04:05:59,605 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 428 transitions. Word has length 50 [2019-11-07 04:05:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:59,605 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 428 transitions. [2019-11-07 04:05:59,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:05:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 428 transitions. [2019-11-07 04:05:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 04:05:59,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:59,608 INFO L410 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-11-07 04:05:59,608 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:59,609 INFO L82 PathProgramCache]: Analyzing trace with hash -445964506, now seen corresponding path program 1 times [2019-11-07 04:05:59,609 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:59,609 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759375627] [2019-11-07 04:05:59,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:59,652 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759375627] [2019-11-07 04:05:59,653 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:59,653 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:59,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708165913] [2019-11-07 04:05:59,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:59,654 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:59,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:59,655 INFO L87 Difference]: Start difference. First operand 353 states and 428 transitions. Second operand 3 states. [2019-11-07 04:05:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:59,768 INFO L93 Difference]: Finished difference Result 493 states and 614 transitions. [2019-11-07 04:05:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:59,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-07 04:05:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:59,772 INFO L225 Difference]: With dead ends: 493 [2019-11-07 04:05:59,772 INFO L226 Difference]: Without dead ends: 485 [2019-11-07 04:05:59,774 INFO L630 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-11-07 04:05:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-11-07 04:05:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 393. [2019-11-07 04:05:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-07 04:05:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 478 transitions. [2019-11-07 04:05:59,803 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 478 transitions. Word has length 43 [2019-11-07 04:05:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:59,805 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 478 transitions. [2019-11-07 04:05:59,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 478 transitions. [2019-11-07 04:05:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 04:05:59,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:59,806 INFO L410 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-11-07 04:05:59,807 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash -488120203, now seen corresponding path program 1 times [2019-11-07 04:05:59,807 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:59,807 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629981562] [2019-11-07 04:05:59,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:59,963 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629981562] [2019-11-07 04:05:59,964 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:59,967 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:05:59,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182398704] [2019-11-07 04:05:59,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:05:59,968 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:05:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:05:59,969 INFO L87 Difference]: Start difference. First operand 393 states and 478 transitions. Second operand 10 states. [2019-11-07 04:06:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:01,333 INFO L93 Difference]: Finished difference Result 439 states and 530 transitions. [2019-11-07 04:06:01,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 04:06:01,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-07 04:06:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:01,336 INFO L225 Difference]: With dead ends: 439 [2019-11-07 04:06:01,337 INFO L226 Difference]: Without dead ends: 435 [2019-11-07 04:06:01,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-11-07 04:06:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-07 04:06:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-11-07 04:06:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-11-07 04:06:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 523 transitions. [2019-11-07 04:06:01,365 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 523 transitions. Word has length 44 [2019-11-07 04:06:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:01,365 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 523 transitions. [2019-11-07 04:06:01,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:06:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 523 transitions. [2019-11-07 04:06:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 04:06:01,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:01,367 INFO L410 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-11-07 04:06:01,367 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash -487843373, now seen corresponding path program 1 times [2019-11-07 04:06:01,368 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:01,368 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283262995] [2019-11-07 04:06:01,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:01,431 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283262995] [2019-11-07 04:06:01,431 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:01,431 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:06:01,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188614656] [2019-11-07 04:06:01,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:06:01,432 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:01,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:06:01,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:01,433 INFO L87 Difference]: Start difference. First operand 431 states and 523 transitions. Second operand 8 states. [2019-11-07 04:06:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:01,585 INFO L93 Difference]: Finished difference Result 463 states and 559 transitions. [2019-11-07 04:06:01,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:06:01,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-11-07 04:06:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:01,588 INFO L225 Difference]: With dead ends: 463 [2019-11-07 04:06:01,589 INFO L226 Difference]: Without dead ends: 447 [2019-11-07 04:06:01,589 INFO L630 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-11-07 04:06:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-07 04:06:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 439. [2019-11-07 04:06:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-11-07 04:06:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 532 transitions. [2019-11-07 04:06:01,617 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 532 transitions. Word has length 44 [2019-11-07 04:06:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:01,618 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 532 transitions. [2019-11-07 04:06:01,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:06:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 532 transitions. [2019-11-07 04:06:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 04:06:01,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:01,620 INFO L410 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-11-07 04:06:01,620 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1717538634, now seen corresponding path program 1 times [2019-11-07 04:06:01,620 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:01,621 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530612821] [2019-11-07 04:06:01,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:01,708 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530612821] [2019-11-07 04:06:01,708 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:01,708 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:06:01,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405104935] [2019-11-07 04:06:01,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:06:01,709 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:01,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:06:01,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:01,709 INFO L87 Difference]: Start difference. First operand 439 states and 532 transitions. Second operand 7 states. [2019-11-07 04:06:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:02,342 INFO L93 Difference]: Finished difference Result 500 states and 609 transitions. [2019-11-07 04:06:02,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:02,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-11-07 04:06:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:02,345 INFO L225 Difference]: With dead ends: 500 [2019-11-07 04:06:02,346 INFO L226 Difference]: Without dead ends: 439 [2019-11-07 04:06:02,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:06:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-11-07 04:06:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-11-07 04:06:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-11-07 04:06:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 530 transitions. [2019-11-07 04:06:02,376 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 530 transitions. Word has length 44 [2019-11-07 04:06:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:02,377 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 530 transitions. [2019-11-07 04:06:02,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:06:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 530 transitions. [2019-11-07 04:06:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 04:06:02,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:02,379 INFO L410 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-11-07 04:06:02,379 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:02,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash 462464929, now seen corresponding path program 1 times [2019-11-07 04:06:02,380 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:02,380 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232868116] [2019-11-07 04:06:02,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:02,418 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232868116] [2019-11-07 04:06:02,418 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:02,418 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:06:02,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048542953] [2019-11-07 04:06:02,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:06:02,419 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:02,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:06:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:06:02,420 INFO L87 Difference]: Start difference. First operand 439 states and 530 transitions. Second operand 3 states. [2019-11-07 04:06:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:02,491 INFO L93 Difference]: Finished difference Result 461 states and 552 transitions. [2019-11-07 04:06:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:06:02,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-07 04:06:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:02,494 INFO L225 Difference]: With dead ends: 461 [2019-11-07 04:06:02,495 INFO L226 Difference]: Without dead ends: 447 [2019-11-07 04:06:02,495 INFO L630 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-11-07 04:06:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-07 04:06:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 435. [2019-11-07 04:06:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-11-07 04:06:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 521 transitions. [2019-11-07 04:06:02,523 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 521 transitions. Word has length 45 [2019-11-07 04:06:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:02,523 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 521 transitions. [2019-11-07 04:06:02,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:06:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 521 transitions. [2019-11-07 04:06:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:06:02,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:02,524 INFO L410 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-11-07 04:06:02,525 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:02,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1389938668, now seen corresponding path program 1 times [2019-11-07 04:06:02,525 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:02,525 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810505662] [2019-11-07 04:06:02,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:02,595 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810505662] [2019-11-07 04:06:02,595 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:02,596 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:02,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214549728] [2019-11-07 04:06:02,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:02,597 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:02,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:02,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:02,598 INFO L87 Difference]: Start difference. First operand 435 states and 521 transitions. Second operand 5 states. [2019-11-07 04:06:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:02,946 INFO L93 Difference]: Finished difference Result 613 states and 744 transitions. [2019-11-07 04:06:02,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:06:02,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-07 04:06:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:02,949 INFO L225 Difference]: With dead ends: 613 [2019-11-07 04:06:02,950 INFO L226 Difference]: Without dead ends: 435 [2019-11-07 04:06:02,951 INFO L630 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-11-07 04:06:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-07 04:06:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-11-07 04:06:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-11-07 04:06:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 520 transitions. [2019-11-07 04:06:02,986 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 520 transitions. Word has length 54 [2019-11-07 04:06:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:02,987 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 520 transitions. [2019-11-07 04:06:02,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 520 transitions. [2019-11-07 04:06:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 04:06:02,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:02,988 INFO L410 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-11-07 04:06:02,989 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1903388506, now seen corresponding path program 1 times [2019-11-07 04:06:02,989 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:02,989 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187765589] [2019-11-07 04:06:02,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:03,055 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187765589] [2019-11-07 04:06:03,055 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:03,055 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:03,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811393954] [2019-11-07 04:06:03,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:03,059 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:03,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:03,060 INFO L87 Difference]: Start difference. First operand 435 states and 520 transitions. Second operand 5 states. [2019-11-07 04:06:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:03,397 INFO L93 Difference]: Finished difference Result 449 states and 533 transitions. [2019-11-07 04:06:03,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:06:03,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-07 04:06:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:03,400 INFO L225 Difference]: With dead ends: 449 [2019-11-07 04:06:03,400 INFO L226 Difference]: Without dead ends: 431 [2019-11-07 04:06:03,401 INFO L630 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-11-07 04:06:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-07 04:06:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2019-11-07 04:06:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-11-07 04:06:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 506 transitions. [2019-11-07 04:06:03,433 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 506 transitions. Word has length 46 [2019-11-07 04:06:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:03,433 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 506 transitions. [2019-11-07 04:06:03,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 506 transitions. [2019-11-07 04:06:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:06:03,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:03,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:03,445 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:03,445 INFO L82 PathProgramCache]: Analyzing trace with hash -234491934, now seen corresponding path program 1 times [2019-11-07 04:06:03,445 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:03,445 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352331259] [2019-11-07 04:06:03,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:03,546 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352331259] [2019-11-07 04:06:03,546 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:03,546 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:06:03,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358328151] [2019-11-07 04:06:03,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:06:03,547 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:03,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:06:03,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:03,548 INFO L87 Difference]: Start difference. First operand 423 states and 506 transitions. Second operand 7 states. [2019-11-07 04:06:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:03,854 INFO L93 Difference]: Finished difference Result 430 states and 514 transitions. [2019-11-07 04:06:03,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:06:03,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-11-07 04:06:03,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:03,859 INFO L225 Difference]: With dead ends: 430 [2019-11-07 04:06:03,859 INFO L226 Difference]: Without dead ends: 427 [2019-11-07 04:06:03,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-11-07 04:06:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-11-07 04:06:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-11-07 04:06:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 506 transitions. [2019-11-07 04:06:03,887 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 506 transitions. Word has length 55 [2019-11-07 04:06:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:03,887 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 506 transitions. [2019-11-07 04:06:03,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:06:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 506 transitions. [2019-11-07 04:06:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:06:03,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:03,889 INFO L410 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-11-07 04:06:03,889 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:03,890 INFO L82 PathProgramCache]: Analyzing trace with hash 163990782, now seen corresponding path program 1 times [2019-11-07 04:06:03,890 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:03,890 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896278462] [2019-11-07 04:06:03,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:03,972 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896278462] [2019-11-07 04:06:03,972 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:03,972 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:03,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462583358] [2019-11-07 04:06:03,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:03,973 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:03,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:03,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:03,974 INFO L87 Difference]: Start difference. First operand 423 states and 506 transitions. Second operand 9 states. [2019-11-07 04:06:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:04,155 INFO L93 Difference]: Finished difference Result 448 states and 531 transitions. [2019-11-07 04:06:04,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:04,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-11-07 04:06:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:04,158 INFO L225 Difference]: With dead ends: 448 [2019-11-07 04:06:04,159 INFO L226 Difference]: Without dead ends: 418 [2019-11-07 04:06:04,160 INFO L630 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-11-07 04:06:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-07 04:06:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2019-11-07 04:06:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-07 04:06:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 498 transitions. [2019-11-07 04:06:04,187 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 498 transitions. Word has length 47 [2019-11-07 04:06:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:04,188 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 498 transitions. [2019-11-07 04:06:04,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 498 transitions. [2019-11-07 04:06:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:06:04,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:04,189 INFO L410 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-11-07 04:06:04,190 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1254376986, now seen corresponding path program 1 times [2019-11-07 04:06:04,190 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:04,190 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604278344] [2019-11-07 04:06:04,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:04,262 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604278344] [2019-11-07 04:06:04,262 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:04,263 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:04,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105441865] [2019-11-07 04:06:04,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:04,263 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:04,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:04,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:04,264 INFO L87 Difference]: Start difference. First operand 418 states and 498 transitions. Second operand 9 states. [2019-11-07 04:06:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:04,457 INFO L93 Difference]: Finished difference Result 443 states and 523 transitions. [2019-11-07 04:06:04,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:04,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-11-07 04:06:04,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:04,460 INFO L225 Difference]: With dead ends: 443 [2019-11-07 04:06:04,460 INFO L226 Difference]: Without dead ends: 413 [2019-11-07 04:06:04,460 INFO L630 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-11-07 04:06:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-07 04:06:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2019-11-07 04:06:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-07 04:06:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 490 transitions. [2019-11-07 04:06:04,484 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 490 transitions. Word has length 47 [2019-11-07 04:06:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:04,485 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 490 transitions. [2019-11-07 04:06:04,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 490 transitions. [2019-11-07 04:06:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 04:06:04,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:04,486 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:04,486 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:04,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1889673940, now seen corresponding path program 1 times [2019-11-07 04:06:04,487 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:04,487 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983129231] [2019-11-07 04:06:04,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:04,533 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983129231] [2019-11-07 04:06:04,533 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:04,533 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:06:04,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439452765] [2019-11-07 04:06:04,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:06:04,534 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:04,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:06:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:06:04,534 INFO L87 Difference]: Start difference. First operand 413 states and 490 transitions. Second operand 6 states. [2019-11-07 04:06:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:04,594 INFO L93 Difference]: Finished difference Result 430 states and 506 transitions. [2019-11-07 04:06:04,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:06:04,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-11-07 04:06:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:04,598 INFO L225 Difference]: With dead ends: 430 [2019-11-07 04:06:04,599 INFO L226 Difference]: Without dead ends: 395 [2019-11-07 04:06:04,599 INFO L630 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-11-07 04:06:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-07 04:06:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2019-11-07 04:06:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-11-07 04:06:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 468 transitions. [2019-11-07 04:06:04,636 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 468 transitions. Word has length 49 [2019-11-07 04:06:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:04,636 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 468 transitions. [2019-11-07 04:06:04,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:06:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 468 transitions. [2019-11-07 04:06:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 04:06:04,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:04,638 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:04,638 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1075527803, now seen corresponding path program 1 times [2019-11-07 04:06:04,639 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:04,639 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975436784] [2019-11-07 04:06:04,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:04,727 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975436784] [2019-11-07 04:06:04,727 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:04,727 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:04,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707810544] [2019-11-07 04:06:04,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:04,728 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:04,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:04,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:04,728 INFO L87 Difference]: Start difference. First operand 395 states and 468 transitions. Second operand 9 states. [2019-11-07 04:06:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:04,943 INFO L93 Difference]: Finished difference Result 420 states and 493 transitions. [2019-11-07 04:06:04,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:04,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-11-07 04:06:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:04,946 INFO L225 Difference]: With dead ends: 420 [2019-11-07 04:06:04,946 INFO L226 Difference]: Without dead ends: 390 [2019-11-07 04:06:04,946 INFO L630 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-11-07 04:06:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-07 04:06:04,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2019-11-07 04:06:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-11-07 04:06:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 460 transitions. [2019-11-07 04:06:04,976 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 460 transitions. Word has length 48 [2019-11-07 04:06:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:04,976 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 460 transitions. [2019-11-07 04:06:04,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 460 transitions. [2019-11-07 04:06:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:06:04,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:04,978 INFO L410 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-11-07 04:06:04,978 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:04,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1514458446, now seen corresponding path program 1 times [2019-11-07 04:06:04,979 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:04,979 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825213096] [2019-11-07 04:06:04,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:05,095 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825213096] [2019-11-07 04:06:05,095 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:05,095 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:05,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768682084] [2019-11-07 04:06:05,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:05,096 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:05,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:05,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:05,097 INFO L87 Difference]: Start difference. First operand 390 states and 460 transitions. Second operand 5 states. [2019-11-07 04:06:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:05,493 INFO L93 Difference]: Finished difference Result 643 states and 771 transitions. [2019-11-07 04:06:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:06:05,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-07 04:06:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:05,498 INFO L225 Difference]: With dead ends: 643 [2019-11-07 04:06:05,498 INFO L226 Difference]: Without dead ends: 471 [2019-11-07 04:06:05,500 INFO L630 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-11-07 04:06:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-07 04:06:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 440. [2019-11-07 04:06:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-07 04:06:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 522 transitions. [2019-11-07 04:06:05,552 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 522 transitions. Word has length 54 [2019-11-07 04:06:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:05,553 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 522 transitions. [2019-11-07 04:06:05,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 522 transitions. [2019-11-07 04:06:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 04:06:05,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:05,555 INFO L410 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-11-07 04:06:05,556 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:05,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:05,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1369679451, now seen corresponding path program 1 times [2019-11-07 04:06:05,556 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:05,557 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700785642] [2019-11-07 04:06:05,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:05,647 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700785642] [2019-11-07 04:06:05,647 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:05,648 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:05,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475526134] [2019-11-07 04:06:05,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:05,648 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:05,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:05,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:05,649 INFO L87 Difference]: Start difference. First operand 440 states and 522 transitions. Second operand 9 states. [2019-11-07 04:06:05,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:05,847 INFO L93 Difference]: Finished difference Result 465 states and 547 transitions. [2019-11-07 04:06:05,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:05,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-07 04:06:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:05,851 INFO L225 Difference]: With dead ends: 465 [2019-11-07 04:06:05,851 INFO L226 Difference]: Without dead ends: 411 [2019-11-07 04:06:05,852 INFO L630 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-11-07 04:06:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-11-07 04:06:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2019-11-07 04:06:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-07 04:06:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 486 transitions. [2019-11-07 04:06:05,911 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 486 transitions. Word has length 51 [2019-11-07 04:06:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:05,912 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 486 transitions. [2019-11-07 04:06:05,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 486 transitions. [2019-11-07 04:06:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-07 04:06:05,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:05,914 INFO L410 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-11-07 04:06:05,914 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:05,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:05,915 INFO L82 PathProgramCache]: Analyzing trace with hash -685045101, now seen corresponding path program 1 times [2019-11-07 04:06:05,915 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:05,916 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235211697] [2019-11-07 04:06:05,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:06,100 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235211697] [2019-11-07 04:06:06,100 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:06,100 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:06,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3028975] [2019-11-07 04:06:06,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:06,101 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:06,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:06,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:06,102 INFO L87 Difference]: Start difference. First operand 411 states and 486 transitions. Second operand 9 states. [2019-11-07 04:06:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:06,690 INFO L93 Difference]: Finished difference Result 445 states and 520 transitions. [2019-11-07 04:06:06,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:06:06,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-11-07 04:06:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:06,693 INFO L225 Difference]: With dead ends: 445 [2019-11-07 04:06:06,693 INFO L226 Difference]: Without dead ends: 409 [2019-11-07 04:06:06,694 INFO L630 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-11-07 04:06:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-11-07 04:06:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-11-07 04:06:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-07 04:06:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 481 transitions. [2019-11-07 04:06:06,723 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 481 transitions. Word has length 63 [2019-11-07 04:06:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:06,724 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 481 transitions. [2019-11-07 04:06:06,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 481 transitions. [2019-11-07 04:06:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-07 04:06:06,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:06,725 INFO L410 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] [2019-11-07 04:06:06,726 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:06,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:06,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1281989941, now seen corresponding path program 1 times [2019-11-07 04:06:06,726 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:06,726 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567964302] [2019-11-07 04:06:06,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:06,817 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567964302] [2019-11-07 04:06:06,818 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:06,818 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:06:06,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713380819] [2019-11-07 04:06:06,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:06:06,819 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:06,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:06:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:06,819 INFO L87 Difference]: Start difference. First operand 409 states and 481 transitions. Second operand 8 states. [2019-11-07 04:06:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:07,457 INFO L93 Difference]: Finished difference Result 491 states and 590 transitions. [2019-11-07 04:06:07,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:07,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-11-07 04:06:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:07,461 INFO L225 Difference]: With dead ends: 491 [2019-11-07 04:06:07,461 INFO L226 Difference]: Without dead ends: 487 [2019-11-07 04:06:07,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:06:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-07 04:06:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 409. [2019-11-07 04:06:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-07 04:06:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 481 transitions. [2019-11-07 04:06:07,493 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 481 transitions. Word has length 64 [2019-11-07 04:06:07,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:07,493 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 481 transitions. [2019-11-07 04:06:07,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:06:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 481 transitions. [2019-11-07 04:06:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 04:06:07,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:07,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:07,495 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:07,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1003050700, now seen corresponding path program 1 times [2019-11-07 04:06:07,496 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:07,496 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446281617] [2019-11-07 04:06:07,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:07,546 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446281617] [2019-11-07 04:06:07,546 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:07,546 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:07,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761915847] [2019-11-07 04:06:07,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:07,547 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:07,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:07,548 INFO L87 Difference]: Start difference. First operand 409 states and 481 transitions. Second operand 5 states. [2019-11-07 04:06:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:07,949 INFO L93 Difference]: Finished difference Result 713 states and 815 transitions. [2019-11-07 04:06:07,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:06:07,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-07 04:06:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:07,952 INFO L225 Difference]: With dead ends: 713 [2019-11-07 04:06:07,952 INFO L226 Difference]: Without dead ends: 460 [2019-11-07 04:06:07,953 INFO L630 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-11-07 04:06:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-07 04:06:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 440. [2019-11-07 04:06:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-07 04:06:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 505 transitions. [2019-11-07 04:06:07,990 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 505 transitions. Word has length 59 [2019-11-07 04:06:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:07,990 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 505 transitions. [2019-11-07 04:06:07,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 505 transitions. [2019-11-07 04:06:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 04:06:07,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:07,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:07,992 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:07,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:07,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1173670243, now seen corresponding path program 1 times [2019-11-07 04:06:07,993 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:07,993 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486570178] [2019-11-07 04:06:07,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:08,066 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486570178] [2019-11-07 04:06:08,066 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:08,067 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:08,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620607848] [2019-11-07 04:06:08,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:08,067 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:08,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:08,068 INFO L87 Difference]: Start difference. First operand 440 states and 505 transitions. Second operand 9 states. [2019-11-07 04:06:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:08,221 INFO L93 Difference]: Finished difference Result 442 states and 506 transitions. [2019-11-07 04:06:08,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:08,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-11-07 04:06:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:08,224 INFO L225 Difference]: With dead ends: 442 [2019-11-07 04:06:08,224 INFO L226 Difference]: Without dead ends: 325 [2019-11-07 04:06:08,225 INFO L630 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-11-07 04:06:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-07 04:06:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-11-07 04:06:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-11-07 04:06:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 377 transitions. [2019-11-07 04:06:08,255 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 377 transitions. Word has length 60 [2019-11-07 04:06:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:08,256 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 377 transitions. [2019-11-07 04:06:08,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 377 transitions. [2019-11-07 04:06:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-07 04:06:08,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:08,257 INFO L410 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] [2019-11-07 04:06:08,257 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1733141653, now seen corresponding path program 1 times [2019-11-07 04:06:08,258 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:08,258 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299227998] [2019-11-07 04:06:08,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:08,322 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299227998] [2019-11-07 04:06:08,322 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:08,322 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:06:08,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596270357] [2019-11-07 04:06:08,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:06:08,323 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:08,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:06:08,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:08,323 INFO L87 Difference]: Start difference. First operand 325 states and 377 transitions. Second operand 7 states. [2019-11-07 04:06:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:08,421 INFO L93 Difference]: Finished difference Result 342 states and 393 transitions. [2019-11-07 04:06:08,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:06:08,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-11-07 04:06:08,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:08,424 INFO L225 Difference]: With dead ends: 342 [2019-11-07 04:06:08,424 INFO L226 Difference]: Without dead ends: 323 [2019-11-07 04:06:08,425 INFO L630 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-11-07 04:06:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-07 04:06:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 284. [2019-11-07 04:06:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-07 04:06:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 325 transitions. [2019-11-07 04:06:08,458 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 325 transitions. Word has length 71 [2019-11-07 04:06:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:08,459 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 325 transitions. [2019-11-07 04:06:08,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:06:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 325 transitions. [2019-11-07 04:06:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-07 04:06:08,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:08,461 INFO L410 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] [2019-11-07 04:06:08,461 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1012836717, now seen corresponding path program 1 times [2019-11-07 04:06:08,461 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:08,461 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995174217] [2019-11-07 04:06:08,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:08,565 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995174217] [2019-11-07 04:06:08,566 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:08,566 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:08,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059968778] [2019-11-07 04:06:08,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:08,567 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:08,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:08,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:08,567 INFO L87 Difference]: Start difference. First operand 284 states and 325 transitions. Second operand 9 states. [2019-11-07 04:06:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:08,942 INFO L93 Difference]: Finished difference Result 400 states and 454 transitions. [2019-11-07 04:06:08,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:06:08,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-11-07 04:06:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:08,944 INFO L225 Difference]: With dead ends: 400 [2019-11-07 04:06:08,945 INFO L226 Difference]: Without dead ends: 256 [2019-11-07 04:06:08,946 INFO L630 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-11-07 04:06:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-07 04:06:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2019-11-07 04:06:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-07 04:06:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 286 transitions. [2019-11-07 04:06:08,968 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 286 transitions. Word has length 72 [2019-11-07 04:06:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:08,969 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 286 transitions. [2019-11-07 04:06:08,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 286 transitions. [2019-11-07 04:06:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-07 04:06:08,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:08,970 INFO L410 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] [2019-11-07 04:06:08,971 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash -392261068, now seen corresponding path program 1 times [2019-11-07 04:06:08,971 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:08,971 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849593243] [2019-11-07 04:06:08,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:09,076 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849593243] [2019-11-07 04:06:09,076 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:09,076 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:06:09,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378739675] [2019-11-07 04:06:09,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:06:09,077 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:09,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:06:09,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:06:09,077 INFO L87 Difference]: Start difference. First operand 252 states and 286 transitions. Second operand 10 states. [2019-11-07 04:06:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:09,318 INFO L93 Difference]: Finished difference Result 294 states and 325 transitions. [2019-11-07 04:06:09,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:06:09,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-11-07 04:06:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:09,320 INFO L225 Difference]: With dead ends: 294 [2019-11-07 04:06:09,320 INFO L226 Difference]: Without dead ends: 232 [2019-11-07 04:06:09,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-07 04:06:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-07 04:06:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-11-07 04:06:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-07 04:06:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 262 transitions. [2019-11-07 04:06:09,347 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 262 transitions. Word has length 78 [2019-11-07 04:06:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:09,347 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 262 transitions. [2019-11-07 04:06:09,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:06:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 262 transitions. [2019-11-07 04:06:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-07 04:06:09,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:09,350 INFO L410 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] [2019-11-07 04:06:09,350 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:09,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:09,350 INFO L82 PathProgramCache]: Analyzing trace with hash 220424145, now seen corresponding path program 1 times [2019-11-07 04:06:09,351 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:09,351 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825944476] [2019-11-07 04:06:09,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:09,479 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825944476] [2019-11-07 04:06:09,479 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:09,480 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:06:09,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669549374] [2019-11-07 04:06:09,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:06:09,480 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:09,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:06:09,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:06:09,481 INFO L87 Difference]: Start difference. First operand 232 states and 262 transitions. Second operand 11 states. [2019-11-07 04:06:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:09,644 INFO L93 Difference]: Finished difference Result 310 states and 347 transitions. [2019-11-07 04:06:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:06:09,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-11-07 04:06:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:09,647 INFO L225 Difference]: With dead ends: 310 [2019-11-07 04:06:09,647 INFO L226 Difference]: Without dead ends: 197 [2019-11-07 04:06:09,648 INFO L630 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-11-07 04:06:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-07 04:06:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2019-11-07 04:06:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-07 04:06:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 207 transitions. [2019-11-07 04:06:09,674 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 207 transitions. Word has length 83 [2019-11-07 04:06:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:09,675 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 207 transitions. [2019-11-07 04:06:09,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:06:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 207 transitions. [2019-11-07 04:06:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-07 04:06:09,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:09,677 INFO L410 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] [2019-11-07 04:06:09,678 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1811313841, now seen corresponding path program 1 times [2019-11-07 04:06:09,678 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:09,679 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562526662] [2019-11-07 04:06:09,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 04:06:09,803 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562526662] [2019-11-07 04:06:09,803 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:09,803 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:06:09,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558941095] [2019-11-07 04:06:09,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:06:09,805 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:09,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:06:09,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:09,808 INFO L87 Difference]: Start difference. First operand 189 states and 207 transitions. Second operand 7 states. [2019-11-07 04:06:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:10,023 INFO L93 Difference]: Finished difference Result 248 states and 279 transitions. [2019-11-07 04:06:10,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:06:10,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-11-07 04:06:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:10,025 INFO L225 Difference]: With dead ends: 248 [2019-11-07 04:06:10,025 INFO L226 Difference]: Without dead ends: 245 [2019-11-07 04:06:10,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:10,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-07 04:06:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 223. [2019-11-07 04:06:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-07 04:06:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2019-11-07 04:06:10,048 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 88 [2019-11-07 04:06:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:10,049 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2019-11-07 04:06:10,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:06:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2019-11-07 04:06:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-07 04:06:10,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:10,051 INFO L410 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] [2019-11-07 04:06:10,051 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1150229932, now seen corresponding path program 1 times [2019-11-07 04:06:10,052 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:10,052 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93082887] [2019-11-07 04:06:10,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 04:06:10,130 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93082887] [2019-11-07 04:06:10,130 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:10,131 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:10,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991605440] [2019-11-07 04:06:10,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:10,131 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:10,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:10,132 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand 5 states. [2019-11-07 04:06:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:10,341 INFO L93 Difference]: Finished difference Result 304 states and 334 transitions. [2019-11-07 04:06:10,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:06:10,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-07 04:06:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:10,343 INFO L225 Difference]: With dead ends: 304 [2019-11-07 04:06:10,343 INFO L226 Difference]: Without dead ends: 243 [2019-11-07 04:06:10,343 INFO L630 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-11-07 04:06:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-07 04:06:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 148. [2019-11-07 04:06:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-07 04:06:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2019-11-07 04:06:10,362 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 96 [2019-11-07 04:06:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:10,363 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2019-11-07 04:06:10,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2019-11-07 04:06:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-07 04:06:10,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:10,364 INFO L410 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] [2019-11-07 04:06:10,365 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1822011349, now seen corresponding path program 1 times [2019-11-07 04:06:10,365 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:10,366 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011061594] [2019-11-07 04:06:10,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 04:06:10,529 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011061594] [2019-11-07 04:06:10,529 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:10,529 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 04:06:10,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414058510] [2019-11-07 04:06:10,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 04:06:10,530 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 04:06:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-07 04:06:10,531 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand 13 states. [2019-11-07 04:06:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:10,823 INFO L93 Difference]: Finished difference Result 191 states and 210 transitions. [2019-11-07 04:06:10,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:06:10,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2019-11-07 04:06:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:10,825 INFO L225 Difference]: With dead ends: 191 [2019-11-07 04:06:10,825 INFO L226 Difference]: Without dead ends: 162 [2019-11-07 04:06:10,826 INFO L630 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-11-07 04:06:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-07 04:06:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2019-11-07 04:06:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-07 04:06:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2019-11-07 04:06:10,851 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 107 [2019-11-07 04:06:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:10,851 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2019-11-07 04:06:10,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 04:06:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2019-11-07 04:06:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 04:06:10,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:10,854 INFO L410 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] [2019-11-07 04:06:10,854 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:10,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash -949307777, now seen corresponding path program 1 times [2019-11-07 04:06:10,855 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:10,855 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700966355] [2019-11-07 04:06:10,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 04:06:11,008 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700966355] [2019-11-07 04:06:11,008 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:11,008 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:06:11,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265064581] [2019-11-07 04:06:11,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:06:11,010 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:06:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:06:11,010 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 11 states. [2019-11-07 04:06:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:11,148 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2019-11-07 04:06:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:06:11,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 120 [2019-11-07 04:06:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:11,150 INFO L225 Difference]: With dead ends: 187 [2019-11-07 04:06:11,150 INFO L226 Difference]: Without dead ends: 154 [2019-11-07 04:06:11,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-07 04:06:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-07 04:06:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-07 04:06:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-07 04:06:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2019-11-07 04:06:11,166 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 120 [2019-11-07 04:06:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:11,167 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2019-11-07 04:06:11,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:06:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2019-11-07 04:06:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-07 04:06:11,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:11,169 INFO L410 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-11-07 04:06:11,169 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:11,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1669499445, now seen corresponding path program 1 times [2019-11-07 04:06:11,170 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:11,170 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228672428] [2019-11-07 04:06:11,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 04:06:11,292 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228672428] [2019-11-07 04:06:11,292 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:11,292 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:11,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077649935] [2019-11-07 04:06:11,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:11,293 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:11,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:11,294 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 5 states. [2019-11-07 04:06:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:11,382 INFO L93 Difference]: Finished difference Result 193 states and 200 transitions. [2019-11-07 04:06:11,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:06:11,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-11-07 04:06:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:11,384 INFO L225 Difference]: With dead ends: 193 [2019-11-07 04:06:11,384 INFO L226 Difference]: Without dead ends: 139 [2019-11-07 04:06:11,384 INFO L630 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-11-07 04:06:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-07 04:06:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-07 04:06:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-07 04:06:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2019-11-07 04:06:11,399 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 123 [2019-11-07 04:06:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:11,399 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2019-11-07 04:06:11,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2019-11-07 04:06:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-07 04:06:11,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:11,401 INFO L410 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] [2019-11-07 04:06:11,401 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:11,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1614696425, now seen corresponding path program 1 times [2019-11-07 04:06:11,402 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:11,403 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438210093] [2019-11-07 04:06:11,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 04:06:11,537 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438210093] [2019-11-07 04:06:11,537 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:11,537 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:11,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320151230] [2019-11-07 04:06:11,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:11,539 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:11,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:11,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:11,540 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 9 states. [2019-11-07 04:06:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:11,833 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2019-11-07 04:06:11,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:11,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-11-07 04:06:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:11,835 INFO L225 Difference]: With dead ends: 189 [2019-11-07 04:06:11,835 INFO L226 Difference]: Without dead ends: 138 [2019-11-07 04:06:11,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:06:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-07 04:06:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-11-07 04:06:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-07 04:06:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-11-07 04:06:11,856 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 125 [2019-11-07 04:06:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:11,857 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-11-07 04:06:11,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-11-07 04:06:11,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-07 04:06:11,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:11,859 INFO L410 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] [2019-11-07 04:06:11,859 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:11,860 INFO L82 PathProgramCache]: Analyzing trace with hash 618335336, now seen corresponding path program 1 times [2019-11-07 04:06:11,860 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:11,860 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828663193] [2019-11-07 04:06:11,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 04:06:12,128 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828663193] [2019-11-07 04:06:12,128 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:12,128 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 04:06:12,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275277098] [2019-11-07 04:06:12,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 04:06:12,129 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:12,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 04:06:12,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:06:12,130 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 14 states. [2019-11-07 04:06:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:13,040 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2019-11-07 04:06:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 04:06:13,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 125 [2019-11-07 04:06:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:13,041 INFO L225 Difference]: With dead ends: 141 [2019-11-07 04:06:13,042 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 04:06:13,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2019-11-07 04:06:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 04:06:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 04:06:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 04:06:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 04:06:13,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2019-11-07 04:06:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:13,044 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 04:06:13,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 04:06:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 04:06:13,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 04:06:13,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 04:06:14,554 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2019-11-07 04:06:14,694 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-11-07 04:06:15,201 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 92 [2019-11-07 04:06:15,702 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 55 [2019-11-07 04:06:15,936 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2019-11-07 04:06:16,294 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 64 [2019-11-07 04:06:16,617 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2019-11-07 04:06:17,135 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-11-07 04:06:17,304 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 1 [2019-11-07 04:06:17,420 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-11-07 04:06:17,731 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-11-07 04:06:17,898 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 85 [2019-11-07 04:06:18,126 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2019-11-07 04:06:18,389 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2019-11-07 04:06:18,608 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-11-07 04:06:18,822 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 1 [2019-11-07 04:06:19,508 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 83 [2019-11-07 04:06:20,070 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 81 [2019-11-07 04:06:20,676 WARN L191 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 93 [2019-11-07 04:06:21,402 WARN L191 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 98 [2019-11-07 04:06:21,529 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-11-07 04:06:21,857 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2019-11-07 04:06:21,984 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-11-07 04:06:22,212 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2019-11-07 04:06:22,377 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-11-07 04:06:22,606 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2019-11-07 04:06:22,901 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 50 [2019-11-07 04:06:23,033 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-11-07 04:06:23,628 WARN L191 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 89 [2019-11-07 04:06:23,905 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-11-07 04:06:24,148 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-07 04:06:24,475 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-11-07 04:06:24,605 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65