/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 22:25:22,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 22:25:22,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 22:25:22,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 22:25:22,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 22:25:22,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 22:25:22,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 22:25:22,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 22:25:22,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 22:25:22,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 22:25:22,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 22:25:22,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 22:25:22,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 22:25:22,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 22:25:22,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 22:25:22,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 22:25:22,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 22:25:22,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 22:25:22,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 22:25:22,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 22:25:22,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 22:25:22,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 22:25:22,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 22:25:22,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 22:25:22,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 22:25:22,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 22:25:22,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 22:25:22,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 22:25:22,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 22:25:22,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 22:25:22,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 22:25:22,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 22:25:22,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 22:25:22,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 22:25:22,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 22:25:22,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 22:25:22,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 22:25:22,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 22:25:22,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 22:25:22,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 22:25:22,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 22:25:22,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 22:25:22,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 22:25:22,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 22:25:22,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 22:25:22,584 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 22:25:22,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 22:25:22,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 22:25:22,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 22:25:22,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 22:25:22,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 22:25:22,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 22:25:22,585 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 22:25:22,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 22:25:22,585 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 22:25:22,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 22:25:22,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 22:25:22,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 22:25:22,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 22:25:22,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 22:25:22,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 22:25:22,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 22:25:22,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 22:25:22,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 22:25:22,586 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 22:25:22,586 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 22:25:22,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 22:25:22,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 22:25:22,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 22:25:22,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 22:25:22,783 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 22:25:22,784 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 22:25:22,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ca98111/09dc83d5b89b47498722cbd982d1053a/FLAG67a13314a [2022-01-31 22:25:23,401 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 22:25:23,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c [2022-01-31 22:25:23,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ca98111/09dc83d5b89b47498722cbd982d1053a/FLAG67a13314a [2022-01-31 22:25:23,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ca98111/09dc83d5b89b47498722cbd982d1053a [2022-01-31 22:25:23,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 22:25:23,820 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 22:25:23,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 22:25:23,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 22:25:23,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 22:25:23,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:25:23" (1/1) ... [2022-01-31 22:25:23,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae037e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:23, skipping insertion in model container [2022-01-31 22:25:23,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:25:23" (1/1) ... [2022-01-31 22:25:23,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 22:25:23,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 22:25:24,203 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 22:25:24,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 22:25:24,341 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 22:25:24,391 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 22:25:24,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 22:25:24,498 INFO L208 MainTranslator]: Completed translation [2022-01-31 22:25:24,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:24 WrapperNode [2022-01-31 22:25:24,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 22:25:24,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 22:25:24,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 22:25:24,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 22:25:24,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:24" (1/1) ... [2022-01-31 22:25:24,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:24" (1/1) ... [2022-01-31 22:25:24,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:24" (1/1) ... [2022-01-31 22:25:24,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:24" (1/1) ... [2022-01-31 22:25:24,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:24" (1/1) ... [2022-01-31 22:25:24,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:24" (1/1) ... [2022-01-31 22:25:24,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:24" (1/1) ... [2022-01-31 22:25:24,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 22:25:24,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 22:25:24,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 22:25:24,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 22:25:24,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:24" (1/1) ... [2022-01-31 22:25:24,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 22:25:24,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 22:25:24,657 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 22:25:24,671 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 22:25:24,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 22:25:24,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 22:25:24,694 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 22:25:24,694 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 22:25:24,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~PVOID~0~X~~PVOID~0~X~~PVOID~0~TO~VOID [2022-01-31 22:25:24,694 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 22:25:24,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 22:25:24,695 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-01-31 22:25:24,695 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-01-31 22:25:24,695 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_IoCtl [2022-01-31 22:25:24,695 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 22:25:24,695 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 22:25:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-01-31 22:25:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_AddDevice [2022-01-31 22:25:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-01-31 22:25:24,697 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InitializationRoutine [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_IsrHook [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_ServiceCallback [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Unload [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-01-31 22:25:24,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-01-31 22:25:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-01-31 22:25:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-01-31 22:25:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-01-31 22:25:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-01-31 22:25:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-01-31 22:25:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-01-31 22:25:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-01-31 22:25:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-01-31 22:25:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-01-31 22:25:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-01-31 22:25:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-01-31 22:25:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-01-31 22:25:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-01-31 22:25:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-01-31 22:25:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-01-31 22:25:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-01-31 22:25:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-01-31 22:25:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-01-31 22:25:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-01-31 22:25:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-01-31 22:25:24,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-01-31 22:25:24,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-01-31 22:25:24,703 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 22:25:24,703 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-01-31 22:25:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-01-31 22:25:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 22:25:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-01-31 22:25:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-01-31 22:25:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-01-31 22:25:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 22:25:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-01-31 22:25:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-01-31 22:25:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-01-31 22:25:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-01-31 22:25:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-01-31 22:25:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-01-31 22:25:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-01-31 22:25:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-01-31 22:25:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 22:25:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 22:25:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-01-31 22:25:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-01-31 22:25:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-01-31 22:25:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-01-31 22:25:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-01-31 22:25:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-01-31 22:25:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-01-31 22:25:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-01-31 22:25:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-01-31 22:25:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-01-31 22:25:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-01-31 22:25:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-01-31 22:25:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_AddDevice [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_IoCtl [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InitializationRoutine [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_IsrHook [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_ServiceCallback [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Unload [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 22:25:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-01-31 22:25:24,718 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 22:25:24,718 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 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~PVOID~0~X~~PVOID~0~X~~PVOID~0~TO~VOID [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-01-31 22:25:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-01-31 22:25:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-01-31 22:25:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-01-31 22:25:25,086 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 22:25:25,088 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 22:25:25,115 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,142 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,142 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,142 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,148 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,148 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,165 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,175 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,175 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,175 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,187 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,187 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,190 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,197 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,197 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,255 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,261 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,261 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,261 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,268 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,269 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,269 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,280 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,280 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,298 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,306 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,306 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,307 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,311 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,311 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,312 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,320 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,320 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,350 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,355 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,356 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,356 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,359 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,360 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,374 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,501 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-01-31 22:25:25,502 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-01-31 22:25:25,511 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,526 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 22:25:25,526 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 22:25:25,538 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:25,542 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:25,542 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:25,545 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:26,010 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-01-31 22:25:26,011 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-01-31 22:25:26,104 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:26,107 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:26,107 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:26,163 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:26,167 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:26,167 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:26,176 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:26,189 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 22:25:26,189 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 22:25:26,193 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:26,201 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 22:25:26,201 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 22:25:26,216 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:26,219 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:26,219 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:26,220 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:26,242 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-01-31 22:25:26,242 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-01-31 22:25:26,244 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 22:25:26,248 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 22:25:26,248 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 22:25:26,266 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 22:25:26,273 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 22:25:26,273 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 22:25:26,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:25:26 BoogieIcfgContainer [2022-01-31 22:25:26,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 22:25:26,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 22:25:26,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 22:25:26,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 22:25:26,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 10:25:23" (1/3) ... [2022-01-31 22:25:26,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c58b658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:25:26, skipping insertion in model container [2022-01-31 22:25:26,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:25:24" (2/3) ... [2022-01-31 22:25:26,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c58b658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:25:26, skipping insertion in model container [2022-01-31 22:25:26,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:25:26" (3/3) ... [2022-01-31 22:25:26,282 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2022-01-31 22:25:26,285 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 22:25:26,285 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 22:25:26,313 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 22:25:26,317 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=JORDAN [2022-01-31 22:25:26,317 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 22:25:26,329 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 22:25:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 22:25:26,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:25:26,334 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 22:25:26,334 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:25:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:25:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1774662017, now seen corresponding path program 1 times [2022-01-31 22:25:26,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:25:26,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1681949714] [2022-01-31 22:25:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:25:26,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:25:26,459 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:25:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:26,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:25:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:26,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:25:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:25:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:26,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:26,887 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 22:25:26,888 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:25:26,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1681949714] [2022-01-31 22:25:26,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1681949714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:25:26,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:25:26,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 22:25:26,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766077426] [2022-01-31 22:25:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:25:26,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 22:25:26,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:25:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 22:25:26,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 22:25:26,910 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 22:25:28,984 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 22:25:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:25:30,489 INFO L93 Difference]: Finished difference Result 643 states and 953 transitions. [2022-01-31 22:25:30,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 22:25:30,491 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 22:25:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:25:30,499 INFO L225 Difference]: With dead ends: 643 [2022-01-31 22:25:30,499 INFO L226 Difference]: Without dead ends: 343 [2022-01-31 22:25:30,502 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 22:25:30,504 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 597 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 220 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:25:30,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 463 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-01-31 22:25:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-01-31 22:25:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 299. [2022-01-31 22:25:30,555 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 22:25:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 407 transitions. [2022-01-31 22:25:30,557 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 407 transitions. Word has length 31 [2022-01-31 22:25:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:25:30,558 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 407 transitions. [2022-01-31 22:25:30,558 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 22:25:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 407 transitions. [2022-01-31 22:25:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 22:25:30,559 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:25:30,559 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 22:25:30,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 22:25:30,559 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:25:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:25:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash 186314115, now seen corresponding path program 1 times [2022-01-31 22:25:30,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:25:30,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333974188] [2022-01-31 22:25:30,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:25:30,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:25:30,567 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:25:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:30,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:25:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:30,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:25:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:30,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:25:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:30,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:30,861 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 22:25:30,861 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:25:30,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333974188] [2022-01-31 22:25:30,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [333974188] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:25:30,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:25:30,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 22:25:30,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205077518] [2022-01-31 22:25:30,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:25:30,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 22:25:30,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:25:30,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 22:25:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 22:25:30,865 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 22:25:32,919 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 22:25:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:25:35,948 INFO L93 Difference]: Finished difference Result 360 states and 492 transitions. [2022-01-31 22:25:35,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 22:25:35,948 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 22:25:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:25:35,950 INFO L225 Difference]: With dead ends: 360 [2022-01-31 22:25:35,950 INFO L226 Difference]: Without dead ends: 343 [2022-01-31 22:25:35,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 22:25:35,951 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 395 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 148 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 4.9s IncrementalHoareTripleChecker+Time [2022-01-31 22:25:35,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 683 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1531 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2022-01-31 22:25:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-01-31 22:25:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 299. [2022-01-31 22:25:35,993 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 22:25:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 406 transitions. [2022-01-31 22:25:35,994 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 406 transitions. Word has length 31 [2022-01-31 22:25:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:25:35,994 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 406 transitions. [2022-01-31 22:25:35,995 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 22:25:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 406 transitions. [2022-01-31 22:25:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 22:25:36,016 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:25:36,016 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 22:25:36,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 22:25:36,017 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:25:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:25:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1201516382, now seen corresponding path program 1 times [2022-01-31 22:25:36,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:25:36,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1464353555] [2022-01-31 22:25:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:25:36,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:25:36,038 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:25:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:36,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:25:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:36,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:25:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:36,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:25:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:36,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:25:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:36,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:36,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:25:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:36,392 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 22:25:36,393 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:25:36,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1464353555] [2022-01-31 22:25:36,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1464353555] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:25:36,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:25:36,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 22:25:36,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149197147] [2022-01-31 22:25:36,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:25:36,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 22:25:36,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:25:36,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 22:25:36,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-31 22:25:36,408 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 22:25:38,486 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 22:25:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:25:42,153 INFO L93 Difference]: Finished difference Result 599 states and 829 transitions. [2022-01-31 22:25:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 22:25:42,153 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 22:25:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:25:42,156 INFO L225 Difference]: With dead ends: 599 [2022-01-31 22:25:42,156 INFO L226 Difference]: Without dead ends: 348 [2022-01-31 22:25:42,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-01-31 22:25:42,157 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 609 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 252 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s 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, 5.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:25:42,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 792 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1671 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-01-31 22:25:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-01-31 22:25:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 303. [2022-01-31 22:25:42,197 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 22:25:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 410 transitions. [2022-01-31 22:25:42,198 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 410 transitions. Word has length 53 [2022-01-31 22:25:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:25:42,199 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 410 transitions. [2022-01-31 22:25:42,199 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 22:25:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 410 transitions. [2022-01-31 22:25:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 22:25:42,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:25:42,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] [2022-01-31 22:25:42,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 22:25:42,203 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:25:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:25:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1078281185, now seen corresponding path program 1 times [2022-01-31 22:25:42,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:25:42,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [709414935] [2022-01-31 22:25:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:25:42,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:25:42,214 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:25:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:25:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:42,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:25:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:42,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:25:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:25:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:42,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:42,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:25:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:42,492 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 22:25:42,492 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:25:42,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [709414935] [2022-01-31 22:25:42,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [709414935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:25:42,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:25:42,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 22:25:42,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694174978] [2022-01-31 22:25:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:25:42,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 22:25:42,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:25:42,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 22:25:42,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 22:25:42,493 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 22:25:44,608 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 22:25:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:25:46,394 INFO L93 Difference]: Finished difference Result 492 states and 667 transitions. [2022-01-31 22:25:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 22:25:46,394 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 22:25:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:25:46,396 INFO L225 Difference]: With dead ends: 492 [2022-01-31 22:25:46,396 INFO L226 Difference]: Without dead ends: 431 [2022-01-31 22:25:46,397 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 22:25:46,397 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 864 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 299 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-01-31 22:25:46,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 612 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 803 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-01-31 22:25:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-01-31 22:25:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 374. [2022-01-31 22:25:46,441 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 22:25:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 498 transitions. [2022-01-31 22:25:46,442 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 498 transitions. Word has length 53 [2022-01-31 22:25:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:25:46,443 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 498 transitions. [2022-01-31 22:25:46,443 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 22:25:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 498 transitions. [2022-01-31 22:25:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 22:25:46,443 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:25:46,443 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 22:25:46,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 22:25:46,444 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:25:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:25:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 17478568, now seen corresponding path program 1 times [2022-01-31 22:25:46,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:25:46,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [575470341] [2022-01-31 22:25:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:25:46,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:25:46,451 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:25:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:25:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:25:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:25:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:46,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:25:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:46,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:46,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:25:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:25:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:46,710 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 22:25:46,710 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:25:46,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [575470341] [2022-01-31 22:25:46,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [575470341] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:25:46,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:25:46,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 22:25:46,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167891975] [2022-01-31 22:25:46,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:25:46,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 22:25:46,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:25:46,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 22:25:46,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 22:25:46,712 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 22:25:48,828 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 22:25:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:25:50,294 INFO L93 Difference]: Finished difference Result 569 states and 751 transitions. [2022-01-31 22:25:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 22:25:50,294 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 22:25:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:25:50,299 INFO L225 Difference]: With dead ends: 569 [2022-01-31 22:25:50,299 INFO L226 Difference]: Without dead ends: 450 [2022-01-31 22:25:50,299 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 22:25:50,302 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 974 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 330 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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 22:25:50,303 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 22:25:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-01-31 22:25:50,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 410. [2022-01-31 22:25:50,356 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 22:25:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 545 transitions. [2022-01-31 22:25:50,360 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 545 transitions. Word has length 60 [2022-01-31 22:25:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:25:50,361 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 545 transitions. [2022-01-31 22:25:50,362 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 22:25:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 545 transitions. [2022-01-31 22:25:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 22:25:50,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:25:50,364 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 22:25:50,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 22:25:50,364 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:25:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:25:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash -110356200, now seen corresponding path program 1 times [2022-01-31 22:25:50,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:25:50,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1845703060] [2022-01-31 22:25:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:25:50,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:25:50,372 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:25:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:25:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:25:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:50,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:25:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:25:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:25:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:50,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 22:25:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:50,776 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 22:25:50,776 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:25:50,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1845703060] [2022-01-31 22:25:50,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1845703060] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:25:50,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:25:50,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 22:25:50,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035678848] [2022-01-31 22:25:50,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:25:50,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 22:25:50,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:25:50,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 22:25:50,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-31 22:25:50,778 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 22:25:52,907 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 22:25:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:25:55,266 INFO L93 Difference]: Finished difference Result 450 states and 594 transitions. [2022-01-31 22:25:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 22:25:55,266 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 22:25:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:25:55,268 INFO L225 Difference]: With dead ends: 450 [2022-01-31 22:25:55,268 INFO L226 Difference]: Without dead ends: 442 [2022-01-31 22:25:55,268 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 22:25:55,269 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 1505 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 517 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-01-31 22:25:55,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1514 Valid, 539 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 744 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-01-31 22:25:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-01-31 22:25:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 415. [2022-01-31 22:25:55,328 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 22:25:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 551 transitions. [2022-01-31 22:25:55,332 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 551 transitions. Word has length 60 [2022-01-31 22:25:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:25:55,332 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 551 transitions. [2022-01-31 22:25:55,332 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 22:25:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 551 transitions. [2022-01-31 22:25:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 22:25:55,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:25:55,333 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 22:25:55,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 22:25:55,333 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:25:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:25:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash 400358010, now seen corresponding path program 1 times [2022-01-31 22:25:55,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:25:55,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [809531832] [2022-01-31 22:25:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:25:55,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:25:55,342 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:25:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:25:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:55,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:25:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:25:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:55,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:55,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:25:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:25:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:25:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:25:55,547 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 22:25:55,548 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:25:55,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [809531832] [2022-01-31 22:25:55,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [809531832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:25:55,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:25:55,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 22:25:55,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835763604] [2022-01-31 22:25:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:25:55,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 22:25:55,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:25:55,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 22:25:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 22:25:55,549 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 22:25:57,714 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 22:26:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:26:00,345 INFO L93 Difference]: Finished difference Result 433 states and 574 transitions. [2022-01-31 22:26:00,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 22:26:00,346 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 22:26:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:26:00,348 INFO L225 Difference]: With dead ends: 433 [2022-01-31 22:26:00,348 INFO L226 Difference]: Without dead ends: 429 [2022-01-31 22:26:00,348 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 22:26:00,349 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 725 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 257 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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, 4.5s IncrementalHoareTripleChecker+Time [2022-01-31 22:26:00,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 475 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 675 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-01-31 22:26:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-01-31 22:26:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 414. [2022-01-31 22:26:00,439 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 22:26:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 548 transitions. [2022-01-31 22:26:00,440 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 548 transitions. Word has length 62 [2022-01-31 22:26:00,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:26:00,441 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 548 transitions. [2022-01-31 22:26:00,441 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 22:26:00,441 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 548 transitions. [2022-01-31 22:26:00,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 22:26:00,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:26:00,441 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 22:26:00,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 22:26:00,442 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:26:00,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:26:00,442 INFO L85 PathProgramCache]: Analyzing trace with hash 466089939, now seen corresponding path program 1 times [2022-01-31 22:26:00,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:26:00,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1988301433] [2022-01-31 22:26:00,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:26:00,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:26:00,477 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:26:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:26:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:00,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:26:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:00,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:26:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:00,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:26:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:26:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 22:26:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:00,798 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 22:26:00,799 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:26:00,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1988301433] [2022-01-31 22:26:00,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1988301433] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:26:00,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:26:00,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 22:26:00,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105374695] [2022-01-31 22:26:00,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:26:00,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 22:26:00,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:26:00,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 22:26:00,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-31 22:26:00,800 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 22:26:02,932 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 22:26:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:26:04,922 INFO L93 Difference]: Finished difference Result 448 states and 589 transitions. [2022-01-31 22:26:04,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 22:26:04,922 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 22:26:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:26:04,925 INFO L225 Difference]: With dead ends: 448 [2022-01-31 22:26:04,926 INFO L226 Difference]: Without dead ends: 440 [2022-01-31 22:26:04,926 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 22:26:04,929 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 1681 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 557 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:26:04,929 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.4s Time] [2022-01-31 22:26:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-01-31 22:26:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 415. [2022-01-31 22:26:04,983 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 22:26:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 549 transitions. [2022-01-31 22:26:04,984 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 549 transitions. Word has length 61 [2022-01-31 22:26:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:26:04,984 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 549 transitions. [2022-01-31 22:26:04,985 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 22:26:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 549 transitions. [2022-01-31 22:26:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 22:26:04,985 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:26:04,985 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 22:26:04,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 22:26:04,986 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:26:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:26:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1325055407, now seen corresponding path program 1 times [2022-01-31 22:26:04,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:26:04,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1018117559] [2022-01-31 22:26:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:26:04,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:26:04,994 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:26:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:26:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:26:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:05,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:26:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:05,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:26:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:05,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:05,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:26:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:05,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 22:26:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:05,230 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 22:26:05,230 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:26:05,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1018117559] [2022-01-31 22:26:05,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1018117559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:26:05,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:26:05,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 22:26:05,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143181804] [2022-01-31 22:26:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:26:05,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 22:26:05,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:26:05,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 22:26:05,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-31 22:26:05,232 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 22:26:07,375 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 22:26:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:26:09,353 INFO L93 Difference]: Finished difference Result 442 states and 581 transitions. [2022-01-31 22:26:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 22:26:09,354 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 22:26:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:26:09,355 INFO L225 Difference]: With dead ends: 442 [2022-01-31 22:26:09,355 INFO L226 Difference]: Without dead ends: 389 [2022-01-31 22:26:09,356 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 22:26:09,356 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 1384 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 450 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:26:09,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1392 Valid, 611 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 877 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-01-31 22:26:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-01-31 22:26:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 371. [2022-01-31 22:26:09,418 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 22:26:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 493 transitions. [2022-01-31 22:26:09,419 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 493 transitions. Word has length 62 [2022-01-31 22:26:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:26:09,420 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 493 transitions. [2022-01-31 22:26:09,420 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 22:26:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 493 transitions. [2022-01-31 22:26:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-31 22:26:09,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:26:09,421 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 22:26:09,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 22:26:09,422 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:26:09,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:26:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1052170321, now seen corresponding path program 1 times [2022-01-31 22:26:09,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:26:09,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [995459617] [2022-01-31 22:26:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:26:09,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:26:09,429 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:26:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:09,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:26:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:26:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:09,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:26:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:09,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:09,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:26:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:09,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:09,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:26:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:09,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 22:26:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:09,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 22:26:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:09,808 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 22:26:09,808 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:26:09,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [995459617] [2022-01-31 22:26:09,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [995459617] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:26:09,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:26:09,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 22:26:09,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698926581] [2022-01-31 22:26:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:26:09,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 22:26:09,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:26:09,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 22:26:09,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-01-31 22:26:09,809 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 22:26:11,943 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 22:26:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:26:14,393 INFO L93 Difference]: Finished difference Result 417 states and 550 transitions. [2022-01-31 22:26:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 22:26:14,393 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 22:26:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:26:14,395 INFO L225 Difference]: With dead ends: 417 [2022-01-31 22:26:14,395 INFO L226 Difference]: Without dead ends: 409 [2022-01-31 22:26:14,395 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 22:26:14,396 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 884 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 274 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.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, 4.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:26:14,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [896 Valid, 572 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1342 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-01-31 22:26:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-01-31 22:26:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 386. [2022-01-31 22:26:14,446 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 22:26:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2022-01-31 22:26:14,447 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 72 [2022-01-31 22:26:14,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:26:14,447 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2022-01-31 22:26:14,447 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 22:26:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2022-01-31 22:26:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 22:26:14,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:26:14,450 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 22:26:14,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 22:26:14,451 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:26:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:26:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2144673722, now seen corresponding path program 1 times [2022-01-31 22:26:14,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:26:14,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [29711719] [2022-01-31 22:26:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:26:14,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:26:14,459 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:26:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:14,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:26:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:26:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:26:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:14,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:26:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:14,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:14,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:26:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:14,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 22:26:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:14,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 22:26:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:14,793 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 22:26:14,793 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:26:14,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [29711719] [2022-01-31 22:26:14,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [29711719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:26:14,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:26:14,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 22:26:14,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033848812] [2022-01-31 22:26:14,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:26:14,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 22:26:14,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:26:14,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 22:26:14,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-01-31 22:26:14,794 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 22:26:16,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:26:19,103 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 22:26:21,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:26:22,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:26:24,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:26:26,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:26:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:26:30,281 INFO L93 Difference]: Finished difference Result 417 states and 549 transitions. [2022-01-31 22:26:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 22:26:30,282 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 22:26:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:26:30,283 INFO L225 Difference]: With dead ends: 417 [2022-01-31 22:26:30,283 INFO L226 Difference]: Without dead ends: 409 [2022-01-31 22:26:30,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2022-01-31 22:26:30,284 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 1060 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 349 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-01-31 22:26:30,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1072 Valid, 659 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1627 Invalid, 3 Unknown, 0 Unchecked, 14.9s Time] [2022-01-31 22:26:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-01-31 22:26:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 387. [2022-01-31 22:26:30,332 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 22:26:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 512 transitions. [2022-01-31 22:26:30,334 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 512 transitions. Word has length 73 [2022-01-31 22:26:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:26:30,334 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 512 transitions. [2022-01-31 22:26:30,334 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 22:26:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 512 transitions. [2022-01-31 22:26:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-31 22:26:30,335 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:26:30,335 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 22:26:30,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 22:26:30,335 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:26:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:26:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1821545128, now seen corresponding path program 1 times [2022-01-31 22:26:30,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:26:30,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1119338318] [2022-01-31 22:26:30,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:26:30,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:26:30,344 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:26:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:30,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:26:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:26:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:30,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:26:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:30,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:26:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:30,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:26:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 22:26:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:30,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 22:26:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:30,575 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 22:26:30,575 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:26:30,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1119338318] [2022-01-31 22:26:30,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1119338318] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:26:30,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:26:30,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 22:26:30,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125781378] [2022-01-31 22:26:30,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:26:30,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 22:26:30,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:26:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 22:26:30,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 22:26:30,589 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 22:26:32,705 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 22:26:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:26:35,337 INFO L93 Difference]: Finished difference Result 419 states and 554 transitions. [2022-01-31 22:26:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 22:26:35,338 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 22:26:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:26:35,339 INFO L225 Difference]: With dead ends: 419 [2022-01-31 22:26:35,339 INFO L226 Difference]: Without dead ends: 396 [2022-01-31 22:26:35,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-01-31 22:26:35,340 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 744 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 244 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:26:35,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [754 Valid, 455 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 863 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-01-31 22:26:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-01-31 22:26:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 381. [2022-01-31 22:26:35,407 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 22:26:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 501 transitions. [2022-01-31 22:26:35,428 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 501 transitions. Word has length 74 [2022-01-31 22:26:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:26:35,428 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 501 transitions. [2022-01-31 22:26:35,428 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 22:26:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 501 transitions. [2022-01-31 22:26:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-31 22:26:35,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:26:35,429 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 22:26:35,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 22:26:35,430 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:26:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:26:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash 937494245, now seen corresponding path program 1 times [2022-01-31 22:26:35,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:26:35,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399426677] [2022-01-31 22:26:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:26:35,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:26:35,438 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:26:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:35,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:26:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:26:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:35,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:26:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:35,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:26:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:35,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:35,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:26:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:26:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:35,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 22:26:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:35,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 22:26:35,717 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:26:35,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399426677] [2022-01-31 22:26:35,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1399426677] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:26:35,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:26:35,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 22:26:35,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830736241] [2022-01-31 22:26:35,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:26:35,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 22:26:35,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:26:35,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 22:26:35,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 22:26:35,718 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 22:26:37,887 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 22:26:40,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:26:40,909 INFO L93 Difference]: Finished difference Result 437 states and 561 transitions. [2022-01-31 22:26:40,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 22:26:40,910 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 22:26:40,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:26:40,911 INFO L225 Difference]: With dead ends: 437 [2022-01-31 22:26:40,911 INFO L226 Difference]: Without dead ends: 374 [2022-01-31 22:26:40,911 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 22:26:40,912 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 1056 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 326 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-31 22:26:40,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1066 Valid, 631 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 967 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-01-31 22:26:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-01-31 22:26:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 345. [2022-01-31 22:26:40,961 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 22:26:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 447 transitions. [2022-01-31 22:26:40,962 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 447 transitions. Word has length 77 [2022-01-31 22:26:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:26:40,962 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 447 transitions. [2022-01-31 22:26:40,962 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 22:26:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 447 transitions. [2022-01-31 22:26:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-31 22:26:40,963 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:26:40,963 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 22:26:40,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 22:26:40,964 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:26:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:26:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash 641442499, now seen corresponding path program 1 times [2022-01-31 22:26:40,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:26:40,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [17653139] [2022-01-31 22:26:40,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:26:40,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:26:40,972 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:26:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:41,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:26:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:26:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:26:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:26:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:41,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:41,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:26:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 22:26:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 22:26:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:41,258 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 22:26:41,258 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:26:41,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [17653139] [2022-01-31 22:26:41,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [17653139] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:26:41,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:26:41,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 22:26:41,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169438195] [2022-01-31 22:26:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:26:41,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 22:26:41,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:26:41,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 22:26:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-01-31 22:26:41,260 INFO L87 Difference]: Start difference. First operand 345 states and 447 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 22:26:43,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:26:45,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:26:47,222 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 22:26:49,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:26:51,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:26:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:26:54,318 INFO L93 Difference]: Finished difference Result 648 states and 854 transitions. [2022-01-31 22:26:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 22:26:54,318 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2022-01-31 22:26:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:26:54,320 INFO L225 Difference]: With dead ends: 648 [2022-01-31 22:26:54,320 INFO L226 Difference]: Without dead ends: 358 [2022-01-31 22:26:54,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-01-31 22:26:54,321 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 556 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 205 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-01-31 22:26:54,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 691 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1445 Invalid, 4 Unknown, 0 Unchecked, 12.8s Time] [2022-01-31 22:26:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-01-31 22:26:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2022-01-31 22:26:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 271 states have (on average 1.3505535055350553) internal successors, (366), 275 states have internal predecessors, (366), 38 states have call successors, (38), 30 states have call predecessors, (38), 31 states have return successors, (38), 35 states have call predecessors, (38), 33 states have call successors, (38) [2022-01-31 22:26:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 442 transitions. [2022-01-31 22:26:54,368 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 442 transitions. Word has length 75 [2022-01-31 22:26:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:26:54,368 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 442 transitions. [2022-01-31 22:26:54,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 22:26:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 442 transitions. [2022-01-31 22:26:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-31 22:26:54,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:26:54,370 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 22:26:54,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 22:26:54,371 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:26:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:26:54,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1009683107, now seen corresponding path program 1 times [2022-01-31 22:26:54,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:26:54,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [505703590] [2022-01-31 22:26:54,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:26:54,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:26:54,379 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:26:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:26:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:26:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:26:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:26:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:26:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:26:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:26:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 22:26:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 22:26:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:54,756 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 22:26:54,756 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:26:54,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [505703590] [2022-01-31 22:26:54,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [505703590] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:26:54,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:26:54,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 22:26:54,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294348812] [2022-01-31 22:26:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:26:54,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 22:26:54,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:26:54,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 22:26:54,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 22:26:54,757 INFO L87 Difference]: Start difference. First operand 341 states and 442 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 22:26:56,822 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 22:26:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:26:59,675 INFO L93 Difference]: Finished difference Result 415 states and 531 transitions. [2022-01-31 22:26:59,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 22:26:59,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 88 [2022-01-31 22:26:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:26:59,676 INFO L225 Difference]: With dead ends: 415 [2022-01-31 22:26:59,676 INFO L226 Difference]: Without dead ends: 357 [2022-01-31 22:26:59,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 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 22:26:59,677 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 779 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 290 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-31 22:26:59,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 743 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1672 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-01-31 22:26:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-01-31 22:26:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 340. [2022-01-31 22:26:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 270 states have (on average 1.337037037037037) internal successors, (361), 274 states have internal predecessors, (361), 38 states have call successors, (38), 30 states have call predecessors, (38), 31 states have return successors, (38), 35 states have call predecessors, (38), 33 states have call successors, (38) [2022-01-31 22:26:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 437 transitions. [2022-01-31 22:26:59,743 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 437 transitions. Word has length 88 [2022-01-31 22:26:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:26:59,743 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 437 transitions. [2022-01-31 22:26:59,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 22:26:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 437 transitions. [2022-01-31 22:26:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-31 22:26:59,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:26:59,748 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 22:26:59,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 22:26:59,748 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:26:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:26:59,748 INFO L85 PathProgramCache]: Analyzing trace with hash 831316094, now seen corresponding path program 1 times [2022-01-31 22:26:59,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:26:59,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1879768274] [2022-01-31 22:26:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:26:59,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:26:59,756 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:26:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:59,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:26:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:59,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:26:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:26:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:59,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:26:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:26:59,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:26:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:00,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:27:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:27:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:27:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:00,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 22:27:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:00,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 22:27:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:00,135 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 22:27:00,136 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:27:00,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1879768274] [2022-01-31 22:27:00,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1879768274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:27:00,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:27:00,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 22:27:00,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593571065] [2022-01-31 22:27:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:27:00,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 22:27:00,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:27:00,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 22:27:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-01-31 22:27:00,137 INFO L87 Difference]: Start difference. First operand 340 states and 437 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-31 22:27:02,306 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 22:27:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:27:07,362 INFO L93 Difference]: Finished difference Result 420 states and 533 transitions. [2022-01-31 22:27:07,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 22:27:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 89 [2022-01-31 22:27:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:27:07,364 INFO L225 Difference]: With dead ends: 420 [2022-01-31 22:27:07,364 INFO L226 Difference]: Without dead ends: 377 [2022-01-31 22:27:07,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 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 22:27:07,365 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 1024 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 371 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-01-31 22:27:07,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1029 Valid, 715 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 1809 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-01-31 22:27:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-01-31 22:27:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 340. [2022-01-31 22:27:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 274 states have internal predecessors, (359), 38 states have call successors, (38), 30 states have call predecessors, (38), 31 states have return successors, (37), 35 states have call predecessors, (37), 33 states have call successors, (37) [2022-01-31 22:27:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 434 transitions. [2022-01-31 22:27:07,428 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 434 transitions. Word has length 89 [2022-01-31 22:27:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:27:07,428 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 434 transitions. [2022-01-31 22:27:07,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-31 22:27:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 434 transitions. [2022-01-31 22:27:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-31 22:27:07,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:27:07,429 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 22:27:07,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 22:27:07,429 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:27:07,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:27:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1700761598, now seen corresponding path program 1 times [2022-01-31 22:27:07,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:27:07,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [286713345] [2022-01-31 22:27:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:27:07,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:27:07,438 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:27:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:27:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:27:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:27:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:27:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:27:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:27:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:27:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 22:27:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:27:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:07,695 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 22:27:07,695 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:27:07,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [286713345] [2022-01-31 22:27:07,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [286713345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:27:07,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:27:07,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 22:27:07,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460904047] [2022-01-31 22:27:07,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:27:07,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 22:27:07,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:27:07,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 22:27:07,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 22:27:07,696 INFO L87 Difference]: Start difference. First operand 340 states and 434 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 22:27:09,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:27:10,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:27:12,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:27:14,633 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 22:27:16,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:27:18,662 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 22:27:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:27:21,941 INFO L93 Difference]: Finished difference Result 376 states and 477 transitions. [2022-01-31 22:27:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 22:27:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2022-01-31 22:27:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:27:21,943 INFO L225 Difference]: With dead ends: 376 [2022-01-31 22:27:21,943 INFO L226 Difference]: Without dead ends: 353 [2022-01-31 22:27:21,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-01-31 22:27:21,944 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 862 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 288 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:27:21,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 522 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 731 Invalid, 4 Unknown, 0 Unchecked, 14.0s Time] [2022-01-31 22:27:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-01-31 22:27:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 331. [2022-01-31 22:27:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 264 states have (on average 1.3333333333333333) internal successors, (352), 268 states have internal predecessors, (352), 37 states have call successors, (37), 29 states have call predecessors, (37), 29 states have return successors, (35), 33 states have call predecessors, (35), 32 states have call successors, (35) [2022-01-31 22:27:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 424 transitions. [2022-01-31 22:27:21,996 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 424 transitions. Word has length 89 [2022-01-31 22:27:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:27:21,996 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 424 transitions. [2022-01-31 22:27:21,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 22:27:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 424 transitions. [2022-01-31 22:27:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-31 22:27:21,997 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:27:21,997 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] [2022-01-31 22:27:21,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 22:27:21,998 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:27:21,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:27:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1579644163, now seen corresponding path program 1 times [2022-01-31 22:27:21,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:27:21,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [500092906] [2022-01-31 22:27:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:27:21,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:27:22,007 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:27:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:27:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:27:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:27:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:27:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:27:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:27:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:27:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 22:27:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 22:27:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:22,408 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 22:27:22,409 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:27:22,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [500092906] [2022-01-31 22:27:22,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [500092906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:27:22,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:27:22,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 22:27:22,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726037405] [2022-01-31 22:27:22,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:27:22,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 22:27:22,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:27:22,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 22:27:22,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-01-31 22:27:22,410 INFO L87 Difference]: Start difference. First operand 331 states and 424 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-01-31 22:27:24,494 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 22:27:26,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:27:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:27:29,200 INFO L93 Difference]: Finished difference Result 396 states and 502 transitions. [2022-01-31 22:27:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 22:27:29,201 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2022-01-31 22:27:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:27:29,202 INFO L225 Difference]: With dead ends: 396 [2022-01-31 22:27:29,202 INFO L226 Difference]: Without dead ends: 352 [2022-01-31 22:27:29,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-01-31 22:27:29,203 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 647 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 209 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-01-31 22:27:29,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [651 Valid, 957 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2394 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-01-31 22:27:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-01-31 22:27:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 330. [2022-01-31 22:27:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 263 states have (on average 1.3307984790874525) internal successors, (350), 267 states have internal predecessors, (350), 37 states have call successors, (37), 29 states have call predecessors, (37), 29 states have return successors, (35), 33 states have call predecessors, (35), 32 states have call successors, (35) [2022-01-31 22:27:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 422 transitions. [2022-01-31 22:27:29,299 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 422 transitions. Word has length 91 [2022-01-31 22:27:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:27:29,299 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 422 transitions. [2022-01-31 22:27:29,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-01-31 22:27:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 422 transitions. [2022-01-31 22:27:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 22:27:29,300 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:27:29,300 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] [2022-01-31 22:27:29,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 22:27:29,300 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:27:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:27:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash -231347989, now seen corresponding path program 1 times [2022-01-31 22:27:29,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:27:29,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [209462383] [2022-01-31 22:27:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:27:29,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:27:29,314 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:27:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:27:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:27:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:27:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:27:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:27:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:27:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:27:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 22:27:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:27:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:29,693 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 22:27:29,693 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:27:29,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [209462383] [2022-01-31 22:27:29,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [209462383] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:27:29,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:27:29,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 22:27:29,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947291041] [2022-01-31 22:27:29,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:27:29,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 22:27:29,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:27:29,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 22:27:29,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 22:27:29,695 INFO L87 Difference]: Start difference. First operand 330 states and 422 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-01-31 22:27:31,769 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 22:27:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:27:36,000 INFO L93 Difference]: Finished difference Result 473 states and 604 transitions. [2022-01-31 22:27:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 22:27:36,000 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2022-01-31 22:27:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:27:36,002 INFO L225 Difference]: With dead ends: 473 [2022-01-31 22:27:36,002 INFO L226 Difference]: Without dead ends: 365 [2022-01-31 22:27:36,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 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 22:27:36,003 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 481 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 2692 mSolverCounterSat, 174 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 2692 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-01-31 22:27:36,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1000 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 2692 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-01-31 22:27:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-01-31 22:27:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 334. [2022-01-31 22:27:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 267 states have (on average 1.3295880149812733) internal successors, (355), 272 states have internal predecessors, (355), 36 states have call successors, (36), 29 states have call predecessors, (36), 30 states have return successors, (36), 32 states have call predecessors, (36), 31 states have call successors, (36) [2022-01-31 22:27:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 427 transitions. [2022-01-31 22:27:36,057 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 427 transitions. Word has length 92 [2022-01-31 22:27:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:27:36,058 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 427 transitions. [2022-01-31 22:27:36,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-01-31 22:27:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 427 transitions. [2022-01-31 22:27:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 22:27:36,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:27:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 22:27:36,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 22:27:36,059 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:27:36,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:27:36,059 INFO L85 PathProgramCache]: Analyzing trace with hash -386853991, now seen corresponding path program 1 times [2022-01-31 22:27:36,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:27:36,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1157018095] [2022-01-31 22:27:36,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:27:36,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:27:36,069 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:27:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:27:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:27:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:27:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:27:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:27:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:27:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:27:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 22:27:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 22:27:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:36,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 22:27:36,397 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:27:36,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1157018095] [2022-01-31 22:27:36,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1157018095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:27:36,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:27:36,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 22:27:36,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491703433] [2022-01-31 22:27:36,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:27:36,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 22:27:36,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:27:36,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 22:27:36,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-31 22:27:36,399 INFO L87 Difference]: Start difference. First operand 334 states and 427 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 22:27:38,554 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 22:27:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:27:41,421 INFO L93 Difference]: Finished difference Result 427 states and 543 transitions. [2022-01-31 22:27:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 22:27:41,422 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2022-01-31 22:27:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:27:41,423 INFO L225 Difference]: With dead ends: 427 [2022-01-31 22:27:41,423 INFO L226 Difference]: Without dead ends: 374 [2022-01-31 22:27:41,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 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 22:27:41,425 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 1039 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 347 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-31 22:27:41,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 534 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1203 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-01-31 22:27:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-01-31 22:27:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 325. [2022-01-31 22:27:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 259 states have (on average 1.3243243243243243) internal successors, (343), 263 states have internal predecessors, (343), 36 states have call successors, (36), 29 states have call predecessors, (36), 29 states have return successors, (34), 32 states have call predecessors, (34), 31 states have call successors, (34) [2022-01-31 22:27:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 413 transitions. [2022-01-31 22:27:41,503 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 413 transitions. Word has length 92 [2022-01-31 22:27:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:27:41,503 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 413 transitions. [2022-01-31 22:27:41,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 22:27:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 413 transitions. [2022-01-31 22:27:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-31 22:27:41,504 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:27:41,504 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] [2022-01-31 22:27:41,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 22:27:41,504 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:27:41,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:27:41,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1555434456, now seen corresponding path program 1 times [2022-01-31 22:27:41,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:27:41,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [126283163] [2022-01-31 22:27:41,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:27:41,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:27:41,515 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:27:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:27:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:27:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:27:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:27:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:27:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:27:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:27:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 22:27:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 22:27:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 22:27:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:41,756 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 22:27:41,756 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:27:41,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [126283163] [2022-01-31 22:27:41,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [126283163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:27:41,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:27:41,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 22:27:41,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453889982] [2022-01-31 22:27:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:27:41,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 22:27:41,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:27:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 22:27:41,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 22:27:41,757 INFO L87 Difference]: Start difference. First operand 325 states and 413 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (17), 9 states have call predecessors, (17), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-01-31 22:27:43,872 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 22:27:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:27:46,118 INFO L93 Difference]: Finished difference Result 414 states and 524 transitions. [2022-01-31 22:27:46,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 22:27:46,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (17), 9 states have call predecessors, (17), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2022-01-31 22:27:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:27:46,119 INFO L225 Difference]: With dead ends: 414 [2022-01-31 22:27:46,119 INFO L226 Difference]: Without dead ends: 355 [2022-01-31 22:27:46,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 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 22:27:46,120 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 724 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 253 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-01-31 22:27:46,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [727 Valid, 564 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 872 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-01-31 22:27:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-01-31 22:27:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 323. [2022-01-31 22:27:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.313953488372093) internal successors, (339), 261 states have internal predecessors, (339), 35 states have call successors, (35), 29 states have call predecessors, (35), 29 states have return successors, (34), 32 states have call predecessors, (34), 31 states have call successors, (34) [2022-01-31 22:27:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 408 transitions. [2022-01-31 22:27:46,175 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 408 transitions. Word has length 97 [2022-01-31 22:27:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:27:46,175 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 408 transitions. [2022-01-31 22:27:46,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (17), 9 states have call predecessors, (17), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-01-31 22:27:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2022-01-31 22:27:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-31 22:27:46,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:27:46,176 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] [2022-01-31 22:27:46,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 22:27:46,176 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:27:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:27:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1824291982, now seen corresponding path program 1 times [2022-01-31 22:27:46,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:27:46,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1090475687] [2022-01-31 22:27:46,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:27:46,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:27:46,188 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:27:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:27:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:27:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:27:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:27:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:27:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:27:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:27:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 22:27:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 22:27:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:46,584 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 22:27:46,585 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:27:46,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1090475687] [2022-01-31 22:27:46,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1090475687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:27:46,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:27:46,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 22:27:46,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623160751] [2022-01-31 22:27:46,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:27:46,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 22:27:46,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:27:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 22:27:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 22:27:46,589 INFO L87 Difference]: Start difference. First operand 323 states and 408 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 22:27:48,664 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 22:27:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:27:50,753 INFO L93 Difference]: Finished difference Result 369 states and 462 transitions. [2022-01-31 22:27:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 22:27:50,755 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2022-01-31 22:27:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:27:50,756 INFO L225 Difference]: With dead ends: 369 [2022-01-31 22:27:50,756 INFO L226 Difference]: Without dead ends: 344 [2022-01-31 22:27:50,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 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 22:27:50,757 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 709 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 226 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-01-31 22:27:50,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [718 Valid, 455 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 777 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-01-31 22:27:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-01-31 22:27:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 322. [2022-01-31 22:27:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 257 states have (on average 1.311284046692607) internal successors, (337), 260 states have internal predecessors, (337), 35 states have call successors, (35), 29 states have call predecessors, (35), 29 states have return successors, (34), 32 states have call predecessors, (34), 31 states have call successors, (34) [2022-01-31 22:27:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 406 transitions. [2022-01-31 22:27:50,815 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 406 transitions. Word has length 93 [2022-01-31 22:27:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:27:50,816 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 406 transitions. [2022-01-31 22:27:50,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-31 22:27:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 406 transitions. [2022-01-31 22:27:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-31 22:27:50,816 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:27:50,817 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] [2022-01-31 22:27:50,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 22:27:50,817 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:27:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:27:50,817 INFO L85 PathProgramCache]: Analyzing trace with hash 531223474, now seen corresponding path program 1 times [2022-01-31 22:27:50,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:27:50,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [858089891] [2022-01-31 22:27:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:27:50,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:27:50,827 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:27:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:27:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:50,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:27:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:27:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:51,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:51,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:27:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:51,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:27:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:27:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:27:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 22:27:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:51,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 22:27:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:51,170 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 22:27:51,170 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:27:51,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [858089891] [2022-01-31 22:27:51,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [858089891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:27:51,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:27:51,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 22:27:51,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931164225] [2022-01-31 22:27:51,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:27:51,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 22:27:51,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:27:51,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 22:27:51,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-31 22:27:51,172 INFO L87 Difference]: Start difference. First operand 322 states and 406 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-31 22:27:53,296 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 22:27:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:27:56,129 INFO L93 Difference]: Finished difference Result 351 states and 441 transitions. [2022-01-31 22:27:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 22:27:56,129 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 93 [2022-01-31 22:27:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:27:56,130 INFO L225 Difference]: With dead ends: 351 [2022-01-31 22:27:56,130 INFO L226 Difference]: Without dead ends: 203 [2022-01-31 22:27:56,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2022-01-31 22:27:56,132 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 840 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 290 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:27:56,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [845 Valid, 507 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1269 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-01-31 22:27:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-01-31 22:27:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 182. [2022-01-31 22:27:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 141 states have internal predecessors, (171), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-01-31 22:27:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2022-01-31 22:27:56,175 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 93 [2022-01-31 22:27:56,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:27:56,175 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2022-01-31 22:27:56,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-31 22:27:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2022-01-31 22:27:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-31 22:27:56,175 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:27:56,176 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] [2022-01-31 22:27:56,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 22:27:56,176 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:27:56,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:27:56,176 INFO L85 PathProgramCache]: Analyzing trace with hash -121095912, now seen corresponding path program 1 times [2022-01-31 22:27:56,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:27:56,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [224951124] [2022-01-31 22:27:56,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:27:56,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:27:56,187 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:27:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:27:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:27:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:27:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:27:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:27:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:27:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:27:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 22:27:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-31 22:27:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:27:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:27:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:27:56,481 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 22:27:56,481 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:27:56,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [224951124] [2022-01-31 22:27:56,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [224951124] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:27:56,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:27:56,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 22:27:56,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409718748] [2022-01-31 22:27:56,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:27:56,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 22:27:56,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:27:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 22:27:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-31 22:27:56,483 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 9 states have call predecessors, (17), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-01-31 22:27:58,545 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 22:28:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:28:01,265 INFO L93 Difference]: Finished difference Result 298 states and 365 transitions. [2022-01-31 22:28:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 22:28:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 9 states have call predecessors, (17), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 101 [2022-01-31 22:28:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:28:01,266 INFO L225 Difference]: With dead ends: 298 [2022-01-31 22:28:01,266 INFO L226 Difference]: Without dead ends: 235 [2022-01-31 22:28:01,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 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 22:28:01,269 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 277 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 167 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-31 22:28:01,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 381 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 756 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-01-31 22:28:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-01-31 22:28:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 195. [2022-01-31 22:28:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 149 states have (on average 1.221476510067114) internal successors, (182), 152 states have internal predecessors, (182), 23 states have call successors, (23), 21 states have call predecessors, (23), 22 states have return successors, (23), 21 states have call predecessors, (23), 19 states have call successors, (23) [2022-01-31 22:28:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2022-01-31 22:28:01,313 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 101 [2022-01-31 22:28:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:28:01,314 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2022-01-31 22:28:01,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 9 states have call predecessors, (17), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-01-31 22:28:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2022-01-31 22:28:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-31 22:28:01,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:28:01,314 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 22:28:01,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 22:28:01,315 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:28:01,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:28:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1896043663, now seen corresponding path program 1 times [2022-01-31 22:28:01,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:28:01,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658471651] [2022-01-31 22:28:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:28:01,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:28:01,326 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:28:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:28:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:28:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:28:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:28:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:28:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:28:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 22:28:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-31 22:28:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:28:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:01,631 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 22:28:01,631 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:28:01,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658471651] [2022-01-31 22:28:01,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1658471651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:28:01,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:28:01,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 22:28:01,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115256466] [2022-01-31 22:28:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:28:01,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 22:28:01,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:28:01,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 22:28:01,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 22:28:01,632 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (17), 10 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 22:28:04,416 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 22:28:06,439 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 22:28:08,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:28:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:28:10,194 INFO L93 Difference]: Finished difference Result 433 states and 516 transitions. [2022-01-31 22:28:10,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 22:28:10,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (17), 10 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2022-01-31 22:28:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:28:10,196 INFO L225 Difference]: With dead ends: 433 [2022-01-31 22:28:10,196 INFO L226 Difference]: Without dead ends: 404 [2022-01-31 22:28:10,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 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 22:28:10,197 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 483 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 216 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-01-31 22:28:10,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 278 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 475 Invalid, 3 Unknown, 0 Unchecked, 8.2s Time] [2022-01-31 22:28:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-01-31 22:28:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 337. [2022-01-31 22:28:10,281 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 22:28:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 399 transitions. [2022-01-31 22:28:10,281 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 399 transitions. Word has length 102 [2022-01-31 22:28:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:28:10,282 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 399 transitions. [2022-01-31 22:28:10,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (17), 10 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 22:28:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 399 transitions. [2022-01-31 22:28:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-31 22:28:10,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:28:10,282 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 22:28:10,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 22:28:10,283 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:28:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:28:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash -623916271, now seen corresponding path program 1 times [2022-01-31 22:28:10,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:28:10,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [684360906] [2022-01-31 22:28:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:28:10,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:28:10,296 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:28:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:28:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:28:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:28:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:28:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 22:28:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:28:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 22:28:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-31 22:28:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:28:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:10,892 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 22:28:10,893 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:28:10,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [684360906] [2022-01-31 22:28:10,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [684360906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:28:10,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:28:10,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 22:28:10,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111130643] [2022-01-31 22:28:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:28:10,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 22:28:10,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:28:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 22:28:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-31 22:28:10,894 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 22:28:12,966 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 22:28:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:28:15,011 INFO L93 Difference]: Finished difference Result 675 states and 810 transitions. [2022-01-31 22:28:15,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 22:28:15,011 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 22:28:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:28:15,013 INFO L225 Difference]: With dead ends: 675 [2022-01-31 22:28:15,013 INFO L226 Difference]: Without dead ends: 389 [2022-01-31 22:28:15,013 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 22:28:15,014 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 202 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 106 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-01-31 22:28:15,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 372 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 556 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-01-31 22:28:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-01-31 22:28:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 339. [2022-01-31 22:28:15,116 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 22:28:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 401 transitions. [2022-01-31 22:28:15,117 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 401 transitions. Word has length 102 [2022-01-31 22:28:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:28:15,117 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 401 transitions. [2022-01-31 22:28:15,118 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 22:28:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 401 transitions. [2022-01-31 22:28:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-31 22:28:15,118 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:28:15,118 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 22:28:15,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 22:28:15,119 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:28:15,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:28:15,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1023672093, now seen corresponding path program 1 times [2022-01-31 22:28:15,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:28:15,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745782744] [2022-01-31 22:28:15,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:28:15,133 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:28:15,133 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:28:15,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:28:15,145 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:28:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:28:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:28:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:28:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:28:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 22:28:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-31 22:28:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 22:28:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-31 22:28:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:28:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:15,722 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 22:28:15,722 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:28:15,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [745782744] [2022-01-31 22:28:15,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [745782744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:28:15,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:28:15,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 22:28:15,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388146576] [2022-01-31 22:28:15,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:28:15,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 22:28:15,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:28:15,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 22:28:15,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 22:28:15,724 INFO L87 Difference]: Start difference. First operand 339 states and 401 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 5 states have internal predecessors, (73), 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 22:28:17,796 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 22:28:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:28:19,464 INFO L93 Difference]: Finished difference Result 677 states and 812 transitions. [2022-01-31 22:28:19,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 22:28:19,464 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 5 states have internal predecessors, (73), 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 103 [2022-01-31 22:28:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:28:19,466 INFO L225 Difference]: With dead ends: 677 [2022-01-31 22:28:19,466 INFO L226 Difference]: Without dead ends: 391 [2022-01-31 22:28:19,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-01-31 22:28:19,467 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 254 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 146 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-31 22:28:19,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 375 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 584 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-01-31 22:28:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-01-31 22:28:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 341. [2022-01-31 22:28:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 266 states have (on average 1.2293233082706767) internal successors, (327), 270 states have internal predecessors, (327), 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 22:28:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 403 transitions. [2022-01-31 22:28:19,561 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 403 transitions. Word has length 103 [2022-01-31 22:28:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:28:19,561 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 403 transitions. [2022-01-31 22:28:19,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 5 states have internal predecessors, (73), 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 22:28:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 403 transitions. [2022-01-31 22:28:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-31 22:28:19,562 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:28:19,563 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:28:19,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 22:28:19,563 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:28:19,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:28:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash 559303825, now seen corresponding path program 2 times [2022-01-31 22:28:19,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:28:19,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [307857969] [2022-01-31 22:28:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:28:19,565 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:28:19,565 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:28:19,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:28:19,579 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:28:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:19,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:28:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:19,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:28:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:28:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:19,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:19,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:20,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:20,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:28:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 22:28:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 22:28:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:20,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-31 22:28:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:20,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 22:28:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:28:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:20,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:20,232 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 22:28:20,232 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:28:20,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [307857969] [2022-01-31 22:28:20,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [307857969] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:28:20,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:28:20,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 22:28:20,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340737340] [2022-01-31 22:28:20,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:28:20,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 22:28:20,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:28:20,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 22:28:20,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-01-31 22:28:20,234 INFO L87 Difference]: Start difference. First operand 341 states and 403 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 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 22:28:22,325 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 22:28:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:28:24,950 INFO L93 Difference]: Finished difference Result 679 states and 814 transitions. [2022-01-31 22:28:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 22:28:24,950 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 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 104 [2022-01-31 22:28:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:28:24,951 INFO L225 Difference]: With dead ends: 679 [2022-01-31 22:28:24,952 INFO L226 Difference]: Without dead ends: 393 [2022-01-31 22:28:24,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-01-31 22:28:24,952 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 329 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 177 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-31 22:28:24,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 360 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 605 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-01-31 22:28:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-01-31 22:28:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 343. [2022-01-31 22:28:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 268 states have (on average 1.2276119402985075) internal successors, (329), 272 states have internal predecessors, (329), 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 22:28:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 405 transitions. [2022-01-31 22:28:25,063 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 405 transitions. Word has length 104 [2022-01-31 22:28:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:28:25,063 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 405 transitions. [2022-01-31 22:28:25,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 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 22:28:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 405 transitions. [2022-01-31 22:28:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-31 22:28:25,064 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:28:25,064 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:28:25,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 22:28:25,064 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:28:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:28:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash -951210595, now seen corresponding path program 3 times [2022-01-31 22:28:25,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:28:25,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330614483] [2022-01-31 22:28:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:28:25,066 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:28:25,066 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:28:25,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:28:25,079 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:28:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:28:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:28:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:28:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:28:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 22:28:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-31 22:28:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 22:28:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 22:28:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:28:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:25,671 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 22:28:25,671 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:28:25,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330614483] [2022-01-31 22:28:25,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1330614483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:28:25,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:28:25,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 22:28:25,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397753317] [2022-01-31 22:28:25,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:28:25,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 22:28:25,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:28:25,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 22:28:25,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-31 22:28:25,672 INFO L87 Difference]: Start difference. First operand 343 states and 405 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 7 states have internal predecessors, (75), 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 22:28:27,741 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 22:28:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:28:30,357 INFO L93 Difference]: Finished difference Result 681 states and 816 transitions. [2022-01-31 22:28:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 22:28:30,357 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 7 states have internal predecessors, (75), 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 105 [2022-01-31 22:28:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:28:30,358 INFO L225 Difference]: With dead ends: 681 [2022-01-31 22:28:30,358 INFO L226 Difference]: Without dead ends: 395 [2022-01-31 22:28:30,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2022-01-31 22:28:30,359 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 328 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 180 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-31 22:28:30,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 468 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 844 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-01-31 22:28:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-01-31 22:28:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 345. [2022-01-31 22:28:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 270 states have (on average 1.2259259259259259) internal successors, (331), 274 states have internal predecessors, (331), 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 22:28:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 407 transitions. [2022-01-31 22:28:30,486 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 407 transitions. Word has length 105 [2022-01-31 22:28:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:28:30,486 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 407 transitions. [2022-01-31 22:28:30,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 7 states have internal predecessors, (75), 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 22:28:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 407 transitions. [2022-01-31 22:28:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-31 22:28:30,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:28:30,487 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:28:30,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 22:28:30,487 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:28:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:28:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash -532517359, now seen corresponding path program 4 times [2022-01-31 22:28:30,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:28:30,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [746778117] [2022-01-31 22:28:30,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:28:30,489 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:28:30,489 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:28:30,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:28:30,503 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:28:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:28:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:28:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:28:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:28:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 22:28:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 22:28:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-31 22:28:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-31 22:28:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:28:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:31,321 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 22:28:31,321 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:28:31,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [746778117] [2022-01-31 22:28:31,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [746778117] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:28:31,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:28:31,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 22:28:31,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589178091] [2022-01-31 22:28:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:28:31,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 22:28:31,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:28:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 22:28:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-01-31 22:28:31,322 INFO L87 Difference]: Start difference. First operand 345 states and 407 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 8 states have internal predecessors, (76), 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 22:28:33,404 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 22:28:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:28:35,735 INFO L93 Difference]: Finished difference Result 683 states and 818 transitions. [2022-01-31 22:28:35,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 22:28:35,735 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 8 states have internal predecessors, (76), 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 106 [2022-01-31 22:28:35,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:28:35,737 INFO L225 Difference]: With dead ends: 683 [2022-01-31 22:28:35,737 INFO L226 Difference]: Without dead ends: 397 [2022-01-31 22:28:35,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-01-31 22:28:35,747 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 200 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 118 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-01-31 22:28:35,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 434 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 785 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-01-31 22:28:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-01-31 22:28:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 347. [2022-01-31 22:28:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 272 states have (on average 1.224264705882353) internal successors, (333), 276 states have internal predecessors, (333), 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 22:28:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 409 transitions. [2022-01-31 22:28:35,879 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 409 transitions. Word has length 106 [2022-01-31 22:28:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:28:35,879 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 409 transitions. [2022-01-31 22:28:35,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 8 states have internal predecessors, (76), 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 22:28:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 409 transitions. [2022-01-31 22:28:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-31 22:28:35,880 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:28:35,880 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:28:35,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 22:28:35,880 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:28:35,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:28:35,880 INFO L85 PathProgramCache]: Analyzing trace with hash -437928931, now seen corresponding path program 5 times [2022-01-31 22:28:35,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:28:35,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [963463687] [2022-01-31 22:28:35,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:28:35,881 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:28:35,881 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:28:35,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:28:35,896 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:28:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:28:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:28:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:28:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:28:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 22:28:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 22:28:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 22:28:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 22:28:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:28:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:36,646 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 22:28:36,647 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:28:36,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [963463687] [2022-01-31 22:28:36,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [963463687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:28:36,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:28:36,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 22:28:36,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005826723] [2022-01-31 22:28:36,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:28:36,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 22:28:36,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:28:36,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 22:28:36,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-01-31 22:28:36,650 INFO L87 Difference]: Start difference. First operand 347 states and 409 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 9 states have internal predecessors, (77), 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 22:28:38,721 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 22:28:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:28:41,944 INFO L93 Difference]: Finished difference Result 685 states and 820 transitions. [2022-01-31 22:28:41,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 22:28:41,944 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 9 states have internal predecessors, (77), 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 107 [2022-01-31 22:28:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:28:41,946 INFO L225 Difference]: With dead ends: 685 [2022-01-31 22:28:41,946 INFO L226 Difference]: Without dead ends: 399 [2022-01-31 22:28:41,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2022-01-31 22:28:41,947 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 212 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 109 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-01-31 22:28:41,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 421 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 829 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-01-31 22:28:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-01-31 22:28:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 349. [2022-01-31 22:28:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 274 states have (on average 1.2226277372262773) internal successors, (335), 278 states have internal predecessors, (335), 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 22:28:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 411 transitions. [2022-01-31 22:28:42,053 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 411 transitions. Word has length 107 [2022-01-31 22:28:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:28:42,054 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 411 transitions. [2022-01-31 22:28:42,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 9 states have internal predecessors, (77), 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 22:28:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 411 transitions. [2022-01-31 22:28:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-31 22:28:42,054 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:28:42,054 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:28:42,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 22:28:42,055 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:28:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:28:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1800654959, now seen corresponding path program 6 times [2022-01-31 22:28:42,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:28:42,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [34677862] [2022-01-31 22:28:42,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:28:42,056 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:28:42,056 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:28:42,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:28:42,087 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:28:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:28:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:28:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:28:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:28:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 22:28:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 22:28:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-31 22:28:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-31 22:28:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:28:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:42,725 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 22:28:42,725 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:28:42,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [34677862] [2022-01-31 22:28:42,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [34677862] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:28:42,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:28:42,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 22:28:42,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079948789] [2022-01-31 22:28:42,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:28:42,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 22:28:42,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:28:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 22:28:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-01-31 22:28:42,727 INFO L87 Difference]: Start difference. First operand 349 states and 411 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 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 22:28:44,805 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 22:28:49,805 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 22:28:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:28:50,477 INFO L93 Difference]: Finished difference Result 687 states and 822 transitions. [2022-01-31 22:28:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 22:28:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 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 108 [2022-01-31 22:28:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:28:50,479 INFO L225 Difference]: With dead ends: 687 [2022-01-31 22:28:50,479 INFO L226 Difference]: Without dead ends: 401 [2022-01-31 22:28:50,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2022-01-31 22:28:50,482 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 270 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 151 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:28:50,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 624 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1330 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-01-31 22:28:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-01-31 22:28:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 351. [2022-01-31 22:28:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 276 states have (on average 1.2210144927536233) internal successors, (337), 280 states have internal predecessors, (337), 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 22:28:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 413 transitions. [2022-01-31 22:28:50,590 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 413 transitions. Word has length 108 [2022-01-31 22:28:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:28:50,590 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 413 transitions. [2022-01-31 22:28:50,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 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 22:28:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 413 transitions. [2022-01-31 22:28:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-31 22:28:50,591 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:28:50,591 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:28:50,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 22:28:50,591 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:28:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:28:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1095488867, now seen corresponding path program 7 times [2022-01-31 22:28:50,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:28:50,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1410880275] [2022-01-31 22:28:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:28:50,593 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:28:50,593 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:28:50,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:28:50,620 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:28:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:50,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:28:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:50,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:28:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:28:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:28:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 22:28:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 22:28:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 22:28:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 22:28:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:28:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:51,441 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 22:28:51,441 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:28:51,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1410880275] [2022-01-31 22:28:51,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1410880275] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:28:51,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:28:51,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 22:28:51,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350760213] [2022-01-31 22:28:51,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:28:51,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 22:28:51,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:28:51,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 22:28:51,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-01-31 22:28:51,443 INFO L87 Difference]: Start difference. First operand 351 states and 413 transitions. Second operand has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 11 states have internal predecessors, (79), 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 22:28:53,525 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 22:28:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:28:56,528 INFO L93 Difference]: Finished difference Result 689 states and 824 transitions. [2022-01-31 22:28:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 22:28:56,528 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 11 states have internal predecessors, (79), 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 109 [2022-01-31 22:28:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:28:56,536 INFO L225 Difference]: With dead ends: 689 [2022-01-31 22:28:56,536 INFO L226 Difference]: Without dead ends: 403 [2022-01-31 22:28:56,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2022-01-31 22:28:56,552 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 270 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 155 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:28:56,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 436 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 842 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-01-31 22:28:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-01-31 22:28:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 353. [2022-01-31 22:28:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 278 states have (on average 1.2194244604316546) internal successors, (339), 282 states have internal predecessors, (339), 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 22:28:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 415 transitions. [2022-01-31 22:28:56,686 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 415 transitions. Word has length 109 [2022-01-31 22:28:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:28:56,686 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 415 transitions. [2022-01-31 22:28:56,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 11 states have internal predecessors, (79), 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 22:28:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 415 transitions. [2022-01-31 22:28:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-31 22:28:56,687 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:28:56,687 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:28:56,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 22:28:56,687 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:28:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:28:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash -710176495, now seen corresponding path program 8 times [2022-01-31 22:28:56,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:28:56,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [650597835] [2022-01-31 22:28:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:28:56,689 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:28:56,689 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:28:56,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:28:56,706 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:28:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:56,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:28:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:28:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:28:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:28:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:28:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-31 22:28:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-31 22:28:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-01-31 22:28:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:28:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:28:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:28:57,402 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 22:28:57,402 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:28:57,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [650597835] [2022-01-31 22:28:57,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [650597835] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:28:57,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:28:57,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 22:28:57,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136452961] [2022-01-31 22:28:57,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:28:57,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 22:28:57,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:28:57,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 22:28:57,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-01-31 22:28:57,403 INFO L87 Difference]: Start difference. First operand 353 states and 415 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 12 states have internal predecessors, (80), 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 22:28:59,456 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 22:29:01,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:29:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:29:03,877 INFO L93 Difference]: Finished difference Result 691 states and 826 transitions. [2022-01-31 22:29:03,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 22:29:03,877 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 12 states have internal predecessors, (80), 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 110 [2022-01-31 22:29:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:29:03,879 INFO L225 Difference]: With dead ends: 691 [2022-01-31 22:29:03,879 INFO L226 Difference]: Without dead ends: 405 [2022-01-31 22:29:03,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2022-01-31 22:29:03,880 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 196 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 132 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-01-31 22:29:03,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 563 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1181 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-01-31 22:29:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-01-31 22:29:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 355. [2022-01-31 22:29:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 280 states have (on average 1.2178571428571427) internal successors, (341), 284 states have internal predecessors, (341), 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 22:29:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 417 transitions. [2022-01-31 22:29:03,995 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 417 transitions. Word has length 110 [2022-01-31 22:29:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:29:03,996 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 417 transitions. [2022-01-31 22:29:03,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 12 states have internal predecessors, (80), 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 22:29:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 417 transitions. [2022-01-31 22:29:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-31 22:29:03,996 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:29:03,997 INFO L514 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:29:03,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 22:29:03,997 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:29:03,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:29:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1650394851, now seen corresponding path program 9 times [2022-01-31 22:29:03,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:29:03,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1873683041] [2022-01-31 22:29:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:29:03,998 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:29:03,998 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:29:03,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:29:04,013 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:29:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:29:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:29:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:29:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:29:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:29:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 22:29:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 22:29:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 22:29:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-01-31 22:29:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:29:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:04,925 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 22:29:04,925 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:29:04,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1873683041] [2022-01-31 22:29:04,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1873683041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:29:04,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:29:04,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 22:29:04,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172494199] [2022-01-31 22:29:04,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:29:04,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 22:29:04,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:29:04,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 22:29:04,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-01-31 22:29:04,926 INFO L87 Difference]: Start difference. First operand 355 states and 417 transitions. Second operand has 20 states, 20 states have (on average 4.05) internal successors, (81), 13 states have internal predecessors, (81), 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 22:29:06,976 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 22:29:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:29:08,961 INFO L93 Difference]: Finished difference Result 693 states and 828 transitions. [2022-01-31 22:29:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 22:29:08,961 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 13 states have internal predecessors, (81), 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 111 [2022-01-31 22:29:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:29:08,962 INFO L225 Difference]: With dead ends: 693 [2022-01-31 22:29:08,962 INFO L226 Difference]: Without dead ends: 407 [2022-01-31 22:29:08,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 22:29:08,963 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 266 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 161 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:29:08,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 345 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 662 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-01-31 22:29:08,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-01-31 22:29:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 357. [2022-01-31 22:29:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 282 states have (on average 1.2163120567375887) internal successors, (343), 286 states have internal predecessors, (343), 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 22:29:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 419 transitions. [2022-01-31 22:29:09,080 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 419 transitions. Word has length 111 [2022-01-31 22:29:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:29:09,080 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 419 transitions. [2022-01-31 22:29:09,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 13 states have internal predecessors, (81), 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 22:29:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 419 transitions. [2022-01-31 22:29:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-31 22:29:09,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:29:09,081 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:29:09,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 22:29:09,081 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:29:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:29:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash -732392815, now seen corresponding path program 10 times [2022-01-31 22:29:09,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:29:09,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [947159813] [2022-01-31 22:29:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:29:09,082 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:29:09,082 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:29:09,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:29:09,098 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:29:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:29:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:29:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:29:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:29:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:29:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 22:29:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 22:29:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-31 22:29:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-01-31 22:29:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:29:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:09,853 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 22:29:09,853 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:29:09,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [947159813] [2022-01-31 22:29:09,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [947159813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:29:09,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:29:09,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 22:29:09,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026055737] [2022-01-31 22:29:09,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:29:09,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 22:29:09,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:29:09,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 22:29:09,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-01-31 22:29:09,854 INFO L87 Difference]: Start difference. First operand 357 states and 419 transitions. Second operand has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 14 states have internal predecessors, (82), 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 22:29:11,931 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 22:29:15,262 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 22:29:16,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:29:16,991 INFO L93 Difference]: Finished difference Result 695 states and 830 transitions. [2022-01-31 22:29:16,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 22:29:16,991 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 14 states have internal predecessors, (82), 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 112 [2022-01-31 22:29:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:29:16,993 INFO L225 Difference]: With dead ends: 695 [2022-01-31 22:29:16,993 INFO L226 Difference]: Without dead ends: 409 [2022-01-31 22:29:16,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 22:29:16,994 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 143 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 93 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-01-31 22:29:16,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 672 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1624 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-01-31 22:29:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-01-31 22:29:17,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 359. [2022-01-31 22:29:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 284 states have (on average 1.2147887323943662) internal successors, (345), 288 states have internal predecessors, (345), 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 22:29:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 421 transitions. [2022-01-31 22:29:17,118 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 421 transitions. Word has length 112 [2022-01-31 22:29:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:29:17,118 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 421 transitions. [2022-01-31 22:29:17,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 14 states have internal predecessors, (82), 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 22:29:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 421 transitions. [2022-01-31 22:29:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-31 22:29:17,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:29:17,130 INFO L514 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:29:17,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 22:29:17,130 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:29:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:29:17,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1955866525, now seen corresponding path program 11 times [2022-01-31 22:29:17,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:29:17,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2011661328] [2022-01-31 22:29:17,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:29:17,132 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:29:17,132 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:29:17,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:29:17,151 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:29:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:17,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:29:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:17,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:29:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:17,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:29:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:17,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:29:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:17,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:17,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:29:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:17,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 22:29:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:17,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 22:29:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:17,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-31 22:29:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:18,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 22:29:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:29:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:18,051 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 22:29:18,051 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:29:18,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2011661328] [2022-01-31 22:29:18,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2011661328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:29:18,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:29:18,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-31 22:29:18,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991838509] [2022-01-31 22:29:18,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:29:18,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 22:29:18,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:29:18,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 22:29:18,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-01-31 22:29:18,054 INFO L87 Difference]: Start difference. First operand 359 states and 421 transitions. Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 15 states have internal predecessors, (83), 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 22:29:20,148 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 22:29:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:29:24,293 INFO L93 Difference]: Finished difference Result 697 states and 832 transitions. [2022-01-31 22:29:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 22:29:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 15 states have internal predecessors, (83), 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 113 [2022-01-31 22:29:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:29:24,294 INFO L225 Difference]: With dead ends: 697 [2022-01-31 22:29:24,294 INFO L226 Difference]: Without dead ends: 411 [2022-01-31 22:29:24,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=217, Invalid=1189, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 22:29:24,295 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 316 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 232 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-01-31 22:29:24,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 498 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1035 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-01-31 22:29:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-01-31 22:29:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 361. [2022-01-31 22:29:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 286 states have (on average 1.2132867132867133) internal successors, (347), 290 states have internal predecessors, (347), 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 22:29:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 423 transitions. [2022-01-31 22:29:24,423 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 423 transitions. Word has length 113 [2022-01-31 22:29:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:29:24,423 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 423 transitions. [2022-01-31 22:29:24,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 15 states have internal predecessors, (83), 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 22:29:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 423 transitions. [2022-01-31 22:29:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-31 22:29:24,424 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:29:24,424 INFO L514 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:29:24,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 22:29:24,424 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:29:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:29:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash -607439855, now seen corresponding path program 12 times [2022-01-31 22:29:24,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:29:24,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1115249868] [2022-01-31 22:29:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:29:24,425 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:29:24,425 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:29:24,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:29:24,444 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:29:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:29:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:24,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:29:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:24,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:29:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:24,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:24,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:29:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:24,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:24,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:29:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 22:29:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:25,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 22:29:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:25,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 22:29:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-31 22:29:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:29:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:25,287 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 22:29:25,287 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:29:25,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1115249868] [2022-01-31 22:29:25,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1115249868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:29:25,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:29:25,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 22:29:25,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63886710] [2022-01-31 22:29:25,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:29:25,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 22:29:25,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:29:25,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 22:29:25,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-01-31 22:29:25,288 INFO L87 Difference]: Start difference. First operand 361 states and 423 transitions. Second operand has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 16 states have internal predecessors, (84), 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 22:29:27,363 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 22:29:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:29:30,526 INFO L93 Difference]: Finished difference Result 699 states and 834 transitions. [2022-01-31 22:29:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 22:29:30,527 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 16 states have internal predecessors, (84), 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 114 [2022-01-31 22:29:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:29:30,528 INFO L225 Difference]: With dead ends: 699 [2022-01-31 22:29:30,528 INFO L226 Difference]: Without dead ends: 413 [2022-01-31 22:29:30,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 22:29:30,529 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 213 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-31 22:29:30,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 454 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1126 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-01-31 22:29:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-01-31 22:29:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 363. [2022-01-31 22:29:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 288 states have (on average 1.2118055555555556) internal successors, (349), 292 states have internal predecessors, (349), 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 22:29:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 425 transitions. [2022-01-31 22:29:30,656 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 425 transitions. Word has length 114 [2022-01-31 22:29:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:29:30,657 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 425 transitions. [2022-01-31 22:29:30,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 16 states have internal predecessors, (84), 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 22:29:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 425 transitions. [2022-01-31 22:29:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-31 22:29:30,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:29:30,657 INFO L514 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:29:30,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 22:29:30,658 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:29:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:29:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1534440989, now seen corresponding path program 13 times [2022-01-31 22:29:30,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:29:30,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [913761028] [2022-01-31 22:29:30,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:29:30,660 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:29:30,660 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:29:30,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:29:30,677 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:29:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:30,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:29:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:29:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:29:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:29:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:29:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-31 22:29:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 22:29:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 22:29:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 22:29:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:29:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:31,540 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 22:29:31,541 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:29:31,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [913761028] [2022-01-31 22:29:31,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [913761028] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:29:31,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:29:31,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 22:29:31,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151127296] [2022-01-31 22:29:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:29:31,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 22:29:31,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:29:31,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 22:29:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-01-31 22:29:31,542 INFO L87 Difference]: Start difference. First operand 363 states and 425 transitions. Second operand has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 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 22:29:33,621 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 22:29:36,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:29:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:29:37,641 INFO L93 Difference]: Finished difference Result 701 states and 836 transitions. [2022-01-31 22:29:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 22:29:37,641 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 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 115 [2022-01-31 22:29:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:29:37,643 INFO L225 Difference]: With dead ends: 701 [2022-01-31 22:29:37,643 INFO L226 Difference]: Without dead ends: 415 [2022-01-31 22:29:37,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 22:29:37,644 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 143 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 99 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:29:37,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 390 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 952 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-01-31 22:29:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-01-31 22:29:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 365. [2022-01-31 22:29:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 290 states have (on average 1.210344827586207) internal successors, (351), 294 states have internal predecessors, (351), 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 22:29:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 427 transitions. [2022-01-31 22:29:37,799 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 427 transitions. Word has length 115 [2022-01-31 22:29:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:29:37,800 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 427 transitions. [2022-01-31 22:29:37,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 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 22:29:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 427 transitions. [2022-01-31 22:29:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-31 22:29:37,801 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:29:37,801 INFO L514 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:29:37,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 22:29:37,801 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:29:37,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:29:37,802 INFO L85 PathProgramCache]: Analyzing trace with hash -786729583, now seen corresponding path program 14 times [2022-01-31 22:29:37,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:29:37,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [296104972] [2022-01-31 22:29:37,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:29:37,803 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:29:37,803 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:29:37,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:29:37,820 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:29:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:29:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:29:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:29:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:29:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:29:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 22:29:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 22:29:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-31 22:29:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 22:29:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:29:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 22:29:38,837 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:29:38,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [296104972] [2022-01-31 22:29:38,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [296104972] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:29:38,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:29:38,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 22:29:38,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127545657] [2022-01-31 22:29:38,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:29:38,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 22:29:38,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:29:38,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 22:29:38,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2022-01-31 22:29:38,838 INFO L87 Difference]: Start difference. First operand 365 states and 427 transitions. Second operand has 25 states, 25 states have (on average 3.44) internal successors, (86), 18 states have internal predecessors, (86), 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 22:29:40,942 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 22:29:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:29:44,488 INFO L93 Difference]: Finished difference Result 703 states and 838 transitions. [2022-01-31 22:29:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 22:29:44,488 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 18 states have internal predecessors, (86), 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 116 [2022-01-31 22:29:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:29:44,490 INFO L225 Difference]: With dead ends: 703 [2022-01-31 22:29:44,490 INFO L226 Difference]: Without dead ends: 417 [2022-01-31 22:29:44,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2022-01-31 22:29:44,508 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 213 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 127 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-01-31 22:29:44,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 454 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1196 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-01-31 22:29:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-01-31 22:29:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 367. [2022-01-31 22:29:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 292 states have (on average 1.2089041095890412) internal successors, (353), 296 states have internal predecessors, (353), 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 22:29:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 429 transitions. [2022-01-31 22:29:44,654 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 429 transitions. Word has length 116 [2022-01-31 22:29:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:29:44,655 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 429 transitions. [2022-01-31 22:29:44,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 18 states have internal predecessors, (86), 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 22:29:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 429 transitions. [2022-01-31 22:29:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-31 22:29:44,655 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:29:44,656 INFO L514 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:29:44,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 22:29:44,656 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:29:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:29:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash 271426717, now seen corresponding path program 15 times [2022-01-31 22:29:44,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:29:44,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1384296838] [2022-01-31 22:29:44,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:29:44,657 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:29:44,657 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:29:44,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:29:44,675 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:29:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:29:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:29:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:29:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:29:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:29:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 22:29:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-31 22:29:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 22:29:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-31 22:29:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:29:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:29:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:29:45,721 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 22:29:45,721 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:29:45,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1384296838] [2022-01-31 22:29:45,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1384296838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:29:45,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:29:45,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 22:29:45,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902211660] [2022-01-31 22:29:45,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:29:45,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 22:29:45,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:29:45,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 22:29:45,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2022-01-31 22:29:45,724 INFO L87 Difference]: Start difference. First operand 367 states and 429 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 19 states have internal predecessors, (87), 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 22:29:47,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:29:49,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:29:51,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:29:53,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:29:55,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:29:57,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:29:59,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:01,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:03,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:05,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:07,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:09,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:11,700 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 22:30:13,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:15,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:17,408 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 22:30:19,427 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:30:25,857 INFO L93 Difference]: Finished difference Result 705 states and 840 transitions. [2022-01-31 22:30:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 22:30:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 19 states have internal predecessors, (87), 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 117 [2022-01-31 22:30:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:30:25,859 INFO L225 Difference]: With dead ends: 705 [2022-01-31 22:30:25,859 INFO L226 Difference]: Without dead ends: 419 [2022-01-31 22:30:25,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=1801, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 22:30:25,860 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 212 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 131 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:30:25,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 906 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2399 Invalid, 15 Unknown, 0 Unchecked, 39.0s Time] [2022-01-31 22:30:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-01-31 22:30:26,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 369. [2022-01-31 22:30:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 294 states have (on average 1.2074829931972788) internal successors, (355), 298 states have internal predecessors, (355), 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 22:30:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 431 transitions. [2022-01-31 22:30:26,001 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 431 transitions. Word has length 117 [2022-01-31 22:30:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:30:26,002 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 431 transitions. [2022-01-31 22:30:26,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 19 states have internal predecessors, (87), 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 22:30:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 431 transitions. [2022-01-31 22:30:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-31 22:30:26,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:30:26,002 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:30:26,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 22:30:26,003 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:30:26,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:30:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1285466351, now seen corresponding path program 16 times [2022-01-31 22:30:26,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:30:26,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1230111270] [2022-01-31 22:30:26,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:30:26,005 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:30:26,005 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:30:26,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:30:26,026 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:30:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:30:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:30:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:30:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:30:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:30:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:30:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:30:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 22:30:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 22:30:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-31 22:30:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-31 22:30:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:30:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:30:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:30:26,900 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 22:30:26,900 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:30:26,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1230111270] [2022-01-31 22:30:26,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1230111270] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:30:26,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:30:26,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-31 22:30:26,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66875380] [2022-01-31 22:30:26,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:30:26,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 22:30:26,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:30:26,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 22:30:26,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-01-31 22:30:26,902 INFO L87 Difference]: Start difference. First operand 369 states and 431 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 20 states have internal predecessors, (88), 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 22:30:28,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:30,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:32,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:34,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:36,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:38,436 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 22:30:40,455 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:42,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:44,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:46,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 22:30:48,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:50,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:52,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:53,281 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 22:30:55,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:57,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:30:59,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:01,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:03,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:05,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:07,406 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 22:31:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:31:15,219 INFO L93 Difference]: Finished difference Result 707 states and 842 transitions. [2022-01-31 22:31:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 22:31:15,219 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 20 states have internal predecessors, (88), 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 118 [2022-01-31 22:31:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:31:15,221 INFO L225 Difference]: With dead ends: 707 [2022-01-31 22:31:15,221 INFO L226 Difference]: Without dead ends: 421 [2022-01-31 22:31:15,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=282, Invalid=1974, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 22:31:15,222 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 254 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 209 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.9s IncrementalHoareTripleChecker+Time [2022-01-31 22:31:15,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 1080 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2794 Invalid, 18 Unknown, 0 Unchecked, 46.9s Time] [2022-01-31 22:31:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-01-31 22:31:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 371. [2022-01-31 22:31:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 296 states have (on average 1.2060810810810811) internal successors, (357), 300 states have internal predecessors, (357), 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 22:31:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 433 transitions. [2022-01-31 22:31:15,379 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 433 transitions. Word has length 118 [2022-01-31 22:31:15,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:31:15,379 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 433 transitions. [2022-01-31 22:31:15,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 20 states have internal predecessors, (88), 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 22:31:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 433 transitions. [2022-01-31 22:31:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-31 22:31:15,380 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:31:15,380 INFO L514 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:31:15,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 22:31:15,380 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:31:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:31:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1990456093, now seen corresponding path program 17 times [2022-01-31 22:31:15,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:31:15,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1210079047] [2022-01-31 22:31:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:31:15,382 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:31:15,382 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:31:15,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:31:15,400 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:31:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:15,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:31:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:15,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:31:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:31:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:15,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:31:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:15,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:31:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:15,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:31:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:31:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:16,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 22:31:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:16,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-31 22:31:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:16,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 22:31:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:16,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-31 22:31:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:16,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:31:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:16,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:31:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:16,422 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 22:31:16,422 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:31:16,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1210079047] [2022-01-31 22:31:16,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1210079047] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:31:16,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:31:16,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-31 22:31:16,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385769075] [2022-01-31 22:31:16,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:31:16,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 22:31:16,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:31:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 22:31:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2022-01-31 22:31:16,424 INFO L87 Difference]: Start difference. First operand 371 states and 433 transitions. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 21 states have internal predecessors, (89), 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 22:31:17,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:19,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:21,938 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 22:31:23,953 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 22:31:25,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:27,989 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:30,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:31,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:33,316 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 22:31:36,233 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 22:31:38,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:40,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:31:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:31:45,217 INFO L93 Difference]: Finished difference Result 709 states and 844 transitions. [2022-01-31 22:31:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 22:31:45,217 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 21 states have internal predecessors, (89), 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 119 [2022-01-31 22:31:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:31:45,218 INFO L225 Difference]: With dead ends: 709 [2022-01-31 22:31:45,218 INFO L226 Difference]: Without dead ends: 423 [2022-01-31 22:31:45,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=295, Invalid=2155, Unknown=0, NotChecked=0, Total=2450 [2022-01-31 22:31:45,220 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 271 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 187 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2022-01-31 22:31:45,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 736 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1961 Invalid, 10 Unknown, 0 Unchecked, 27.5s Time] [2022-01-31 22:31:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-01-31 22:31:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 373. [2022-01-31 22:31:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 298 states have (on average 1.2046979865771812) internal successors, (359), 302 states have internal predecessors, (359), 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 22:31:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 435 transitions. [2022-01-31 22:31:45,364 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 435 transitions. Word has length 119 [2022-01-31 22:31:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:31:45,365 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 435 transitions. [2022-01-31 22:31:45,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 21 states have internal predecessors, (89), 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 22:31:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 435 transitions. [2022-01-31 22:31:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-31 22:31:45,365 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:31:45,365 INFO L514 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:31:45,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 22:31:45,366 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:31:45,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:31:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash 464836753, now seen corresponding path program 18 times [2022-01-31 22:31:45,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:31:45,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [868407146] [2022-01-31 22:31:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:31:45,367 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:31:45,367 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:31:45,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:31:45,385 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:31:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:31:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:31:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:31:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:45,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:31:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:45,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:31:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:31:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:31:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:46,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 22:31:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:46,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 22:31:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:46,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-01-31 22:31:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-31 22:31:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:46,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:31:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:31:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:46,463 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 22:31:46,463 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:31:46,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [868407146] [2022-01-31 22:31:46,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [868407146] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:31:46,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:31:46,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-01-31 22:31:46,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136093767] [2022-01-31 22:31:46,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:31:46,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 22:31:46,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:31:46,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 22:31:46,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2022-01-31 22:31:46,464 INFO L87 Difference]: Start difference. First operand 373 states and 435 transitions. Second operand has 29 states, 29 states have (on average 3.103448275862069) internal successors, (90), 22 states have internal predecessors, (90), 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 22:31:48,536 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 22:31:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:31:53,644 INFO L93 Difference]: Finished difference Result 711 states and 846 transitions. [2022-01-31 22:31:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 22:31:53,659 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.103448275862069) internal successors, (90), 22 states have internal predecessors, (90), 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 120 [2022-01-31 22:31:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:31:53,661 INFO L225 Difference]: With dead ends: 711 [2022-01-31 22:31:53,661 INFO L226 Difference]: Without dead ends: 425 [2022-01-31 22:31:53,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=308, Invalid=2344, Unknown=0, NotChecked=0, Total=2652 [2022-01-31 22:31:53,669 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 213 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 135 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-01-31 22:31:53,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 642 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1834 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-01-31 22:31:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-01-31 22:31:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 375. [2022-01-31 22:31:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 300 states have (on average 1.2033333333333334) internal successors, (361), 304 states have internal predecessors, (361), 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 22:31:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 437 transitions. [2022-01-31 22:31:53,822 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 437 transitions. Word has length 120 [2022-01-31 22:31:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:31:53,822 INFO L470 AbstractCegarLoop]: Abstraction has 375 states and 437 transitions. [2022-01-31 22:31:53,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.103448275862069) internal successors, (90), 22 states have internal predecessors, (90), 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 22:31:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 437 transitions. [2022-01-31 22:31:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-31 22:31:53,823 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:31:53,823 INFO L514 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:31:53,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 22:31:53,823 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:31:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:31:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash 415277469, now seen corresponding path program 19 times [2022-01-31 22:31:53,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:31:53,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1844038179] [2022-01-31 22:31:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:31:53,824 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:31:53,825 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:31:53,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:31:53,845 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:31:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:31:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:31:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:31:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:31:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:31:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:31:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:31:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 22:31:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-31 22:31:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-01-31 22:31:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 22:31:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:54,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:31:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:31:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:31:55,007 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 22:31:55,008 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:31:55,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1844038179] [2022-01-31 22:31:55,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1844038179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:31:55,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:31:55,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-01-31 22:31:55,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313192861] [2022-01-31 22:31:55,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:31:55,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 22:31:55,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:31:55,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 22:31:55,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2022-01-31 22:31:55,009 INFO L87 Difference]: Start difference. First operand 375 states and 437 transitions. Second operand has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 23 states have internal predecessors, (91), 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 22:31:57,085 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 22:32:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:32:04,186 INFO L93 Difference]: Finished difference Result 713 states and 848 transitions. [2022-01-31 22:32:04,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 22:32:04,189 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 23 states have internal predecessors, (91), 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 121 [2022-01-31 22:32:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:32:04,190 INFO L225 Difference]: With dead ends: 713 [2022-01-31 22:32:04,190 INFO L226 Difference]: Without dead ends: 427 [2022-01-31 22:32:04,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=321, Invalid=2541, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 22:32:04,191 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 259 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 218 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-01-31 22:32:04,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 813 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2221 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2022-01-31 22:32:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-01-31 22:32:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 377. [2022-01-31 22:32:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 302 states have (on average 1.2019867549668874) internal successors, (363), 306 states have internal predecessors, (363), 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 22:32:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 439 transitions. [2022-01-31 22:32:04,347 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 439 transitions. Word has length 121 [2022-01-31 22:32:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:32:04,347 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 439 transitions. [2022-01-31 22:32:04,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 23 states have internal predecessors, (91), 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 22:32:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 439 transitions. [2022-01-31 22:32:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-31 22:32:04,348 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:32:04,348 INFO L514 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:04,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 22:32:04,348 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:32:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:32:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1121060335, now seen corresponding path program 20 times [2022-01-31 22:32:04,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:32:04,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1112692382] [2022-01-31 22:32:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:32:04,350 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:32:04,350 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:32:04,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:32:04,376 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:32:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:04,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:32:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:04,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:32:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:32:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:04,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:32:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:04,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:32:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 22:32:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 22:32:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:05,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-01-31 22:32:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-01-31 22:32:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:05,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:32:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:05,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:05,442 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 22:32:05,443 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:32:05,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1112692382] [2022-01-31 22:32:05,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1112692382] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:32:05,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:32:05,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-31 22:32:05,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809552309] [2022-01-31 22:32:05,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:32:05,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 22:32:05,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:32:05,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 22:32:05,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2022-01-31 22:32:05,444 INFO L87 Difference]: Start difference. First operand 377 states and 439 transitions. Second operand has 31 states, 31 states have (on average 2.967741935483871) internal successors, (92), 24 states have internal predecessors, (92), 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 22:32:07,525 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 22:32:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:32:11,557 INFO L93 Difference]: Finished difference Result 715 states and 850 transitions. [2022-01-31 22:32:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 22:32:11,557 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.967741935483871) internal successors, (92), 24 states have internal predecessors, (92), 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 122 [2022-01-31 22:32:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:32:11,559 INFO L225 Difference]: With dead ends: 715 [2022-01-31 22:32:11,559 INFO L226 Difference]: Without dead ends: 429 [2022-01-31 22:32:11,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=334, Invalid=2746, Unknown=0, NotChecked=0, Total=3080 [2022-01-31 22:32:11,560 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 258 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 221 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-31 22:32:11,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 419 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1177 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-01-31 22:32:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-01-31 22:32:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 379. [2022-01-31 22:32:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 304 states have (on average 1.200657894736842) internal successors, (365), 308 states have internal predecessors, (365), 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 22:32:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 441 transitions. [2022-01-31 22:32:11,741 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 441 transitions. Word has length 122 [2022-01-31 22:32:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:32:11,742 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 441 transitions. [2022-01-31 22:32:11,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.967741935483871) internal successors, (92), 24 states have internal predecessors, (92), 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 22:32:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 441 transitions. [2022-01-31 22:32:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-31 22:32:11,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:32:11,742 INFO L514 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:11,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 22:32:11,743 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:32:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:32:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1502892003, now seen corresponding path program 21 times [2022-01-31 22:32:11,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:32:11,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1616753946] [2022-01-31 22:32:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:32:11,744 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:32:11,744 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:32:11,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:32:11,768 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:32:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:32:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:32:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:32:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:32:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:32:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 22:32:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-31 22:32:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 22:32:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 22:32:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:32:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:12,935 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 22:32:12,935 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:32:12,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1616753946] [2022-01-31 22:32:12,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1616753946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:32:12,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:32:12,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-01-31 22:32:12,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303376819] [2022-01-31 22:32:12,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:32:12,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 22:32:12,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:32:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 22:32:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2022-01-31 22:32:12,937 INFO L87 Difference]: Start difference. First operand 379 states and 441 transitions. Second operand has 32 states, 32 states have (on average 2.90625) internal successors, (93), 25 states have internal predecessors, (93), 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 22:32:15,026 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 22:32:21,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:32:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:32:23,340 INFO L93 Difference]: Finished difference Result 717 states and 852 transitions. [2022-01-31 22:32:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-31 22:32:23,341 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 25 states have internal predecessors, (93), 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 123 [2022-01-31 22:32:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:32:23,342 INFO L225 Difference]: With dead ends: 717 [2022-01-31 22:32:23,342 INFO L226 Difference]: Without dead ends: 431 [2022-01-31 22:32:23,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=347, Invalid=2959, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 22:32:23,344 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 200 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 170 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 2588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-01-31 22:32:23,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 874 Invalid, 2588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2417 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2022-01-31 22:32:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-01-31 22:32:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 381. [2022-01-31 22:32:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 306 states have (on average 1.1993464052287581) internal successors, (367), 310 states have internal predecessors, (367), 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 22:32:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 443 transitions. [2022-01-31 22:32:23,504 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 443 transitions. Word has length 123 [2022-01-31 22:32:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:32:23,505 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 443 transitions. [2022-01-31 22:32:23,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 25 states have internal predecessors, (93), 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 22:32:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 443 transitions. [2022-01-31 22:32:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-31 22:32:23,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:32:23,505 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:23,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 22:32:23,506 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:32:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:32:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash -454771823, now seen corresponding path program 22 times [2022-01-31 22:32:23,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:32:23,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [6955135] [2022-01-31 22:32:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:32:23,507 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:32:23,507 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:32:23,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:32:23,537 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:32:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:32:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:32:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:32:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:32:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:32:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 22:32:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 22:32:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-31 22:32:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 22:32:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:32:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:24,964 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 22:32:24,964 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:32:24,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [6955135] [2022-01-31 22:32:24,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [6955135] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:32:24,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:32:24,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-01-31 22:32:24,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899673879] [2022-01-31 22:32:24,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:32:24,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 22:32:24,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:32:24,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 22:32:24,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 22:32:24,966 INFO L87 Difference]: Start difference. First operand 381 states and 443 transitions. Second operand has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 26 states have internal predecessors, (94), 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 22:32:27,060 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 22:32:30,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:32:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:32:36,679 INFO L93 Difference]: Finished difference Result 719 states and 854 transitions. [2022-01-31 22:32:36,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 22:32:36,679 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 26 states have internal predecessors, (94), 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 124 [2022-01-31 22:32:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:32:36,680 INFO L225 Difference]: With dead ends: 719 [2022-01-31 22:32:36,681 INFO L226 Difference]: Without dead ends: 433 [2022-01-31 22:32:36,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=360, Invalid=3180, Unknown=0, NotChecked=0, Total=3540 [2022-01-31 22:32:36,682 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 143 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 116 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-01-31 22:32:36,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 860 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2584 Invalid, 1 Unknown, 0 Unchecked, 10.1s Time] [2022-01-31 22:32:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-01-31 22:32:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 383. [2022-01-31 22:32:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 308 states have (on average 1.198051948051948) internal successors, (369), 312 states have internal predecessors, (369), 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 22:32:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 445 transitions. [2022-01-31 22:32:36,853 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 445 transitions. Word has length 124 [2022-01-31 22:32:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:32:36,853 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 445 transitions. [2022-01-31 22:32:36,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 26 states have internal predecessors, (94), 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 22:32:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 445 transitions. [2022-01-31 22:32:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-31 22:32:36,853 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:32:36,854 INFO L514 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:36,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 22:32:36,854 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:32:36,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:32:36,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1972182685, now seen corresponding path program 23 times [2022-01-31 22:32:36,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:32:36,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [256676622] [2022-01-31 22:32:36,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:32:36,855 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:32:36,855 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:32:36,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:32:36,880 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:32:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:32:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:37,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:32:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:37,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:32:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:37,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:32:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:37,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:32:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:38,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 22:32:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-31 22:32:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 22:32:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:38,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 22:32:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:38,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:32:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:38,138 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 22:32:38,138 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:32:38,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [256676622] [2022-01-31 22:32:38,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [256676622] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:32:38,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:32:38,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-31 22:32:38,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921077121] [2022-01-31 22:32:38,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:32:38,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 22:32:38,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:32:38,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 22:32:38,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 22:32:38,139 INFO L87 Difference]: Start difference. First operand 383 states and 445 transitions. Second operand has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 27 states have internal predecessors, (95), 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 22:32:40,223 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 22:32:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:32:45,359 INFO L93 Difference]: Finished difference Result 721 states and 856 transitions. [2022-01-31 22:32:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 22:32:45,359 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 27 states have internal predecessors, (95), 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 125 [2022-01-31 22:32:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:32:45,361 INFO L225 Difference]: With dead ends: 721 [2022-01-31 22:32:45,361 INFO L226 Difference]: Without dead ends: 435 [2022-01-31 22:32:45,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=373, Invalid=3409, Unknown=0, NotChecked=0, Total=3782 [2022-01-31 22:32:45,361 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 200 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 176 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:32:45,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 592 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1759 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-01-31 22:32:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-01-31 22:32:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 385. [2022-01-31 22:32:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 310 states have (on average 1.196774193548387) internal successors, (371), 314 states have internal predecessors, (371), 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 22:32:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 447 transitions. [2022-01-31 22:32:45,571 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 447 transitions. Word has length 125 [2022-01-31 22:32:45,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:32:45,571 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 447 transitions. [2022-01-31 22:32:45,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 27 states have internal predecessors, (95), 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 22:32:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 447 transitions. [2022-01-31 22:32:45,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-31 22:32:45,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:32:45,572 INFO L514 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:45,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 22:32:45,573 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:32:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:32:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash -101638895, now seen corresponding path program 24 times [2022-01-31 22:32:45,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:32:45,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1011002751] [2022-01-31 22:32:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:32:45,581 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:32:45,582 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:32:45,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:32:45,608 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:32:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:32:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:45,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:32:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:32:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:45,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:45,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:32:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:46,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:46,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:32:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:46,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 22:32:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:46,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-31 22:32:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:46,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 22:32:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 22:32:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:32:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:46,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:32:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:32:46,919 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 22:32:46,919 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:32:46,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1011002751] [2022-01-31 22:32:46,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1011002751] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:32:46,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:32:46,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-01-31 22:32:46,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072032418] [2022-01-31 22:32:46,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:32:46,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 22:32:46,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:32:46,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 22:32:46,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 22:32:46,920 INFO L87 Difference]: Start difference. First operand 385 states and 447 transitions. Second operand has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 28 states have internal predecessors, (96), 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 22:32:49,019 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 22:32:55,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:32:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:32:59,622 INFO L93 Difference]: Finished difference Result 723 states and 858 transitions. [2022-01-31 22:32:59,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 22:32:59,623 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 28 states have internal predecessors, (96), 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 126 [2022-01-31 22:32:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:32:59,624 INFO L225 Difference]: With dead ends: 723 [2022-01-31 22:32:59,624 INFO L226 Difference]: Without dead ends: 437 [2022-01-31 22:32:59,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=386, Invalid=3646, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 22:32:59,625 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 212 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 4044 mSolverCounterSat, 147 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 4192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 4044 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-01-31 22:32:59,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 1376 Invalid, 4192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 4044 Invalid, 1 Unknown, 0 Unchecked, 10.8s Time] [2022-01-31 22:32:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-01-31 22:32:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 387. [2022-01-31 22:32:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 312 states have (on average 1.1955128205128205) internal successors, (373), 316 states have internal predecessors, (373), 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 22:32:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 449 transitions. [2022-01-31 22:32:59,796 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 449 transitions. Word has length 126 [2022-01-31 22:32:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:32:59,796 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 449 transitions. [2022-01-31 22:32:59,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 28 states have internal predecessors, (96), 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 22:32:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 449 transitions. [2022-01-31 22:32:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-01-31 22:32:59,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:32:59,797 INFO L514 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:59,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 22:32:59,797 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:32:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:32:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash 34401565, now seen corresponding path program 25 times [2022-01-31 22:32:59,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:32:59,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607659752] [2022-01-31 22:32:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:32:59,799 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:32:59,799 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:32:59,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:32:59,823 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:33:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:00,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:33:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:33:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:33:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:00,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:33:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:00,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:33:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:33:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:00,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:33:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:01,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-31 22:33:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 22:33:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-31 22:33:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:01,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-31 22:33:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:01,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:33:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:01,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:33:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:01,137 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 22:33:01,137 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:33:01,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1607659752] [2022-01-31 22:33:01,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1607659752] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:33:01,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:33:01,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-01-31 22:33:01,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593880218] [2022-01-31 22:33:01,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:33:01,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 22:33:01,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:33:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 22:33:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 22:33:01,138 INFO L87 Difference]: Start difference. First operand 387 states and 449 transitions. Second operand has 36 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 29 states have internal predecessors, (97), 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 22:33:02,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:04,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:06,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:08,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:10,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:12,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:14,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:16,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:18,968 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 22:33:21,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:23,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:25,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:28,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:30,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:32,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:34,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:36,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:33:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:33:43,777 INFO L93 Difference]: Finished difference Result 725 states and 860 transitions. [2022-01-31 22:33:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 22:33:43,778 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 29 states have internal predecessors, (97), 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 127 [2022-01-31 22:33:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:33:43,781 INFO L225 Difference]: With dead ends: 725 [2022-01-31 22:33:43,781 INFO L226 Difference]: Without dead ends: 439 [2022-01-31 22:33:43,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=399, Invalid=3891, Unknown=0, NotChecked=0, Total=4290 [2022-01-31 22:33:43,782 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 201 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 3021 mSolverCounterSat, 184 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 3221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 3021 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.6s IncrementalHoareTripleChecker+Time [2022-01-31 22:33:43,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1001 Invalid, 3221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 3021 Invalid, 16 Unknown, 0 Unchecked, 40.6s Time] [2022-01-31 22:33:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-01-31 22:33:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 389. [2022-01-31 22:33:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 314 states have (on average 1.194267515923567) internal successors, (375), 318 states have internal predecessors, (375), 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 22:33:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 451 transitions. [2022-01-31 22:33:43,972 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 451 transitions. Word has length 127 [2022-01-31 22:33:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:33:43,972 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 451 transitions. [2022-01-31 22:33:43,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 29 states have internal predecessors, (97), 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 22:33:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 451 transitions. [2022-01-31 22:33:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-31 22:33:43,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:33:43,973 INFO L514 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:43,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 22:33:43,973 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:33:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:33:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash -43311471, now seen corresponding path program 26 times [2022-01-31 22:33:43,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:33:43,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219250332] [2022-01-31 22:33:43,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:33:43,988 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:33:43,988 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:33:43,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:33:44,022 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:33:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:33:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:44,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:33:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:44,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:33:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:33:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:33:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:33:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:33:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:45,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 22:33:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:45,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 22:33:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-31 22:33:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:45,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-31 22:33:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:45,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:33:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:45,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:33:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:45,476 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 22:33:45,476 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:33:45,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219250332] [2022-01-31 22:33:45,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [219250332] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:33:45,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:33:45,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-01-31 22:33:45,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372779390] [2022-01-31 22:33:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:33:45,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-31 22:33:45,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:33:45,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-31 22:33:45,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 22:33:45,478 INFO L87 Difference]: Start difference. First operand 389 states and 451 transitions. Second operand has 37 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 30 states have internal predecessors, (98), 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 22:33:47,585 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 22:33:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:33:54,945 INFO L93 Difference]: Finished difference Result 727 states and 862 transitions. [2022-01-31 22:33:54,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 22:33:54,946 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 30 states have internal predecessors, (98), 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 128 [2022-01-31 22:33:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:33:54,947 INFO L225 Difference]: With dead ends: 727 [2022-01-31 22:33:54,947 INFO L226 Difference]: Without dead ends: 441 [2022-01-31 22:33:54,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=412, Invalid=4144, Unknown=0, NotChecked=0, Total=4556 [2022-01-31 22:33:54,948 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 270 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 3563 mSolverCounterSat, 211 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 3775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 3563 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-01-31 22:33:54,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 1188 Invalid, 3775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 3563 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-01-31 22:33:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-01-31 22:33:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 391. [2022-01-31 22:33:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 316 states have (on average 1.1930379746835442) internal successors, (377), 320 states have internal predecessors, (377), 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 22:33:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 453 transitions. [2022-01-31 22:33:55,125 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 453 transitions. Word has length 128 [2022-01-31 22:33:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:33:55,125 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 453 transitions. [2022-01-31 22:33:55,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 30 states have internal predecessors, (98), 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 22:33:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 453 transitions. [2022-01-31 22:33:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-31 22:33:55,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:33:55,126 INFO L514 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:55,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 22:33:55,126 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:33:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:33:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1842551709, now seen corresponding path program 27 times [2022-01-31 22:33:55,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:33:55,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1790926649] [2022-01-31 22:33:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:33:55,128 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:33:55,128 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:33:55,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:33:55,154 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:33:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:55,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:33:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:33:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:55,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:33:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:55,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:33:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:55,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:33:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:33:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:33:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:56,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 22:33:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-31 22:33:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:56,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-31 22:33:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 22:33:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:56,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:33:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:56,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:33:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:33:56,578 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 22:33:56,578 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:33:56,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1790926649] [2022-01-31 22:33:56,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1790926649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:33:56,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:33:56,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-01-31 22:33:56,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891722060] [2022-01-31 22:33:56,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:33:56,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 22:33:56,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:33:56,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 22:33:56,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1296, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 22:33:56,579 INFO L87 Difference]: Start difference. First operand 391 states and 453 transitions. Second operand has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 31 states have internal predecessors, (99), 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 22:33:58,681 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 22:34:05,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:34:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:34:09,549 INFO L93 Difference]: Finished difference Result 729 states and 864 transitions. [2022-01-31 22:34:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 22:34:09,550 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 31 states have internal predecessors, (99), 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 129 [2022-01-31 22:34:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:34:09,551 INFO L225 Difference]: With dead ends: 729 [2022-01-31 22:34:09,551 INFO L226 Difference]: Without dead ends: 443 [2022-01-31 22:34:09,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=425, Invalid=4405, Unknown=0, NotChecked=0, Total=4830 [2022-01-31 22:34:09,552 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 266 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 3526 mSolverCounterSat, 214 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 3526 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-01-31 22:34:09,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 1144 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 3526 Invalid, 1 Unknown, 0 Unchecked, 10.9s Time] [2022-01-31 22:34:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-01-31 22:34:09,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 393. [2022-01-31 22:34:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 318 states have (on average 1.1918238993710693) internal successors, (379), 322 states have internal predecessors, (379), 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 22:34:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 455 transitions. [2022-01-31 22:34:09,735 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 455 transitions. Word has length 129 [2022-01-31 22:34:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:34:09,736 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 455 transitions. [2022-01-31 22:34:09,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 31 states have internal predecessors, (99), 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 22:34:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 455 transitions. [2022-01-31 22:34:09,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-31 22:34:09,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:34:09,736 INFO L514 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:09,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 22:34:09,737 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:34:09,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:34:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash 174768145, now seen corresponding path program 28 times [2022-01-31 22:34:09,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:34:09,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1247459832] [2022-01-31 22:34:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:34:09,738 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:34:09,738 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:34:09,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:34:09,765 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:34:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:34:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:34:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:10,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:34:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:10,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:34:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:10,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:10,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:34:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:11,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 22:34:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:11,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-01-31 22:34:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:11,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-31 22:34:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:11,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-31 22:34:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:11,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:34:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:11,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:11,505 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 22:34:11,505 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:34:11,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1247459832] [2022-01-31 22:34:11,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1247459832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:34:11,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:34:11,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-01-31 22:34:11,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974739424] [2022-01-31 22:34:11,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:34:11,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-31 22:34:11,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:34:11,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-31 22:34:11,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 22:34:11,506 INFO L87 Difference]: Start difference. First operand 393 states and 455 transitions. Second operand has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 32 states have internal predecessors, (100), 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 22:34:13,623 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 22:34:23,034 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 22:34:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:34:26,937 INFO L93 Difference]: Finished difference Result 731 states and 866 transitions. [2022-01-31 22:34:26,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 22:34:26,938 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 32 states have internal predecessors, (100), 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 130 [2022-01-31 22:34:26,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:34:26,939 INFO L225 Difference]: With dead ends: 731 [2022-01-31 22:34:26,939 INFO L226 Difference]: Without dead ends: 445 [2022-01-31 22:34:26,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=438, Invalid=4674, Unknown=0, NotChecked=0, Total=5112 [2022-01-31 22:34:26,955 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 142 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 4586 mSolverCounterSat, 128 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 4715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 4586 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-01-31 22:34:26,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 1500 Invalid, 4715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 4586 Invalid, 1 Unknown, 0 Unchecked, 13.1s Time] [2022-01-31 22:34:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-01-31 22:34:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 395. [2022-01-31 22:34:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 320 states have (on average 1.190625) internal successors, (381), 324 states have internal predecessors, (381), 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 22:34:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 457 transitions. [2022-01-31 22:34:27,185 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 457 transitions. Word has length 130 [2022-01-31 22:34:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:34:27,185 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 457 transitions. [2022-01-31 22:34:27,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 32 states have internal predecessors, (100), 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 22:34:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 457 transitions. [2022-01-31 22:34:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-31 22:34:27,186 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:34:27,186 INFO L514 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:27,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 22:34:27,186 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:34:27,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:34:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash 13085213, now seen corresponding path program 29 times [2022-01-31 22:34:27,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:34:27,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1266721387] [2022-01-31 22:34:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:34:27,189 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:34:27,189 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:34:27,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:34:27,215 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:34:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:27,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:34:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:27,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:34:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:34:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:27,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:34:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:27,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:27,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:34:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:28,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 22:34:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-31 22:34:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 22:34:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 22:34:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:34:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:28,823 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 22:34:28,823 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:34:28,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1266721387] [2022-01-31 22:34:28,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1266721387] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:34:28,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:34:28,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-01-31 22:34:28,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669127707] [2022-01-31 22:34:28,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:34:28,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-31 22:34:28,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:34:28,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-31 22:34:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1444, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 22:34:28,824 INFO L87 Difference]: Start difference. First operand 395 states and 457 transitions. Second operand has 40 states, 40 states have (on average 2.525) internal successors, (101), 33 states have internal predecessors, (101), 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 22:34:30,910 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 22:34:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:34:37,316 INFO L93 Difference]: Finished difference Result 733 states and 868 transitions. [2022-01-31 22:34:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 22:34:37,316 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 33 states have internal predecessors, (101), 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 131 [2022-01-31 22:34:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:34:37,317 INFO L225 Difference]: With dead ends: 733 [2022-01-31 22:34:37,317 INFO L226 Difference]: Without dead ends: 447 [2022-01-31 22:34:37,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=451, Invalid=4951, Unknown=0, NotChecked=0, Total=5402 [2022-01-31 22:34:37,318 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 213 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 159 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:34:37,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 580 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2207 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-01-31 22:34:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-01-31 22:34:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 397. [2022-01-31 22:34:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 322 states have (on average 1.18944099378882) internal successors, (383), 326 states have internal predecessors, (383), 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 22:34:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 459 transitions. [2022-01-31 22:34:37,504 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 459 transitions. Word has length 131 [2022-01-31 22:34:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:34:37,505 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 459 transitions. [2022-01-31 22:34:37,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 33 states have internal predecessors, (101), 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 22:34:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 459 transitions. [2022-01-31 22:34:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-31 22:34:37,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:34:37,505 INFO L514 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:37,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 22:34:37,506 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:34:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:34:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash -704118383, now seen corresponding path program 30 times [2022-01-31 22:34:37,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:34:37,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1338153544] [2022-01-31 22:34:37,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:34:37,507 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:34:37,507 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:34:37,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:34:37,537 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:34:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:34:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:37,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:34:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:37,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:34:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:38,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:38,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:34:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:38,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:38,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:34:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 22:34:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 22:34:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:39,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-01-31 22:34:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-31 22:34:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:34:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:39,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:39,191 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 22:34:39,191 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:34:39,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1338153544] [2022-01-31 22:34:39,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1338153544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:34:39,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:34:39,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-01-31 22:34:39,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711530148] [2022-01-31 22:34:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:34:39,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-31 22:34:39,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:34:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-31 22:34:39,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 22:34:39,192 INFO L87 Difference]: Start difference. First operand 397 states and 459 transitions. Second operand has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 34 states have internal predecessors, (102), 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 22:34:41,272 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 22:34:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:34:53,025 INFO L93 Difference]: Finished difference Result 735 states and 870 transitions. [2022-01-31 22:34:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 22:34:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 34 states have internal predecessors, (102), 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 132 [2022-01-31 22:34:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:34:53,027 INFO L225 Difference]: With dead ends: 735 [2022-01-31 22:34:53,027 INFO L226 Difference]: Without dead ends: 449 [2022-01-31 22:34:53,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=464, Invalid=5236, Unknown=0, NotChecked=0, Total=5700 [2022-01-31 22:34:53,033 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 259 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 3823 mSolverCounterSat, 262 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 3823 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-01-31 22:34:53,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 1189 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 3823 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2022-01-31 22:34:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-01-31 22:34:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 399. [2022-01-31 22:34:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 324 states have (on average 1.1882716049382716) internal successors, (385), 328 states have internal predecessors, (385), 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 22:34:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 461 transitions. [2022-01-31 22:34:53,244 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 461 transitions. Word has length 132 [2022-01-31 22:34:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:34:53,244 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 461 transitions. [2022-01-31 22:34:53,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 34 states have internal predecessors, (102), 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 22:34:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 461 transitions. [2022-01-31 22:34:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-31 22:34:53,245 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:34:53,245 INFO L514 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:53,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 22:34:53,245 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:34:53,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:34:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1462593379, now seen corresponding path program 31 times [2022-01-31 22:34:53,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:34:53,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1270123573] [2022-01-31 22:34:53,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:34:53,246 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:34:53,246 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:34:53,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:34:53,287 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:34:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:34:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:34:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:53,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:34:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:53,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:34:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:54,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:54,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:34:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 22:34:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:55,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-01-31 22:34:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 22:34:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 22:34:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:55,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:34:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:34:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:34:55,175 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 22:34:55,175 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:34:55,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1270123573] [2022-01-31 22:34:55,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1270123573] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:34:55,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:34:55,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-01-31 22:34:55,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503827795] [2022-01-31 22:34:55,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:34:55,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 22:34:55,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:34:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 22:34:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1600, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 22:34:55,176 INFO L87 Difference]: Start difference. First operand 399 states and 461 transitions. Second operand has 42 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 35 states have internal predecessors, (103), 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 22:34:57,266 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 22:35:07,929 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 22:35:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:35:11,082 INFO L93 Difference]: Finished difference Result 737 states and 872 transitions. [2022-01-31 22:35:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 22:35:11,082 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 35 states have internal predecessors, (103), 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 133 [2022-01-31 22:35:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:35:11,084 INFO L225 Difference]: With dead ends: 737 [2022-01-31 22:35:11,084 INFO L226 Difference]: Without dead ends: 451 [2022-01-31 22:35:11,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=477, Invalid=5529, Unknown=0, NotChecked=0, Total=6006 [2022-01-31 22:35:11,088 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 142 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 4904 mSolverCounterSat, 134 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 5039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 4904 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:35:11,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 1547 Invalid, 5039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 4904 Invalid, 1 Unknown, 0 Unchecked, 13.4s Time] [2022-01-31 22:35:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-01-31 22:35:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 401. [2022-01-31 22:35:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 326 states have (on average 1.187116564417178) internal successors, (387), 330 states have internal predecessors, (387), 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 22:35:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 463 transitions. [2022-01-31 22:35:11,298 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 463 transitions. Word has length 133 [2022-01-31 22:35:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:35:11,298 INFO L470 AbstractCegarLoop]: Abstraction has 401 states and 463 transitions. [2022-01-31 22:35:11,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 35 states have internal predecessors, (103), 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 22:35:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 463 transitions. [2022-01-31 22:35:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-31 22:35:11,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:35:11,299 INFO L514 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:35:11,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 22:35:11,300 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:35:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:35:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash 794485521, now seen corresponding path program 32 times [2022-01-31 22:35:11,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:35:11,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2390271] [2022-01-31 22:35:11,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:35:11,302 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:35:11,302 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:35:11,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:35:11,335 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:35:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:11,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:35:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:35:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:35:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:11,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:35:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:35:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:11,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:35:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:11,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:35:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:13,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 22:35:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:13,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-01-31 22:35:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:13,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-31 22:35:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:13,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-01-31 22:35:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:13,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:35:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:13,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:35:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:13,135 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 22:35:13,136 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:35:13,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2390271] [2022-01-31 22:35:13,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2390271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:35:13,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:35:13,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-01-31 22:35:13,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111753827] [2022-01-31 22:35:13,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:35:13,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-31 22:35:13,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:35:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-31 22:35:13,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1681, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 22:35:13,137 INFO L87 Difference]: Start difference. First operand 401 states and 463 transitions. Second operand has 43 states, 43 states have (on average 2.4186046511627906) internal successors, (104), 36 states have internal predecessors, (104), 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 22:35:15,254 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 22:35:27,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:35:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:35:33,254 INFO L93 Difference]: Finished difference Result 739 states and 874 transitions. [2022-01-31 22:35:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-31 22:35:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.4186046511627906) internal successors, (104), 36 states have internal predecessors, (104), 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 134 [2022-01-31 22:35:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:35:33,256 INFO L225 Difference]: With dead ends: 739 [2022-01-31 22:35:33,256 INFO L226 Difference]: Without dead ends: 453 [2022-01-31 22:35:33,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=490, Invalid=5830, Unknown=0, NotChecked=0, Total=6320 [2022-01-31 22:35:33,257 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 196 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 5539 mSolverCounterSat, 203 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 5743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 5539 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-01-31 22:35:33,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 1785 Invalid, 5743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 5539 Invalid, 1 Unknown, 0 Unchecked, 17.5s Time] [2022-01-31 22:35:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-01-31 22:35:33,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 403. [2022-01-31 22:35:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 328 states have (on average 1.1859756097560976) internal successors, (389), 332 states have internal predecessors, (389), 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 22:35:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 465 transitions. [2022-01-31 22:35:33,454 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 465 transitions. Word has length 134 [2022-01-31 22:35:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:35:33,454 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 465 transitions. [2022-01-31 22:35:33,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.4186046511627906) internal successors, (104), 36 states have internal predecessors, (104), 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 22:35:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 465 transitions. [2022-01-31 22:35:33,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-31 22:35:33,455 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:35:33,455 INFO L514 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:35:33,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 22:35:33,455 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:35:33,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:35:33,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2044454685, now seen corresponding path program 33 times [2022-01-31 22:35:33,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:35:33,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [586722601] [2022-01-31 22:35:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:35:33,456 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:35:33,456 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:35:33,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:35:33,488 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:35:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:33,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:35:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:33,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:35:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:33,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:35:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:35:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:33,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:35:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:33,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:35:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:35:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:35,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 22:35:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-01-31 22:35:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:35,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 22:35:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:35,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-31 22:35:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:35:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:35:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:35,289 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 22:35:35,289 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:35:35,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [586722601] [2022-01-31 22:35:35,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [586722601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:35:35,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:35:35,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-01-31 22:35:35,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697253774] [2022-01-31 22:35:35,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:35:35,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-31 22:35:35,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:35:35,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-31 22:35:35,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1764, Unknown=0, NotChecked=0, Total=1892 [2022-01-31 22:35:35,290 INFO L87 Difference]: Start difference. First operand 403 states and 465 transitions. Second operand has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 37 states have internal predecessors, (105), 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 22:35:37,376 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 22:35:46,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:35:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:35:50,292 INFO L93 Difference]: Finished difference Result 741 states and 876 transitions. [2022-01-31 22:35:50,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-31 22:35:50,292 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 37 states have internal predecessors, (105), 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 135 [2022-01-31 22:35:50,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:35:50,294 INFO L225 Difference]: With dead ends: 741 [2022-01-31 22:35:50,294 INFO L226 Difference]: Without dead ends: 455 [2022-01-31 22:35:50,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=503, Invalid=6139, Unknown=0, NotChecked=0, Total=6642 [2022-01-31 22:35:50,294 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 258 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 5333 mSolverCounterSat, 273 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 5607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 5333 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:35:50,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 1688 Invalid, 5607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 5333 Invalid, 1 Unknown, 0 Unchecked, 12.4s Time] [2022-01-31 22:35:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-01-31 22:35:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 405. [2022-01-31 22:35:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 330 states have (on average 1.1848484848484848) internal successors, (391), 334 states have internal predecessors, (391), 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 22:35:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 467 transitions. [2022-01-31 22:35:50,500 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 467 transitions. Word has length 135 [2022-01-31 22:35:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:35:50,501 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 467 transitions. [2022-01-31 22:35:50,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 37 states have internal predecessors, (105), 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 22:35:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 467 transitions. [2022-01-31 22:35:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-01-31 22:35:50,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:35:50,503 INFO L514 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:35:50,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 22:35:50,503 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:35:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:35:50,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2138793105, now seen corresponding path program 34 times [2022-01-31 22:35:50,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:35:50,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1577179732] [2022-01-31 22:35:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:35:50,504 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:35:50,509 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:35:50,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:35:50,549 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:35:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:35:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:51,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:35:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:35:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:51,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:35:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:51,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:35:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:51,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:35:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:35:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 22:35:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 22:35:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:52,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 22:35:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:52,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 22:35:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:52,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:35:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:35:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:35:52,577 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 22:35:52,578 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:35:52,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1577179732] [2022-01-31 22:35:52,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1577179732] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:35:52,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:35:52,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-01-31 22:35:52,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218669402] [2022-01-31 22:35:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:35:52,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-31 22:35:52,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:35:52,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-31 22:35:52,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1849, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 22:35:52,579 INFO L87 Difference]: Start difference. First operand 405 states and 467 transitions. Second operand has 45 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 38 states have internal predecessors, (106), 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 22:35:54,715 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 22:36:06,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:36:11,149 INFO L93 Difference]: Finished difference Result 743 states and 878 transitions. [2022-01-31 22:36:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-31 22:36:11,150 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 38 states have internal predecessors, (106), 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 136 [2022-01-31 22:36:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:36:11,151 INFO L225 Difference]: With dead ends: 743 [2022-01-31 22:36:11,151 INFO L226 Difference]: Without dead ends: 457 [2022-01-31 22:36:11,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=516, Invalid=6456, Unknown=0, NotChecked=0, Total=6972 [2022-01-31 22:36:11,152 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 200 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 6035 mSolverCounterSat, 209 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 6245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 6035 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-01-31 22:36:11,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 1923 Invalid, 6245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 6035 Invalid, 1 Unknown, 0 Unchecked, 15.8s Time] [2022-01-31 22:36:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-01-31 22:36:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 407. [2022-01-31 22:36:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 332 states have (on average 1.1837349397590362) internal successors, (393), 336 states have internal predecessors, (393), 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 22:36:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 469 transitions. [2022-01-31 22:36:11,375 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 469 transitions. Word has length 136 [2022-01-31 22:36:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:36:11,375 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 469 transitions. [2022-01-31 22:36:11,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 38 states have internal predecessors, (106), 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 22:36:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 469 transitions. [2022-01-31 22:36:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-31 22:36:11,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:36:11,376 INFO L514 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:11,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 22:36:11,376 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:36:11,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:36:11,377 INFO L85 PathProgramCache]: Analyzing trace with hash 768316829, now seen corresponding path program 35 times [2022-01-31 22:36:11,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:36:11,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [169173669] [2022-01-31 22:36:11,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:36:11,378 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:36:11,378 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:36:11,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:36:11,412 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:36:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:36:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:36:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:36:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:11,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:36:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:36:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:36:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:36:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-31 22:36:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:13,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-31 22:36:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-31 22:36:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-31 22:36:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:13,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:36:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:13,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:36:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:36:13,298 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 22:36:13,298 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:36:13,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [169173669] [2022-01-31 22:36:13,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [169173669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:36:13,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:36:13,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-01-31 22:36:13,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329418594] [2022-01-31 22:36:13,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:36:13,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-31 22:36:13,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:36:13,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-31 22:36:13,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1936, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 22:36:13,299 INFO L87 Difference]: Start difference. First operand 407 states and 469 transitions. Second operand has 46 states, 46 states have (on average 2.3260869565217392) internal successors, (107), 39 states have internal predecessors, (107), 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 22:36:16,342 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 22:36:18,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:20,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:22,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:24,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:26,439 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:28,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:30,475 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 22:36:32,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:34,521 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 22:36:36,542 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:38,558 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 22:36:40,578 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 22:36:42,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:44,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:46,637 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:48,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:50,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:52,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:54,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:56,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:36:58,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:00,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:02,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:04,316 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 22:37:06,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:07,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:09,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:11,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:13,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:37:26,083 INFO L93 Difference]: Finished difference Result 745 states and 880 transitions. [2022-01-31 22:37:26,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 22:37:26,083 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.3260869565217392) internal successors, (107), 39 states have internal predecessors, (107), 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 137 [2022-01-31 22:37:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:37:26,084 INFO L225 Difference]: With dead ends: 745 [2022-01-31 22:37:26,084 INFO L226 Difference]: Without dead ends: 459 [2022-01-31 22:37:26,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=529, Invalid=6781, Unknown=0, NotChecked=0, Total=7310 [2022-01-31 22:37:26,085 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 258 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 5034 mSolverCounterSat, 286 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 5348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 5034 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.1s IncrementalHoareTripleChecker+Time [2022-01-31 22:37:26,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 1532 Invalid, 5348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 5034 Invalid, 28 Unknown, 0 Unchecked, 70.1s Time] [2022-01-31 22:37:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-01-31 22:37:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 409. [2022-01-31 22:37:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 334 states have (on average 1.1826347305389222) internal successors, (395), 338 states have internal predecessors, (395), 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 22:37:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 471 transitions. [2022-01-31 22:37:26,308 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 471 transitions. Word has length 137 [2022-01-31 22:37:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:37:26,308 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 471 transitions. [2022-01-31 22:37:26,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.3260869565217392) internal successors, (107), 39 states have internal predecessors, (107), 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 22:37:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 471 transitions. [2022-01-31 22:37:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-31 22:37:26,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:37:26,309 INFO L514 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:26,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 22:37:26,309 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:37:26,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:37:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1233225233, now seen corresponding path program 36 times [2022-01-31 22:37:26,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:37:26,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [535528958] [2022-01-31 22:37:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:37:26,310 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:37:26,310 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:37:26,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:37:26,341 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:37:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:37:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:26,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:37:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:37:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:26,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:37:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:26,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:37:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:26,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:37:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:26,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:37:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:27,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 22:37:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:28,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 22:37:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-31 22:37:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:28,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-01-31 22:37:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:28,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:37:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:28,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:37:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:37:28,108 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 22:37:28,108 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:37:28,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [535528958] [2022-01-31 22:37:28,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [535528958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:37:28,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:37:28,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-01-31 22:37:28,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888366166] [2022-01-31 22:37:28,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:37:28,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-31 22:37:28,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:37:28,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-31 22:37:28,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2025, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 22:37:28,110 INFO L87 Difference]: Start difference. First operand 409 states and 471 transitions. Second operand has 47 states, 47 states have (on average 2.297872340425532) internal successors, (108), 40 states have internal predecessors, (108), 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 22:37:29,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:31,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:33,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:35,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:37,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:39,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:41,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:43,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:45,633 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 22:37:47,656 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:49,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:51,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:53,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:55,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:37:57,745 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 22:37:59,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:01,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:03,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:05,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:07,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:09,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:11,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:13,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:15,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:17,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:19,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:38:29,000 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 22:38:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:38:30,984 INFO L93 Difference]: Finished difference Result 747 states and 882 transitions. [2022-01-31 22:38:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 22:38:30,985 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.297872340425532) internal successors, (108), 40 states have internal predecessors, (108), 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 138 [2022-01-31 22:38:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:38:30,986 INFO L225 Difference]: With dead ends: 747 [2022-01-31 22:38:30,986 INFO L226 Difference]: Without dead ends: 461 [2022-01-31 22:38:30,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=542, Invalid=7114, Unknown=0, NotChecked=0, Total=7656 [2022-01-31 22:38:30,987 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 201 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 4515 mSolverCounterSat, 217 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 4756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 4515 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.9s IncrementalHoareTripleChecker+Time [2022-01-31 22:38:30,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1283 Invalid, 4756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 4515 Invalid, 24 Unknown, 0 Unchecked, 59.9s Time] [2022-01-31 22:38:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-01-31 22:38:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 411. [2022-01-31 22:38:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 336 states have (on average 1.181547619047619) internal successors, (397), 340 states have internal predecessors, (397), 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 22:38:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 473 transitions. [2022-01-31 22:38:31,223 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 473 transitions. Word has length 138 [2022-01-31 22:38:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:38:31,223 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 473 transitions. [2022-01-31 22:38:31,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.297872340425532) internal successors, (108), 40 states have internal predecessors, (108), 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 22:38:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 473 transitions. [2022-01-31 22:38:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-31 22:38:31,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:38:31,224 INFO L514 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:31,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 22:38:31,225 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:38:31,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:38:31,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1534483427, now seen corresponding path program 37 times [2022-01-31 22:38:31,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:38:31,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297779801] [2022-01-31 22:38:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:38:31,227 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:38:31,228 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:38:31,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:38:31,273 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:38:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:38:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:31,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:38:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:31,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:38:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:38:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:31,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:38:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:38:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:38:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:33,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-31 22:38:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:33,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 22:38:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 22:38:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:33,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 22:38:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:33,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:38:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:38:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:33,313 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 22:38:33,313 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:38:33,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297779801] [2022-01-31 22:38:33,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [297779801] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:38:33,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:38:33,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-31 22:38:33,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686129400] [2022-01-31 22:38:33,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:38:33,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 22:38:33,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:38:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 22:38:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2116, Unknown=0, NotChecked=0, Total=2256 [2022-01-31 22:38:33,314 INFO L87 Difference]: Start difference. First operand 411 states and 473 transitions. Second operand has 48 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 41 states have internal predecessors, (109), 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 22:38:35,428 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 22:38:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:38:49,369 INFO L93 Difference]: Finished difference Result 749 states and 884 transitions. [2022-01-31 22:38:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 22:38:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 41 states have internal predecessors, (109), 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 139 [2022-01-31 22:38:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:38:49,370 INFO L225 Difference]: With dead ends: 749 [2022-01-31 22:38:49,370 INFO L226 Difference]: Without dead ends: 463 [2022-01-31 22:38:49,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=555, Invalid=7455, Unknown=0, NotChecked=0, Total=8010 [2022-01-31 22:38:49,372 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 271 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 4632 mSolverCounterSat, 246 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 4879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 4632 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-01-31 22:38:49,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 1300 Invalid, 4879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 4632 Invalid, 1 Unknown, 0 Unchecked, 13.0s Time] [2022-01-31 22:38:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-01-31 22:38:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 413. [2022-01-31 22:38:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 338 states have (on average 1.180473372781065) internal successors, (399), 342 states have internal predecessors, (399), 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 22:38:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 475 transitions. [2022-01-31 22:38:49,606 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 475 transitions. Word has length 139 [2022-01-31 22:38:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:38:49,606 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 475 transitions. [2022-01-31 22:38:49,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 41 states have internal predecessors, (109), 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 22:38:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 475 transitions. [2022-01-31 22:38:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-31 22:38:49,607 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:38:49,607 INFO L514 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:49,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 22:38:49,607 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:38:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:38:49,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1434105967, now seen corresponding path program 38 times [2022-01-31 22:38:49,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:38:49,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1150249386] [2022-01-31 22:38:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:38:49,608 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:38:49,608 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:38:49,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:38:49,650 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:38:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:50,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:38:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:50,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:38:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:50,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:38:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:50,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:38:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:50,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:38:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:38:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:50,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:38:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 22:38:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-31 22:38:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-31 22:38:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-01-31 22:38:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:38:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:38:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:38:51,818 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 22:38:51,818 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:38:51,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1150249386] [2022-01-31 22:38:51,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1150249386] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:38:51,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:38:51,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-01-31 22:38:51,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600020746] [2022-01-31 22:38:51,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:38:51,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-01-31 22:38:51,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:38:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-01-31 22:38:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2209, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 22:38:51,819 INFO L87 Difference]: Start difference. First operand 413 states and 475 transitions. Second operand has 49 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 42 states have internal predecessors, (110), 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 22:38:53,926 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 22:39:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:39:13,867 INFO L93 Difference]: Finished difference Result 751 states and 886 transitions. [2022-01-31 22:39:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-31 22:39:13,867 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 42 states have internal predecessors, (110), 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 140 [2022-01-31 22:39:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:39:13,869 INFO L225 Difference]: With dead ends: 751 [2022-01-31 22:39:13,869 INFO L226 Difference]: Without dead ends: 465 [2022-01-31 22:39:13,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=568, Invalid=7804, Unknown=0, NotChecked=0, Total=8372 [2022-01-31 22:39:13,869 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 142 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 6936 mSolverCounterSat, 147 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 7084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 6936 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-01-31 22:39:13,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 2111 Invalid, 7084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 6936 Invalid, 1 Unknown, 0 Unchecked, 18.9s Time] [2022-01-31 22:39:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-01-31 22:39:14,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 415. [2022-01-31 22:39:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 340 states have (on average 1.1794117647058824) internal successors, (401), 344 states have internal predecessors, (401), 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 22:39:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 477 transitions. [2022-01-31 22:39:14,089 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 477 transitions. Word has length 140 [2022-01-31 22:39:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:39:14,089 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 477 transitions. [2022-01-31 22:39:14,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 42 states have internal predecessors, (110), 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 22:39:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 477 transitions. [2022-01-31 22:39:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-01-31 22:39:14,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:39:14,090 INFO L514 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:14,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-31 22:39:14,090 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:39:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:39:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1677595293, now seen corresponding path program 39 times [2022-01-31 22:39:14,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:39:14,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [398195409] [2022-01-31 22:39:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:39:14,091 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:39:14,091 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:39:14,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:39:14,130 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:39:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:39:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:15,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:39:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:39:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:15,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:39:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:15,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:39:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:15,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:39:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:15,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:39:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:16,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 22:39:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:16,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-31 22:39:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:16,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 22:39:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-31 22:39:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:17,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:39:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:39:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:17,079 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 22:39:17,079 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:39:17,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [398195409] [2022-01-31 22:39:17,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [398195409] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:39:17,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:39:17,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-01-31 22:39:17,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986542226] [2022-01-31 22:39:17,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:39:17,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-31 22:39:17,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:39:17,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-31 22:39:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2304, Unknown=0, NotChecked=0, Total=2450 [2022-01-31 22:39:17,081 INFO L87 Difference]: Start difference. First operand 415 states and 477 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 43 states have internal predecessors, (111), 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 22:39:19,166 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 22:39:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 22:39:25,456 INFO L93 Difference]: Finished difference Result 753 states and 888 transitions. [2022-01-31 22:39:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-31 22:39:25,457 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 43 states have internal predecessors, (111), 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 141 [2022-01-31 22:39:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 22:39:25,458 INFO L225 Difference]: With dead ends: 753 [2022-01-31 22:39:25,458 INFO L226 Difference]: Without dead ends: 467 [2022-01-31 22:39:25,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=581, Invalid=8161, Unknown=0, NotChecked=0, Total=8742 [2022-01-31 22:39:25,459 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 382 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 2840 mSolverCounterSat, 398 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 2840 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-01-31 22:39:25,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 580 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 2840 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-01-31 22:39:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-01-31 22:39:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 417. [2022-01-31 22:39:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 342 states have (on average 1.1783625730994152) internal successors, (403), 346 states have internal predecessors, (403), 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 22:39:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 479 transitions. [2022-01-31 22:39:25,682 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 479 transitions. Word has length 141 [2022-01-31 22:39:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 22:39:25,682 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 479 transitions. [2022-01-31 22:39:25,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 43 states have internal predecessors, (111), 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 22:39:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 479 transitions. [2022-01-31 22:39:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-31 22:39:25,683 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 22:39:25,683 INFO L514 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:25,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-31 22:39:25,683 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 22:39:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 22:39:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash -643913455, now seen corresponding path program 40 times [2022-01-31 22:39:25,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 22:39:25,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [676828404] [2022-01-31 22:39:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 22:39:25,684 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 22:39:25,684 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 22:39:25,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 22:39:25,723 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 22:39:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:26,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 22:39:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:26,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 22:39:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:26,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 22:39:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:39:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 22:39:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:26,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:39:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 22:39:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:28,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 22:39:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:28,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-31 22:39:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:28,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-31 22:39:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:28,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-01-31 22:39:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:28,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 22:39:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:28,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 22:39:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 22:39:28,153 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 22:39:28,153 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 22:39:28,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [676828404] [2022-01-31 22:39:28,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [676828404] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 22:39:28,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 22:39:28,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-01-31 22:39:28,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007540055] [2022-01-31 22:39:28,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 22:39:28,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-31 22:39:28,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 22:39:28,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-31 22:39:28,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2401, Unknown=0, NotChecked=0, Total=2550 [2022-01-31 22:39:28,155 INFO L87 Difference]: Start difference. First operand 417 states and 479 transitions. Second operand has 51 states, 51 states have (on average 2.196078431372549) internal successors, (112), 44 states have internal predecessors, (112), 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 22:39:29,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 22:39:31,254 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 22:39:33,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []