/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:47:25,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:47:25,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:47:25,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:47:25,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:47:25,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:47:25,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:47:25,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:47:25,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:47:25,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:47:25,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:47:25,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:47:25,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:47:25,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:47:25,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:47:25,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:47:25,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:47:25,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:47:25,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:47:25,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:47:25,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:47:25,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:47:25,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:47:25,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:47:25,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:47:25,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:47:25,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:47:25,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:47:25,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:47:25,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:47:25,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:47:25,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:47:25,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:47:25,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:47:25,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:47:25,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:47:25,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:47:25,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:47:25,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:47:25,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:47:25,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:47:25,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-01-31 23:47:25,522 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:47:25,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:47:25,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:47:25,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:47:25,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:47:25,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:47:25,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:47:25,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:47:25,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:47:25,524 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:47:25,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:47:25,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:47:25,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:47:25,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:47:25,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:47:25,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:47:25,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:47:25,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:47:25,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:47:25,525 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:47:25,525 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 23:47:25,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:47:25,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:47:25,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:47:25,689 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:47:25,690 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:47:25,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c [2022-01-31 23:47:25,736 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc736a77c/96935ef3a27e4a8f805ef611b820fd9b/FLAG157c7f0ef [2022-01-31 23:47:26,221 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:47:26,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c [2022-01-31 23:47:26,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc736a77c/96935ef3a27e4a8f805ef611b820fd9b/FLAG157c7f0ef [2022-01-31 23:47:26,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc736a77c/96935ef3a27e4a8f805ef611b820fd9b [2022-01-31 23:47:26,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:47:26,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:47:26,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:47:26,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:47:26,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:47:26,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:47:26" (1/1) ... [2022-01-31 23:47:26,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35557d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:26, skipping insertion in model container [2022-01-31 23:47:26,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:47:26" (1/1) ... [2022-01-31 23:47:26,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:47:26,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:47:26,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2022-01-31 23:47:27,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:47:27,125 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:47:27,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2022-01-31 23:47:27,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:47:27,305 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:47:27,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:27 WrapperNode [2022-01-31 23:47:27,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:47:27,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:47:27,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:47:27,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:47:27,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:27" (1/1) ... [2022-01-31 23:47:27,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:27" (1/1) ... [2022-01-31 23:47:27,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:27" (1/1) ... [2022-01-31 23:47:27,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:27" (1/1) ... [2022-01-31 23:47:27,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:27" (1/1) ... [2022-01-31 23:47:27,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:27" (1/1) ... [2022-01-31 23:47:27,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:27" (1/1) ... [2022-01-31 23:47:27,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:47:27,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:47:27,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:47:27,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:47:27,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:27" (1/1) ... [2022-01-31 23:47:27,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:47:27,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:47:27,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 23:47:27,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 23:47:27,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:47:27,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:47:27,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~PVOID~0~X~$Pointer$~X~$Pointer$~X~~PBOOLEAN~0~TO~~NTSTATUS~0 [2022-01-31 23:47:27,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~PKEYBOARD_INPUT_DATA~0~X~~POUTPUT_PACKET~0~X~~UCHAR~0~X~~PUCHAR~0~X~~PBOOLEAN~0~X~~PKEYBOARD_SCAN_STATE~0~TO~~BOOLEAN~0 [2022-01-31 23:47:27,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~PVOID~0~X~~PVOID~0~X~~PVOID~0~TO~VOID [2022-01-31 23:47:27,529 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:47:27,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 23:47:27,530 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-01-31 23:47:27,530 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-01-31 23:47:27,530 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_IoCtl [2022-01-31 23:47:27,530 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 23:47:27,530 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 23:47:27,531 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-01-31 23:47:27,531 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_AddDevice [2022-01-31 23:47:27,531 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-01-31 23:47:27,531 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-01-31 23:47:27,531 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-01-31 23:47:27,532 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-01-31 23:47:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-01-31 23:47:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-01-31 23:47:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InitializationRoutine [2022-01-31 23:47:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_IsrHook [2022-01-31 23:47:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_ServiceCallback [2022-01-31 23:47:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Unload [2022-01-31 23:47:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 23:47:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-01-31 23:47:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-01-31 23:47:27,535 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-01-31 23:47:27,535 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-01-31 23:47:27,535 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-01-31 23:47:27,535 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-01-31 23:47:27,550 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-01-31 23:47:27,551 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-01-31 23:47:27,551 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-01-31 23:47:27,551 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-01-31 23:47:27,551 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-01-31 23:47:27,551 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-01-31 23:47:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-01-31 23:47:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-01-31 23:47:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-01-31 23:47:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-01-31 23:47:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-01-31 23:47:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-01-31 23:47:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-01-31 23:47:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-01-31 23:47:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-01-31 23:47:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-01-31 23:47:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-01-31 23:47:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:47:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:47:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:47:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:47:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 23:47:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 23:47:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 23:47:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-01-31 23:47:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-01-31 23:47:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 23:47:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-01-31 23:47:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-01-31 23:47:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-01-31 23:47:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 23:47:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-01-31 23:47:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-01-31 23:47:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-01-31 23:47:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-01-31 23:47:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-01-31 23:47:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-01-31 23:47:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-01-31 23:47:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 23:47:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 23:47:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-01-31 23:47:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-01-31 23:47:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-01-31 23:47:27,560 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-01-31 23:47:27,561 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-01-31 23:47:27,561 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-01-31 23:47:27,563 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-01-31 23:47:27,563 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-01-31 23:47:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-01-31 23:47:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-01-31 23:47:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-01-31 23:47:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-01-31 23:47:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_AddDevice [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_IoCtl [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InitializationRoutine [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_IsrHook [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_ServiceCallback [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Unload [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 23:47:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~PVOID~0~X~$Pointer$~X~$Pointer$~X~~PBOOLEAN~0~TO~~NTSTATUS~0 [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~PKEYBOARD_INPUT_DATA~0~X~~POUTPUT_PACKET~0~X~~UCHAR~0~X~~PUCHAR~0~X~~PBOOLEAN~0~X~~PKEYBOARD_SCAN_STATE~0~TO~~BOOLEAN~0 [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~PVOID~0~X~~PVOID~0~X~~PVOID~0~TO~VOID [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-01-31 23:47:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-01-31 23:47:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-01-31 23:47:28,000 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:47:28,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:47:28,039 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,105 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,105 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,105 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,116 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,116 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,164 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,173 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,174 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,174 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,185 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,185 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,188 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,194 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,194 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,356 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,363 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,364 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,364 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,372 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,372 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,373 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,385 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,385 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,398 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,403 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,403 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,403 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,407 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,407 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,407 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,414 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,414 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,435 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,440 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,440 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,440 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,444 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,444 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,451 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,542 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-01-31 23:47:28,542 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-01-31 23:47:28,552 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,567 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 23:47:28,567 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 23:47:28,577 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:28,580 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:28,581 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:28,583 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:30,003 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-01-31 23:47:30,003 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-01-31 23:47:30,151 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:30,156 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:30,156 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:30,206 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:30,215 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:30,215 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:30,226 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:30,248 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 23:47:30,249 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 23:47:30,255 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:30,264 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 23:47:30,264 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 23:47:30,287 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:30,291 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:30,292 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:30,296 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:30,325 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-01-31 23:47:30,325 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-01-31 23:47:30,329 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:47:30,335 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:47:30,336 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:47:30,364 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:47:30,379 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:47:30,379 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 23:47:30,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:47:30 BoogieIcfgContainer [2022-01-31 23:47:30,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:47:30,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:47:30,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:47:30,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:47:30,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:47:26" (1/3) ... [2022-01-31 23:47:30,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4111569f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:47:30, skipping insertion in model container [2022-01-31 23:47:30,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:47:27" (2/3) ... [2022-01-31 23:47:30,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4111569f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:47:30, skipping insertion in model container [2022-01-31 23:47:30,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:47:30" (3/3) ... [2022-01-31 23:47:30,392 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2022-01-31 23:47:30,396 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:47:30,397 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 23:47:30,471 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:47:30,477 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=QVASR [2022-01-31 23:47:30,478 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 23:47:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 230 states have (on average 1.5) internal successors, (345), 248 states have internal predecessors, (345), 49 states have call successors, (49), 27 states have call predecessors, (49), 27 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2022-01-31 23:47:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 23:47:30,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:47:30,510 INFO L514 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] [2022-01-31 23:47:30,510 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:47:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:47:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1774662017, now seen corresponding path program 1 times [2022-01-31 23:47:30,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:47:30,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [969714219] [2022-01-31 23:47:30,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:47:30,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:47:30,591 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:47:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:30,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:47:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:30,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:47:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:47:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:47:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:47:31,048 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:47:31,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [969714219] [2022-01-31 23:47:31,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [969714219] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:47:31,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:47:31,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:47:31,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393435606] [2022-01-31 23:47:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:47:31,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:47:31,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:47:31,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:47:31,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:47:31,086 INFO L87 Difference]: Start difference. First operand has 308 states, 230 states have (on average 1.5) internal successors, (345), 248 states have internal predecessors, (345), 49 states have call successors, (49), 27 states have call predecessors, (49), 27 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:47:33,165 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:47:35,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:47:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:47:36,525 INFO L93 Difference]: Finished difference Result 643 states and 953 transitions. [2022-01-31 23:47:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:47:36,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-01-31 23:47:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:47:36,538 INFO L225 Difference]: With dead ends: 643 [2022-01-31 23:47:36,538 INFO L226 Difference]: Without dead ends: 343 [2022-01-31 23:47:36,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:47:36,545 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 597 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 220 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:47:36,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 463 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-01-31 23:47:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-01-31 23:47:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 299. [2022-01-31 23:47:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 224 states have (on average 1.4464285714285714) internal successors, (324), 240 states have internal predecessors, (324), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-01-31 23:47:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 407 transitions. [2022-01-31 23:47:36,674 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 407 transitions. Word has length 31 [2022-01-31 23:47:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:47:36,674 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 407 transitions. [2022-01-31 23:47:36,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:47:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 407 transitions. [2022-01-31 23:47:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 23:47:36,675 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:47:36,675 INFO L514 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] [2022-01-31 23:47:36,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:47:36,675 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:47:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:47:36,676 INFO L85 PathProgramCache]: Analyzing trace with hash 186314115, now seen corresponding path program 1 times [2022-01-31 23:47:36,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:47:36,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [56415271] [2022-01-31 23:47:36,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:47:36,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:47:36,684 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:47:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:36,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:47:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:36,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:47:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:36,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:47:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:47:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:47:36,969 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:47:36,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [56415271] [2022-01-31 23:47:36,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [56415271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:47:36,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:47:36,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:47:36,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15799746] [2022-01-31 23:47:36,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:47:36,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:47:36,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:47:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:47:36,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:47:36,971 INFO L87 Difference]: Start difference. First operand 299 states and 407 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:47:39,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:47:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:47:42,466 INFO L93 Difference]: Finished difference Result 360 states and 492 transitions. [2022-01-31 23:47:42,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:47:42,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-01-31 23:47:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:47:42,469 INFO L225 Difference]: With dead ends: 360 [2022-01-31 23:47:42,469 INFO L226 Difference]: Without dead ends: 343 [2022-01-31 23:47:42,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:47:42,472 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 395 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 148 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:47:42,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 683 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1531 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-01-31 23:47:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-01-31 23:47:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 299. [2022-01-31 23:47:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 240 states have internal predecessors, (323), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-01-31 23:47:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 406 transitions. [2022-01-31 23:47:42,505 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 406 transitions. Word has length 31 [2022-01-31 23:47:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:47:42,505 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 406 transitions. [2022-01-31 23:47:42,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:47:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 406 transitions. [2022-01-31 23:47:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 23:47:42,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:47:42,507 INFO L514 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] [2022-01-31 23:47:42,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:47:42,507 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:47:42,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:47:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1201516382, now seen corresponding path program 1 times [2022-01-31 23:47:42,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:47:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1992201387] [2022-01-31 23:47:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:47:42,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:47:42,515 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:47:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:42,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:47:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:47:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:42,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:47:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:42,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:47:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:42,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:47:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:47:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:42,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:47:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:47:42,870 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:47:42,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1992201387] [2022-01-31 23:47:42,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1992201387] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:47:42,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:47:42,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:47:42,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026236484] [2022-01-31 23:47:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:47:42,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:47:42,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:47:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:47:42,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:47:42,875 INFO L87 Difference]: Start difference. First operand 299 states and 406 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:47:44,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:47:47,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:47:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:47:50,605 INFO L93 Difference]: Finished difference Result 599 states and 829 transitions. [2022-01-31 23:47:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:47:50,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2022-01-31 23:47:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:47:50,608 INFO L225 Difference]: With dead ends: 599 [2022-01-31 23:47:50,608 INFO L226 Difference]: Without dead ends: 348 [2022-01-31 23:47:50,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:47:50,610 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 609 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 252 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:47:50,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 792 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1671 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-01-31 23:47:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-01-31 23:47:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 303. [2022-01-31 23:47:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 243 states have internal predecessors, (326), 49 states have call successors, (49), 27 states have call predecessors, (49), 26 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) [2022-01-31 23:47:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 410 transitions. [2022-01-31 23:47:50,638 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 410 transitions. Word has length 53 [2022-01-31 23:47:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:47:50,638 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 410 transitions. [2022-01-31 23:47:50,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:47:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 410 transitions. [2022-01-31 23:47:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 23:47:50,646 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:47:50,646 INFO L514 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] [2022-01-31 23:47:50,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:47:50,646 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:47:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:47:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1078281185, now seen corresponding path program 1 times [2022-01-31 23:47:50,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:47:50,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2131280215] [2022-01-31 23:47:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:47:50,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:47:50,655 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:47:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:50,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:47:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:50,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:47:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:47:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:47:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:50,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:47:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:50,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:47:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:50,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:47:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:47:50,942 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:47:50,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2131280215] [2022-01-31 23:47:50,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2131280215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:47:50,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:47:50,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:47:50,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539005645] [2022-01-31 23:47:50,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:47:50,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:47:50,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:47:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:47:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:47:50,944 INFO L87 Difference]: Start difference. First operand 303 states and 410 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 23:47:53,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:47:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:47:55,418 INFO L93 Difference]: Finished difference Result 492 states and 667 transitions. [2022-01-31 23:47:55,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:47:55,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2022-01-31 23:47:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:47:55,421 INFO L225 Difference]: With dead ends: 492 [2022-01-31 23:47:55,421 INFO L226 Difference]: Without dead ends: 431 [2022-01-31 23:47:55,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:47:55,422 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 864 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 299 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:47:55,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 615 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 808 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-01-31 23:47:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-01-31 23:47:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 374. [2022-01-31 23:47:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 288 states have (on average 1.3715277777777777) internal successors, (395), 292 states have internal predecessors, (395), 48 states have call successors, (48), 33 states have call predecessors, (48), 37 states have return successors, (55), 51 states have call predecessors, (55), 39 states have call successors, (55) [2022-01-31 23:47:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 498 transitions. [2022-01-31 23:47:55,454 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 498 transitions. Word has length 53 [2022-01-31 23:47:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:47:55,455 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 498 transitions. [2022-01-31 23:47:55,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 23:47:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 498 transitions. [2022-01-31 23:47:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 23:47:55,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:47:55,456 INFO L514 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] [2022-01-31 23:47:55,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:47:55,456 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:47:55,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:47:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash 17478568, now seen corresponding path program 1 times [2022-01-31 23:47:55,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:47:55,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777148789] [2022-01-31 23:47:55,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:47:55,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:47:55,464 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:47:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:55,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:47:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:55,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:47:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:55,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:47:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:55,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:47:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:55,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:47:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:55,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:47:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:55,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:47:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:55,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 23:47:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:47:55,744 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:47:55,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777148789] [2022-01-31 23:47:55,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [777148789] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:47:55,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:47:55,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:47:55,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188357126] [2022-01-31 23:47:55,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:47:55,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:47:55,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:47:55,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:47:55,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:47:55,745 INFO L87 Difference]: Start difference. First operand 374 states and 498 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 23:47:57,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:47:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:47:59,262 INFO L93 Difference]: Finished difference Result 569 states and 751 transitions. [2022-01-31 23:47:59,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:47:59,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2022-01-31 23:47:59,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:47:59,265 INFO L225 Difference]: With dead ends: 569 [2022-01-31 23:47:59,265 INFO L226 Difference]: Without dead ends: 450 [2022-01-31 23:47:59,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:47:59,267 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 974 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 330 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:47:59,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [986 Valid, 489 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 650 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-01-31 23:47:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-01-31 23:47:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 410. [2022-01-31 23:47:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 325 states have (on average 1.3723076923076922) internal successors, (446), 327 states have internal predecessors, (446), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-01-31 23:47:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 545 transitions. [2022-01-31 23:47:59,316 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 545 transitions. Word has length 60 [2022-01-31 23:47:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:47:59,316 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 545 transitions. [2022-01-31 23:47:59,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 23:47:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 545 transitions. [2022-01-31 23:47:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 23:47:59,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:47:59,318 INFO L514 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] [2022-01-31 23:47:59,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:47:59,318 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:47:59,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:47:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash -110356200, now seen corresponding path program 1 times [2022-01-31 23:47:59,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:47:59,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [598419097] [2022-01-31 23:47:59,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:47:59,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:47:59,327 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:47:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:59,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:47:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:47:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:47:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:59,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:47:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:59,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:47:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:47:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:59,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:47:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 23:47:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:47:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:47:59,735 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:47:59,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [598419097] [2022-01-31 23:47:59,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [598419097] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:47:59,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:47:59,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:47:59,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196424823] [2022-01-31 23:47:59,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:47:59,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:47:59,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:47:59,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:47:59,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:47:59,737 INFO L87 Difference]: Start difference. First operand 410 states and 545 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 23:48:01,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:48:04,124 INFO L93 Difference]: Finished difference Result 450 states and 594 transitions. [2022-01-31 23:48:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 23:48:04,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2022-01-31 23:48:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:48:04,128 INFO L225 Difference]: With dead ends: 450 [2022-01-31 23:48:04,128 INFO L226 Difference]: Without dead ends: 442 [2022-01-31 23:48:04,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-01-31 23:48:04,134 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 1504 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 516 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:48:04,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1513 Valid, 541 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 748 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-01-31 23:48:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-01-31 23:48:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 415. [2022-01-31 23:48:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 330 states have (on average 1.3696969696969696) internal successors, (452), 332 states have internal predecessors, (452), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-01-31 23:48:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 551 transitions. [2022-01-31 23:48:04,202 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 551 transitions. Word has length 60 [2022-01-31 23:48:04,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:48:04,202 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 551 transitions. [2022-01-31 23:48:04,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 23:48:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 551 transitions. [2022-01-31 23:48:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 23:48:04,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:48:04,203 INFO L514 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] [2022-01-31 23:48:04,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:48:04,203 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:48:04,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:48:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash 400358010, now seen corresponding path program 1 times [2022-01-31 23:48:04,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:48:04,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1250280364] [2022-01-31 23:48:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:48:04,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:48:04,212 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:48:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:04,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:48:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:04,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:04,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:48:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:04,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:48:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:04,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:04,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:48:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:48:04,454 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:48:04,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1250280364] [2022-01-31 23:48:04,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1250280364] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:48:04,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:48:04,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:48:04,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092647169] [2022-01-31 23:48:04,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:48:04,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:48:04,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:48:04,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:48:04,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:48:04,455 INFO L87 Difference]: Start difference. First operand 415 states and 551 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 23:48:06,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:09,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:48:09,990 INFO L93 Difference]: Finished difference Result 433 states and 574 transitions. [2022-01-31 23:48:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:48:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-01-31 23:48:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:48:09,993 INFO L225 Difference]: With dead ends: 433 [2022-01-31 23:48:09,993 INFO L226 Difference]: Without dead ends: 429 [2022-01-31 23:48:09,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:48:09,995 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 725 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 257 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:48:09,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 475 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 675 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-01-31 23:48:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-01-31 23:48:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 414. [2022-01-31 23:48:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 331 states have internal predecessors, (450), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-01-31 23:48:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 548 transitions. [2022-01-31 23:48:10,051 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 548 transitions. Word has length 62 [2022-01-31 23:48:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:48:10,051 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 548 transitions. [2022-01-31 23:48:10,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 23:48:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 548 transitions. [2022-01-31 23:48:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 23:48:10,052 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:48:10,052 INFO L514 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] [2022-01-31 23:48:10,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 23:48:10,052 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:48:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:48:10,053 INFO L85 PathProgramCache]: Analyzing trace with hash 466089939, now seen corresponding path program 1 times [2022-01-31 23:48:10,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:48:10,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1009272779] [2022-01-31 23:48:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:48:10,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:48:10,062 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:48:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:48:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:10,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:10,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:48:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:48:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:48:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:10,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 23:48:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:48:10,397 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:48:10,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1009272779] [2022-01-31 23:48:10,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1009272779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:48:10,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:48:10,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:48:10,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800808252] [2022-01-31 23:48:10,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:48:10,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:48:10,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:48:10,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:48:10,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:48:10,399 INFO L87 Difference]: Start difference. First operand 414 states and 548 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 23:48:12,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:48:14,780 INFO L93 Difference]: Finished difference Result 448 states and 589 transitions. [2022-01-31 23:48:14,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 23:48:14,780 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2022-01-31 23:48:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:48:14,782 INFO L225 Difference]: With dead ends: 448 [2022-01-31 23:48:14,782 INFO L226 Difference]: Without dead ends: 440 [2022-01-31 23:48:14,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-01-31 23:48:14,783 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 1681 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 557 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:48:14,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1690 Valid, 608 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 893 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-01-31 23:48:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-01-31 23:48:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 415. [2022-01-31 23:48:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 331 states have (on average 1.3625377643504533) internal successors, (451), 332 states have internal predecessors, (451), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-01-31 23:48:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 549 transitions. [2022-01-31 23:48:14,843 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 549 transitions. Word has length 61 [2022-01-31 23:48:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:48:14,844 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 549 transitions. [2022-01-31 23:48:14,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 23:48:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 549 transitions. [2022-01-31 23:48:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 23:48:14,845 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:48:14,845 INFO L514 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] [2022-01-31 23:48:14,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 23:48:14,845 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:48:14,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:48:14,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1325055407, now seen corresponding path program 1 times [2022-01-31 23:48:14,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:48:14,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1846003240] [2022-01-31 23:48:14,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:48:14,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:48:14,853 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:48:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:14,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:48:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:48:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:48:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:15,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:15,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:48:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:15,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 23:48:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:48:15,104 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:48:15,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1846003240] [2022-01-31 23:48:15,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1846003240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:48:15,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:48:15,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:48:15,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189759604] [2022-01-31 23:48:15,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:48:15,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:48:15,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:48:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:48:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:48:15,105 INFO L87 Difference]: Start difference. First operand 415 states and 549 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 23:48:17,219 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:48:20,430 INFO L93 Difference]: Finished difference Result 442 states and 581 transitions. [2022-01-31 23:48:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 23:48:20,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-01-31 23:48:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:48:20,432 INFO L225 Difference]: With dead ends: 442 [2022-01-31 23:48:20,432 INFO L226 Difference]: Without dead ends: 389 [2022-01-31 23:48:20,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2022-01-31 23:48:20,433 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 1384 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 450 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:48:20,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1392 Valid, 611 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 877 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-01-31 23:48:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-01-31 23:48:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 371. [2022-01-31 23:48:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 296 states have (on average 1.3817567567567568) internal successors, (409), 302 states have internal predecessors, (409), 42 states have call successors, (42), 32 states have call predecessors, (42), 32 states have return successors, (42), 37 states have call predecessors, (42), 36 states have call successors, (42) [2022-01-31 23:48:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 493 transitions. [2022-01-31 23:48:20,481 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 493 transitions. Word has length 62 [2022-01-31 23:48:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:48:20,482 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 493 transitions. [2022-01-31 23:48:20,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 23:48:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 493 transitions. [2022-01-31 23:48:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-31 23:48:20,483 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:48:20,483 INFO L514 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] [2022-01-31 23:48:20,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 23:48:20,483 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:48:20,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:48:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1052170321, now seen corresponding path program 1 times [2022-01-31 23:48:20,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:48:20,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [454278369] [2022-01-31 23:48:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:48:20,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:48:20,492 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:48:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:20,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:48:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:20,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:20,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:48:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:20,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:48:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:48:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:20,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 23:48:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:20,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:48:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:48:20,902 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:48:20,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [454278369] [2022-01-31 23:48:20,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [454278369] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:48:20,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:48:20,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:48:20,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171432825] [2022-01-31 23:48:20,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:48:20,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:48:20,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:48:20,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:48:20,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:48:20,904 INFO L87 Difference]: Start difference. First operand 371 states and 493 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:48:23,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:48:26,437 INFO L93 Difference]: Finished difference Result 417 states and 550 transitions. [2022-01-31 23:48:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 23:48:26,437 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2022-01-31 23:48:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:48:26,439 INFO L225 Difference]: With dead ends: 417 [2022-01-31 23:48:26,439 INFO L226 Difference]: Without dead ends: 409 [2022-01-31 23:48:26,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2022-01-31 23:48:26,440 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 884 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 274 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:48:26,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [896 Valid, 572 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1342 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-01-31 23:48:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-01-31 23:48:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 386. [2022-01-31 23:48:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 309 states have (on average 1.3754045307443366) internal successors, (425), 314 states have internal predecessors, (425), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-01-31 23:48:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2022-01-31 23:48:26,515 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 72 [2022-01-31 23:48:26,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:48:26,516 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2022-01-31 23:48:26,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:48:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2022-01-31 23:48:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 23:48:26,517 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:48:26,517 INFO L514 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] [2022-01-31 23:48:26,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 23:48:26,517 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:48:26,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:48:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2144673722, now seen corresponding path program 1 times [2022-01-31 23:48:26,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:48:26,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178999898] [2022-01-31 23:48:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:48:26,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:48:26,526 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:48:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:48:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:26,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:48:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:26,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:48:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:26,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:48:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:26,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 23:48:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:48:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:48:26,901 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:48:26,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178999898] [2022-01-31 23:48:26,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1178999898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:48:26,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:48:26,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:48:26,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594287295] [2022-01-31 23:48:26,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:48:26,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:48:26,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:48:26,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:48:26,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:48:26,902 INFO L87 Difference]: Start difference. First operand 386 states and 511 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:48:29,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:31,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:32,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:48:35,196 INFO L93 Difference]: Finished difference Result 417 states and 549 transitions. [2022-01-31 23:48:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 23:48:35,197 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-01-31 23:48:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:48:35,198 INFO L225 Difference]: With dead ends: 417 [2022-01-31 23:48:35,198 INFO L226 Difference]: Without dead ends: 409 [2022-01-31 23:48:35,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2022-01-31 23:48:35,199 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 1057 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 343 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:48:35,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1069 Valid, 665 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1621 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2022-01-31 23:48:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-01-31 23:48:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 387. [2022-01-31 23:48:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 310 states have (on average 1.3741935483870968) internal successors, (426), 315 states have internal predecessors, (426), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-01-31 23:48:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 512 transitions. [2022-01-31 23:48:35,251 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 512 transitions. Word has length 73 [2022-01-31 23:48:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:48:35,251 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 512 transitions. [2022-01-31 23:48:35,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:48:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 512 transitions. [2022-01-31 23:48:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-31 23:48:35,252 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:48:35,252 INFO L514 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] [2022-01-31 23:48:35,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 23:48:35,253 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:48:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:48:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1821545128, now seen corresponding path program 1 times [2022-01-31 23:48:35,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:48:35,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [305106346] [2022-01-31 23:48:35,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:48:35,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:48:35,272 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:48:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:35,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:48:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:35,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:35,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:48:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:35,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:48:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:35,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:35,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:48:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:35,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 23:48:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:48:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:48:35,561 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:48:35,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [305106346] [2022-01-31 23:48:35,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [305106346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:48:35,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:48:35,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:48:35,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710976144] [2022-01-31 23:48:35,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:48:35,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:48:35,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:48:35,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:48:35,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:48:35,562 INFO L87 Difference]: Start difference. First operand 387 states and 512 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-01-31 23:48:37,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:48:38,965 INFO L93 Difference]: Finished difference Result 419 states and 554 transitions. [2022-01-31 23:48:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:48:38,966 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2022-01-31 23:48:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:48:38,967 INFO L225 Difference]: With dead ends: 419 [2022-01-31 23:48:38,968 INFO L226 Difference]: Without dead ends: 396 [2022-01-31 23:48:38,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-01-31 23:48:38,968 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 979 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 311 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:48:38,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [989 Valid, 457 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 616 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-01-31 23:48:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-01-31 23:48:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 381. [2022-01-31 23:48:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 305 states have (on average 1.3639344262295081) internal successors, (416), 309 states have internal predecessors, (416), 41 states have call successors, (41), 32 states have call predecessors, (41), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-01-31 23:48:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 501 transitions. [2022-01-31 23:48:39,057 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 501 transitions. Word has length 74 [2022-01-31 23:48:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:48:39,057 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 501 transitions. [2022-01-31 23:48:39,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-01-31 23:48:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 501 transitions. [2022-01-31 23:48:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-31 23:48:39,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:48:39,059 INFO L514 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] [2022-01-31 23:48:39,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 23:48:39,059 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:48:39,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:48:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash 937494245, now seen corresponding path program 1 times [2022-01-31 23:48:39,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:48:39,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396465144] [2022-01-31 23:48:39,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:48:39,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:48:39,067 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:48:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:39,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:48:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:39,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:39,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:48:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:39,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:39,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:48:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:39,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:48:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:39,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 23:48:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 23:48:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:48:39,296 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:48:39,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396465144] [2022-01-31 23:48:39,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [396465144] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:48:39,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:48:39,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:48:39,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333292162] [2022-01-31 23:48:39,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:48:39,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:48:39,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:48:39,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:48:39,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:48:39,297 INFO L87 Difference]: Start difference. First operand 381 states and 501 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:48:41,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:48:43,249 INFO L93 Difference]: Finished difference Result 437 states and 561 transitions. [2022-01-31 23:48:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:48:43,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 77 [2022-01-31 23:48:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:48:43,251 INFO L225 Difference]: With dead ends: 437 [2022-01-31 23:48:43,251 INFO L226 Difference]: Without dead ends: 374 [2022-01-31 23:48:43,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-01-31 23:48:43,252 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 869 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 272 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:48:43,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [879 Valid, 628 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 961 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-01-31 23:48:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-01-31 23:48:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 345. [2022-01-31 23:48:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 274 states have (on average 1.3503649635036497) internal successors, (370), 278 states have internal predecessors, (370), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-01-31 23:48:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 447 transitions. [2022-01-31 23:48:43,301 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 447 transitions. Word has length 77 [2022-01-31 23:48:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:48:43,301 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 447 transitions. [2022-01-31 23:48:43,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:48:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 447 transitions. [2022-01-31 23:48:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-31 23:48:43,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:48:43,302 INFO L514 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] [2022-01-31 23:48:43,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 23:48:43,303 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:48:43,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:48:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash 641442499, now seen corresponding path program 1 times [2022-01-31 23:48:43,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:48:43,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [475663429] [2022-01-31 23:48:43,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:48:43,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:48:43,311 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:48:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:48:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:43,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:43,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:48:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:48:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:43,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:48:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:43,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 23:48:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:43,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:48:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:48:43,569 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:48:43,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [475663429] [2022-01-31 23:48:43,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [475663429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:48:43,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:48:43,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:48:43,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168654338] [2022-01-31 23:48:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:48:43,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:48:43,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:48:43,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:48:43,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:48:43,571 INFO L87 Difference]: Start difference. First operand 345 states and 447 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:48:45,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:48:51,377 INFO L93 Difference]: Finished difference Result 417 states and 534 transitions. [2022-01-31 23:48:51,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 23:48:51,378 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2022-01-31 23:48:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:48:51,379 INFO L225 Difference]: With dead ends: 417 [2022-01-31 23:48:51,379 INFO L226 Difference]: Without dead ends: 359 [2022-01-31 23:48:51,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-01-31 23:48:51,380 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 867 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 305 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:48:51,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [870 Valid, 791 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1784 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2022-01-31 23:48:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-01-31 23:48:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 344. [2022-01-31 23:48:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 273 states have (on average 1.336996336996337) internal successors, (365), 277 states have internal predecessors, (365), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-01-31 23:48:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 442 transitions. [2022-01-31 23:48:51,430 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 442 transitions. Word has length 75 [2022-01-31 23:48:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:48:51,430 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 442 transitions. [2022-01-31 23:48:51,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:48:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 442 transitions. [2022-01-31 23:48:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-31 23:48:51,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:48:51,432 INFO L514 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] [2022-01-31 23:48:51,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 23:48:51,432 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:48:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:48:51,432 INFO L85 PathProgramCache]: Analyzing trace with hash 476602328, now seen corresponding path program 1 times [2022-01-31 23:48:51,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:48:51,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1666038550] [2022-01-31 23:48:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:48:51,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:48:51,440 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:48:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:51,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:48:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:51,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:48:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:51,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:48:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:51,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:48:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 23:48:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:48:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:48:51,777 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:48:51,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1666038550] [2022-01-31 23:48:51,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1666038550] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:48:51,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:48:51,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:48:51,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891127269] [2022-01-31 23:48:51,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:48:51,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:48:51,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:48:51,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:48:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:48:51,778 INFO L87 Difference]: Start difference. First operand 344 states and 442 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 23:48:53,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:48:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:48:58,897 INFO L93 Difference]: Finished difference Result 422 states and 536 transitions. [2022-01-31 23:48:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 23:48:58,897 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2022-01-31 23:48:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:48:58,898 INFO L225 Difference]: With dead ends: 422 [2022-01-31 23:48:58,898 INFO L226 Difference]: Without dead ends: 379 [2022-01-31 23:48:58,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 23:48:58,899 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 1036 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 373 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:48:58,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1041 Valid, 745 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1690 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-01-31 23:48:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-01-31 23:48:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2022-01-31 23:48:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 273 states have (on average 1.3296703296703296) internal successors, (363), 277 states have internal predecessors, (363), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (38), 36 states have call predecessors, (38), 33 states have call successors, (38) [2022-01-31 23:48:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 439 transitions. [2022-01-31 23:48:58,950 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 439 transitions. Word has length 76 [2022-01-31 23:48:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:48:58,950 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 439 transitions. [2022-01-31 23:48:58,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 23:48:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 439 transitions. [2022-01-31 23:48:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-31 23:48:58,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:48:58,951 INFO L514 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] [2022-01-31 23:48:58,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 23:48:58,951 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:48:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:48:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1346047832, now seen corresponding path program 1 times [2022-01-31 23:48:58,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:48:58,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1757744040] [2022-01-31 23:48:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:48:58,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:48:58,960 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:48:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:59,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:48:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:59,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:48:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:59,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:48:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:59,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:48:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:48:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:59,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 23:48:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:59,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:48:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:48:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:48:59,179 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:48:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1757744040] [2022-01-31 23:48:59,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1757744040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:48:59,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:48:59,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:48:59,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862241934] [2022-01-31 23:48:59,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:48:59,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:48:59,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:48:59,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:48:59,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:48:59,180 INFO L87 Difference]: Start difference. First operand 344 states and 439 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:49:01,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:04,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:05,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:49:06,685 INFO L93 Difference]: Finished difference Result 378 states and 480 transitions. [2022-01-31 23:49:06,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:49:06,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2022-01-31 23:49:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:49:06,687 INFO L225 Difference]: With dead ends: 378 [2022-01-31 23:49:06,687 INFO L226 Difference]: Without dead ends: 355 [2022-01-31 23:49:06,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:49:06,688 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 870 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 296 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:49:06,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [873 Valid, 546 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 861 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-01-31 23:49:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-01-31 23:49:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 335. [2022-01-31 23:49:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 267 states have (on average 1.3333333333333333) internal successors, (356), 271 states have internal predecessors, (356), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-01-31 23:49:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 429 transitions. [2022-01-31 23:49:06,740 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 429 transitions. Word has length 76 [2022-01-31 23:49:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:49:06,740 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 429 transitions. [2022-01-31 23:49:06,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:49:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 429 transitions. [2022-01-31 23:49:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-31 23:49:06,741 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:49:06,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:49:06,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 23:49:06,741 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:49:06,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:49:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2131421, now seen corresponding path program 1 times [2022-01-31 23:49:06,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:49:06,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1994647532] [2022-01-31 23:49:06,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:49:06,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:49:06,751 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:49:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:06,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:49:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:06,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:49:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:06,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:49:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:06,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:49:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:49:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 23:49:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:07,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:49:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:49:07,085 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:49:07,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1994647532] [2022-01-31 23:49:07,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1994647532] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:49:07,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:49:07,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:49:07,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881319891] [2022-01-31 23:49:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:49:07,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:49:07,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:49:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:49:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:49:07,087 INFO L87 Difference]: Start difference. First operand 335 states and 429 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-01-31 23:49:09,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:12,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:49:14,015 INFO L93 Difference]: Finished difference Result 398 states and 505 transitions. [2022-01-31 23:49:14,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 23:49:14,015 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) Word has length 78 [2022-01-31 23:49:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:49:14,016 INFO L225 Difference]: With dead ends: 398 [2022-01-31 23:49:14,016 INFO L226 Difference]: Without dead ends: 354 [2022-01-31 23:49:14,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-01-31 23:49:14,017 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 399 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 139 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:49:14,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 935 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2518 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-01-31 23:49:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-01-31 23:49:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 334. [2022-01-31 23:49:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 266 states have (on average 1.330827067669173) internal successors, (354), 270 states have internal predecessors, (354), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-01-31 23:49:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 427 transitions. [2022-01-31 23:49:14,069 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 427 transitions. Word has length 78 [2022-01-31 23:49:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:49:14,069 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 427 transitions. [2022-01-31 23:49:14,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-01-31 23:49:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 427 transitions. [2022-01-31 23:49:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-31 23:49:14,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:49:14,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:49:14,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 23:49:14,070 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:49:14,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:49:14,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1889602735, now seen corresponding path program 1 times [2022-01-31 23:49:14,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:49:14,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334779652] [2022-01-31 23:49:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:49:14,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:49:14,080 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:49:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:14,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:49:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:14,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:49:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:14,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:49:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:49:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:14,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:49:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 23:49:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:49:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:49:14,439 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:49:14,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334779652] [2022-01-31 23:49:14,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [334779652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:49:14,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:49:14,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 23:49:14,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635890812] [2022-01-31 23:49:14,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:49:14,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 23:49:14,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:49:14,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 23:49:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:49:14,441 INFO L87 Difference]: Start difference. First operand 334 states and 427 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-01-31 23:49:16,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:19,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:49:25,837 INFO L93 Difference]: Finished difference Result 475 states and 607 transitions. [2022-01-31 23:49:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 23:49:25,838 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2022-01-31 23:49:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:49:25,839 INFO L225 Difference]: With dead ends: 475 [2022-01-31 23:49:25,839 INFO L226 Difference]: Without dead ends: 367 [2022-01-31 23:49:25,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2022-01-31 23:49:25,840 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 485 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 170 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:49:25,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 975 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2601 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2022-01-31 23:49:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-01-31 23:49:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 338. [2022-01-31 23:49:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 275 states have internal predecessors, (359), 36 states have call successors, (36), 29 states have call predecessors, (36), 31 states have return successors, (37), 33 states have call predecessors, (37), 31 states have call successors, (37) [2022-01-31 23:49:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 432 transitions. [2022-01-31 23:49:25,960 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 432 transitions. Word has length 79 [2022-01-31 23:49:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:49:25,960 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 432 transitions. [2022-01-31 23:49:25,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-01-31 23:49:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 432 transitions. [2022-01-31 23:49:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-31 23:49:25,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:49:25,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:49:25,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 23:49:25,961 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:49:25,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:49:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2045108737, now seen corresponding path program 1 times [2022-01-31 23:49:25,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:49:25,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820150825] [2022-01-31 23:49:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:49:25,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:49:25,971 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:49:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:26,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:49:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:49:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:49:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:26,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:26,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:49:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:26,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:49:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:26,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 23:49:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:49:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:49:26,306 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:49:26,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820150825] [2022-01-31 23:49:26,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1820150825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:49:26,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:49:26,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:49:26,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211707928] [2022-01-31 23:49:26,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:49:26,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:49:26,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:49:26,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:49:26,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:49:26,307 INFO L87 Difference]: Start difference. First operand 338 states and 432 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:49:28,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:49:30,980 INFO L93 Difference]: Finished difference Result 429 states and 546 transitions. [2022-01-31 23:49:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 23:49:30,980 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2022-01-31 23:49:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:49:30,982 INFO L225 Difference]: With dead ends: 429 [2022-01-31 23:49:30,982 INFO L226 Difference]: Without dead ends: 376 [2022-01-31 23:49:30,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2022-01-31 23:49:30,983 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 1050 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 349 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:49:30,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1065 Valid, 497 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1031 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-01-31 23:49:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-01-31 23:49:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 329. [2022-01-31 23:49:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 266 states have internal predecessors, (347), 36 states have call successors, (36), 29 states have call predecessors, (36), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-01-31 23:49:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 418 transitions. [2022-01-31 23:49:31,040 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 418 transitions. Word has length 79 [2022-01-31 23:49:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:49:31,040 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 418 transitions. [2022-01-31 23:49:31,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:49:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 418 transitions. [2022-01-31 23:49:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-31 23:49:31,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:49:31,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:49:31,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 23:49:31,042 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:49:31,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:49:31,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1773831806, now seen corresponding path program 1 times [2022-01-31 23:49:31,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:49:31,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675274520] [2022-01-31 23:49:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:49:31,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:49:31,052 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:49:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:49:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:49:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:49:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:49:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:49:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 23:49:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 23:49:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-31 23:49:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:49:31,308 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:49:31,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675274520] [2022-01-31 23:49:31,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1675274520] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:49:31,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:49:31,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:49:31,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213471753] [2022-01-31 23:49:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:49:31,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:49:31,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:49:31,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:49:31,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:49:31,311 INFO L87 Difference]: Start difference. First operand 329 states and 418 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-01-31 23:49:33,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:37,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:49:38,111 INFO L93 Difference]: Finished difference Result 416 states and 527 transitions. [2022-01-31 23:49:38,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 23:49:38,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 84 [2022-01-31 23:49:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:49:38,113 INFO L225 Difference]: With dead ends: 416 [2022-01-31 23:49:38,113 INFO L226 Difference]: Without dead ends: 357 [2022-01-31 23:49:38,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-01-31 23:49:38,114 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 556 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 194 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:49:38,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 566 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 895 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-01-31 23:49:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-01-31 23:49:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 327. [2022-01-31 23:49:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 261 states have (on average 1.314176245210728) internal successors, (343), 264 states have internal predecessors, (343), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-01-31 23:49:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 413 transitions. [2022-01-31 23:49:38,177 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 413 transitions. Word has length 84 [2022-01-31 23:49:38,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:49:38,179 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 413 transitions. [2022-01-31 23:49:38,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-01-31 23:49:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 413 transitions. [2022-01-31 23:49:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-31 23:49:38,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:49:38,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:49:38,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 23:49:38,181 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:49:38,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:49:38,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1690581556, now seen corresponding path program 1 times [2022-01-31 23:49:38,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:49:38,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1663426244] [2022-01-31 23:49:38,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:49:38,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:49:38,193 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:49:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:49:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:49:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:49:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:38,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:49:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:38,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:49:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 23:49:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:49:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:49:38,504 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:49:38,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1663426244] [2022-01-31 23:49:38,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1663426244] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:49:38,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:49:38,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:49:38,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828229365] [2022-01-31 23:49:38,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:49:38,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:49:38,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:49:38,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:49:38,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:49:38,505 INFO L87 Difference]: Start difference. First operand 327 states and 413 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:49:40,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:49:43,548 INFO L93 Difference]: Finished difference Result 371 states and 465 transitions. [2022-01-31 23:49:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:49:43,548 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2022-01-31 23:49:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:49:43,552 INFO L225 Difference]: With dead ends: 371 [2022-01-31 23:49:43,552 INFO L226 Difference]: Without dead ends: 346 [2022-01-31 23:49:43,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2022-01-31 23:49:43,552 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 855 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 265 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:49:43,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 559 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 915 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-01-31 23:49:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-01-31 23:49:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 326. [2022-01-31 23:49:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 260 states have (on average 1.3115384615384615) internal successors, (341), 263 states have internal predecessors, (341), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-01-31 23:49:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 411 transitions. [2022-01-31 23:49:43,616 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 411 transitions. Word has length 80 [2022-01-31 23:49:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:49:43,616 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 411 transitions. [2022-01-31 23:49:43,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:49:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 411 transitions. [2022-01-31 23:49:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-31 23:49:43,617 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:49:43,617 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:49:43,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 23:49:43,617 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:49:43,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:49:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash 664933900, now seen corresponding path program 1 times [2022-01-31 23:49:43,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:49:43,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1699701064] [2022-01-31 23:49:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:49:43,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:49:43,628 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:49:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:49:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:49:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:43,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:49:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:43,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:43,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:49:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:43,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:43,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:49:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:43,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 23:49:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:49:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:49:43,972 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:49:43,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1699701064] [2022-01-31 23:49:43,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1699701064] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:49:43,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:49:43,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:49:43,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624201152] [2022-01-31 23:49:43,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:49:43,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:49:43,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:49:43,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:49:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:49:43,973 INFO L87 Difference]: Start difference. First operand 326 states and 411 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 23:49:46,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:48,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:49:49,762 INFO L93 Difference]: Finished difference Result 353 states and 444 transitions. [2022-01-31 23:49:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 23:49:49,762 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 80 [2022-01-31 23:49:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:49:49,763 INFO L225 Difference]: With dead ends: 353 [2022-01-31 23:49:49,763 INFO L226 Difference]: Without dead ends: 205 [2022-01-31 23:49:49,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2022-01-31 23:49:49,764 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 1063 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 345 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:49:49,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1069 Valid, 521 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1449 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-01-31 23:49:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-01-31 23:49:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2022-01-31 23:49:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 144 states have internal predecessors, (175), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 20 states have call predecessors, (22), 19 states have call successors, (22) [2022-01-31 23:49:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2022-01-31 23:49:49,807 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 80 [2022-01-31 23:49:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:49:49,807 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2022-01-31 23:49:49,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 23:49:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2022-01-31 23:49:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-31 23:49:49,808 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:49:49,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:49:49,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 23:49:49,808 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:49:49,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:49:49,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1299022194, now seen corresponding path program 1 times [2022-01-31 23:49:49,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:49:49,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1396024424] [2022-01-31 23:49:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:49:49,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:49:49,820 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:49:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:49:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:49:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:49:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:49,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:49,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:49:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:50,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:49:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 23:49:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:50,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 23:49:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:49:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:50,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:49:50,089 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:49:50,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1396024424] [2022-01-31 23:49:50,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1396024424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:49:50,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:49:50,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:49:50,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214174923] [2022-01-31 23:49:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:49:50,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:49:50,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:49:50,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:49:50,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:49:50,092 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-01-31 23:49:52,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:54,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:49:54,984 INFO L93 Difference]: Finished difference Result 300 states and 368 transitions. [2022-01-31 23:49:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:49:54,985 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 88 [2022-01-31 23:49:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:49:54,985 INFO L225 Difference]: With dead ends: 300 [2022-01-31 23:49:54,986 INFO L226 Difference]: Without dead ends: 237 [2022-01-31 23:49:54,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-01-31 23:49:54,986 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 309 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 160 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:49:54,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 392 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 831 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-01-31 23:49:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-01-31 23:49:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 199. [2022-01-31 23:49:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 155 states have internal predecessors, (186), 23 states have call successors, (23), 21 states have call predecessors, (23), 23 states have return successors, (24), 22 states have call predecessors, (24), 19 states have call successors, (24) [2022-01-31 23:49:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2022-01-31 23:49:55,032 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 88 [2022-01-31 23:49:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:49:55,032 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2022-01-31 23:49:55,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-01-31 23:49:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2022-01-31 23:49:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-31 23:49:55,033 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:49:55,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:49:55,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 23:49:55,033 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:49:55,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:49:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1324935307, now seen corresponding path program 1 times [2022-01-31 23:49:55,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:49:55,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [677594086] [2022-01-31 23:49:55,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:49:55,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:49:55,044 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:49:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:49:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:49:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:49:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:49:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:49:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 23:49:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 23:49:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:49:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:49:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:49:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:49:55,317 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:49:55,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [677594086] [2022-01-31 23:49:55,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [677594086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:49:55,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:49:55,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:49:55,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006398095] [2022-01-31 23:49:55,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:49:55,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:49:55,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:49:55,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:49:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:49:55,318 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (15), 10 states have call predecessors, (15), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 23:49:57,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:49:59,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:50:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:50:00,411 INFO L93 Difference]: Finished difference Result 437 states and 522 transitions. [2022-01-31 23:50:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 23:50:00,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (15), 10 states have call predecessors, (15), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2022-01-31 23:50:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:50:00,418 INFO L225 Difference]: With dead ends: 437 [2022-01-31 23:50:00,419 INFO L226 Difference]: Without dead ends: 408 [2022-01-31 23:50:00,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2022-01-31 23:50:00,420 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 607 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 284 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:50:00,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 269 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 401 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-01-31 23:50:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-01-31 23:50:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 345. [2022-01-31 23:50:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 268 states have (on average 1.2350746268656716) internal successors, (331), 272 states have internal predecessors, (331), 36 states have call successors, (36), 34 states have call predecessors, (36), 40 states have return successors, (42), 38 states have call predecessors, (42), 32 states have call successors, (42) [2022-01-31 23:50:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 409 transitions. [2022-01-31 23:50:00,552 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 409 transitions. Word has length 89 [2022-01-31 23:50:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:50:00,552 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 409 transitions. [2022-01-31 23:50:00,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (15), 10 states have call predecessors, (15), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 23:50:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 409 transitions. [2022-01-31 23:50:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-31 23:50:00,553 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:50:00,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:50:00,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 23:50:00,553 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:50:00,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:50:00,553 INFO L85 PathProgramCache]: Analyzing trace with hash 450072055, now seen corresponding path program 1 times [2022-01-31 23:50:00,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:50:00,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923284891] [2022-01-31 23:50:00,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:50:00,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:50:00,581 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:50:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:50:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:50:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:50:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:50:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:50:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:50:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 23:50:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 23:50:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 23:50:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:50:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:50:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:50:00,862 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:50:00,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923284891] [2022-01-31 23:50:00,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1923284891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:50:00,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:50:00,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:50:00,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101400237] [2022-01-31 23:50:00,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:50:00,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:50:00,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:50:00,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:50:00,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:50:00,864 INFO L87 Difference]: Start difference. First operand 345 states and 409 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-31 23:50:02,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:50:04,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:50:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:50:07,129 INFO L93 Difference]: Finished difference Result 657 states and 796 transitions. [2022-01-31 23:50:07,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:50:07,130 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 89 [2022-01-31 23:50:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:50:07,131 INFO L225 Difference]: With dead ends: 657 [2022-01-31 23:50:07,132 INFO L226 Difference]: Without dead ends: 399 [2022-01-31 23:50:07,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:50:07,132 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 221 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 111 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:50:07,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 363 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 795 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-01-31 23:50:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-01-31 23:50:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 337. [2022-01-31 23:50:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 262 states have (on average 1.2328244274809161) internal successors, (323), 266 states have internal predecessors, (323), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-01-31 23:50:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 399 transitions. [2022-01-31 23:50:07,236 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 399 transitions. Word has length 89 [2022-01-31 23:50:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:50:07,236 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 399 transitions. [2022-01-31 23:50:07,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-31 23:50:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 399 transitions. [2022-01-31 23:50:07,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-31 23:50:07,237 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:50:07,237 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:50:07,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 23:50:07,237 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:50:07,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:50:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash -623916271, now seen corresponding path program 1 times [2022-01-31 23:50:07,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:50:07,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1587297629] [2022-01-31 23:50:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:50:07,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:50:07,249 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:50:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:50:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:50:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:50:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:50:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 23:50:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:50:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:50:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 23:50:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 23:50:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 23:50:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-31 23:50:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:50:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:50:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:50:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:50:07,717 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:50:07,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1587297629] [2022-01-31 23:50:07,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1587297629] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:50:07,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:50:07,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:50:07,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575977222] [2022-01-31 23:50:07,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:50:07,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:50:07,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:50:07,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:50:07,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:50:07,719 INFO L87 Difference]: Start difference. First operand 337 states and 399 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 9 states have call predecessors, (17), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 23:50:09,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 23:50:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:50:12,429 INFO L93 Difference]: Finished difference Result 675 states and 810 transitions. [2022-01-31 23:50:12,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:50:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 9 states have call predecessors, (17), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2022-01-31 23:50:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:50:12,431 INFO L225 Difference]: With dead ends: 675 [2022-01-31 23:50:12,431 INFO L226 Difference]: Without dead ends: 389 [2022-01-31 23:50:12,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:50:12,432 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 202 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 108 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:50:12,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 372 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 554 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-01-31 23:50:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-01-31 23:50:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 339. [2022-01-31 23:50:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 264 states have (on average 1.231060606060606) internal successors, (325), 268 states have internal predecessors, (325), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-01-31 23:50:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 401 transitions. [2022-01-31 23:50:12,535 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 401 transitions. Word has length 102 [2022-01-31 23:50:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:50:12,535 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 401 transitions. [2022-01-31 23:50:12,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 9 states have call predecessors, (17), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 23:50:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 401 transitions. [2022-01-31 23:50:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-31 23:50:12,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:50:12,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:50:12,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 23:50:12,537 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:50:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:50:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1023672093, now seen corresponding path program 1 times [2022-01-31 23:50:12,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:50:12,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1132413224] [2022-01-31 23:50:12,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:50:12,555 ERROR L252 FreeRefinementEngine]: Caught unknown exception: Undeclared function symbol (select Real Int) [2022-01-31 23:50:12,555 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-31 23:50:12,555 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (select Real Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:505) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:426) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.select(SmtUtils.java:1520) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.termWithLocalSimplification(SmtUtils.java:1465) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.termWithLocalSimplification(SmtUtils.java:1374) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.convertApplicationTerm(SmtUtils.java:1363) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.convertApplicationTerm(Substitution.java:53) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractor.getUpdates(QvasrAbstractor.java:1229) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractor.computeAbstraction(QvasrAbstractor.java:106) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:133) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:79) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:210) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-31 23:50:12,561 INFO L158 Benchmark]: Toolchain (without parser) took 166021.14ms. Allocated memory was 205.5MB in the beginning and 392.2MB in the end (delta: 186.6MB). Free memory was 152.4MB in the beginning and 307.2MB in the end (delta: -154.8MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2022-01-31 23:50:12,561 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 23:50:12,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.93ms. Allocated memory was 205.5MB in the beginning and 302.0MB in the end (delta: 96.5MB). Free memory was 152.1MB in the beginning and 231.4MB in the end (delta: -79.2MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. [2022-01-31 23:50:12,561 INFO L158 Benchmark]: Boogie Preprocessor took 132.31ms. Allocated memory is still 302.0MB. Free memory was 231.4MB in the beginning and 219.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 23:50:12,561 INFO L158 Benchmark]: RCFGBuilder took 2946.83ms. Allocated memory is still 302.0MB. Free memory was 219.9MB in the beginning and 123.0MB in the end (delta: 96.9MB). Peak memory consumption was 96.7MB. Max. memory is 8.0GB. [2022-01-31 23:50:12,561 INFO L158 Benchmark]: TraceAbstraction took 162172.71ms. Allocated memory was 302.0MB in the beginning and 392.2MB in the end (delta: 90.2MB). Free memory was 122.5MB in the beginning and 307.2MB in the end (delta: -184.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 23:50:12,562 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 763.93ms. Allocated memory was 205.5MB in the beginning and 302.0MB in the end (delta: 96.5MB). Free memory was 152.1MB in the beginning and 231.4MB in the end (delta: -79.2MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 132.31ms. Allocated memory is still 302.0MB. Free memory was 231.4MB in the beginning and 219.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * RCFGBuilder took 2946.83ms. Allocated memory is still 302.0MB. Free memory was 219.9MB in the beginning and 123.0MB in the end (delta: 96.9MB). Peak memory consumption was 96.7MB. Max. memory is 8.0GB. * TraceAbstraction took 162172.71ms. Allocated memory was 302.0MB in the beginning and 392.2MB in the end (delta: 90.2MB). Free memory was 122.5MB in the beginning and 307.2MB in the end (delta: -184.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (select Real Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (select Real Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:505) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-31 23:50:12,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...