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/cdaudio.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:50:20,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:50:20,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:50:20,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:50:20,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:50:20,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:50:20,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:50:20,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:50:20,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:50:20,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:50:20,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:50:20,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:50:20,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:50:20,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:50:20,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:50:20,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:50:20,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:50:20,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:50:20,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:50:20,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:50:20,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:50:20,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:50:20,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:50:20,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:50:20,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:50:20,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:50:20,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:50:20,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:50:20,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:50:20,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:50:20,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:50:20,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:50:20,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:50:20,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:50:20,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:50:20,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:50:20,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:50:20,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:50:20,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:50:20,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:50:20,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:50:20,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:50:20,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:50:20,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:50:20,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:50:20,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:50:20,899 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:50:20,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:50:20,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:50:20,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:50:20,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:50:20,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:50:20,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:50:20,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:50:20,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:50:20,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:50:20,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:50:20,903 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:50:20,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:50:20,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:50:20,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:50:20,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:50:20,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:50:20,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:50:20,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:50:20,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:50:20,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:50:20,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:50:20,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:50:20,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:50:20,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:50:21,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:50:21,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:50:21,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:50:21,191 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:50:21,192 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:50:21,192 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2019-10-07 13:50:21,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47eb393bd/2b39156fa81e4689b8b12ed77704a7ab/FLAG805cf663b [2019-10-07 13:50:22,068 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:50:22,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2019-10-07 13:50:22,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47eb393bd/2b39156fa81e4689b8b12ed77704a7ab/FLAG805cf663b [2019-10-07 13:50:22,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47eb393bd/2b39156fa81e4689b8b12ed77704a7ab [2019-10-07 13:50:22,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:50:22,605 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:50:22,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:50:22,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:50:22,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:50:22,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:50:22" (1/1) ... [2019-10-07 13:50:22,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71858a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:22, skipping insertion in model container [2019-10-07 13:50:22,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:50:22" (1/1) ... [2019-10-07 13:50:22,620 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:50:22,780 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:50:24,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:50:24,558 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:50:25,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:50:25,165 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:50:25,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25 WrapperNode [2019-10-07 13:50:25,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:50:25,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:50:25,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:50:25,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:50:25,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:50:25,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:50:25,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:50:25,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:50:25,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:50:25,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:50:25,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:50:25,845 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2019-10-07 13:50:25,845 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-10-07 13:50:25,845 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-10-07 13:50:25,845 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2019-10-07 13:50:25,846 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2019-10-07 13:50:25,846 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-07 13:50:25,846 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-07 13:50:25,846 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-07 13:50:25,847 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2019-10-07 13:50:25,847 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-07 13:50:25,847 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-07 13:50:25,847 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-07 13:50:25,847 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-10-07 13:50:25,848 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2019-10-07 13:50:25,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2019-10-07 13:50:25,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-07 13:50:25,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-07 13:50:25,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-07 13:50:25,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2019-10-07 13:50:25,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2019-10-07 13:50:25,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2019-10-07 13:50:25,850 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2019-10-07 13:50:25,850 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2019-10-07 13:50:25,850 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-07 13:50:25,850 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-07 13:50:25,850 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-07 13:50:25,850 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-07 13:50:25,851 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-07 13:50:25,851 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-07 13:50:25,851 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-07 13:50:25,851 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-07 13:50:25,852 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-07 13:50:25,852 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-07 13:50:25,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:50:25,852 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2019-10-07 13:50:25,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-10-07 13:50:25,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-10-07 13:50:25,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-10-07 13:50:25,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-10-07 13:50:25,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-10-07 13:50:25,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-10-07 13:50:25,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-10-07 13:50:25,854 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-10-07 13:50:25,854 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-10-07 13:50:25,854 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-10-07 13:50:25,855 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-07 13:50:25,855 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-10-07 13:50:25,855 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-10-07 13:50:25,855 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-10-07 13:50:25,856 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-07 13:50:25,856 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-10-07 13:50:25,856 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-10-07 13:50:25,856 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-10-07 13:50:25,856 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-10-07 13:50:25,857 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-07 13:50:25,857 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-07 13:50:25,857 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-10-07 13:50:25,857 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-07 13:50:25,857 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-10-07 13:50:25,858 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-07 13:50:25,858 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-07 13:50:25,858 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-07 13:50:25,858 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-10-07 13:50:25,858 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-10-07 13:50:25,858 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-10-07 13:50:25,859 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-10-07 13:50:25,859 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-10-07 13:50:25,859 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-10-07 13:50:25,859 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-10-07 13:50:25,859 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-07 13:50:25,860 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-07 13:50:25,860 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-10-07 13:50:25,860 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-10-07 13:50:25,860 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-10-07 13:50:25,860 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-10-07 13:50:25,861 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-10-07 13:50:25,861 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-10-07 13:50:25,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-07 13:50:25,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-10-07 13:50:25,861 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-07 13:50:25,861 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-10-07 13:50:25,861 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-07 13:50:25,862 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-10-07 13:50:25,862 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-10-07 13:50:25,862 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-10-07 13:50:25,862 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-10-07 13:50:25,862 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-10-07 13:50:25,862 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-10-07 13:50:25,863 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-10-07 13:50:25,863 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-10-07 13:50:25,863 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-10-07 13:50:25,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-07 13:50:25,863 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-07 13:50:25,864 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-10-07 13:50:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:50:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:50:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:50:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-07 13:50:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 13:50:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 13:50:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-07 13:50:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-10-07 13:50:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-10-07 13:50:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-07 13:50:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-10-07 13:50:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2019-10-07 13:50:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-10-07 13:50:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-10-07 13:50:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-10-07 13:50:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-10-07 13:50:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-10-07 13:50:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-10-07 13:50:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-10-07 13:50:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-10-07 13:50:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:50:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:50:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-10-07 13:50:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-10-07 13:50:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-07 13:50:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-10-07 13:50:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-10-07 13:50:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-10-07 13:50:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-07 13:50:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-10-07 13:50:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-10-07 13:50:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-10-07 13:50:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-10-07 13:50:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-10-07 13:50:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-10-07 13:50:25,870 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-10-07 13:50:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-10-07 13:50:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-10-07 13:50:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-10-07 13:50:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-10-07 13:50:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-10-07 13:50:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-10-07 13:50:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2019-10-07 13:50:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-10-07 13:50:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-10-07 13:50:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-07 13:50:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-10-07 13:50:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-10-07 13:50:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-10-07 13:50:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-10-07 13:50:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-07 13:50:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-07 13:50:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-07 13:50:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-10-07 13:50:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-10-07 13:50:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-10-07 13:50:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-07 13:50:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-10-07 13:50:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-10-07 13:50:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-10-07 13:50:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-10-07 13:50:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-07 13:50:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-10-07 13:50:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-10-07 13:50:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2019-10-07 13:50:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-07 13:50:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-07 13:50:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-07 13:50:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-10-07 13:50:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-07 13:50:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-10-07 13:50:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-07 13:50:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-07 13:50:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-07 13:50:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-10-07 13:50:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2019-10-07 13:50:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-07 13:50:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-07 13:50:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-07 13:50:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2019-10-07 13:50:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2019-10-07 13:50:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2019-10-07 13:50:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2019-10-07 13:50:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2019-10-07 13:50:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2019-10-07 13:50:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-07 13:50:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-07 13:50:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-07 13:50:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-07 13:50:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-07 13:50:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-07 13:50:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-07 13:50:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-07 13:50:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-07 13:50:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-07 13:50:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:50:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:50:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 13:50:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2019-10-07 13:50:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-07 13:50:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 13:50:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-07 13:50:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-07 13:50:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-07 13:50:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-10-07 13:50:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-07 13:50:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:50:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 13:50:25,885 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2019-10-07 13:50:25,885 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-07 13:50:25,885 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-10-07 13:50:25,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:50:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 13:50:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:50:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-07 13:50:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-07 13:50:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-07 13:50:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-07 13:50:27,676 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,749 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,749 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,750 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,772 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,772 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,795 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,808 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,808 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,809 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,836 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,836 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,842 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:40,133 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-10-07 13:50:40,134 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-10-07 13:50:40,162 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:40,174 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:40,174 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:40,174 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:40,186 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:40,186 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:40,187 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:40,200 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:40,201 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:40,201 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:40,228 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:40,229 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:40,234 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:59,170 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-07 13:50:59,171 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-07 13:50:59,177 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:59,359 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2019-10-07 13:50:59,359 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2019-10-07 13:50:59,375 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:59,385 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:59,385 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:59,386 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:59,421 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-07 13:50:59,422 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-07 13:50:59,422 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:59,429 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:59,430 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:59,430 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:59,440 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:59,440 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:59,456 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:59,471 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:59,471 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:59,471 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:59,480 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:59,480 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:51:07,216 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:13,987 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-07 13:51:13,987 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-07 13:51:13,998 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:28,513 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-07 13:51:28,514 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-07 13:51:28,520 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:28,577 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-07 13:51:28,578 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-07 13:51:28,693 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:28,701 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:51:28,702 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:51:28,748 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:28,837 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-07 13:51:28,837 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-07 13:51:29,047 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:29,061 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:51:29,061 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:51:29,128 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:29,140 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:51:29,141 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:51:29,142 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:39,596 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-10-07 13:51:39,597 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-10-07 13:51:39,607 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:39,643 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-07 13:51:39,644 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-07 13:51:39,656 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:39,708 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-07 13:51:39,708 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-07 13:51:39,824 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:39,834 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:51:39,834 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:51:40,288 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:42,467 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-07 13:51:42,467 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint L3707: #res := 0; [2019-10-07 13:51:42,467 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-07 13:51:42,467 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:42,476 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:51:42,476 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:51:43,995 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:57,606 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-07 13:51:57,607 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-07 13:55:49,800 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:55:49,801 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-10-07 13:55:49,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:55:49 BoogieIcfgContainer [2019-10-07 13:55:49,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:55:49,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:55:49,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:55:49,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:55:49,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:50:22" (1/3) ... [2019-10-07 13:55:49,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a2b179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:55:49, skipping insertion in model container [2019-10-07 13:55:49,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (2/3) ... [2019-10-07 13:55:49,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a2b179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:55:49, skipping insertion in model container [2019-10-07 13:55:49,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:55:49" (3/3) ... [2019-10-07 13:55:49,811 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-2.c [2019-10-07 13:55:49,819 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:55:49,827 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:55:49,836 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:55:49,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:55:49,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:55:49,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:55:49,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:55:49,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:55:49,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:55:49,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:55:49,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:55:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states. [2019-10-07 13:55:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:55:49,917 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:49,918 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:49,920 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:49,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1843878253, now seen corresponding path program 1 times [2019-10-07 13:55:49,931 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:49,932 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:49,932 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:49,932 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:50,447 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:50,447 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:50,447 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:55:50,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:55:50,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:55:50,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:50,469 INFO L87 Difference]: Start difference. First operand 1008 states. Second operand 3 states. [2019-10-07 13:55:50,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:50,722 INFO L93 Difference]: Finished difference Result 988 states and 1509 transitions. [2019-10-07 13:55:50,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:55:50,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-07 13:55:50,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:50,742 INFO L225 Difference]: With dead ends: 988 [2019-10-07 13:55:50,742 INFO L226 Difference]: Without dead ends: 556 [2019-10-07 13:55:50,750 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-10-07 13:55:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-10-07 13:55:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-10-07 13:55:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 811 transitions. [2019-10-07 13:55:50,845 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 811 transitions. Word has length 18 [2019-10-07 13:55:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:50,846 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 811 transitions. [2019-10-07 13:55:50,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:55:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 811 transitions. [2019-10-07 13:55:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:55:50,848 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:50,848 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:50,849 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:50,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash 793989859, now seen corresponding path program 1 times [2019-10-07 13:55:50,849 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:50,849 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:50,849 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:50,849 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:51,053 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:51,054 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:51,054 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:55:51,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:55:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:55:51,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:51,056 INFO L87 Difference]: Start difference. First operand 556 states and 811 transitions. Second operand 3 states. [2019-10-07 13:55:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:51,383 INFO L93 Difference]: Finished difference Result 1006 states and 1460 transitions. [2019-10-07 13:55:51,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:55:51,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-07 13:55:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:51,393 INFO L225 Difference]: With dead ends: 1006 [2019-10-07 13:55:51,393 INFO L226 Difference]: Without dead ends: 770 [2019-10-07 13:55:51,395 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2019-10-07 13:55:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 766. [2019-10-07 13:55:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-10-07 13:55:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1116 transitions. [2019-10-07 13:55:51,485 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1116 transitions. Word has length 21 [2019-10-07 13:55:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:51,486 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1116 transitions. [2019-10-07 13:55:51,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:55:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1116 transitions. [2019-10-07 13:55:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 13:55:51,493 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:51,493 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:51,495 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash 8090219, now seen corresponding path program 1 times [2019-10-07 13:55:51,496 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:51,496 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:51,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:51,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:51,733 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:51,734 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:51,734 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:55:51,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:55:51,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:55:51,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:51,739 INFO L87 Difference]: Start difference. First operand 766 states and 1116 transitions. Second operand 3 states. [2019-10-07 13:55:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:52,244 INFO L93 Difference]: Finished difference Result 1625 states and 2425 transitions. [2019-10-07 13:55:52,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:55:52,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-07 13:55:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:52,257 INFO L225 Difference]: With dead ends: 1625 [2019-10-07 13:55:52,258 INFO L226 Difference]: Without dead ends: 1251 [2019-10-07 13:55:52,260 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-10-07 13:55:52,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 915. [2019-10-07 13:55:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-10-07 13:55:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1353 transitions. [2019-10-07 13:55:52,342 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1353 transitions. Word has length 27 [2019-10-07 13:55:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:52,342 INFO L462 AbstractCegarLoop]: Abstraction has 915 states and 1353 transitions. [2019-10-07 13:55:52,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:55:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1353 transitions. [2019-10-07 13:55:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 13:55:52,346 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:52,346 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:52,346 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:52,347 INFO L82 PathProgramCache]: Analyzing trace with hash 12530571, now seen corresponding path program 1 times [2019-10-07 13:55:52,347 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:52,347 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:52,347 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:52,348 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:52,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:52,667 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:52,667 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:52,667 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:55:52,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:55:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:55:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:55:52,668 INFO L87 Difference]: Start difference. First operand 915 states and 1353 transitions. Second operand 5 states. [2019-10-07 13:55:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:54,318 INFO L93 Difference]: Finished difference Result 1457 states and 2157 transitions. [2019-10-07 13:55:54,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:55:54,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-07 13:55:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:54,328 INFO L225 Difference]: With dead ends: 1457 [2019-10-07 13:55:54,329 INFO L226 Difference]: Without dead ends: 915 [2019-10-07 13:55:54,332 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:55:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-10-07 13:55:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 909. [2019-10-07 13:55:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-10-07 13:55:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1341 transitions. [2019-10-07 13:55:54,385 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1341 transitions. Word has length 28 [2019-10-07 13:55:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:54,385 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1341 transitions. [2019-10-07 13:55:54,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:55:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1341 transitions. [2019-10-07 13:55:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 13:55:54,387 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:54,387 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:54,387 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:54,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:54,388 INFO L82 PathProgramCache]: Analyzing trace with hash -320113336, now seen corresponding path program 1 times [2019-10-07 13:55:54,388 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:54,388 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:54,388 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:54,389 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:54,543 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:54,544 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:54,544 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:55:54,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:55:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:55:54,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:54,547 INFO L87 Difference]: Start difference. First operand 909 states and 1341 transitions. Second operand 3 states. [2019-10-07 13:55:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:54,640 INFO L93 Difference]: Finished difference Result 1473 states and 2137 transitions. [2019-10-07 13:55:54,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:55:54,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-07 13:55:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:54,650 INFO L225 Difference]: With dead ends: 1473 [2019-10-07 13:55:54,650 INFO L226 Difference]: Without dead ends: 1367 [2019-10-07 13:55:54,652 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-10-07 13:55:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1301. [2019-10-07 13:55:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-10-07 13:55:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1918 transitions. [2019-10-07 13:55:54,731 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1918 transitions. Word has length 30 [2019-10-07 13:55:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:54,731 INFO L462 AbstractCegarLoop]: Abstraction has 1301 states and 1918 transitions. [2019-10-07 13:55:54,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:55:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1918 transitions. [2019-10-07 13:55:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 13:55:54,733 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:54,733 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:54,733 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:54,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:54,733 INFO L82 PathProgramCache]: Analyzing trace with hash -238425372, now seen corresponding path program 1 times [2019-10-07 13:55:54,734 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:54,734 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:54,734 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:54,734 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:54,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:54,914 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:54,914 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:54,914 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:55:54,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:55:54,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:55:54,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:55:54,915 INFO L87 Difference]: Start difference. First operand 1301 states and 1918 transitions. Second operand 4 states. [2019-10-07 13:55:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:55,936 INFO L93 Difference]: Finished difference Result 1304 states and 1920 transitions. [2019-10-07 13:55:55,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:55:55,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-07 13:55:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:55,946 INFO L225 Difference]: With dead ends: 1304 [2019-10-07 13:55:55,946 INFO L226 Difference]: Without dead ends: 1300 [2019-10-07 13:55:55,948 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:55:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-10-07 13:55:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2019-10-07 13:55:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-10-07 13:55:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1915 transitions. [2019-10-07 13:55:56,017 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1915 transitions. Word has length 29 [2019-10-07 13:55:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:56,019 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 1915 transitions. [2019-10-07 13:55:56,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:55:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1915 transitions. [2019-10-07 13:55:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:55:56,023 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:56,023 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:56,023 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:56,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:56,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1507301629, now seen corresponding path program 1 times [2019-10-07 13:55:56,024 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:56,024 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:56,024 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:56,024 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:56,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:56,328 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:56,328 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:56,328 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:55:56,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:55:56,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:55:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:55:56,329 INFO L87 Difference]: Start difference. First operand 1300 states and 1915 transitions. Second operand 4 states. [2019-10-07 13:55:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:56,777 INFO L93 Difference]: Finished difference Result 1925 states and 2778 transitions. [2019-10-07 13:55:56,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:55:56,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-07 13:55:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:56,785 INFO L225 Difference]: With dead ends: 1925 [2019-10-07 13:55:56,785 INFO L226 Difference]: Without dead ends: 997 [2019-10-07 13:55:56,788 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:55:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-10-07 13:55:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 930. [2019-10-07 13:55:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-10-07 13:55:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1344 transitions. [2019-10-07 13:55:56,843 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1344 transitions. Word has length 41 [2019-10-07 13:55:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:56,843 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1344 transitions. [2019-10-07 13:55:56,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:55:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1344 transitions. [2019-10-07 13:55:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:55:56,846 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:56,847 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:56,847 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:56,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:56,847 INFO L82 PathProgramCache]: Analyzing trace with hash -804802755, now seen corresponding path program 1 times [2019-10-07 13:55:56,847 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:56,847 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:56,848 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:56,848 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:57,091 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:57,092 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:57,092 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:55:57,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:55:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:55:57,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:57,093 INFO L87 Difference]: Start difference. First operand 930 states and 1344 transitions. Second operand 3 states. [2019-10-07 13:55:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:57,137 INFO L93 Difference]: Finished difference Result 980 states and 1405 transitions. [2019-10-07 13:55:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:55:57,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-07 13:55:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:57,145 INFO L225 Difference]: With dead ends: 980 [2019-10-07 13:55:57,145 INFO L226 Difference]: Without dead ends: 927 [2019-10-07 13:55:57,146 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-10-07 13:55:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2019-10-07 13:55:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-10-07 13:55:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1339 transitions. [2019-10-07 13:55:57,200 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1339 transitions. Word has length 42 [2019-10-07 13:55:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:57,200 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1339 transitions. [2019-10-07 13:55:57,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:55:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1339 transitions. [2019-10-07 13:55:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 13:55:57,204 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:57,205 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:57,205 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash -162937714, now seen corresponding path program 1 times [2019-10-07 13:55:57,206 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:57,206 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:57,206 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:57,206 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:57,479 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:57,479 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:57,479 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:55:57,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:55:57,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:55:57,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:55:57,481 INFO L87 Difference]: Start difference. First operand 927 states and 1339 transitions. Second operand 7 states. [2019-10-07 13:56:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:04,024 INFO L93 Difference]: Finished difference Result 1136 states and 1649 transitions. [2019-10-07 13:56:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:56:04,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-10-07 13:56:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:04,031 INFO L225 Difference]: With dead ends: 1136 [2019-10-07 13:56:04,031 INFO L226 Difference]: Without dead ends: 1080 [2019-10-07 13:56:04,032 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:56:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2019-10-07 13:56:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 899. [2019-10-07 13:56:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-10-07 13:56:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1312 transitions. [2019-10-07 13:56:04,084 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1312 transitions. Word has length 40 [2019-10-07 13:56:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:04,085 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1312 transitions. [2019-10-07 13:56:04,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:56:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1312 transitions. [2019-10-07 13:56:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:56:04,087 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:04,087 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:04,087 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:04,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:04,088 INFO L82 PathProgramCache]: Analyzing trace with hash -981409419, now seen corresponding path program 1 times [2019-10-07 13:56:04,088 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:04,088 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:04,088 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:04,089 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:04,204 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:04,204 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:04,205 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:56:04,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:56:04,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:56:04,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:04,206 INFO L87 Difference]: Start difference. First operand 899 states and 1312 transitions. Second operand 3 states. [2019-10-07 13:56:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:04,278 INFO L93 Difference]: Finished difference Result 914 states and 1332 transitions. [2019-10-07 13:56:04,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:56:04,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-07 13:56:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:04,285 INFO L225 Difference]: With dead ends: 914 [2019-10-07 13:56:04,285 INFO L226 Difference]: Without dead ends: 895 [2019-10-07 13:56:04,286 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-10-07 13:56:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2019-10-07 13:56:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-10-07 13:56:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1305 transitions. [2019-10-07 13:56:04,343 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1305 transitions. Word has length 41 [2019-10-07 13:56:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:04,343 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1305 transitions. [2019-10-07 13:56:04,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:56:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1305 transitions. [2019-10-07 13:56:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:56:04,346 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:04,346 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:04,346 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:04,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash -995754328, now seen corresponding path program 1 times [2019-10-07 13:56:04,347 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:04,347 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:04,347 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:04,347 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:04,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:04,523 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:04,523 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:04,524 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:56:04,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:56:04,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:56:04,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:56:04,525 INFO L87 Difference]: Start difference. First operand 895 states and 1305 transitions. Second operand 7 states. [2019-10-07 13:56:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:08,381 INFO L93 Difference]: Finished difference Result 1030 states and 1508 transitions. [2019-10-07 13:56:08,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:56:08,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-07 13:56:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:08,388 INFO L225 Difference]: With dead ends: 1030 [2019-10-07 13:56:08,388 INFO L226 Difference]: Without dead ends: 978 [2019-10-07 13:56:08,389 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:56:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-07 13:56:08,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 895. [2019-10-07 13:56:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-10-07 13:56:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1303 transitions. [2019-10-07 13:56:08,451 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1303 transitions. Word has length 41 [2019-10-07 13:56:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:08,452 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1303 transitions. [2019-10-07 13:56:08,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:56:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1303 transitions. [2019-10-07 13:56:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:56:08,454 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:08,454 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:08,454 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:08,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2100477860, now seen corresponding path program 1 times [2019-10-07 13:56:08,455 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:08,455 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:08,455 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:08,455 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:08,564 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:08,564 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:08,565 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:56:08,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:56:08,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:56:08,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:08,565 INFO L87 Difference]: Start difference. First operand 895 states and 1303 transitions. Second operand 3 states. [2019-10-07 13:56:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:08,754 INFO L93 Difference]: Finished difference Result 1171 states and 1692 transitions. [2019-10-07 13:56:08,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:56:08,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-07 13:56:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:08,764 INFO L225 Difference]: With dead ends: 1171 [2019-10-07 13:56:08,765 INFO L226 Difference]: Without dead ends: 1160 [2019-10-07 13:56:08,766 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-10-07 13:56:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 922. [2019-10-07 13:56:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-10-07 13:56:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1330 transitions. [2019-10-07 13:56:08,858 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1330 transitions. Word has length 42 [2019-10-07 13:56:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:08,859 INFO L462 AbstractCegarLoop]: Abstraction has 922 states and 1330 transitions. [2019-10-07 13:56:08,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:56:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1330 transitions. [2019-10-07 13:56:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:56:08,861 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:08,861 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:08,861 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:08,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash -238308411, now seen corresponding path program 1 times [2019-10-07 13:56:08,862 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:08,862 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:08,862 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:08,862 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:08,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:09,152 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:09,152 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:09,152 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:56:09,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:56:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:56:09,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:56:09,154 INFO L87 Difference]: Start difference. First operand 922 states and 1330 transitions. Second operand 6 states. [2019-10-07 13:56:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:10,819 INFO L93 Difference]: Finished difference Result 1162 states and 1679 transitions. [2019-10-07 13:56:10,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:56:10,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-10-07 13:56:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:10,828 INFO L225 Difference]: With dead ends: 1162 [2019-10-07 13:56:10,828 INFO L226 Difference]: Without dead ends: 1158 [2019-10-07 13:56:10,829 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:56:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-10-07 13:56:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 924. [2019-10-07 13:56:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2019-10-07 13:56:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1332 transitions. [2019-10-07 13:56:10,920 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1332 transitions. Word has length 43 [2019-10-07 13:56:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:10,920 INFO L462 AbstractCegarLoop]: Abstraction has 924 states and 1332 transitions. [2019-10-07 13:56:10,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:56:10,920 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1332 transitions. [2019-10-07 13:56:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:56:10,923 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:10,923 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:10,923 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:10,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash -238031581, now seen corresponding path program 1 times [2019-10-07 13:56:10,925 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:10,925 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:10,925 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:10,925 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:11,131 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:11,131 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:11,131 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:56:11,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:56:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:56:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:56:11,132 INFO L87 Difference]: Start difference. First operand 924 states and 1332 transitions. Second operand 8 states. [2019-10-07 13:56:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:11,959 INFO L93 Difference]: Finished difference Result 936 states and 1343 transitions. [2019-10-07 13:56:11,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:56:11,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-07 13:56:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:11,966 INFO L225 Difference]: With dead ends: 936 [2019-10-07 13:56:11,966 INFO L226 Difference]: Without dead ends: 907 [2019-10-07 13:56:11,968 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:56:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-10-07 13:56:12,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2019-10-07 13:56:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-10-07 13:56:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1314 transitions. [2019-10-07 13:56:12,055 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1314 transitions. Word has length 43 [2019-10-07 13:56:12,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:12,055 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1314 transitions. [2019-10-07 13:56:12,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:56:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1314 transitions. [2019-10-07 13:56:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:56:12,057 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:12,057 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:12,057 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash 721155329, now seen corresponding path program 1 times [2019-10-07 13:56:12,058 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:12,058 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:12,058 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:12,058 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:12,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:12,228 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:12,229 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:12,229 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:56:12,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:56:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:56:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:12,230 INFO L87 Difference]: Start difference. First operand 907 states and 1314 transitions. Second operand 3 states. [2019-10-07 13:56:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:12,356 INFO L93 Difference]: Finished difference Result 1421 states and 2036 transitions. [2019-10-07 13:56:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:56:12,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-07 13:56:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:12,361 INFO L225 Difference]: With dead ends: 1421 [2019-10-07 13:56:12,361 INFO L226 Difference]: Without dead ends: 962 [2019-10-07 13:56:12,365 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-10-07 13:56:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 907. [2019-10-07 13:56:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-10-07 13:56:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1313 transitions. [2019-10-07 13:56:12,433 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1313 transitions. Word has length 47 [2019-10-07 13:56:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:12,434 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1313 transitions. [2019-10-07 13:56:12,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:56:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1313 transitions. [2019-10-07 13:56:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 13:56:12,436 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:12,437 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:12,437 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:12,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:12,437 INFO L82 PathProgramCache]: Analyzing trace with hash -294737477, now seen corresponding path program 1 times [2019-10-07 13:56:12,437 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:12,438 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:12,438 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:12,438 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:12,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:12,609 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:12,609 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:12,609 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:56:12,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:56:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:56:12,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:12,613 INFO L87 Difference]: Start difference. First operand 907 states and 1313 transitions. Second operand 3 states. [2019-10-07 13:56:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:12,687 INFO L93 Difference]: Finished difference Result 982 states and 1398 transitions. [2019-10-07 13:56:12,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:56:12,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-07 13:56:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:12,692 INFO L225 Difference]: With dead ends: 982 [2019-10-07 13:56:12,693 INFO L226 Difference]: Without dead ends: 918 [2019-10-07 13:56:12,693 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-10-07 13:56:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 898. [2019-10-07 13:56:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2019-10-07 13:56:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1302 transitions. [2019-10-07 13:56:12,902 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1302 transitions. Word has length 48 [2019-10-07 13:56:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:12,903 INFO L462 AbstractCegarLoop]: Abstraction has 898 states and 1302 transitions. [2019-10-07 13:56:12,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:56:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1302 transitions. [2019-10-07 13:56:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:56:12,907 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:12,907 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:12,907 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:12,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:12,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1744989544, now seen corresponding path program 1 times [2019-10-07 13:56:12,908 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:12,908 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:12,908 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:12,910 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:12,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:13,037 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:13,038 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:13,038 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:56:13,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:56:13,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:56:13,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:13,039 INFO L87 Difference]: Start difference. First operand 898 states and 1302 transitions. Second operand 3 states. [2019-10-07 13:56:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:13,163 INFO L93 Difference]: Finished difference Result 920 states and 1326 transitions. [2019-10-07 13:56:13,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:56:13,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-07 13:56:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:13,168 INFO L225 Difference]: With dead ends: 920 [2019-10-07 13:56:13,169 INFO L226 Difference]: Without dead ends: 913 [2019-10-07 13:56:13,171 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-10-07 13:56:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 911. [2019-10-07 13:56:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-10-07 13:56:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1316 transitions. [2019-10-07 13:56:13,230 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1316 transitions. Word has length 50 [2019-10-07 13:56:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:13,230 INFO L462 AbstractCegarLoop]: Abstraction has 911 states and 1316 transitions. [2019-10-07 13:56:13,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:56:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1316 transitions. [2019-10-07 13:56:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:56:13,233 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:13,233 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:13,233 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:13,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:13,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1110491283, now seen corresponding path program 1 times [2019-10-07 13:56:13,233 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:13,235 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:13,236 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:13,236 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:13,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:13,457 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:13,457 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:13,457 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:56:13,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:56:13,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:56:13,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:56:13,458 INFO L87 Difference]: Start difference. First operand 911 states and 1316 transitions. Second operand 11 states. [2019-10-07 13:56:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:14,428 INFO L93 Difference]: Finished difference Result 926 states and 1330 transitions. [2019-10-07 13:56:14,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:56:14,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-10-07 13:56:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:14,434 INFO L225 Difference]: With dead ends: 926 [2019-10-07 13:56:14,435 INFO L226 Difference]: Without dead ends: 909 [2019-10-07 13:56:14,435 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:56:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-10-07 13:56:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2019-10-07 13:56:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-10-07 13:56:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1312 transitions. [2019-10-07 13:56:14,495 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1312 transitions. Word has length 50 [2019-10-07 13:56:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:14,495 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1312 transitions. [2019-10-07 13:56:14,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:56:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1312 transitions. [2019-10-07 13:56:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 13:56:14,498 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:14,498 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:14,498 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:14,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1041483879, now seen corresponding path program 1 times [2019-10-07 13:56:14,499 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:14,499 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:14,499 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:14,499 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:14,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:14,717 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:14,717 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:14,717 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:56:14,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:56:14,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:56:14,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:56:14,718 INFO L87 Difference]: Start difference. First operand 909 states and 1312 transitions. Second operand 10 states. [2019-10-07 13:56:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:15,734 INFO L93 Difference]: Finished difference Result 924 states and 1326 transitions. [2019-10-07 13:56:15,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:56:15,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-10-07 13:56:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:15,739 INFO L225 Difference]: With dead ends: 924 [2019-10-07 13:56:15,739 INFO L226 Difference]: Without dead ends: 907 [2019-10-07 13:56:15,740 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:56:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-10-07 13:56:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2019-10-07 13:56:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-10-07 13:56:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1308 transitions. [2019-10-07 13:56:15,797 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1308 transitions. Word has length 49 [2019-10-07 13:56:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:15,797 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1308 transitions. [2019-10-07 13:56:15,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:56:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1308 transitions. [2019-10-07 13:56:15,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 13:56:15,804 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:15,804 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:15,804 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:15,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:15,804 INFO L82 PathProgramCache]: Analyzing trace with hash -247727543, now seen corresponding path program 1 times [2019-10-07 13:56:15,805 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:15,805 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:15,805 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:15,805 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:15,979 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:15,979 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:15,979 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:56:15,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:56:15,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:56:15,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:15,980 INFO L87 Difference]: Start difference. First operand 907 states and 1308 transitions. Second operand 3 states. [2019-10-07 13:56:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:16,118 INFO L93 Difference]: Finished difference Result 1365 states and 1960 transitions. [2019-10-07 13:56:16,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:56:16,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-07 13:56:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:16,124 INFO L225 Difference]: With dead ends: 1365 [2019-10-07 13:56:16,124 INFO L226 Difference]: Without dead ends: 901 [2019-10-07 13:56:16,126 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-10-07 13:56:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2019-10-07 13:56:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-07 13:56:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1298 transitions. [2019-10-07 13:56:16,185 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1298 transitions. Word has length 55 [2019-10-07 13:56:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:16,185 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1298 transitions. [2019-10-07 13:56:16,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:56:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1298 transitions. [2019-10-07 13:56:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:56:16,194 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:16,194 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:16,194 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:16,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:16,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1249343610, now seen corresponding path program 1 times [2019-10-07 13:56:16,195 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:16,195 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:16,195 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:16,195 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:16,431 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:16,432 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:16,432 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:56:16,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:56:16,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:56:16,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:56:16,433 INFO L87 Difference]: Start difference. First operand 901 states and 1298 transitions. Second operand 10 states. [2019-10-07 13:56:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:17,967 INFO L93 Difference]: Finished difference Result 913 states and 1309 transitions. [2019-10-07 13:56:17,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:56:17,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-07 13:56:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:17,972 INFO L225 Difference]: With dead ends: 913 [2019-10-07 13:56:17,972 INFO L226 Difference]: Without dead ends: 896 [2019-10-07 13:56:17,973 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:56:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-10-07 13:56:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2019-10-07 13:56:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-10-07 13:56:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1291 transitions. [2019-10-07 13:56:18,032 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1291 transitions. Word has length 50 [2019-10-07 13:56:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:18,032 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1291 transitions. [2019-10-07 13:56:18,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:56:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1291 transitions. [2019-10-07 13:56:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-07 13:56:18,035 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:18,035 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:18,035 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:18,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:18,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2134816756, now seen corresponding path program 1 times [2019-10-07 13:56:18,036 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:18,036 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:18,036 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:18,036 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:18,234 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:18,234 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:18,234 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:56:18,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:56:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:56:18,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:56:18,235 INFO L87 Difference]: Start difference. First operand 896 states and 1291 transitions. Second operand 5 states. [2019-10-07 13:56:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:19,123 INFO L93 Difference]: Finished difference Result 904 states and 1297 transitions. [2019-10-07 13:56:19,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:56:19,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-10-07 13:56:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:19,128 INFO L225 Difference]: With dead ends: 904 [2019-10-07 13:56:19,128 INFO L226 Difference]: Without dead ends: 898 [2019-10-07 13:56:19,129 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:56:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-10-07 13:56:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 896. [2019-10-07 13:56:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-10-07 13:56:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1290 transitions. [2019-10-07 13:56:19,186 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1290 transitions. Word has length 52 [2019-10-07 13:56:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:19,186 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1290 transitions. [2019-10-07 13:56:19,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:56:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1290 transitions. [2019-10-07 13:56:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:56:19,189 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:19,189 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:19,189 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:19,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1809119554, now seen corresponding path program 1 times [2019-10-07 13:56:19,190 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:19,190 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:19,190 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:19,190 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:19,439 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:19,439 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:19,439 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:56:19,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:56:19,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:56:19,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:56:19,440 INFO L87 Difference]: Start difference. First operand 896 states and 1290 transitions. Second operand 9 states. [2019-10-07 13:56:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:23,726 INFO L93 Difference]: Finished difference Result 919 states and 1313 transitions. [2019-10-07 13:56:23,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:56:23,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-10-07 13:56:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:23,734 INFO L225 Difference]: With dead ends: 919 [2019-10-07 13:56:23,734 INFO L226 Difference]: Without dead ends: 839 [2019-10-07 13:56:23,735 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:56:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-07 13:56:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2019-10-07 13:56:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-10-07 13:56:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1180 transitions. [2019-10-07 13:56:23,795 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1180 transitions. Word has length 53 [2019-10-07 13:56:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:23,795 INFO L462 AbstractCegarLoop]: Abstraction has 839 states and 1180 transitions. [2019-10-07 13:56:23,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:56:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1180 transitions. [2019-10-07 13:56:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:56:23,800 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:23,800 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:23,800 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:23,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:23,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2094110307, now seen corresponding path program 1 times [2019-10-07 13:56:23,801 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:23,801 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:23,801 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:23,801 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:23,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:24,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-10-07 13:56:24,053 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:24,053 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:24,053 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:56:24,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:56:24,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:56:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:56:24,055 INFO L87 Difference]: Start difference. First operand 839 states and 1180 transitions. Second operand 9 states. [2019-10-07 13:56:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:28,604 INFO L93 Difference]: Finished difference Result 862 states and 1203 transitions. [2019-10-07 13:56:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:56:28,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-10-07 13:56:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:28,610 INFO L225 Difference]: With dead ends: 862 [2019-10-07 13:56:28,610 INFO L226 Difference]: Without dead ends: 802 [2019-10-07 13:56:28,611 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:56:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-10-07 13:56:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 798. [2019-10-07 13:56:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-10-07 13:56:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2019-10-07 13:56:28,810 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 53 [2019-10-07 13:56:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:28,811 INFO L462 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2019-10-07 13:56:28,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:56:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2019-10-07 13:56:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:56:28,813 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:28,813 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:28,814 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:28,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:28,814 INFO L82 PathProgramCache]: Analyzing trace with hash 127906354, now seen corresponding path program 1 times [2019-10-07 13:56:28,814 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:28,814 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:28,814 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:28,815 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:28,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:29,170 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:29,170 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:29,170 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:56:29,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:56:29,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:56:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:56:29,172 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand 13 states. [2019-10-07 13:56:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:31,540 INFO L93 Difference]: Finished difference Result 813 states and 1115 transitions. [2019-10-07 13:56:31,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:56:31,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-10-07 13:56:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:31,545 INFO L225 Difference]: With dead ends: 813 [2019-10-07 13:56:31,545 INFO L226 Difference]: Without dead ends: 793 [2019-10-07 13:56:31,546 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:56:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-10-07 13:56:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2019-10-07 13:56:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-07 13:56:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1094 transitions. [2019-10-07 13:56:31,595 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1094 transitions. Word has length 56 [2019-10-07 13:56:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:31,596 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1094 transitions. [2019-10-07 13:56:31,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:56:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1094 transitions. [2019-10-07 13:56:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 13:56:31,598 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:31,598 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:31,598 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:31,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash -106765367, now seen corresponding path program 1 times [2019-10-07 13:56:31,599 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:31,599 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:31,599 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:31,599 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:31,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:31,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:31,915 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:31,916 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:56:31,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:56:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:56:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:56:31,917 INFO L87 Difference]: Start difference. First operand 793 states and 1094 transitions. Second operand 13 states. [2019-10-07 13:56:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:33,672 INFO L93 Difference]: Finished difference Result 808 states and 1108 transitions. [2019-10-07 13:56:33,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:56:33,672 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-10-07 13:56:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:33,676 INFO L225 Difference]: With dead ends: 808 [2019-10-07 13:56:33,676 INFO L226 Difference]: Without dead ends: 788 [2019-10-07 13:56:33,676 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:56:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-07 13:56:33,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2019-10-07 13:56:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-07 13:56:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1087 transitions. [2019-10-07 13:56:33,724 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1087 transitions. Word has length 55 [2019-10-07 13:56:33,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:33,725 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1087 transitions. [2019-10-07 13:56:33,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:56:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1087 transitions. [2019-10-07 13:56:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-07 13:56:33,727 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:33,727 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:56:33,728 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:33,728 INFO L82 PathProgramCache]: Analyzing trace with hash 290718785, now seen corresponding path program 1 times [2019-10-07 13:56:33,728 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:33,728 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:33,729 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:33,729 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:33,992 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:33,992 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:33,992 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:56:33,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:56:33,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:56:33,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:56:33,993 INFO L87 Difference]: Start difference. First operand 788 states and 1087 transitions. Second operand 5 states. [2019-10-07 13:56:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:35,300 INFO L93 Difference]: Finished difference Result 1442 states and 2030 transitions. [2019-10-07 13:56:35,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:56:35,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-07 13:56:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:35,306 INFO L225 Difference]: With dead ends: 1442 [2019-10-07 13:56:35,307 INFO L226 Difference]: Without dead ends: 1038 [2019-10-07 13:56:35,308 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:56:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2019-10-07 13:56:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 850. [2019-10-07 13:56:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-10-07 13:56:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1167 transitions. [2019-10-07 13:56:35,367 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1167 transitions. Word has length 67 [2019-10-07 13:56:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:35,368 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1167 transitions. [2019-10-07 13:56:35,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:56:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1167 transitions. [2019-10-07 13:56:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 13:56:35,370 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:35,370 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:35,370 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:35,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:35,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1453478186, now seen corresponding path program 1 times [2019-10-07 13:56:35,371 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:35,371 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:35,371 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:35,371 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:35,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:35,532 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:35,532 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:35,532 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:56:35,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:56:35,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:56:35,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:56:35,533 INFO L87 Difference]: Start difference. First operand 850 states and 1167 transitions. Second operand 4 states. [2019-10-07 13:56:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:36,145 INFO L93 Difference]: Finished difference Result 896 states and 1213 transitions. [2019-10-07 13:56:36,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:56:36,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-07 13:56:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:36,151 INFO L225 Difference]: With dead ends: 896 [2019-10-07 13:56:36,152 INFO L226 Difference]: Without dead ends: 868 [2019-10-07 13:56:36,152 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:56:36,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-07 13:56:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 850. [2019-10-07 13:56:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-10-07 13:56:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1166 transitions. [2019-10-07 13:56:36,208 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1166 transitions. Word has length 57 [2019-10-07 13:56:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:36,209 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1166 transitions. [2019-10-07 13:56:36,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:56:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1166 transitions. [2019-10-07 13:56:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:56:36,211 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:36,211 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:36,211 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1347208510, now seen corresponding path program 1 times [2019-10-07 13:56:36,212 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:36,212 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:36,212 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:36,212 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:36,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:36,409 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:36,409 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:36,410 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:56:36,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:56:36,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:56:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:56:36,411 INFO L87 Difference]: Start difference. First operand 850 states and 1166 transitions. Second operand 9 states. [2019-10-07 13:56:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:38,576 INFO L93 Difference]: Finished difference Result 870 states and 1185 transitions. [2019-10-07 13:56:38,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:56:38,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-07 13:56:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:38,579 INFO L225 Difference]: With dead ends: 870 [2019-10-07 13:56:38,579 INFO L226 Difference]: Without dead ends: 848 [2019-10-07 13:56:38,580 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:56:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-10-07 13:56:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2019-10-07 13:56:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-10-07 13:56:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1162 transitions. [2019-10-07 13:56:38,634 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1162 transitions. Word has length 59 [2019-10-07 13:56:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:38,634 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1162 transitions. [2019-10-07 13:56:38,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:56:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1162 transitions. [2019-10-07 13:56:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:56:38,636 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:38,637 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:38,637 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1785415404, now seen corresponding path program 1 times [2019-10-07 13:56:38,637 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:38,637 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:38,638 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:38,638 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:38,928 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:38,929 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:38,929 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:56:38,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:56:38,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:56:38,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:56:38,930 INFO L87 Difference]: Start difference. First operand 848 states and 1162 transitions. Second operand 11 states. [2019-10-07 13:56:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:41,152 INFO L93 Difference]: Finished difference Result 884 states and 1211 transitions. [2019-10-07 13:56:41,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:56:41,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-10-07 13:56:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:41,156 INFO L225 Difference]: With dead ends: 884 [2019-10-07 13:56:41,156 INFO L226 Difference]: Without dead ends: 860 [2019-10-07 13:56:41,157 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:56:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-07 13:56:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 854. [2019-10-07 13:56:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-10-07 13:56:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1180 transitions. [2019-10-07 13:56:41,206 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1180 transitions. Word has length 59 [2019-10-07 13:56:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:41,206 INFO L462 AbstractCegarLoop]: Abstraction has 854 states and 1180 transitions. [2019-10-07 13:56:41,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:56:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1180 transitions. [2019-10-07 13:56:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-07 13:56:41,210 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:41,210 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:41,210 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:41,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:41,210 INFO L82 PathProgramCache]: Analyzing trace with hash -895277615, now seen corresponding path program 1 times [2019-10-07 13:56:41,211 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:41,211 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:41,211 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:41,211 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:41,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:41,359 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:41,359 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:41,360 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:56:41,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:56:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:56:41,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:56:41,361 INFO L87 Difference]: Start difference. First operand 854 states and 1180 transitions. Second operand 5 states. [2019-10-07 13:56:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:49,619 INFO L93 Difference]: Finished difference Result 1264 states and 1705 transitions. [2019-10-07 13:56:49,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:56:49,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-07 13:56:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:49,626 INFO L225 Difference]: With dead ends: 1264 [2019-10-07 13:56:49,626 INFO L226 Difference]: Without dead ends: 846 [2019-10-07 13:56:49,628 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:56:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-10-07 13:56:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2019-10-07 13:56:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-10-07 13:56:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1140 transitions. [2019-10-07 13:56:49,676 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1140 transitions. Word has length 71 [2019-10-07 13:56:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:49,676 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1140 transitions. [2019-10-07 13:56:49,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:56:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1140 transitions. [2019-10-07 13:56:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-07 13:56:49,678 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:49,678 INFO L385 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-10-07 13:56:49,679 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:49,679 INFO L82 PathProgramCache]: Analyzing trace with hash 745950413, now seen corresponding path program 1 times [2019-10-07 13:56:49,679 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:49,679 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:49,680 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:49,680 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:49,826 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:49,826 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:49,826 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:56:49,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:56:49,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:56:49,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:49,827 INFO L87 Difference]: Start difference. First operand 846 states and 1140 transitions. Second operand 3 states. [2019-10-07 13:56:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:49,952 INFO L93 Difference]: Finished difference Result 1077 states and 1454 transitions. [2019-10-07 13:56:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:56:49,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-07 13:56:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:49,956 INFO L225 Difference]: With dead ends: 1077 [2019-10-07 13:56:49,956 INFO L226 Difference]: Without dead ends: 865 [2019-10-07 13:56:49,957 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-10-07 13:56:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 847. [2019-10-07 13:56:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-10-07 13:56:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1138 transitions. [2019-10-07 13:56:50,018 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1138 transitions. Word has length 64 [2019-10-07 13:56:50,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:50,018 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1138 transitions. [2019-10-07 13:56:50,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:56:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1138 transitions. [2019-10-07 13:56:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-07 13:56:50,022 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:50,022 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:50,022 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash -619850044, now seen corresponding path program 1 times [2019-10-07 13:56:50,023 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:50,023 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:50,023 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:50,023 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:50,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:50,160 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:50,160 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:50,160 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:56:50,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:56:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:56:50,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:50,161 INFO L87 Difference]: Start difference. First operand 847 states and 1138 transitions. Second operand 3 states. [2019-10-07 13:56:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:52,241 INFO L93 Difference]: Finished difference Result 1241 states and 1695 transitions. [2019-10-07 13:56:52,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:56:52,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-07 13:56:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:52,244 INFO L225 Difference]: With dead ends: 1241 [2019-10-07 13:56:52,244 INFO L226 Difference]: Without dead ends: 810 [2019-10-07 13:56:52,245 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-10-07 13:56:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2019-10-07 13:56:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-10-07 13:56:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1084 transitions. [2019-10-07 13:56:52,305 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1084 transitions. Word has length 63 [2019-10-07 13:56:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:52,305 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1084 transitions. [2019-10-07 13:56:52,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:56:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1084 transitions. [2019-10-07 13:56:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-07 13:56:52,307 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:52,307 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:52,308 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:52,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:52,308 INFO L82 PathProgramCache]: Analyzing trace with hash -557819259, now seen corresponding path program 1 times [2019-10-07 13:56:52,308 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:52,308 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:52,309 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:52,309 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:52,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:52,665 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:52,665 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:52,666 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:56:52,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:56:52,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:56:52,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:56:52,667 INFO L87 Difference]: Start difference. First operand 808 states and 1084 transitions. Second operand 11 states. [2019-10-07 13:56:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:58,682 INFO L93 Difference]: Finished difference Result 842 states and 1122 transitions. [2019-10-07 13:56:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:56:58,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-10-07 13:56:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:58,686 INFO L225 Difference]: With dead ends: 842 [2019-10-07 13:56:58,687 INFO L226 Difference]: Without dead ends: 819 [2019-10-07 13:56:58,687 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:56:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-10-07 13:56:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 810. [2019-10-07 13:56:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2019-10-07 13:56:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1086 transitions. [2019-10-07 13:56:58,740 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1086 transitions. Word has length 61 [2019-10-07 13:56:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:58,740 INFO L462 AbstractCegarLoop]: Abstraction has 810 states and 1086 transitions. [2019-10-07 13:56:58,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:56:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1086 transitions. [2019-10-07 13:56:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-07 13:56:58,742 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:58,742 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:58,743 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:58,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1121569609, now seen corresponding path program 1 times [2019-10-07 13:56:58,743 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:58,743 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:58,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:58,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:58,862 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:58,863 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:58,863 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:56:58,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:56:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:56:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:58,864 INFO L87 Difference]: Start difference. First operand 810 states and 1086 transitions. Second operand 3 states. [2019-10-07 13:56:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:58,911 INFO L93 Difference]: Finished difference Result 1194 states and 1631 transitions. [2019-10-07 13:56:58,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:56:58,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-07 13:56:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:58,914 INFO L225 Difference]: With dead ends: 1194 [2019-10-07 13:56:58,914 INFO L226 Difference]: Without dead ends: 749 [2019-10-07 13:56:58,916 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:56:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-10-07 13:56:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 718. [2019-10-07 13:56:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-10-07 13:56:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 940 transitions. [2019-10-07 13:56:58,963 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 940 transitions. Word has length 61 [2019-10-07 13:56:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:58,964 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 940 transitions. [2019-10-07 13:56:58,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:56:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 940 transitions. [2019-10-07 13:56:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:56:58,965 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:58,966 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:58,966 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:58,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2087590026, now seen corresponding path program 1 times [2019-10-07 13:56:58,966 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:58,966 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:58,967 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:58,967 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:59,222 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:59,222 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:59,222 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:56:59,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:56:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:56:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:56:59,223 INFO L87 Difference]: Start difference. First operand 718 states and 940 transitions. Second operand 11 states. [2019-10-07 13:57:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:03,458 INFO L93 Difference]: Finished difference Result 741 states and 963 transitions. [2019-10-07 13:57:03,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:57:03,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-10-07 13:57:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:03,460 INFO L225 Difference]: With dead ends: 741 [2019-10-07 13:57:03,461 INFO L226 Difference]: Without dead ends: 715 [2019-10-07 13:57:03,461 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:03,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-10-07 13:57:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-10-07 13:57:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-07 13:57:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 935 transitions. [2019-10-07 13:57:03,510 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 935 transitions. Word has length 62 [2019-10-07 13:57:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:03,510 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 935 transitions. [2019-10-07 13:57:03,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:57:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 935 transitions. [2019-10-07 13:57:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:57:03,512 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:03,512 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:57:03,513 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:03,513 INFO L82 PathProgramCache]: Analyzing trace with hash -878873844, now seen corresponding path program 1 times [2019-10-07 13:57:03,513 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:03,513 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:03,514 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:03,514 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:03,739 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:03,739 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:03,740 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:57:03,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:57:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:57:03,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:57:03,740 INFO L87 Difference]: Start difference. First operand 715 states and 935 transitions. Second operand 11 states. [2019-10-07 13:57:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:06,745 INFO L93 Difference]: Finished difference Result 738 states and 958 transitions. [2019-10-07 13:57:06,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:57:06,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-10-07 13:57:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:06,747 INFO L225 Difference]: With dead ends: 738 [2019-10-07 13:57:06,747 INFO L226 Difference]: Without dead ends: 713 [2019-10-07 13:57:06,748 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-10-07 13:57:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2019-10-07 13:57:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-10-07 13:57:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 931 transitions. [2019-10-07 13:57:06,794 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 931 transitions. Word has length 62 [2019-10-07 13:57:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:06,794 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 931 transitions. [2019-10-07 13:57:06,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:57:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 931 transitions. [2019-10-07 13:57:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:57:06,796 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:06,796 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:57:06,796 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:06,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:06,796 INFO L82 PathProgramCache]: Analyzing trace with hash -944943604, now seen corresponding path program 1 times [2019-10-07 13:57:06,797 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:06,797 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:06,797 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:06,797 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:07,141 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:07,141 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:07,141 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:57:07,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:57:07,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:57:07,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:57:07,143 INFO L87 Difference]: Start difference. First operand 713 states and 931 transitions. Second operand 11 states. [2019-10-07 13:57:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:12,420 INFO L93 Difference]: Finished difference Result 736 states and 954 transitions. [2019-10-07 13:57:12,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:57:12,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-10-07 13:57:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:12,425 INFO L225 Difference]: With dead ends: 736 [2019-10-07 13:57:12,425 INFO L226 Difference]: Without dead ends: 710 [2019-10-07 13:57:12,425 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-07 13:57:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2019-10-07 13:57:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2019-10-07 13:57:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 926 transitions. [2019-10-07 13:57:12,471 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 926 transitions. Word has length 62 [2019-10-07 13:57:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:12,471 INFO L462 AbstractCegarLoop]: Abstraction has 710 states and 926 transitions. [2019-10-07 13:57:12,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:57:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 926 transitions. [2019-10-07 13:57:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-07 13:57:12,473 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:12,473 INFO L385 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-10-07 13:57:12,473 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:12,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1728531617, now seen corresponding path program 1 times [2019-10-07 13:57:12,474 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:12,474 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:12,474 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:12,474 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:12,749 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:12,749 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:12,749 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:57:12,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:57:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:57:12,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:57:12,750 INFO L87 Difference]: Start difference. First operand 710 states and 926 transitions. Second operand 11 states. [2019-10-07 13:57:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:17,138 INFO L93 Difference]: Finished difference Result 733 states and 949 transitions. [2019-10-07 13:57:17,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:57:17,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-07 13:57:17,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:17,141 INFO L225 Difference]: With dead ends: 733 [2019-10-07 13:57:17,141 INFO L226 Difference]: Without dead ends: 702 [2019-10-07 13:57:17,141 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-07 13:57:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2019-10-07 13:57:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-10-07 13:57:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 913 transitions. [2019-10-07 13:57:17,170 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 913 transitions. Word has length 64 [2019-10-07 13:57:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:17,170 INFO L462 AbstractCegarLoop]: Abstraction has 702 states and 913 transitions. [2019-10-07 13:57:17,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:57:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 913 transitions. [2019-10-07 13:57:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-07 13:57:17,172 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:17,172 INFO L385 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-10-07 13:57:17,172 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:17,173 INFO L82 PathProgramCache]: Analyzing trace with hash 118094914, now seen corresponding path program 1 times [2019-10-07 13:57:17,173 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:17,173 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:17,173 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:17,173 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:17,424 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:17,424 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:17,424 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:57:17,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:57:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:57:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:57:17,425 INFO L87 Difference]: Start difference. First operand 702 states and 913 transitions. Second operand 11 states. [2019-10-07 13:57:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:21,809 INFO L93 Difference]: Finished difference Result 725 states and 936 transitions. [2019-10-07 13:57:21,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:57:21,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-07 13:57:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:21,814 INFO L225 Difference]: With dead ends: 725 [2019-10-07 13:57:21,814 INFO L226 Difference]: Without dead ends: 699 [2019-10-07 13:57:21,814 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-10-07 13:57:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2019-10-07 13:57:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-10-07 13:57:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 908 transitions. [2019-10-07 13:57:21,859 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 908 transitions. Word has length 64 [2019-10-07 13:57:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:21,859 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 908 transitions. [2019-10-07 13:57:21,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:57:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 908 transitions. [2019-10-07 13:57:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-07 13:57:21,861 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:21,861 INFO L385 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] [2019-10-07 13:57:21,862 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:21,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:21,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1774452987, now seen corresponding path program 1 times [2019-10-07 13:57:21,862 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:21,862 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:21,863 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:21,863 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:21,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:22,126 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:22,126 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:22,126 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:57:22,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:57:22,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:57:22,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:57:22,128 INFO L87 Difference]: Start difference. First operand 699 states and 908 transitions. Second operand 11 states. [2019-10-07 13:57:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:26,756 INFO L93 Difference]: Finished difference Result 722 states and 931 transitions. [2019-10-07 13:57:26,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:57:26,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-10-07 13:57:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:26,760 INFO L225 Difference]: With dead ends: 722 [2019-10-07 13:57:26,760 INFO L226 Difference]: Without dead ends: 697 [2019-10-07 13:57:26,761 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-10-07 13:57:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2019-10-07 13:57:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-10-07 13:57:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 904 transitions. [2019-10-07 13:57:26,809 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 904 transitions. Word has length 65 [2019-10-07 13:57:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:26,810 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 904 transitions. [2019-10-07 13:57:26,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:57:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 904 transitions. [2019-10-07 13:57:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-07 13:57:26,813 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:26,814 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:57:26,814 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:26,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:26,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1776551768, now seen corresponding path program 1 times [2019-10-07 13:57:26,815 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:26,815 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:26,815 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:26,815 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:26,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:26,994 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:26,994 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:26,994 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:57:26,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:57:26,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:57:26,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:57:26,995 INFO L87 Difference]: Start difference. First operand 697 states and 904 transitions. Second operand 5 states. [2019-10-07 13:57:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:28,040 INFO L93 Difference]: Finished difference Result 887 states and 1173 transitions. [2019-10-07 13:57:28,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:57:28,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-07 13:57:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:28,045 INFO L225 Difference]: With dead ends: 887 [2019-10-07 13:57:28,045 INFO L226 Difference]: Without dead ends: 881 [2019-10-07 13:57:28,046 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:57:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-10-07 13:57:28,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 697. [2019-10-07 13:57:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-10-07 13:57:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 903 transitions. [2019-10-07 13:57:28,094 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 903 transitions. Word has length 66 [2019-10-07 13:57:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:28,094 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 903 transitions. [2019-10-07 13:57:28,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:57:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 903 transitions. [2019-10-07 13:57:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-07 13:57:28,096 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:28,096 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:57:28,096 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1695447136, now seen corresponding path program 1 times [2019-10-07 13:57:28,097 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:28,097 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:28,097 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:28,097 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:28,412 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:28,412 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:28,412 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:57:28,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:57:28,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:57:28,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:28,413 INFO L87 Difference]: Start difference. First operand 697 states and 903 transitions. Second operand 13 states. [2019-10-07 13:57:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:29,641 INFO L93 Difference]: Finished difference Result 712 states and 917 transitions. [2019-10-07 13:57:29,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:57:29,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-10-07 13:57:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:29,646 INFO L225 Difference]: With dead ends: 712 [2019-10-07 13:57:29,646 INFO L226 Difference]: Without dead ends: 683 [2019-10-07 13:57:29,647 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:57:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-10-07 13:57:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2019-10-07 13:57:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-10-07 13:57:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 885 transitions. [2019-10-07 13:57:29,677 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 885 transitions. Word has length 67 [2019-10-07 13:57:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:29,678 INFO L462 AbstractCegarLoop]: Abstraction has 683 states and 885 transitions. [2019-10-07 13:57:29,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:57:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 885 transitions. [2019-10-07 13:57:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 13:57:29,681 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:29,681 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:57:29,682 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:29,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:29,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1000301234, now seen corresponding path program 1 times [2019-10-07 13:57:29,683 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:29,683 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:29,683 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:29,683 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:57:29,917 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:29,917 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:29,917 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:57:29,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:57:29,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:57:29,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:57:29,918 INFO L87 Difference]: Start difference. First operand 683 states and 885 transitions. Second operand 11 states. [2019-10-07 13:57:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:34,456 INFO L93 Difference]: Finished difference Result 706 states and 908 transitions. [2019-10-07 13:57:34,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:57:34,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-07 13:57:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:34,460 INFO L225 Difference]: With dead ends: 706 [2019-10-07 13:57:34,460 INFO L226 Difference]: Without dead ends: 676 [2019-10-07 13:57:34,461 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-10-07 13:57:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2019-10-07 13:57:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-10-07 13:57:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 874 transitions. [2019-10-07 13:57:34,489 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 874 transitions. Word has length 68 [2019-10-07 13:57:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:34,489 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 874 transitions. [2019-10-07 13:57:34,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:57:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 874 transitions. [2019-10-07 13:57:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-07 13:57:34,491 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:34,491 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:57:34,491 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:34,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1659909549, now seen corresponding path program 1 times [2019-10-07 13:57:34,492 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:34,492 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:34,492 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:34,492 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:34,713 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:34,713 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:34,714 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:57:34,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:57:34,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:57:34,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:57:34,715 INFO L87 Difference]: Start difference. First operand 676 states and 874 transitions. Second operand 5 states. [2019-10-07 13:57:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:35,786 INFO L93 Difference]: Finished difference Result 860 states and 1138 transitions. [2019-10-07 13:57:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:57:35,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-07 13:57:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:35,789 INFO L225 Difference]: With dead ends: 860 [2019-10-07 13:57:35,790 INFO L226 Difference]: Without dead ends: 856 [2019-10-07 13:57:35,790 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:57:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-10-07 13:57:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 674. [2019-10-07 13:57:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-10-07 13:57:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 871 transitions. [2019-10-07 13:57:35,845 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 871 transitions. Word has length 67 [2019-10-07 13:57:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:35,845 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 871 transitions. [2019-10-07 13:57:35,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:57:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 871 transitions. [2019-10-07 13:57:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-07 13:57:35,847 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:35,847 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:57:35,847 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:35,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1659632719, now seen corresponding path program 1 times [2019-10-07 13:57:35,848 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:35,848 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:35,848 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:35,849 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:36,110 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:36,111 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:36,111 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:57:36,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:57:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:57:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:57:36,112 INFO L87 Difference]: Start difference. First operand 674 states and 871 transitions. Second operand 11 states. [2019-10-07 13:57:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:37,311 INFO L93 Difference]: Finished difference Result 684 states and 880 transitions. [2019-10-07 13:57:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:57:37,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-10-07 13:57:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:37,314 INFO L225 Difference]: With dead ends: 684 [2019-10-07 13:57:37,314 INFO L226 Difference]: Without dead ends: 660 [2019-10-07 13:57:37,315 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-07 13:57:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 656. [2019-10-07 13:57:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-10-07 13:57:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 849 transitions. [2019-10-07 13:57:37,375 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 849 transitions. Word has length 67 [2019-10-07 13:57:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:37,375 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 849 transitions. [2019-10-07 13:57:37,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:57:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 849 transitions. [2019-10-07 13:57:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 13:57:37,376 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:37,377 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:57:37,377 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:37,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:37,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1481565898, now seen corresponding path program 1 times [2019-10-07 13:57:37,378 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:37,378 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:37,378 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:37,378 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 13:57:37,596 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:37,596 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:37,596 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:57:37,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:57:37,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:57:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:57:37,597 INFO L87 Difference]: Start difference. First operand 656 states and 849 transitions. Second operand 5 states. [2019-10-07 13:57:37,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:37,659 INFO L93 Difference]: Finished difference Result 864 states and 1137 transitions. [2019-10-07 13:57:37,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:57:37,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-07 13:57:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:37,661 INFO L225 Difference]: With dead ends: 864 [2019-10-07 13:57:37,661 INFO L226 Difference]: Without dead ends: 654 [2019-10-07 13:57:37,662 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:57:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-10-07 13:57:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2019-10-07 13:57:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-10-07 13:57:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 846 transitions. [2019-10-07 13:57:37,709 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 846 transitions. Word has length 80 [2019-10-07 13:57:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:37,710 INFO L462 AbstractCegarLoop]: Abstraction has 654 states and 846 transitions. [2019-10-07 13:57:37,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:57:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 846 transitions. [2019-10-07 13:57:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-07 13:57:37,711 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:37,711 INFO L385 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] [2019-10-07 13:57:37,711 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:37,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1180539776, now seen corresponding path program 1 times [2019-10-07 13:57:37,712 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:37,712 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:37,712 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:37,712 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:37,997 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:37,997 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:37,997 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:57:37,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:57:37,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:57:37,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:57:37,998 INFO L87 Difference]: Start difference. First operand 654 states and 846 transitions. Second operand 11 states. [2019-10-07 13:57:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:42,288 INFO L93 Difference]: Finished difference Result 671 states and 862 transitions. [2019-10-07 13:57:42,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:57:42,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-10-07 13:57:42,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:42,291 INFO L225 Difference]: With dead ends: 671 [2019-10-07 13:57:42,291 INFO L226 Difference]: Without dead ends: 634 [2019-10-07 13:57:42,292 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-07 13:57:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-10-07 13:57:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-07 13:57:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 821 transitions. [2019-10-07 13:57:42,351 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 821 transitions. Word has length 70 [2019-10-07 13:57:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:42,351 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 821 transitions. [2019-10-07 13:57:42,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:57:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 821 transitions. [2019-10-07 13:57:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-07 13:57:42,353 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:42,353 INFO L385 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] [2019-10-07 13:57:42,353 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:42,353 INFO L82 PathProgramCache]: Analyzing trace with hash -613004396, now seen corresponding path program 1 times [2019-10-07 13:57:42,354 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:42,354 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:42,354 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:42,354 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:42,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:42,569 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:42,570 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:42,570 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:57:42,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:57:42,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:57:42,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:57:42,571 INFO L87 Difference]: Start difference. First operand 634 states and 821 transitions. Second operand 4 states. [2019-10-07 13:57:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:42,791 INFO L93 Difference]: Finished difference Result 1111 states and 1467 transitions. [2019-10-07 13:57:42,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:57:42,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-10-07 13:57:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:42,794 INFO L225 Difference]: With dead ends: 1111 [2019-10-07 13:57:42,794 INFO L226 Difference]: Without dead ends: 636 [2019-10-07 13:57:42,796 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:57:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-10-07 13:57:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-10-07 13:57:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-07 13:57:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 823 transitions. [2019-10-07 13:57:42,838 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 823 transitions. Word has length 70 [2019-10-07 13:57:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:42,838 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 823 transitions. [2019-10-07 13:57:42,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:57:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 823 transitions. [2019-10-07 13:57:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 13:57:42,840 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:42,840 INFO L385 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] [2019-10-07 13:57:42,840 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:42,840 INFO L82 PathProgramCache]: Analyzing trace with hash 378163113, now seen corresponding path program 1 times [2019-10-07 13:57:42,841 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:42,841 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:42,841 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:42,841 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:43,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-10-07 13:57:43,075 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:43,076 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:43,076 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:57:43,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:57:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:57:43,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:43,077 INFO L87 Difference]: Start difference. First operand 636 states and 823 transitions. Second operand 13 states. [2019-10-07 13:57:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:44,539 INFO L93 Difference]: Finished difference Result 654 states and 840 transitions. [2019-10-07 13:57:44,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:57:44,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-10-07 13:57:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:44,541 INFO L225 Difference]: With dead ends: 654 [2019-10-07 13:57:44,541 INFO L226 Difference]: Without dead ends: 619 [2019-10-07 13:57:44,542 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:57:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-07 13:57:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-07 13:57:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-07 13:57:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 798 transitions. [2019-10-07 13:57:44,570 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 798 transitions. Word has length 77 [2019-10-07 13:57:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:44,570 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 798 transitions. [2019-10-07 13:57:44,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:57:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 798 transitions. [2019-10-07 13:57:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-07 13:57:44,571 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:44,571 INFO L385 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] [2019-10-07 13:57:44,572 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:44,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:44,572 INFO L82 PathProgramCache]: Analyzing trace with hash 735991210, now seen corresponding path program 1 times [2019-10-07 13:57:44,572 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:44,572 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:44,572 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:44,573 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:44,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:57:44,841 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:44,841 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:44,841 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:57:44,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:57:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:57:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:57:44,842 INFO L87 Difference]: Start difference. First operand 619 states and 798 transitions. Second operand 13 states. [2019-10-07 13:57:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:46,166 INFO L93 Difference]: Finished difference Result 621 states and 799 transitions. [2019-10-07 13:57:46,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:57:46,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-10-07 13:57:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:46,169 INFO L225 Difference]: With dead ends: 621 [2019-10-07 13:57:46,169 INFO L226 Difference]: Without dead ends: 582 [2019-10-07 13:57:46,169 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:57:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-07 13:57:46,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-07 13:57:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-07 13:57:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 760 transitions. [2019-10-07 13:57:46,197 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 760 transitions. Word has length 70 [2019-10-07 13:57:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:46,198 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 760 transitions. [2019-10-07 13:57:46,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:57:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 760 transitions. [2019-10-07 13:57:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-07 13:57:46,199 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:46,199 INFO L385 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-10-07 13:57:46,199 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:46,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:46,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2085109357, now seen corresponding path program 1 times [2019-10-07 13:57:46,200 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:46,200 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:46,200 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:46,200 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:57:46,342 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:46,342 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:57:46,343 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:57:46,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:57:46,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:57:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:57:46,343 INFO L87 Difference]: Start difference. First operand 582 states and 760 transitions. Second operand 4 states. [2019-10-07 13:57:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:57:46,490 INFO L93 Difference]: Finished difference Result 1057 states and 1402 transitions. [2019-10-07 13:57:46,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:57:46,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-10-07 13:57:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:57:46,493 INFO L225 Difference]: With dead ends: 1057 [2019-10-07 13:57:46,493 INFO L226 Difference]: Without dead ends: 584 [2019-10-07 13:57:46,495 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:57:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-07 13:57:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-07 13:57:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-07 13:57:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 762 transitions. [2019-10-07 13:57:46,538 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 762 transitions. Word has length 71 [2019-10-07 13:57:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:57:46,539 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 762 transitions. [2019-10-07 13:57:46,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:57:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 762 transitions. [2019-10-07 13:57:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 13:57:46,540 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:57:46,540 INFO L385 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-10-07 13:57:46,540 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:57:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:57:46,541 INFO L82 PathProgramCache]: Analyzing trace with hash -752432138, now seen corresponding path program 1 times [2019-10-07 13:57:46,541 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:57:46,541 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:46,541 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:46,541 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:57:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:57:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:57:46,715 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:57:46,715 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:57:46,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:57:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:57:49,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 13:57:49,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:57:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:57:49,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:57:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:57:49,770 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:57:49,812 INFO L162 IcfgInterpreter]: Started Sifa with 71 locations of interest [2019-10-07 13:57:49,812 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:57:49,819 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:57:49,833 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:57:49,834 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:58:10,890 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 417 [2019-10-07 13:58:21,978 WARN L191 SmtUtils]: Spent 8.81 s on a formula simplification. DAG size of input: 729 DAG size of output: 585 [2019-10-07 13:58:22,285 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 632 [2019-10-07 13:58:22,534 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 632 [2019-10-07 13:58:22,786 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 632 [2019-10-07 13:58:23,089 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 736 [2019-10-07 13:58:23,545 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 736 [2019-10-07 13:58:23,798 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 736 [2019-10-07 13:58:24,097 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 736 [2019-10-07 13:58:24,591 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 738 DAG size of output: 736 [2019-10-07 13:58:24,864 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 736 [2019-10-07 13:58:25,157 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 736 [2019-10-07 13:58:25,564 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 736 [2019-10-07 13:58:25,816 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 736 [2019-10-07 13:58:26,106 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 736 [2019-10-07 13:58:26,123 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 766 for LOIs [2019-10-07 13:58:26,397 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 766 [2019-10-07 13:58:26,655 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 766 [2019-10-07 13:58:27,034 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 828 [2019-10-07 13:58:27,420 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 873 [2019-10-07 13:58:27,921 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 869 [2019-10-07 13:59:55,057 WARN L191 SmtUtils]: Spent 6.63 s on a formula simplification that was a NOOP. DAG size: 1077 [2019-10-07 13:59:56,304 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 1581 [2019-10-07 14:00:09,123 WARN L191 SmtUtils]: Spent 910.00 ms on a formula simplification that was a NOOP. DAG size: 1574 [2019-10-07 14:00:10,641 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 1573 [2019-10-07 14:00:11,670 WARN L191 SmtUtils]: Spent 914.00 ms on a formula simplification that was a NOOP. DAG size: 1572 [2019-10-07 14:00:13,260 WARN L191 SmtUtils]: Spent 934.00 ms on a formula simplification that was a NOOP. DAG size: 1567 [2019-10-07 14:00:25,051 WARN L191 SmtUtils]: Spent 6.65 s on a formula simplification that was a NOOP. DAG size: 1077 [2019-10-07 14:00:26,109 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1528 [2019-10-07 14:00:34,331 WARN L191 SmtUtils]: Spent 883.00 ms on a formula simplification that was a NOOP. DAG size: 1521 [2019-10-07 14:00:35,417 WARN L191 SmtUtils]: Spent 870.00 ms on a formula simplification that was a NOOP. DAG size: 1520 [2019-10-07 14:00:36,430 WARN L191 SmtUtils]: Spent 911.00 ms on a formula simplification that was a NOOP. DAG size: 1519 [2019-10-07 14:00:38,262 WARN L191 SmtUtils]: Spent 885.00 ms on a formula simplification that was a NOOP. DAG size: 1514 [2019-10-07 14:00:40,234 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 933 [2019-10-07 14:00:42,560 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 945 [2019-10-07 14:00:44,608 WARN L191 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 936 [2019-10-07 14:03:04,886 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= |#t~string139.base| |#t~string113.base|)